You are looking at a specific version 20200506:002547 of this paper. See the latest version.

Paper 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.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Preprint. MINOR revision.
Keywords
Finite fieldInversion algorithmNormTrace.
Contact author(s)
fhn @ tsinghua edu cn
History
2022-08-19: last of 2 revisions
2020-04-28: received
See all versions
Short URL
https://ia.cr/2020/482
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.