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

摘要

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