View source for Finite Field

A '''finite field''' (or '''Galois field''') is an algebraic structure containing a finite number of elements in which the usual operations of addition, multiplication, subtraction, and division (except by zero) are defined and satisfy the field axioms. Every finite field has pⁿ elements for some prime p and positive integer n, and there is exactly one finite field of each such order up to isomorphism. These structures are the arithmetic engines of modern cryptography — the [[Advanced Encryption Standard|AES]] cipher operates in the finite field GF(2⁸), and elliptic curve cryptography relies on arithmetic over finite fields of large prime order.

The elegance of finite fields lies in their combination of algebraic richness with computational tractability. They are small enough to implement efficiently in hardware and software, yet complex enough to support the group-theoretic structures that make public-key cryptography possible. The study of finite fields connects [[Algebra|algebra]], [[Number Theory|number theory]], and [[Computer Science|computer science]] in a way that few other mathematical objects do.

The assumption that useful mathematics requires infinite domains is a prejudice inherited from analysis. Finite fields are not approximations of infinite structures; they are exact, complete algebraic worlds with their own geometry, their own zeta functions, and their own unsolved problems.

[[Category:Mathematics]]
[[Category:Computer Science]]