A Comparison on FPGA of Modular Multipliers Suitable for Elliptic Curve Cryptography over GF(p) for Specific p Values

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
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/inria-00633200
Contributor : Arnaud Tisserand <>
Submitted on : Monday, October 17, 2011 - 7:11:41 PM
Last modification on : Thursday, October 10, 2019 - 10:49:15 AM
Long-term archiving on: Wednesday, January 18, 2012 - 2:35:27 AM

File

fpl11.pdf
Publisher files allowed on an open archive

Identifiers

Citation

Mark Hamilton, William Marnane, Arnaud Tisserand. A Comparison on FPGA of Modular Multipliers Suitable for Elliptic Curve Cryptography over GF(p) for Specific p Values. 21st International Conference on Field Programmable Logic and Applications (FPL), Sep 2011, Chania, Greece. pp.273-276, ⟨10.1109/FPL.2011.55⟩. ⟨inria-00633200⟩

Share

Metrics

Record views

363

Files downloads

7681