DocumentCode :
1805943
Title :
A Comparison on FPGA of Modular Multipliers Suitable for Elliptic Curve Cryptography over GF(p) for Specific p Values
Author :
Hamilton, Mark ; Marnane, William P. ; Tisserand, Arnaud
Author_Institution :
Dept. of Electr. & Electron. Eng., Univ. Coll. Cork, Cork, Ireland
fYear :
2011
fDate :
5-7 Sept. 2011
Firstpage :
273
Lastpage :
276
Abstract :
In this paper we provide a comparison of different modular multipliers suitable for use in an elliptic curve processor, when working with a Mersenne prime modulus. Mersenne primes allow for the use of fast modular reduction techniques. Several multipliers are presented that can be implemented solely in slice logic. A design that makes use of the DSP48E blocks on Virtex 5 FPGAs is also described. The different multipliers are compared for speed, area and power consumption when implemented on a Virtex 5 FPGA.
Keywords :
field programmable gate arrays; multiplying circuits; public key cryptography; DSP48E blocks; Mersenne prime modulus; Mersenne primes; Virtex 5 FPGA; elliptic curve cryptography; elliptic curve processor; field programmable gate arrays; modular multipliers; modular reduction techniques; power consumption; Adders; Clocks; Digital signal processing; Elliptic curve cryptography; Field programmable gate arrays; Power demand; Power measurement; Elliptic Curve Processor; FPGA; Hiasat Multiplier; Mersenne prime; Modular Multiplication;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Field Programmable Logic and Applications (FPL), 2011 International Conference on
Conference_Location :
Chania
Print_ISBN :
978-1-4577-1484-9
Electronic_ISBN :
978-0-7695-4529-5
Type :
conf
DOI :
10.1109/FPL.2011.55
Filename :
6044828
Link To Document :
بازگشت