A comparison on FPGA of modular multipliers suitable for elliptic curve cryptography over GF(p) for specific p values

Mark Hamilton; William P. Marnane; Arnaud Tisserand

doi:10.1109/FPL.2011.55

A comparison on FPGA of modular multipliers suitable for elliptic curve cryptography over GF(p) for specific p values

Mark Hamilton
, William P. Marnane
, Arnaud Tisserand

Research output: Chapter in Book/Report/Conference proceedings › Conference proceeding › peer-review

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.

Original language	English
Title of host publication	Proceedings - 21st International Conference on Field Programmable Logic and Applications, FPL 2011
Pages	273-276
Number of pages	4
DOIs	https://doi.org/10.1109/FPL.2011.55
Publication status	Published - 2011
Event	21st International Conference on Field Programmable Logic and Applications, FPL 2011 - Chania, Greece Duration: 5 Sep 2011 → 7 Sep 2011

Publication series

Name	Proceedings - 21st International Conference on Field Programmable Logic and Applications, FPL 2011

Conference

Conference	21st International Conference on Field Programmable Logic and Applications, FPL 2011
Country/Territory	Greece
City	Chania
Period	5/09/11 → 7/09/11

Keywords

Elliptic curve processor
FPGA
Hiasat multiplier
Mersenne prime
Modular multiplication

Access to Document

10.1109/FPL.2011.55

Cite this

Hamilton, M., Marnane, W. P., & Tisserand, A. (2011). A comparison on FPGA of modular multipliers suitable for elliptic curve cryptography over GF(p) for specific p values. In Proceedings - 21st International Conference on Field Programmable Logic and Applications, FPL 2011 (pp. 273-276). Article 6044828 (Proceedings - 21st International Conference on Field Programmable Logic and Applications, FPL 2011). https://doi.org/10.1109/FPL.2011.55

Hamilton, Mark ; Marnane, William P. ; Tisserand, Arnaud. / A comparison on FPGA of modular multipliers suitable for elliptic curve cryptography over GF(p) for specific p values. Proceedings - 21st International Conference on Field Programmable Logic and Applications, FPL 2011. 2011. pp. 273-276 (Proceedings - 21st International Conference on Field Programmable Logic and Applications, FPL 2011).

@inproceedings{f46a4670f48447e884d28545f15cced4,

title = "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.",

keywords = "Elliptic curve processor, FPGA, Hiasat multiplier, Mersenne prime, Modular multiplication",

author = "Mark Hamilton and Marnane, \{William P.\} and Arnaud Tisserand",

year = "2011",

doi = "10.1109/FPL.2011.55",

language = "English",

isbn = "9780769545295",

series = "Proceedings - 21st International Conference on Field Programmable Logic and Applications, FPL 2011",

pages = "273--276",

booktitle = "Proceedings - 21st International Conference on Field Programmable Logic and Applications, FPL 2011",

note = "21st International Conference on Field Programmable Logic and Applications, FPL 2011 ; Conference date: 05-09-2011 Through 07-09-2011",

}

Hamilton, M, Marnane, WP & Tisserand, A 2011, A comparison on FPGA of modular multipliers suitable for elliptic curve cryptography over GF(p) for specific p values. in Proceedings - 21st International Conference on Field Programmable Logic and Applications, FPL 2011., 6044828, Proceedings - 21st International Conference on Field Programmable Logic and Applications, FPL 2011, pp. 273-276, 21st International Conference on Field Programmable Logic and Applications, FPL 2011, Chania, Greece, 5/09/11. https://doi.org/10.1109/FPL.2011.55

A comparison on FPGA of modular multipliers suitable for elliptic curve cryptography over GF(p) for specific p values. / Hamilton, Mark; Marnane, William P.; Tisserand, Arnaud.
Proceedings - 21st International Conference on Field Programmable Logic and Applications, FPL 2011. 2011. p. 273-276 6044828 (Proceedings - 21st International Conference on Field Programmable Logic and Applications, FPL 2011).

Research output: Chapter in Book/Report/Conference proceedings › Conference proceeding › peer-review

TY - GEN

T1 - A comparison on FPGA of modular multipliers suitable for elliptic curve cryptography over GF(p) for specific p values

AU - Hamilton, Mark

AU - Marnane, William P.

AU - Tisserand, Arnaud

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Elliptic curve processor

KW - FPGA

KW - Hiasat multiplier

KW - Mersenne prime

KW - Modular multiplication

UR - https://www.scopus.com/pages/publications/80455129828

U2 - 10.1109/FPL.2011.55

DO - 10.1109/FPL.2011.55

M3 - Conference proceeding

AN - SCOPUS:80455129828

SN - 9780769545295

T3 - Proceedings - 21st International Conference on Field Programmable Logic and Applications, FPL 2011

SP - 273

EP - 276

BT - Proceedings - 21st International Conference on Field Programmable Logic and Applications, FPL 2011

T2 - 21st International Conference on Field Programmable Logic and Applications, FPL 2011

Y2 - 5 September 2011 through 7 September 2011

ER -

Hamilton M, Marnane WP, Tisserand A. A comparison on FPGA of modular multipliers suitable for elliptic curve cryptography over GF(p) for specific p values. In Proceedings - 21st International Conference on Field Programmable Logic and Applications, FPL 2011. 2011. p. 273-276. 6044828. (Proceedings - 21st International Conference on Field Programmable Logic and Applications, FPL 2011). doi: 10.1109/FPL.2011.55

A comparison on FPGA of modular multipliers suitable for elliptic curve cryptography over GF(p) for specific p values

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this