Modified radix-2 Montgomery modular multiplication to make it faster and simpler
Kooroush Manochehri, Saadat Pourmozafari · 2005
Montgomery modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem or other cryptosystems based on modular arithmetic. There are several improvements for making it suitable for hardware implementation. Radix-2 version of this algorithm is simple and fast to implement in hardware design. In this paper a new algorithm based on this approach is presented that is more simple and faster than radix-2 algorithm. For implementing this new algorithm, carry save adder (CSA) architecture is used and synthesized in both ASIC and FPGA technology.