International Journal of Engineering Trends and Technology
Montgomery multiplication algorithm is used in the implementation of RSA and other cryptosystems based on modular arithmetic. Several improvements have been suggested to increase its suitability for hardware implementation. Radix-2 Montgomery architectures are easier to implement in hardware. In this paper, a modified optimized algorithm for radix-2 Montgomery multiplication is presented which is based on parallelizing the multiplications within each processing element and pre-computation of partial results using assumptions regarding the most significant bit of the previous design thereby, improving speed.