International Research Journal of Education and Technology

For effective modular multiplication, the Montgomery multiplier technique is crucial, especially in cryptographic applications such as elliptic curve encryption and RSA. The design and simulation of a Montgomery multiplier architecture specifically adapted for the Arbitrary Residue Number System (RNS) are presented in this work. By removing carry propagation, the RNS improves modular arithmetic and is hence well suited for parallel processing, which speeds up arithmetic processes. The goal of combining RNS and Montgomery multiplication is to improve module multiplication performance, especially for big numbers that are utilized in cryptographic systems. This work's main goal is to provide an efficient Montgomery multiplier architecture that takes advantage of RNS's advantages for high-speed, low-latency operations. An effective structure is used in the suggested design to convert between the standard and the suggested solution makes use of a customized multiplier to carry out Montgomery reduction in the RNS domain and an effective framework for translating between the standard number system and the RNS.

Key Words: Montgomery Multiplier, Residue Number System (RNS), ModularMultiplicationCryptography, FPGA, ASIC,

Parallel Processing, Hardware Architecture, Throughput