Subscribe Now Subscribe Today
Science Alert
Curve Top
Information Technology Journal
  Year: 2006 | Volume: 5 | Issue: 4 | Page No.: 742-748
DOI: 10.3923/itj.2006.742.748
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

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

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

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.
PDF Fulltext XML References Citation Report Citation
  •    Compiler Optimization and Plain Text Pre-Processing to Hoist the Height of HIGHT in AVR Platform
  •    Survey and Analysis of Hardware Cryptographic and Steganographic Systems on FPGA
  •    Firmware for Data Security: A Review
How to cite this article:

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

DOI: 10.3923/itj.2006.742.748






Curve Bottom