A fast multiplier over GF (2^n)

M.J. Potgieter; B.J. Dyk, van; T.J. Tjalkens

A fast multiplier over GF (2^n)

M.J. Potgieter, B.J. Dyk, van, T.J. Tjalkens

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

70 Downloads (Pure)

Abstract

In this paper we will present a hardware implementation of a GF(2n) polynomial basis multiplier that is twice as fast a the classical multiplier while requiring about 50 % more chip area. We implement a flexible scalar (or point) multiplier for elliptic curve cryptosystems using this multiplier and find that the flexible system performs almost twice as fast as compared with the classical multiplier.

Original language	English
Title of host publication	23rd symposium on information theory in the Benelux
Editors	B. Macq, J.-J. Quisquater
Place of Publication	Enschede
Publisher	Werkgemeenschap voor Informatie- en Communicatietheorie (WIC)
Pages	69-74
ISBN (Print)	90-71048-16-0
Publication status	Published - 2002
Event	2002 Symposium on Information Theory in the Benelux (SITB 2002) - Louvain-la-Neuve, Belgium Duration: 29 May 2002 → 31 May 2002 Conference number: 23

Conference

Conference	2002 Symposium on Information Theory in the Benelux (SITB 2002)
Abbreviated title	SITB 2002
Country/Territory	Belgium
City	Louvain-la-Neuve
Period	29/05/02 → 31/05/02

Access to Document

Metis149668Final published version, 463 KB

Cite this

@inproceedings{eb52262f6419469fb53d5060f90b3dfd,

title = "A fast multiplier over GF (2^n)",

abstract = "In this paper we will present a hardware implementation of a GF(2n) polynomial basis multiplier that is twice as fast a the classical multiplier while requiring about 50 % more chip area. We implement a flexible scalar (or point) multiplier for elliptic curve cryptosystems using this multiplier and find that the flexible system performs almost twice as fast as compared with the classical multiplier.",

author = "M.J. Potgieter and {Dyk, van}, B.J. and T.J. Tjalkens",

year = "2002",

language = "English",

isbn = "90-71048-16-0",

pages = "69--74",

editor = "B. Macq and J.-J. Quisquater",

booktitle = "23rd symposium on information theory in the Benelux",

publisher = "Werkgemeenschap voor Informatie- en Communicatietheorie (WIC)",

note = "2002 Symposium on Information Theory in the Benelux (SITB 2002), SITB 2002 ; Conference date: 29-05-2002 Through 31-05-2002",

}

A fast multiplier over GF (2^n). / Potgieter, M.J.; Dyk, van, B.J.; Tjalkens, T.J.
23rd symposium on information theory in the Benelux. ed. / B. Macq; J.-J. Quisquater. Enschede: Werkgemeenschap voor Informatie- en Communicatietheorie (WIC), 2002. p. 69-74.

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

TY - GEN

T1 - A fast multiplier over GF (2^n)

AU - Potgieter, M.J.

AU - Dyk, van, B.J.

AU - Tjalkens, T.J.

N1 - Conference code: 23

PY - 2002

Y1 - 2002

N2 - In this paper we will present a hardware implementation of a GF(2n) polynomial basis multiplier that is twice as fast a the classical multiplier while requiring about 50 % more chip area. We implement a flexible scalar (or point) multiplier for elliptic curve cryptosystems using this multiplier and find that the flexible system performs almost twice as fast as compared with the classical multiplier.

AB - In this paper we will present a hardware implementation of a GF(2n) polynomial basis multiplier that is twice as fast a the classical multiplier while requiring about 50 % more chip area. We implement a flexible scalar (or point) multiplier for elliptic curve cryptosystems using this multiplier and find that the flexible system performs almost twice as fast as compared with the classical multiplier.

M3 - Conference contribution

SN - 90-71048-16-0

SP - 69

EP - 74

BT - 23rd symposium on information theory in the Benelux

A2 - Macq, B.

A2 - Quisquater, J.-J.

PB - Werkgemeenschap voor Informatie- en Communicatietheorie (WIC)

CY - Enschede

T2 - 2002 Symposium on Information Theory in the Benelux (SITB 2002)

Y2 - 29 May 2002 through 31 May 2002

ER -

A fast multiplier over GF (2^n)

Abstract

Conference

Access to Document

Fingerprint

Cite this