A fast multiplier over GF (2^n)

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

70 Downloads (Pure)


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 languageEnglish
Title of host publication23rd symposium on information theory in the Benelux
EditorsB. Macq, J.-J. Quisquater
Place of PublicationEnschede
PublisherWerkgemeenschap voor Informatie- en Communicatietheorie (WIC)
ISBN (Print)90-71048-16-0
Publication statusPublished - 2002
Event2002 Symposium on Information Theory in the Benelux (SITB 2002) - Louvain-la-Neuve, Belgium
Duration: 29 May 200231 May 2002
Conference number: 23


Conference2002 Symposium on Information Theory in the Benelux (SITB 2002)
Abbreviated titleSITB 2002


Dive into the research topics of 'A fast multiplier over GF (2^n)'. Together they form a unique fingerprint.

Cite this