loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'04)
FPGA Montgomery Multiplier Architectures - A Comparison
Napa, California
April 20-April 23
ISBN: 0-7695-2230-0
Ciaran McIvor, Queen's University of Belfast, Northern Ireland
M?ire McLoone, Queen's University of Belfast, Northern Ireland
John V. McCanny, Queen's University of Belfast, Northern Ireland
Novel FPGA architectures for the SOS, CIOS and FIOS Montgomery multiplication algorithms are presented. The 18x18-bit multipliers and fast carry look-ahead logic embedded within the Xilinx Virtex2 Pro family of FPGAs are used to perform the ordinary multiplications and additions required by these algorithms. A detailed analysis is given, highlighting the advantages and weaknesses of each of these architectures when implemented in hardware. This shows that the CIOS multiplier architectures perform best overall, with the performance gap between this and the other options increasing as the word size used decreases. In addition, the SOS multipliers outperform the FIOS multipliers for larger word sizes, but vice versa as the word size decreases. It is also shown that one can tailor the multiplier architectures to be area efficient, time efficient or a mixture of both, by choosing a particular word size.
Citation:
Ciaran McIvor, M?ire McLoone, John V. McCanny, "FPGA Montgomery Multiplier Architectures - A Comparison," fccm, pp.279-282, 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.