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

Haining Fan; Yiqi Dai

Paper 2004/126 Original: eprint.iacr.org/2004/126 ↗

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

Haining Fan

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.

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Preprint.
History: 2004-06-23: last updated; 2004-06-03: published
Short URL: https://ia.cr/2004/126
License: https://creativecommons.org/licenses/by/4.0/

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}
}