A parameterized design of Modular Exponentiation on reconfigurable platforms for RSA cryptographic processor

Modular Exponentiation is at the heart of various arithmetic architectures used in most Public Key cryptography algorithms. Modular Exponentiation of large numbers requires excessive processing. An efficient implementation of modular exponentiation may help overcome the speed issues of public Key Cryptography. in this work, the most promising technique of Montgomery modular exponentiation and its optimizations have been deeply explored. We have been able to achieve performance results which are better than earlier published results. Full bit length modular exponentiations with different word sizes and radices are implemented and there results are shown.