Efficient Configurable Modular Multiplier For RNS

Modular multipliers are usually the most critical units in Residue Number System implementations. With the widespread application of cryptographic algorithms based on the Residue Number System, the scale and variety of modulus channels have significantly increased, Consequently, the design of high-speed general-purpose modular multipliers has become increasingly important. In this paper, we propose a universal architecture for designing an efficient modular multiplier based on the Barrett reduction algorithm. The proposed modular multiplier can be configured to support different modular multiplications and is well-suited for accelerating applications in Residue Number System-based encryption schemes. Synthesized results demonstrate that the proposed modular multiplier exhibits up to a 35.7% improvement in performance compared to the improved Barrett modular multiplier.