KFUPM ePrints

High radix parallel architecture for GF(p) elliptic curve processor

Gutub, A.A.-A. and Ibrahim, M.K. (2003) High radix parallel architecture for GF(p) elliptic curve processor. Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). 2003 IEEE International conference, 2.

[img]Microsoft Word


A new GF(p) cryptographic processor architecture for elliptic curve encryption/decryption is proposed in this paper. The architecture takes advantage of projective coordinates to convert GF(p) inversion needed in elliptic point operations into several multiplication steps. Unlike existing sequential designs, we show that projecting into (X/Z,Y/Z) leads to a much better performance than the conventional choice of projecting into the current (X/Z/sup 2/,Y/Z/sup 3/). We also propose to use high radix modulo multipliers which give a wide range of area-time trade-offs. The proposed architecture is a significant challenger for implementing data security systems based on elliptic curve cryptography.

Item Type:Article
Date:April 2003
Date Type:Publication
Divisions:College Of Computer Sciences and Engineering > Computer Engineering Dept
Creators:Gutub, A.A.-A. and Ibrahim, M.K.
ID Code:14516
Deposited By:KFUPM ePrints Admin
Deposited On:24 Jun 2008 16:38
Last Modified:12 Apr 2011 13:16

Repository Staff Only: item control page