CryptoDB
New Montgomery-based Semi-systolic Multiplier for Even-type GNB of GF(2^m)
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2010-23119, title={New Montgomery-based Semi-systolic Multiplier for Even-type GNB of GF(2^m)}, booktitle={IACR Eprint archive}, keywords={implementation / finite field multiplication, Gaussian normal basis, elliptic curve cryptosystem, Montgomery, systolic architecture}, url={http://eprint.iacr.org/2010/218}, note={ shuqinfan78@gmail.com;longdizhen@gmail.com 14718 received 19 Apr 2010}, author={Zhen Wang and Shuqin Fan}, year=2010 }