Fast Parallel Exponentiation Algorithm for RSA Public-Key Cryptosystem

We know the necessity for information security becomes more widespread in these days, especially for hardware-based implementations such as smart cards chips for wireless applications and cryptographic accelerators. Fast modular exponentiation algorithms are often considered of practical significance in public-key cryptosystems. The RSA cryptosystem is one of the most widely used technologies for achieving information security. The main task of the encryption and decryption engine of RSA cryptosystem is to compute ME mod N. Because the bit-length of the numbers M, E, and N would be about 512 to 1024 bits now, the computations for RSA cryptosystem are time-consuming. In this paper, an efficient technique for parallel computation of the modular exponentiation is proposed and our algorithm can reduce time complexity. We can have

• Type: Journal
• Year: 2006
• Where: INFORMATICALT
• Authors: Chia-Long Wu, Der-Chyuan Lou, Jui-Chang Lai, Te-Jen Chang
• Keywords: Cryptosystem, INFORMATICALT 2006, Modular Exponentiation, RSA Cryptosystem