High Radix Montgomery Modular Multiplier on Modern FPGA

Abstract

Montgomery algorithm is the most common mechanism for implementing modular multiplication. This work proposes a new systolic architecture to perform high radix Montgomery algorithm on modern FPGA, which is rich in dedicated hardcore multiplier resources, and the new architecture is suitable to be used in public key coprocessors. In the modern FPGA application design, using dedicated hardcore in FPGA is the recommended designing ideas. In this work, by following this new design concept, the new multiplier architecture can reach to a high throughput. Compared with the same architecture work, the improved architecture saves nearly half of the dedicated multiplier in FPGA.

FPGA-based high-throughput Montgomery modular multipliers for RSA cryptosystems

“…However, the cycle cost of serial multipliers are much higher than fullword multipliers. And thus, many designs [12,13,14,15,16,17,18,19] propose high-radix methods that scan multiple bits synchronically to reduce the cycle cost. Furthermore, to deal with the time-consuming carry chain of partial product accumulation, carry-save structures are adopted [14,18] to optimize the latency.…”