A finite field is a finite set equipped with addition, subtraction, multiplication, and division by nonzero elements. Finite fields are also called Galois fields and are written GF(q) or Fq. A finite field exists precisely when its number of elements is a prime power q = pn.
From prime fields to extension fields
When n = 1, GF(p) is simply arithmetic modulo the prime p. When n is larger, the field can be constructed from polynomials over GF(p). A common construction takes polynomial expressions modulo an irreducible polynomial, much as modular arithmetic takes integers modulo a prime.
What this guide covers
- The field axioms and how to test them on finite sets.
- Arithmetic and multiplicative inverses in GF(p).
- Why every finite field has prime-power cardinality.
- Constructing GF(pn) with irreducible polynomials.
- Frobenius maps and repeated p-th powers.
- The relationship between extension degree and subfields.
Why irreducible polynomials are essential
An irreducible polynomial plays the role that a prime number plays for integers. Quotienting by an irreducible polynomial prevents zero divisors and ensures that every nonzero polynomial residue has an inverse. If the polynomial factors, the resulting quotient is generally a ring rather than a field.
Applications in computing
Finite fields support Reed-Solomon error correction, AES arithmetic, elliptic-curve cryptography, secret sharing, coding theory, and many proof systems. Their finite structure also makes every operation exact and suitable for efficient implementation.
How to use the interactive guide
Use the controls to calculate examples, inspect multiplication tables, test polynomials, and trace field relationships. The visual experiments are designed to connect the formal definitions with behavior you can observe directly.