An Improved RNS Montgomery Modular Multiplier

摘要：

Modular multiplication arithmetic plays an important role in public key cryptography. This paper presents an improved RNS modular multiplication for large operands. The algorithm uses Montgomerys method together with the Chinese Remainder Theorem, and is performed using a Residue Number System. The number of modular multiplication in the improved one is reduced by 300/(2n+8) percent (n is the number of modulus) comparing to the Bajards method. A proper hardware architecture for this algorithm is proposed. Finally this work has been verified by modeling it in verilog-HDL, implementing it under 0.18μm CMOS technology. The result indicates that our work has advanced performance than other works.

关键词： residue number system modular multiplication cryptography hardware implementation

作者: Yang Tong-jie Dai Zi-bin Yang Xiao-hui Zhao Qian-jin

作者单位: Institute of Electronic Technology, Information Engineering University Zhengzhou 450004, China

会议类型: 国际会议

会议名称: The 2010 International Conference on Computer Application and System Modeling(2010计算机应用与系统建模国际会议 ICCASM 2010)

会议地点: 太原

会议语种:英文

页码: 144-147

在线出版日期: 2010-10-22（万方平台首次上网日期，不代表论文的发表时间）