Cryptology ePrint Archive: Report 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.

Category / Keywords: implementation / normal basis, multiplication algorithm.

Publication Info: The paper have not been published.

Date: received 26 May 2004, last revised 22 Jun 2004

Contact author: fhn99 at mails tsinghua edu cn

Available format(s): PDF | BibTeX Citation

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

Version: 20040623:012544 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]