Low latency modular multiplication for public-key cryptosystems using a scalable array of parallel processing elements

Yinan Kong; Yufeng Lai

doi:10.1109/MWSCAS.2013.6674830

Low latency modular multiplication for public-key cryptosystems using a scalable array of parallel processing elements

Yinan Kong, Yufeng Lai

School of Engineering

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

3 Citations (Scopus)

Abstract

This work contributes to the modular multiplication operation C = A × B, the basis of many public-key cryptosystems including RSA and Elliptic Curve Cryptography (ECC). We use the Residue Number System (RNS) to speed up long wordlength modular multiplication. The RNS leads to a highly parallel algorithm which we exploit with a massively parallel hardware implementation capable of exceptionally low latency. This paper presents architecture for this scheme consisting of a scalable array of identical processing elements.

Original language	English
Title of host publication	2013 IEEE 56th International Midwest Symposium on Circuits and Systems, MWSCAS 2013
Place of Publication	Piscataway, NJ
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	1039-1042
Number of pages	4
ISBN (Electronic)	9781479900664, 9781479900640
ISBN (Print)	9781479900657
DOIs	https://doi.org/10.1109/MWSCAS.2013.6674830
Publication status	Published - 2 Dec 2013
Event	2013 IEEE 56th International Midwest Symposium on Circuits and Systems, MWSCAS 2013 - Columbus, OH, United States Duration: 4 Aug 2013 → 7 Aug 2013

Other

Other	2013 IEEE 56th International Midwest Symposium on Circuits and Systems, MWSCAS 2013
Country/Territory	United States
City	Columbus, OH
Period	4/08/13 → 7/08/13

Access to Document

10.1109/MWSCAS.2013.6674830

Cite this

@inproceedings{5ff6e500164b49d68a22f190f321fdf0,

title = "Low latency modular multiplication for public-key cryptosystems using a scalable array of parallel processing elements",

abstract = "This work contributes to the modular multiplication operation C = A × B, the basis of many public-key cryptosystems including RSA and Elliptic Curve Cryptography (ECC). We use the Residue Number System (RNS) to speed up long wordlength modular multiplication. The RNS leads to a highly parallel algorithm which we exploit with a massively parallel hardware implementation capable of exceptionally low latency. This paper presents architecture for this scheme consisting of a scalable array of identical processing elements.",

author = "Yinan Kong and Yufeng Lai",

year = "2013",

month = dec,

day = "2",

doi = "10.1109/MWSCAS.2013.6674830",

language = "English",

isbn = "9781479900657",

pages = "1039--1042",

booktitle = "2013 IEEE 56th International Midwest Symposium on Circuits and Systems, MWSCAS 2013",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

note = "2013 IEEE 56th International Midwest Symposium on Circuits and Systems, MWSCAS 2013 ; Conference date: 04-08-2013 Through 07-08-2013",

}

Kong, Y & Lai, Y 2013, Low latency modular multiplication for public-key cryptosystems using a scalable array of parallel processing elements. in 2013 IEEE 56th International Midwest Symposium on Circuits and Systems, MWSCAS 2013., 6674830, Institute of Electrical and Electronics Engineers (IEEE), Piscataway, NJ, pp. 1039-1042, 2013 IEEE 56th International Midwest Symposium on Circuits and Systems, MWSCAS 2013, Columbus, OH, United States, 4/08/13. https://doi.org/10.1109/MWSCAS.2013.6674830

Low latency modular multiplication for public-key cryptosystems using a scalable array of parallel processing elements. / Kong, Yinan; Lai, Yufeng.
2013 IEEE 56th International Midwest Symposium on Circuits and Systems, MWSCAS 2013. Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2013. p. 1039-1042 6674830.

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

TY - GEN

T1 - Low latency modular multiplication for public-key cryptosystems using a scalable array of parallel processing elements

AU - Kong, Yinan

AU - Lai, Yufeng

PY - 2013/12/2

Y1 - 2013/12/2

N2 - This work contributes to the modular multiplication operation C = A × B, the basis of many public-key cryptosystems including RSA and Elliptic Curve Cryptography (ECC). We use the Residue Number System (RNS) to speed up long wordlength modular multiplication. The RNS leads to a highly parallel algorithm which we exploit with a massively parallel hardware implementation capable of exceptionally low latency. This paper presents architecture for this scheme consisting of a scalable array of identical processing elements.

AB - This work contributes to the modular multiplication operation C = A × B, the basis of many public-key cryptosystems including RSA and Elliptic Curve Cryptography (ECC). We use the Residue Number System (RNS) to speed up long wordlength modular multiplication. The RNS leads to a highly parallel algorithm which we exploit with a massively parallel hardware implementation capable of exceptionally low latency. This paper presents architecture for this scheme consisting of a scalable array of identical processing elements.

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

U2 - 10.1109/MWSCAS.2013.6674830

DO - 10.1109/MWSCAS.2013.6674830

M3 - Conference proceeding contribution

AN - SCOPUS:84893180110

SN - 9781479900657

SP - 1039

EP - 1042

BT - 2013 IEEE 56th International Midwest Symposium on Circuits and Systems, MWSCAS 2013

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, NJ

T2 - 2013 IEEE 56th International Midwest Symposium on Circuits and Systems, MWSCAS 2013

Y2 - 4 August 2013 through 7 August 2013

ER -

Low latency modular multiplication for public-key cryptosystems using a scalable array of parallel processing elements

Abstract

Other

Access to Document

Other files and links

Fingerprint

Cite this