Hardware implementation of an elliptic curve processor over GF(p) with Montgomery modular multiplier

Berna Örs*, Lejla Batina, Bart Preneel, Joos Vandewalle

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)

Abstract

This paper describes a hardware implementation of an arithmetic processor which is efficient for bit-lengths suitable for both commonly used types of Public Key Cryptography, i.e., Elliptic Curve (EC) and RSA Cryptosystems. Montgomery modular multiplication in a systolic array architecture is used for modular multiplication. The processor consists of special operational blocks for Montgomery modular multiplication, modular addition/subtraction, EC Point doubling/addition, modular multiplicative inversion, EC point multiplier, projective to affine coordinates conversion and Montgomery to normal representation conversion.

Original languageEnglish
Pages (from-to)229-240
Number of pages12
JournalInternational Journal of Embedded Systems
Volume3
Issue number4
DOIs
Publication statusPublished - 2008

Keywords

  • Elliptic curve cryptosystems
  • FPGA
  • MMM
  • Modular operations
  • Montgomery modular multiplication

Fingerprint

Dive into the research topics of 'Hardware implementation of an elliptic curve processor over GF(p) with Montgomery modular multiplier'. Together they form a unique fingerprint.

Cite this