A Faster Modular Multiplication Based on Key Size Partitioning for RSA Public-Key Cryptosystem

Seok-Yong LEE  Yong-Jin JEONG  Oh-Jun KWON  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E85-D   No.4   pp.789-791
Publication Date: 2002/04/01
Online ISSN: 
DOI: 
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Applications of Information Security Techniques
Keyword: 
modular multiplication,  RSA,  cryptography,  key size partitioning,  

Full Text: PDF(118.9KB)>>
Buy this Article




Summary: 
We propose a new method that can speed up the modular multiplication by physically partitioning the key size into two slices. By using LSB-first and MSB-first approach on two respective partitioned hardware module in parallel, we reduce the number of iterations in modular multiplication from k to k/2+1 for k-bit operands, and the resulting performance is doubled when contrasted with an implementation purely by LSB-first or MSB-first approach.