Cryptology ePrint Archive: Report 2014/687

Reducing the Complexity of Normal Basis Multiplication

Omer Egecioglu and Cetin Kaya Koc

Abstract: In this paper we introduce a new transformation method and a multiplication algorithm for multiplying the elements of the field GF$(2^k)$ expressed in a normal basis. The number of XOR gates for the proposed multiplication algorithm is fewer than that of the optimal normal basis multiplication, not taking into account the cost of forward and backward transformations. The algorithm is more suitable for applications in which tens or hundreds of field multiplications are performed before needing to transform the results back.

Category / Keywords: implementation / Finite fields, characteristic 2, normal basis, optimal normal basis

Date: received 2 Sep 2014

Contact author: koc at cs ucsb edu

Available format(s): PDF | BibTeX Citation

Note: Accepted to WAIFI 2014.

Version: 20140904:060847 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]