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

Research output: Contribution to journalLetterpeer-review

Abstract

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)).

Original languageEnglish
Pages (from-to)418-420
Number of pages3
JournalIEICE Transactions on Information and Systems
VolumeE85-D
Issue number2
StatePublished - Feb 2002

Keywords

  • Elliptic curve cryptography
  • Finite field multiplier
  • Security
  • VLSI

Fingerprint

Dive into the research topics of 'A fast finite field multiplier architecture for high-security elliptic curve cryptosystems'. Together they form a unique fingerprint.

Cite this