|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2011 21st International Conference on Field Programmable Logic and Applications
A Comparison on FPGA of Modular Multipliers Suitable for Elliptic Curve Cryptography over GF(p) for Specific p Values
Chania, Chania Greece
September 05-September 07
ISBN: 978-0-7695-4529-5
| ASCII Text | x | ||
| Mark Hamilton, William P. Marnane, Arnaud Tisserand, "A Comparison on FPGA of Modular Multipliers Suitable for Elliptic Curve Cryptography over GF(p) for Specific p Values," International Conference on Field Programmable Logic and Applications, pp. 273-276, 2011 21st International Conference on Field Programmable Logic and Applications, 2011. | |||
| BibTex | x | ||
| @article{ 10.1109/FPL.2011.55, author = {Mark Hamilton and William P. Marnane and Arnaud Tisserand}, title = {A Comparison on FPGA of Modular Multipliers Suitable for Elliptic Curve Cryptography over GF(p) for Specific p Values}, journal ={International Conference on Field Programmable Logic and Applications}, volume = {0}, year = {2011}, isbn = {978-0-7695-4529-5}, pages = {273-276}, doi = {http://doi.ieeecomputersociety.org/10.1109/FPL.2011.55}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - International Conference on Field Programmable Logic and Applications TI - A Comparison on FPGA of Modular Multipliers Suitable for Elliptic Curve Cryptography over GF(p) for Specific p Values SN - 978-0-7695-4529-5 SP273 EP276 A1 - Mark Hamilton, A1 - William P. Marnane, A1 - Arnaud Tisserand, PY - 2011 KW - FPGA KW - Hiasat Multiplier KW - Elliptic Curve Processor KW - Mersenne prime KW - Modular Multiplication VL - 0 JA - International Conference on Field Programmable Logic and Applications ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FPL.2011.55
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.
Index Terms:
FPGA, Hiasat Multiplier, Elliptic Curve Processor, Mersenne prime, Modular Multiplication
Citation:
Mark Hamilton, William P. Marnane, Arnaud Tisserand, "A Comparison on FPGA of Modular Multipliers Suitable for Elliptic Curve Cryptography over GF(p) for Specific p Values," fpl, pp.273-276, 2011 21st International Conference on Field Programmable Logic and Applications, 2011
Usage of this product signifies your acceptance of the Terms of Use.