Paper 2010/218

New Montgomery-based Semi-systolic Multiplier for Even-type GNB of GF(2^m)

Zhen Wang and Shuqin Fan

Abstract

Efficient finite field multiplication is crucial for implementing public key crytosystem. Based on new Gaussian normal basis Montgomery(GNBM) representation, this paper presents a semi-systolic even-type GNBM multiplier.Compared with the only existing semi-systolic even-type GNB multiplier, the proposed multiplier saves about 57% space complexity and 50% time complexity.

Metadata
Available format(s)
-- withdrawn --
Category
Implementation
Publication info
Published elsewhere. Unknown where it was published
Keywords
finite field multiplicationGaussian normal basiselliptic curve cryptosystemMontgomerysystolic architecture
Contact author(s)
shuqinfan78 @ gmail com
longdizhen @ gmail com
History
2012-01-01: withdrawn
2010-04-19: received
See all versions
Short URL
https://ia.cr/2010/218
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.