KFUPM ePrints

High Performance Elliptic Curve GF(2m) Crypto-processor

Al-Somani, Turki Faisal and Ibrahim, Mohammad K. and Gutub, Adnan (2006) High Performance Elliptic Curve GF(2m) Crypto-processor. Information Technology Journal (ITJ), 5 (4). pp. 742-748. ISSN 1812-5638

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

Official URL: http://www.ansijournals.com/3/c4p.php?id=1&theme=3...

Abstract

This study presents a high performance elliptic curve cryptoprocessor architecture over GF(2m). The proposed architecture exploits parallelism at the projective coordinate level to perform parallel field multiplications. Comparisons between the Projective, Jacobian and Lopez-Dahab coordinate systems using sequential and parallel designs are presented. Results show that parallel designs gives better area-time complexity (AT2) than sequential designs by 44-252% which leads to a wide range of design tradeoffs. The results also show that the Projective coordinate system gives the best AT2 in parallel designs with the least number of multiplications levels when using 4 multipliers.



Item Type:Article
Date:2006
Subjects:Math
Computer
Electrical
Divisions:College Of Computer Sciences and Engineering > Computer Engineering Dept
Creators:Al-Somani, Turki Faisal and Ibrahim, Mohammad K. and Gutub, Adnan
Email:tfsomani@uqu.edu.sa, ibrahim@dmu.ac.uk, gutub@kfupm.edu.sa
ID Code:172
Deposited By:ADNAN ABDUL-AZIZ M. GUTUB (gutub
Deposited On:01 Mar 2008 15:57
Last Modified:12 Apr 2011 13:06

Repository Staff Only: item control page