Some comments on Zech's logarithms

Authors:
K. Huber
Affiliations:
Inst. fuer Netzwerk- und Signal Theorie, Tech. Hochschule Darmstadt
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 1

Binary Representations of Finite Fields and Their Application to Complexity Theory

Finite Fields and Their Applications

Quantified Score

Hi-index	754.84

Visualization

Abstract

Some properties of Zech's logarithms are stated and exploited to compute Zech's logarithms from a restricted set of key elements. Zech's logarithms are recommended for the fast solution of quadratic, cubic, and quartic equations over GF(2m)