A Fast Finite Field Multiplier Architecture for High-Security Elliptic Curve Cryptosystems

Sangook MOON  Yong Joo LEE  Jae Min PARK  Byung In MOON  Yong Surk LEE  

IEICE TRANSACTIONS on Information and Systems   Vol.E85-D   No.2   pp.418-420
Publication Date: 2002/02/01
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Applications of Information Security Techniques
finite field multiplier,  elliptic curve cryptography,  security,  VLSI,  

Full Text: PDF(185KB)>>
Buy this Article

A new approach on designing a finite field multiplier architecture is proposed. The proposed architecture trades reduction in the number of clock cycles with resources. This architecture features high performance, simple structure, scalability and independence on the choice of the finite field, and can be used in high security cryptographic applications such as elliptic curve crypto-systems in large prime Galois Fields (GF(2m)).