For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Faster Modular Multiplication Based on Key Size Partitioning for RSA Public-Key Cryptosystem
Seok-Yong LEE Yong-Jin JEONG Oh-Jun KWON
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2002/04/01
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Applications of Information Security Techniques
modular multiplication, RSA, cryptography, key size partitioning,
Full Text: PDF(118.9KB)>>
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.