Improved Montgomery Modular Multipliers on FPGAs and ASICs
This paper presents the design of an Improved Montgomery Modular Multiplier (MMM) employing three large-integer hybrid recursive Karatsuba multipliers (HRKM) with the base cases replaced by Optimized Schoolbook multipliers (OSBM). This method achieves a single-cycle modular multiplier with significantly reduced resource utilization and latency on FPGAs and ASICs. The proposed design is implemented on a Virtex-6 and Virtex UltraScale+ XCVU9P FPGA platform and synthesized using Synopsys Design Compiler for ASIC implementation. Experimental results on the AMD FPGA platform demonstrate a notable reduction in area-time product (ATP) of 92.766% and 95.130% for an improved 256-bit MMM compared to the best state-of-the-art MMMs on the Virtex-6 and Virtex UltraScale+ XCVU9P FPGA platform. Moreover, results of ASIC implementation on United Microelectronics Corporation (UMC) 65nm technology demonstrate a notable reduction in the power time product (PTP) of 22.173% compared to the best state-of-the-art works.
Authors
- Arghya Roy
- Babita Jajodia (ORCID: https://orcid.org/0000-0002-2479-930X)
- Raushan Maharana
- Sourabh Kumar Singh
Institutions
- Indian Institute of Information Technology Guwahati (IN)
Publication Details
- Journal
- IEEE Embedded Systems Letters
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1109/les.2025.3619075
- Primary Topic
- Cryptography and Residue Arithmetic
- Type
- article
- Field-Weighted Citation Impact
- 0.00