Montgomery modular multiplication and exponentiation in the residue number system

W. L. Freking; K. K. Parhi

doi:10.1109/ACSSC.1999.831919

Montgomery modular multiplication and exponentiation in the residue number system

W. L. Freking, K. K. Parhi

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 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 language	English (US)
Title of host publication	Conference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers
Editors	Michael B. Matthews
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1312-1316
Number of pages	5
ISBN (Electronic)	0780357000, 9780780357006
DOIs	https://doi.org/10.1109/ACSSC.1999.831919
State	Published - 1999
Event	33rd Asilomar Conference on Signals, Systems, and Computers, ACSSC 1999 - Pacific Grove, United States Duration: Oct 24 1999 → Oct 27 1999

Publication series

Name	Conference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers
Volume	2

Other

Other	33rd Asilomar Conference on Signals, Systems, and Computers, ACSSC 1999
Country/Territory	United States
City	Pacific Grove
Period	10/24/99 → 10/27/99

Bibliographical note

Publisher Copyright:
© 1999 IEEE.

Keywords

Modular Exponentiation
Modular Multiplacataon
RSA
Residue Number System

Publisher link

10.1109/ACSSC.1999.831919

Find It

Find It at U of M Libraries

Cite this

Freking, W. L., & Parhi, K. K. (1999). Montgomery modular multiplication and exponentiation in the residue number system. In M. B. Matthews (Ed.), Conference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers (pp. 1312-1316). Article 831919 (Conference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers; Vol. 2). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ACSSC.1999.831919

Montgomery modular multiplication and exponentiation in the residue number system. / Freking, W. L.; Parhi, K. K.
Conference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers. ed. / Michael B. Matthews. Institute of Electrical and Electronics Engineers Inc., 1999. p. 1312-1316 831919 (Conference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Freking, WL & Parhi, KK 1999, Montgomery modular multiplication and exponentiation in the residue number system. in MB Matthews (ed.), Conference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers., 831919, Conference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers, vol. 2, Institute of Electrical and Electronics Engineers Inc., pp. 1312-1316, 33rd Asilomar Conference on Signals, Systems, and Computers, ACSSC 1999, Pacific Grove, United States, 10/24/99. https://doi.org/10.1109/ACSSC.1999.831919

Freking WL, Parhi KK. Montgomery modular multiplication and exponentiation in the residue number system. In Matthews MB, editor, Conference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers. Institute of Electrical and Electronics Engineers Inc. 1999. p. 1312-1316. 831919. (Conference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers). doi: 10.1109/ACSSC.1999.831919

Freking, W. L. ; Parhi, K. K. / Montgomery modular multiplication and exponentiation in the residue number system. Conference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers. editor / Michael B. Matthews. Institute of Electrical and Electronics Engineers Inc., 1999. pp. 1312-1316 (Conference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers).

@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.}",

note = "Publisher Copyright: {\textcopyright} 1999 IEEE.; 33rd Asilomar Conference on Signals, Systems, and Computers, ACSSC 1999 ; Conference date: 24-10-1999 Through 27-10-1999",

year = "1999",

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",

}

TY - GEN

T1 - Montgomery modular multiplication and exponentiation in the residue number system

AU - Freking, W. L.

AU - Parhi, K. K.

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

KW - Modular Exponentiation

KW - Modular Multiplacataon

KW - RSA

KW - Residue Number System

UR - http://www.scopus.com/inward/record.url?scp=0033333215&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033333215&partnerID=8YFLogxK

U2 - 10.1109/ACSSC.1999.831919

DO - 10.1109/ACSSC.1999.831919

M3 - Conference contribution

AN - SCOPUS:0033333215

T3 - Conference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers

SP - 1312

EP - 1316

BT - Conference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers

A2 - Matthews, Michael B.

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 33rd Asilomar Conference on Signals, Systems, and Computers, ACSSC 1999

Y2 - 24 October 1999 through 27 October 1999

ER -

Montgomery modular multiplication and exponentiation in the residue number system

Abstract

Publication series

Other

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this