An FPGA implementation of an elliptic curve processor over GF(2 m)

Nele Mentens; Siddika Berna Örs; Bart Preneel

An FPGA implementation of an elliptic curve processor over GF(2 ^m)

Nele Mentens^*, Siddika Berna Örs, Bart Preneel

^*Corresponding author for this work

KU Leuven

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

29 Citations (Scopus)

Abstract

This paper describes a hardware implementation of an arithmetic processor which is efficient for elliptic curve (EC) cryptosystems, which are becoming increasingly popular as an alternative for public key cryptosystems based on factoring. The modular multiplication is implemented using a Montgomery modular multiplication in a systolic array architecture, which has the advantage that the clock frequency becomes independent of the bit length m.

Original language	English
Title of host publication	Proceedings of the 2004 ACM Great Lakes Symposium on VLSI, GLSVLSI 2004
Subtitle of host publication	VLSI in the Nanometer Era
Pages	454-457
Number of pages	4
Publication status	Published - 2004
Externally published	Yes
Event	Proceedings of the 2004 ACM Great lakes Symposium on VLSI, GLSVLSI 2004: VLSI in the Nanometer Era - Boston, MA, United States Duration: 26 Apr 2004 → 28 Apr 2004

Publication series

Name	Proceedings of the ACM Great Lakes Symposium on VLSI

Conference

Conference	Proceedings of the 2004 ACM Great lakes Symposium on VLSI, GLSVLSI 2004: VLSI in the Nanometer Era
Country/Territory	United States
City	Boston, MA
Period	26/04/04 → 28/04/04

Keywords

Elliptic Curve Cryptosystems
FPGA
Montgomery Modular Multiplication

Cite this

@inproceedings{9d1d38ef050a4782996573271fa42db8,

title = "An FPGA implementation of an elliptic curve processor over GF(2 m)",

abstract = "This paper describes a hardware implementation of an arithmetic processor which is efficient for elliptic curve (EC) cryptosystems, which are becoming increasingly popular as an alternative for public key cryptosystems based on factoring. The modular multiplication is implemented using a Montgomery modular multiplication in a systolic array architecture, which has the advantage that the clock frequency becomes independent of the bit length m.",

keywords = "Elliptic Curve Cryptosystems, FPGA, Montgomery Modular Multiplication",

author = "Nele Mentens and {\"O}rs, {Siddika Berna} and Bart Preneel",

year = "2004",

language = "English",

isbn = "1581138539",

series = "Proceedings of the ACM Great Lakes Symposium on VLSI",

pages = "454--457",

booktitle = "Proceedings of the 2004 ACM Great Lakes Symposium on VLSI, GLSVLSI 2004",

note = "Proceedings of the 2004 ACM Great lakes Symposium on VLSI, GLSVLSI 2004: VLSI in the Nanometer Era ; Conference date: 26-04-2004 Through 28-04-2004",

}

Mentens, N, Örs, SB & Preneel, B 2004, An FPGA implementation of an elliptic curve processor over GF(2 ^m). in Proceedings of the 2004 ACM Great Lakes Symposium on VLSI, GLSVLSI 2004: VLSI in the Nanometer Era. Proceedings of the ACM Great Lakes Symposium on VLSI, pp. 454-457, Proceedings of the 2004 ACM Great lakes Symposium on VLSI, GLSVLSI 2004: VLSI in the Nanometer Era, Boston, MA, United States, 26/04/04.

An FPGA implementation of an elliptic curve processor over GF(2 ^m). / Mentens, Nele; Örs, Siddika Berna; Preneel, Bart.
Proceedings of the 2004 ACM Great Lakes Symposium on VLSI, GLSVLSI 2004: VLSI in the Nanometer Era. 2004. p. 454-457 (Proceedings of the ACM Great Lakes Symposium on VLSI).

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

TY - GEN

T1 - An FPGA implementation of an elliptic curve processor over GF(2 m)

AU - Mentens, Nele

AU - Örs, Siddika Berna

AU - Preneel, Bart

PY - 2004

Y1 - 2004

N2 - This paper describes a hardware implementation of an arithmetic processor which is efficient for elliptic curve (EC) cryptosystems, which are becoming increasingly popular as an alternative for public key cryptosystems based on factoring. The modular multiplication is implemented using a Montgomery modular multiplication in a systolic array architecture, which has the advantage that the clock frequency becomes independent of the bit length m.

AB - This paper describes a hardware implementation of an arithmetic processor which is efficient for elliptic curve (EC) cryptosystems, which are becoming increasingly popular as an alternative for public key cryptosystems based on factoring. The modular multiplication is implemented using a Montgomery modular multiplication in a systolic array architecture, which has the advantage that the clock frequency becomes independent of the bit length m.

KW - Elliptic Curve Cryptosystems

KW - FPGA

KW - Montgomery Modular Multiplication

UR - http://www.scopus.com/inward/record.url?scp=2942754025&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:2942754025

SN - 1581138539

T3 - Proceedings of the ACM Great Lakes Symposium on VLSI

SP - 454

EP - 457

BT - Proceedings of the 2004 ACM Great Lakes Symposium on VLSI, GLSVLSI 2004

T2 - Proceedings of the 2004 ACM Great lakes Symposium on VLSI, GLSVLSI 2004: VLSI in the Nanometer Era

Y2 - 26 April 2004 through 28 April 2004

ER -