KFUPM ePrints

Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operations

Gutub, Adnan (2007) Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operations. Kuwait Journal of Science & Engineering (KJSE), December 2007, 34 (2). pp. 165-182.

[img]
Preview
PDF (Paper)
240Kb
[img]HTML (Abstract)
12Kb

Official URL: http://www.kjse.kuniv.edu.kw/

Abstract

This paper presents the design and implementation of an elliptic curve cryptographic core to realize point scalar multiplication operations used for the GF(p) elliptic curve encryption/decryption and the elliptic curve digital signature algorithm (ECDSA). The design makes use of projective coordinates together with scalable Montgomery multipliers for data size of up to 256-bits. We propose using four multiplier cores together with the ordinary projective coordinates which outperform implementations with Jacobean coordinates typically believed to perform better. The proposed architecture is particularly attractive for elliptic curve cryptosystems when hardware area optimization is the key concern.



Item Type:Article
Date:December 2007
Date Type:Publication
Subjects:Math
Computer
Electrical
Divisions:College Of Computer Sciences and Engineering > Computer Engineering Dept
Creators:Gutub, Adnan
Email:gutub@kfupm.edu.sa
ID Code:155
Deposited By:ADNAN ABDUL-AZIZ M. GUTUB (gutub
Deposited On:29 Feb 2008 09:12
Last Modified:12 Apr 2011 13:05

Repository Staff Only: item control page