Simulations of modular multipliers on FPGA

A diverse variety of algorithms and architectures for modu lar multiplication have been published. They were recently classified 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.Y. Kong and B. Phillipshttp://www.actapress.com/Abstract.aspx?paperId=3183