Adnan Gutub - Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field Multipliers

Journal of Computer Science 2 (5): 395-400, 2006

ISSN 1549-3636

Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field Multipliers

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

King Fahd University of Petroleum and Minerals, Computer Engineering Department Dhahran 31261, Saudi Arabia

*De Montfort University, School of Engineering and Technology, Leicester LE19BH, UK

Abstract: This study presents a high performance GF(2^m) Elliptic Curve Crypto-processor architecture. The proposed architecture exploits parallelism at the projective coordinate level to perform parallel field multiplications. In the proposed architecture, normal basis representation is used. Comparisons between the Projective, Jacobian and Mixed coordinate systems using sequential and parallel designs are presented. Results show that parallel designs using normal basis gives better areatime complexity (AT²) than sequential designs by 33-252% which leads to a wide range of design tradeoffs. The results also show that mixed coordinate system is the best in both sequential and parallel designs and gives the least number of multiplications levels when using 3 multipliers and the best AT² when using only 2 multipliers.

Key words: Elliptic curves cryptosystems, projective coordinate, parallel designs, normal basis