Paper 2004/137

New GF(2n) Parallel Multiplier Using Redundant Representation

Haining Fan and Yiqi Dai

Abstract

A new GF(2n) redundant representation is presented. Squaring in the representation is almost cost-free. Based on the representation, two multipliers are proposed. The XOR gate complexity of the first multiplier is lower than a recently proposed normal basis multiplier when CN (the complexity of the basis) is larger than 3n-1.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. This paper is published in: H. Fan, Researches in GF(2n) Multiplication Algorithms, PhD dissertation, Tsinghua University, 2004. (in Chinese)
Keywords
Finite fieldnormal basisredundant setMassey-Omura multiplier.
Contact author(s)
fan_haining @ yahoo com
History
2006-08-06: last of 3 revisions
2004-06-16: received
See all versions
Short URL
https://ia.cr/2004/137
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2004/137,
      author = {Haining Fan and Yiqi Dai},
      title = {New GF(2n) Parallel Multiplier Using Redundant Representation},
      howpublished = {Cryptology ePrint Archive, Paper 2004/137},
      year = {2004},
      note = {\url{https://eprint.iacr.org/2004/137}},
      url = {https://eprint.iacr.org/2004/137}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.