International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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

Authors:
Haining Fan
Yiqi Dai
Download:
URL: http://eprint.iacr.org/2004/126
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2004-12098,
  title={Two Software Normal Basis Multiplication Algorithms for GF(2n)},
  booktitle={IACR Eprint archive},
  keywords={implementation / normal basis, multiplication algorithm.},
  url={http://eprint.iacr.org/2004/126},
  note={The paper have not been published. fhn99@mails.tsinghua.edu.cn 12592 received 26 May 2004, last revised 22 Jun 2004},
  author={Haining Fan and Yiqi Dai},
  year=2004
}