@inproceedings{c0b21661445e4913884d68c54fd13bb2,
title = "Montgomery modular multiplication and exponentiation in the residue number system",
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.",
keywords = "Modular Exponentiation, Modular Multiplacataon, RSA, Residue Number System",
author = "Freking, {W. L.} and Parhi, {K. K.}",
year = "1999",
month = jan,
day = "1",
doi = "10.1109/ACSSC.1999.831919",
language = "English (US)",
series = "Conference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1312--1316",
editor = "Matthews, {Michael B.}",
booktitle = "Conference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers",
note = "33rd Asilomar Conference on Signals, Systems, and Computers, ACSSC 1999 ; Conference date: 24-10-1999 Through 27-10-1999",
}