Parallel modular multiplication with application to VLSI RSA implementation

William L. Freking, Keshab K. Parhi

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

1 Scopus citations

Abstract

In this paper, modular multiplication, the fundamental operation composing modular exponentiation, is internally parallelized for the first time at the digit level. Modular exponentiation is the core computation of numerous public-key cryptography (PKC) systems including RSA. As a performance criterion, overall latency is often more significant than throughput in the principal PKC applications of key exchange and authentication. Efforts to address total latency architecturally through traditional modular multiplication techniques utilizing pipelining are hindered by the inherent recursive nature of practical modular exponentiation methods. Thus, performance scalability relative to implementation area has been limited. Fine-grain parallelization methods revealed in this paper are compelling because they permit overall latency reduction in addition to increased throughput. First, a hybrid bi-directional method is introduced for two-parallel implementations. Second, a uni-directional p-parallel technique is introduced which attains general levels of parallelism, thereby enabling performance scalability. These new techniques create a foundation for ultra-high-performance implementations.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
PublisherIEEE
PagesI-490 - I-495
ISBN (Print)0780354729
StatePublished - Jan 1 1999
EventProceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS '99 - Orlando, FL, USA
Duration: May 30 1999Jun 2 1999

Publication series

NameProceedings - IEEE International Symposium on Circuits and Systems
Volume1
ISSN (Print)0271-4310

Other

OtherProceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS '99
CityOrlando, FL, USA
Period5/30/996/2/99

Fingerprint Dive into the research topics of 'Parallel modular multiplication with application to VLSI RSA implementation'. Together they form a unique fingerprint.

Cite this