"Almost Montgomery" based multiplier in GF(2^n)

L. Batina, C.J.A. Jansen, G. Bruin - Muurling, S.B. Xu

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

5 Downloads (Pure)

Abstract

Finite field arithmetic over GF (2 to the nth) is particularly attractive for efficient implementations of elliptic curve cryptosystems in hardware. In this paper a new scalable multiplier architecture is proposed, combining the classical bit-serial method and Montgomery's modular multiplication algorithm. Using polynomial basis, this combined multiplier exhibits a double speed with an increase in hardware comlexity of only 50% compared to the classical type of multiplier. Special attention is given to the scalability and flexibility of the design. Performance data is given for an FPGA prototype implementation.
Original languageEnglish
Title of host publication23rd Symposium on Information Theory in the Benelux
EditorsB. Macq, J.-J. Quisquater
Place of PublicationBrussels
PublisherWerkgemeenschap voor Informatie- en Communicatietheorie (WIC)
Pages61-68
ISBN (Print)90-741048-16-0
Publication statusPublished - 2002
Externally publishedYes

Fingerprint Dive into the research topics of '"Almost Montgomery" based multiplier in GF(2^n)'. Together they form a unique fingerprint.

Cite this