Simulations of Modular Multipliers on FPGA

Y. Kong and B. Phillips


Modular Multiplication, FPGA, Simulations, Cryptogra phy, E-Security


A diverse variety of algorithms and architectures for modu lar multiplication have been published. They were recently classi´Čüed into four classes, i.e. Sum of Residues, Classical, Barrett and Montgomery. This paper provides timing and area results for FPGA implementations and a survey of the four different architectures and wordlengths.

Important Links:

Go Back