A Scalable Architecture for RSA Cryptography on Large FPGAs
Allen Michalski, Duncan A. Buell · 2006
The authors propose an improvement to a limited resource Montgomery multiplier design, the MWR2MM algorithm proposed by Tenca and Koc, which is suitable for implementation on large FPGAs. The design can be scaled to utilize available FPGA multipliers, CLB logic and frequencies of operation