Two Software Normal Basis Multiplication Algorithms for GF(2n)

Haining Fan; Yiqi Dai

Paper 2004/126

Two Software Normal Basis Multiplication Algorithms for GF(2n)

Haining Fan and Yiqi Dai

Abstract

In this paper, two different normal basis multiplication algorithms for software implementation are proposed over GF(2n). The first algorithm is suitable for high complexity normal bases and the second algorithm is fast for type-I optimal normal bases and low complexity normal bases. The ANSI C source program is also included in this paper.

Note: The C program is in the 126.ps. Please download it and rename to 126.cpp.

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Published elsewhere. The paper have not been published.
Keywords: normal basis multiplication algorithm.
Contact author(s): fhn99 @ mails tsinghua edu cn
History: 2004-06-23: last of 4 revisions; 2004-06-03: received; See all versions
Short URL: https://ia.cr/2004/126
License: CC BY

BibTeX

@misc{cryptoeprint:2004/126,
      author = {Haining Fan and Yiqi Dai},
      title = {Two Software Normal Basis Multiplication Algorithms for {GF}(2n)},
      howpublished = {Cryptology {ePrint} Archive, Paper 2004/126},
      year = {2004},
      url = {https://eprint.iacr.org/2004/126}
}