Loading [MathJax]/extensions/MathMenu.js
Efficient High-Radix GF(p) Montgomery Modular Multiplication Via Deep Use Of Multipliers | IEEE Journals & Magazine | IEEE Xplore

Efficient High-Radix GF(p) Montgomery Modular Multiplication Via Deep Use Of Multipliers


Abstract:

High-radix Montgomery Modular Multiplication (MMM) is flexible and consumes fewer cycles, but turns inefficient especially when it comes to low-bit calculation. In this b...Show More

Abstract:

High-radix Montgomery Modular Multiplication (MMM) is flexible and consumes fewer cycles, but turns inefficient especially when it comes to low-bit calculation. In this brief, we propose a high-radix MMM algorithm, called Separated Iterative Digit-Digit Modular Multiplication (S-IDDMM), which accelerates the MMM by taking full advantage of multipliers and adders. The relationship among clock cycles, pipeline of multiplications and number of multipliers for the proposed algorithm is derived and utilized to optimize the overall efficiency jointly. Xilinx Virtex-7 FPGA implementations of S-IDDMM in 256 bits and 512 bits are constructed with radix-32 and radix-64, respectively. Compared with IDDMM design reported elsewhere (Amiet et al., 2016), our calculation time is reduced by more than 2 times with a similar area cost, due to deep use of multipliers and higher frequency.
Published in: IEEE Transactions on Circuits and Systems II: Express Briefs ( Volume: 69, Issue: 12, December 2022)
Page(s): 5099 - 5103
Date of Publication: 16 August 2022

ISSN Information:

Funding Agency:


Contact IEEE to Subscribe

References

References is not available for this document.