A finite field, also called a Galois field, is an algebraic structure containing a finite number of elements on which addition, subtraction, multiplication, and division (excluding by zero) are defined and obey the field axioms. Every finite field has a number of elements equal to a prime power, and fields of a given size are unique up to isomorphism. Finite fields are central to cryptography, error-correcting codes, and many computational algorithms because they support exact arithmetic over bounded sets.
- A finite field is an algebraic structure with finitely many elements on which the field operations behave consistently, generalising Modular Arithmetic over a prime. Grounded in Number Theory, finite fields underpin Cryptography, including Elliptic Curve Cryptography and Zero-Knowledge Proof systems.
Overview
- A field supports addition, subtraction, multiplication, and division by non-zero elements, all satisfying the usual algebraic laws; a finite field simply has a finite element set.
- The number of elements in a finite field is always a prime raised to a positive integer power, and any two finite fields of the same size are structurally identical.
- The simplest finite fields are the integers modulo a prime, while larger fields are built as extensions using irreducible polynomials.
Key aspects
- Prime fields consist of the residues modulo a prime under modular arithmetic.
- Extension fields are constructed over a prime field using an irreducible polynomial, giving prime-power sizes.
- Every non-zero element has a multiplicative inverse, enabling exact division within the field.
- The non-zero elements form a cyclic group, a property exploited heavily in cryptography.
Applications
- Public-key cryptography, including elliptic-curve and discrete-logarithm schemes.
- Error-correcting codes such as Reed-Solomon used in storage and communications.
- Zero-knowledge proof systems and other advanced cryptographic protocols.
- Fast and exact arithmetic in computer algebra and coding theory.