Power Analysis of a Montgomery Modular Multiplier for Cryptosystems

Modular multiplication is the main task to be performed while doing the encryption and decryption algorithms. The main contribution of this paper is to implement modular multiplier using Montgomery algorithm for RSA encryption and decryption. Network security plays an important role in day-to-day communication systems. Many algorithms are developed in order to secure the data. These uses Ripple Carry Adders, Carry Look ahead Adder and Carry Save Adders (CSA's) to perform the large word length Addition's required by this algorithm when used for RSA encryption and decryption. For operand lengths of 128-bits and greater, the percentage gain in data throughput rate outweighs the percentage increase in silicon area. The dynamic power will also increase as the switching activity increases. Moreover, for a 256-bit operand length, typical of what is required in many future generation applications is the dynamic power reduction.