HOME

TheInfoList



OR:

Zech logarithms are used to implement addition in
finite field In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field that contains a finite number of elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subt ...
s when elements are represented as powers of a generator \alpha. Zech logarithms are named after Julius Zech, and are also called Jacobi logarithms, after Carl G. J. Jacobi who used them for
number theoretic Number theory (or arithmetic or higher arithmetic in older usage) is a branch of pure mathematics devoted primarily to the study of the integers and integer-valued functions. German mathematician Carl Friedrich Gauss (1777–1855) said, "Math ...
investigations.


Definition

Given a primitive element \alpha of a finite field, the Zech logarithm relative to the base \alpha is defined by the equation :\alpha^ = 1 + \alpha^n, which is often rewritten as :Z_\alpha(n) = \log_\alpha(1 + \alpha^n). The choice of base \alpha is usually dropped from the notation when it is clear from the context. To be more precise, Z_\alpha is a function on the integers modulo the multiplicative order of \alpha, and takes values in the same set. In order to describe every element, it is convenient to formally add a new symbol -\infty, along with the definitions :\alpha^ = 0 :n + (-\infty) = -\infty :Z_\alpha(-\infty) = 0 :Z_\alpha(e) = -\infty where e is an integer satisfying \alpha^e = -1, that is e=0 for a field of characteristic 2, and e=\frac for a field of odd characteristic with q elements. Using the Zech logarithm, finite field arithmetic can be done in the exponential representation: :\alpha^m + \alpha^n = \alpha^m \cdot (1 + \alpha^) = \alpha^m \cdot \alpha^ = \alpha^ :-\alpha^n = (-1) \cdot \alpha^n = \alpha^e \cdot \alpha^n = \alpha^ :\alpha^m - \alpha^n = \alpha^m + (-\alpha^n) = \alpha^ :\alpha^m \cdot \alpha^n = \alpha^ :\left( \alpha^m \right)^ = \alpha^ :\alpha^m / \alpha^n = \alpha^m \cdot \left( \alpha^n \right)^ = \alpha^ These formulas remain true with our conventions with the symbol -\infty, with the caveat that subtraction of -\infty is undefined. In particular, the addition and subtraction formulas need to treat m = -\infty as a special case. This can be extended to arithmetic of the
projective line In mathematics, a projective line is, roughly speaking, the extension of a usual line by a point called a ''point at infinity''. The statement and the proof of many theorems of geometry are simplified by the resultant elimination of special cases; ...
by introducing another symbol +\infty satisfying \alpha^ = \infty and other rules as appropriate. For fields of characteristic two, :Z_\alpha(n) = m \iff Z_\alpha(m) = n.


Uses

For sufficiently small finite fields, a table of Zech logarithms allows an especially efficient implementation of all finite field arithmetic in terms of a small number of integer addition/subtractions and table look-ups. The utility of this method diminishes for large fields where one cannot efficiently store the table. This method is also inefficient when doing very few operations in the finite field, because one spends more time computing the table than one does in actual calculation.


Examples

Let be a root of the primitive polynomial . The traditional representation of elements of this field is as polynomials in α of degree 2 or less. A table of Zech logarithms for this field are , , , , , , , and . The multiplicative order of ''α'' is 7, so the exponential representation works with integers modulo 7. Since ''α'' is a root of then that means , or if we recall that since all coefficients are in GF(2), subtraction is the same as addition, we obtain . The conversion from exponential to polynomial representations is given by : \alpha^3 = \alpha^2 + 1 (as shown above) : \alpha^4 = \alpha^3 \alpha = (\alpha^2 + 1)\alpha = \alpha^3 + \alpha = \alpha^2 + \alpha + 1 : \alpha^5 = \alpha^4 \alpha = (\alpha^2 + \alpha + 1)\alpha = \alpha^3 + \alpha^2 + \alpha = \alpha^2 + 1 + \alpha^2 + \alpha = \alpha + 1 : \alpha^6 = \alpha^5 \alpha = (\alpha + 1)\alpha = \alpha^2 + \alpha Using Zech logarithms to compute : :\alpha^6 + \alpha^3 = \alpha^ = \alpha^ = \alpha^ = \alpha^ = \alpha^5, or, more efficiently, :\alpha^6 + \alpha^3 = \alpha^ = \alpha^ = \alpha^5, and verifying it in the polynomial representation: :\alpha^6 + \alpha^3 = (\alpha^2 + \alpha) + (\alpha^2 + 1) = \alpha + 1 = \alpha^5.


See also

* Gaussian logarithm *
Irish logarithm Irish logarithms were a system of number manipulation invented by Percy Ludgate for machine multiplication. The system used a combination of mechanical cams as look-up tables and mechanical addition to sum pseudo-logarithmic indices to produce part ...
, a similar technique derived empirically by Percy Ludgate *
Finite field arithmetic In mathematics, finite field arithmetic is arithmetic in a finite field (a field containing a finite number of elements) contrary to arithmetic in a field with an infinite number of elements, like the field of rational numbers. There are infinit ...
* Logarithm table


References


Further reading

* * *
https://web.archive.org/web/20180714105025/http://www.netlib.org/toms-2014-06-10/620 -->
* {{DEFAULTSORT:Zech's Logarithms Linear algebra Finite fields