Montgomery modular multiplication and exponentiation in the residue number system

W. L. Freking, K. K. Parhi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

Modular exponentiation and its constituent operation, modular multiplication, are fundamental to numerous public-key cryptography schemes including RSA. Efficient hardware implementations via ASIC or coprocessor approaches are essential to high-performance and low-power applications. New techniques are developed to aid in the design of both sequential and parallel implementations in the residue number system (RNS). A new sequential modular multiplication method suitable for smart cards is proposed which achieves the best known operation count for an all-modular-Arithmetic approach. Furthermore, a new technique is introduced to address the Montgomery (1985) scale factor in fully-parallel RNS implementations.

Original languageEnglish (US)
Title of host publicationConference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers
EditorsMichael B. Matthews
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1312-1316
Number of pages5
ISBN (Electronic)0780357000, 9780780357006
DOIs
StatePublished - Jan 1 1999
Event33rd Asilomar Conference on Signals, Systems, and Computers, ACSSC 1999 - Pacific Grove, United States
Duration: Oct 24 1999Oct 27 1999

Publication series

NameConference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers
Volume2

Other

Other33rd Asilomar Conference on Signals, Systems, and Computers, ACSSC 1999
CountryUnited States
CityPacific Grove
Period10/24/9910/27/99

Keywords

  • Modular Exponentiation
  • Modular Multiplacataon
  • RSA
  • Residue Number System

Fingerprint Dive into the research topics of 'Montgomery modular multiplication and exponentiation in the residue number system'. Together they form a unique fingerprint.

Cite this