Publication

Abstract : Montgomery multiplication algorithm is widely used in many cryptographic algorithms to provide secure communication between the transmitter and receiver. The main objective of this paper is to study the potential gains of Montgomery algorithm compared to classic ones, For the speedy operation, Montgomery modular multiplication algorithm employs carry–save addition to reduce the carry propagation time at each cycle of addition, but it will increase the hardware complexity. Using carry–save adder as standard, carry–select, carry–skip adders are considered with different optimized hardware versions and thus increases the performance. Simulation is done by using Xilinx design 14.2. The pro-posed Montgomery algorithm design is then compared with the classic one in terms of power, area, delay and thus can achieve improved performance and speed when compared to the classic Montgomery multiplier.