Word-based montgomery modular multiplication algorithm for low-latency scalable architectures

Ming Der Shieh, Wen Ching Lin

Research output: Contribution to journalArticlepeer-review

31 Citations (Scopus)


Modular multiplication is a crucial operation in public key cryptosystems like RSA and elliptic curve cryptography (ECC). This paper presents a new word-based Montgomery modular multiplication algorithm which can be used to achieve a low-latency scalable architecture for efficient hardware implementations. We show how to relax the data dependency in conventional word-based algorithms so that a latency of exactly one cycle can be obtained regardless of the chosen word size w (w >1). With the presented operand reduction scheme, the proposed scalable architecture can operate at high speeds and suitable data paths can be chosen for specific applications. Complexity analysis shows that the proposed architecture has the lowest latency and area complexity compared to related scalable architectures. Experimental results demonstrate that our design has area, speed, and flexibility advantages over related schemes.

Original languageEnglish
Article number5441286
Pages (from-to)1145-1151
Number of pages7
JournalIEEE Transactions on Computers
Issue number8
Publication statusPublished - 2010 Jul 6

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'Word-based montgomery modular multiplication algorithm for low-latency scalable architectures'. Together they form a unique fingerprint.

Cite this