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 Montgomery´s 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 Bajard´s 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.