RSA Using Montgomery Powering Ladder on Dual Core

Abstract

RSA is widely used public key cryptographic algorithm. Security of RSA depends upon the factorization of the large integers. Key sizes must be large for highly secured RSA. But the computation time of RSA increases for larger key sizes. Sequential RSA encryption for 1024 bits takes large execution time. Montgomery powering ladder prevents simple power attack and can be parallelized. In this paper, parallel Montgomery powering adder is implemented on dual-core machine using the multiprocessing module of the python. The performance of the parallel Montgomery powering ladder is analyzed for various key sizes. The parallel Montgomery powering ladder shows 1.63 speedup over its sequential version.