Efficient RNS implementation of elliptic curve point multiplication over GF(p)

Mohammad Esmaeildoust, Dimitrios Schinianakis, Hamid Javashi, Thanos Stouraitis, Keivan Navi

Research output: Contribution to journalArticlepeer-review

70 Scopus citations

Abstract

Elliptic curve point multiplication (ECPM) is one of the most critical operations in elliptic curve cryptography. In this brief, a new hardware architecture for ECPM over GF(p) is presented, based on the residue number system (RNS). The proposed architecture encompasses RNS bases with various word-lengths in order to efficiently implement RNS Montgomery multiplication. Two architectures with four and six pipeline stages are presented, targeted on area-efficient and fast RNS Montgomery multiplication designs, respectively. The fast version of the proposed ECPM architecture achieves higher speeds and the area-efficient version achieves better area-delay tradeoffs compared to state-of-the-art implementations.

Original languageBritish English
Article number6290461
Pages (from-to)1545-1549
Number of pages5
JournalIEEE Transactions on Very Large Scale Integration (VLSI) Systems
Volume21
Issue number8
DOIs
StatePublished - 2013

Keywords

  • Elliptic curve cryptography (ECC)
  • Montgomery multiplication
  • residue arithmetic
  • residue number system (RNS)

Fingerprint

Dive into the research topics of 'Efficient RNS implementation of elliptic curve point multiplication over GF(p)'. Together they form a unique fingerprint.

Cite this