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

Yinan Kong, Yufeng Lai

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

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 languageEnglish
Title of host publication2013 IEEE 56th International Midwest Symposium on Circuits and Systems, MWSCAS 2013
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages1039-1042
Number of pages4
ISBN (Electronic)9781479900664, 9781479900640
ISBN (Print)9781479900657
DOIs
Publication statusPublished - 2 Dec 2013
Event2013 IEEE 56th International Midwest Symposium on Circuits and Systems, MWSCAS 2013 - Columbus, OH, United States
Duration: 4 Aug 20137 Aug 2013

Other

Other2013 IEEE 56th International Midwest Symposium on Circuits and Systems, MWSCAS 2013
CountryUnited States
CityColumbus, OH
Period4/08/137/08/13

Fingerprint Dive into the research topics of 'Low latency modular multiplication for public-key cryptosystems using a scalable array of parallel processing elements'. Together they form a unique fingerprint.

Cite this