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

Research Article

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

Turki F. Al- Somani, M.K. Ibrahim and Adnan Gutub

This study presents a high performance elliptic curve cryptoprocessor architecture over GF(2^m). 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 (AT²) 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 AT²in parallel designs with the least number of multiplications levels when using 4 multipliers.

PDF Fulltext XML References Citation

How to cite this article

Turki F. Al- Somani, M.K. Ibrahim and Adnan Gutub, 2006. High Performance Elliptic Curve GF(2^m) Crypto-processor. Information Technology Journal, 5: 742-748.

DOI: 10.3923/itj.2006.742.748

URL: https://scialert.net/abstract/?doi=itj.2006.742.748

Information Technology Journal

Article Trend

Total views 129

Authors

Turki F. Al- Somani

M.K. Ibrahim

Adnan Gutub

Keywords

Research Article

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

How to cite this article

Related Articles

Leave a Comment