KFUPM ePrints

Fast 160-Bits GF (P) Elliptic Curve Crypto Hardware of High-Radix Scalable Multipliers

Gutub, Adnan (2006) Fast 160-Bits GF (P) Elliptic Curve Crypto Hardware of High-Radix Scalable Multipliers. International Arab Journal of Information Technology (IAJIT), 3 (4). pp. 342-349. ISSN 1683-3198

[img]
Preview
PDF (Paper)
496Kb
[img]HTML (Abstract)
8Kb

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

Abstract

In this paper, a fast hardware architecture for elliptic curve cryptography computation in Galois Field GF(p) is proposed. The architecture is implemented for 160-bits, as its data size to handle. The design adopts projective coordinates to eliminate most of the required GF(p) inversion calculations replacing them with several multiplication operations. The hardware is intended to be scalable, which allows the hardware to compute long precision numbers in a repetitive way. The design involves four parallel scalable multipliers to gain the best speed. This scalable design was implemented in different versions depending on the area and speed. All scalable implementations were compared with an available FPGA design. The proposed scalable hardware showed interesting results in both area and speed. It also showed some area-time flexibility to accommodate the variation needed by different crypto applications.



Item Type:Article
Date:October 2006
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:168
Deposited By:ADNAN ABDUL-AZIZ M. GUTUB (gutub
Deposited On:01 Mar 2008 15:39
Last Modified:12 Apr 2011 13:06

Repository Staff Only: item control page