Highly parallel modular multiplier for elliptic curve cryptography in Residue Number System

Shahzad Asif*, Yinan Kong

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)

Abstract

This article proposes a novel architecture to perform modular multiplication in the Residue Number System (RNS) by using sum of residues. The highly parallel architecture is implemented using VHDL and verified by extensive simulations in ModelSim SE. The pipelined and non-pipelined versions of the design are implemented on ASIC and FPGA platforms to allow a broad comparison. The proposed architecture requires only one iteration to complete modular multiplication and achieves 12–90 % less delay as compared to the existing RNS and binary modular multipliers. The complexity of the proposed design is also less than the existing state-of-the-art RNS-based modular multipliers. The high scalability and flexibility of the proposed architecture allows it to be used for a wide range of high-speed applications.

Original languageEnglish
Pages (from-to)1027-1051
Number of pages25
JournalCircuits, Systems and Signal Processing
Volume36
Issue number3
DOIs
Publication statusPublished - 1 Mar 2017

Keywords

  • Cryptosystem
  • Elliptic curve cryptography (ECC)
  • High speed
  • Modular multiplier
  • Montgomery multiplier
  • Residue Number System (RNS)
  • RSA

Fingerprint Dive into the research topics of 'Highly parallel modular multiplier for elliptic curve cryptography in Residue Number System'. Together they form a unique fingerprint.

Cite this