In mathematics, a normal basis in field theory is a special kind of basis for Galois extensions of finite degree, characterised as forming a single orbit for the Galois group. The normal basis theorem states that any Galois extension of fields has a normal basis. In algebraic number theory the study of the more refined question of the existence of a normal integral basis is part of Galois module theory.

In the case of finite fields, this means that each of the basis elements is related to any one of them by applying the p-th power mapping repeatedly, where p is the characteristic of the field. Let GF(pm) be a field with pm elements, and β an element of it such that the m elements

\{ \beta, \beta^p, \beta^{p^2}, \ldots, \beta^{p^{m-1}} \}

are linearly independent. Then this set forms a normal basis for GF(pm).


This basis is frequently used in cryptographic applications that are based on the discrete logarithm problem such as elliptic curve cryptography. Hardware implementations of normal basis arithmetic typically have far less power consumption than other bases.

When representing elements as a binary string (e.g. in GF(23) the most significant bit represents β4, the least significant bit represents β), we can square elements by doing a left circular shift with wraparound (left shifting β4 would give β8, but since we are working in GF(23) this wraps around to β). This makes the normal basis especially attractive for cryptosystems that utilize frequent squaring.

See alsoEdit


Ad blocker interference detected!

Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.