KFUPM ePrints

Area Flexible GF(2k) Elliptic Curve Cryptography Coprocessor

Gutub, Adnan (2007) Area Flexible GF(2k) Elliptic Curve Cryptography Coprocessor. International Arab Journal of Information Technology (IAJIT), 4 (1). pp. 1-10.

PDF (Paper)
[img]HTML (Abstract)

Official URL: http://www.iajit.org/


Elliptic curve cryptography (ECC) is popularly defined either over GF(p) or GF(2k). This research modifies a GF(p) multiplication algorithm to make it applicable for GF(2k). Both algorithms, the GF(p) and GF(2k) one, are designed in hardware to be compared. The GF(2k) multiplier is found faster and small. This GF(2k) multiplier is further improved to benefit in speed, it gained more than 40% faster speed with the cost of 5% more area. This multiplier hardware is furthermore adjusted to have area flexibility feature, which is used as the basic block in modeling a complete projective coordinate GF(2k) ECC coprocessor.

Item Type:Article
Date:January 2007
Date Type:Publication
Divisions:College Of Computer Sciences and Engineering > Computer Engineering Dept
Creators:Gutub, Adnan
ID Code:169
Deposited By:ADNAN ABDUL-AZIZ M. GUTUB (gutub
Deposited On:01 Mar 2008 15:31
Last Modified:12 Apr 2011 13:06

Repository Staff Only: item control page