(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. 165182.

PDF (Paper)
I.pdf Download (246kB)  Preview 

HTML (Abstract)
i.htm Download (12kB) 
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 256bits. 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 

Subjects:  Math Computer Electrical 
Department:  College of Computing and Mathematics > Computer Engineering 
Depositing User:  ADNAN ABDU GUTUB (gutub 
Date Deposited:  29 Feb 2008 06:12 
Last Modified:  01 Nov 2019 13:22 
URI:  http://eprints.kfupm.edu.sa/id/eprint/155 