Cryptology ePrint Archive: Report 2020/482

A Trace Based $GF(2^n)$ Inversion Algorithm

Haining Fan

Abstract: By associating Fermat's Little Theorem based $GF(2^n)$ inversion algorithms with the multiplicative Norm function, we present an additive Trace based $GF(2^n)$ inversion algorithm. For elements with Trace value 0, it needs 1 less multiplication operation than Fermat's Little Theorem based algorithms in some $GF(2^n)$s.

Category / Keywords: implementation / Finite field, Inversion algorithm, Norm, Trace.

Date: received 24 Apr 2020, last revised 5 May 2020

Contact author: fhn at tsinghua edu cn

Available format(s): PDF | BibTeX Citation

Version: 20200506:002547 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]