Enhancement of a modified radix-2 Montgomery modular multiplication

IEICE Electronics Express

Se-Hyu Choi¹  Keon-Jik Lee¹ 

[1] School of Architectural, Civil, Environmental and Energy Engineering, Kyungpook National University

关键词: Montgomery;    modular multiplication;    radix-2;    carry save adder;   

DOI  :  10.1587/elex.11.20140782

学科分类：电子、光学、磁材料

来源: Denshi Jouhou Tsuushin Gakkai

【 摘 要 】

References(9)Cited-By(1)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.

【 授权许可】

Unknown