Enhancement of a modified radix-2 Montgomery modular multiplication

Abstract

Recently, Manochehri et al. proposed a modified radix-2 Montgomery modular multiplication with a new recording method. In this letter, we present an improvement to their scheme that makes it simpler and faster. Manochehri et al.'s algorithm requires n + 2 iterations, whereas the proposed (non-pipelined) algorithm requires n + 2 iterations. Moreover, there is no need for post-processing to obtain the correct output, nor for a non-standard operation such as bitwise subtraction. The area/time complexity of our pipelined multiplier is reduced by approximately 24.36% compared to Manochehri et al.'s multiplier. The proposed architecture is simple, modular, and regular. Moreover, it exhibits low complexity and propagation delay. Accordingly, it is well suited for VLSI implementation.

FPGA-based high-throughput Montgomery modular multipliers for RSA cryptosystems

“…The serial structure [2,7,8,9,10,11] scans the multiplier bit by bit, leading to low area complexities. However, the cycle cost of serial multipliers are much higher than fullword multipliers.…”

New systolic modular multiplication architecture for efficient Montgomery multiplication

“…Therefore, an efficient MMM architecture under limited hardware resources is important from a system performance point of view. Several MMM architectures have been proposed [3,4,5,6]. Although the processing element (PE) structure proposed in previous researches is adequate for designing a systolic multiplier, it is insufficient for obtaining optimality.…”