Conference Publication Details
Mandatory Fields
Hamilton M., Tisserand A., Marnane W.P.
21st International Conference on Field Programmable Logic and Applications (FPL 2011)
A Comparison on FPGA of Modular Multipliers Suitable for Elliptic Curve Cryptography over GF(p) for Specific p Values
2011
September
Published
1
()
Optional Fields
FPGA, Hiasat Multiplier, Elliptic Curve Processor, Mersenne prime, Modular Multiplication
273
276
Chania, Crete, Greece
05-SEP-11
07-SEP-11
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.
http://fpl2011.org/
10.1109/FPL.2011.55
Grant Details
Science Foundation Ireland
06/MI/006