Lecture 11: Finite Fields: Doing Math in a Limited Universe

Sequentia Explores: The Mathematics of Crypto

Part II: The Mathematician’s Toolkit

Lecture 11: Finite Fields: Doing Math in a Limited Universe

In our last lecture, we took a step back to look at the big picture, introducing the concept of a mathematical Group. We learned that a Group is a set of elements with an operation (like addition) that follows four key rules: Closure, Associativity, Identity, and Inverse. This structure guarantees a certain level of predictability and is what makes decryption mathematically possible.

Today, we’re going to level up. What if we want to do more than just add and subtract? What if we want to multiply and—most importantly—divide, all while staying within our neat, finite, “clock arithmetic” world?

To do this, we need a more powerful structure. Welcome to the concept of a Finite Field.

From Groups to Fields: What’s the Difference?

A Field is a set of elements where you can perform all four standard arithmetic operations: addition, subtraction, multiplication, and division (except division by zero). The results of these operations must always stay within the original set (closure), and they must follow the familiar rules of arithmetic (associativity, commutativity, distributivity).

A Finite Field is simply a Field that contains a finite number of elements.

Think of it as a complete, self-contained mathematical universe. No matter what standard arithmetic you do, you can never “escape” the universe. Everything you need is right there inside the set.

Let’s revisit our “clock arithmetic” example. The set of integers {0, 1, 2, …, 11} with addition modulo 12 forms a Group. But does it form a Field?

We can add, subtract, and multiply just fine. But what about division? Division is the same as multiplying by a multiplicative inverse. Let’s try to find the inverse of 4 (mod 12). We are looking for a number x such that:

(4 × x) ≡ 1 (mod 12)

Let’s test all the possibilities:
4 × 1 = 4
4 × 2 = 8
4 × 3 = 12 ≡ 0
4 × 4 = 16 ≡ 4
…and so on. You’ll find that no matter which number x from 0 to 11 you multiply by 4, you will never get 1 (mod 12). Therefore, 4 has no multiplicative inverse mod 12.

Why? Remember from Lecture 8, an inverse for a (mod n) only exists if GCD(a, n) = 1. Here, GCD(4, 12) = 4. Because 4 and 12 share a common factor, we can’t “divide” by 4 in this system.

Since not every non-zero element has a multiplicative inverse, the integers mod 12 do not form a Field. They form a structure called a Ring, but that’s a topic for another day.

So, how do we create a Finite Field?

The Magic of a Prime Modulus

The solution lies in one of our favorite tools: prime numbers.

Let’s change our modulus from a composite number (12) to a prime number, say, 7. Our set is now {0, 1, 2, 3, 4, 5, 6}, and our operations are addition and multiplication mod 7.

This structure is known as a Galois Field, denoted GF(p) where p is a prime number. In our case, GF(7).

Let’s check if GF(7) forms a Field. We already know it forms a Group under addition. The key test is whether every non-zero element has a multiplicative inverse. Let’s check:

• 1: 1 × 1 ≡ 1 (mod 7) (Inverse of 1 is 1)
• 2: 2 × 4 = 8 ≡ 1 (mod 7) (Inverse of 2 is 4)
• 3: 3 × 5 = 15 ≡ 1 (mod 7) (Inverse of 3 is 5)
• 4: 4 × 2 = 8 ≡ 1 (mod 7) (Inverse of 4 is 2)
• 5: 5 × 3 = 15 ≡ 1 (mod 7) (Inverse of 5 is 3)
• 6: 6 × 6 = 36 ≡ 1 (mod 7) (Inverse of 6 is 6)

Success! Every non-zero element in our set has a unique multiplicative inverse within the set. This means we can effectively “divide” by any non-zero number in this mod 7 universe.

This happens because 7 is a prime number. For any prime p, every integer from 1 to p-1 will be coprime to p (their GCD will be 1). And because they are coprime, we can guarantee that a multiplicative inverse exists for each of them.

Why Finite Fields are the Bedrock of Modern Cryptography

Finite Fields are the perfect setting for advanced cryptography, especially for Elliptic Curve Cryptography (ECC), which is used to secure everything from Bitcoin to iMessage.

1. Complete Mathematical System: They provide a finite world where all our standard arithmetic tools (add, subtract, multiply, divide) work predictably. There are no missing pieces or operations that suddenly fail.
2. No “Leaking” of Information: Because all operations are closed, calculations never produce results outside the field. This prevents information from “leaking” out in the form of fractions or infinitely large numbers, which could give clues to an attacker.
3. Foundation for Complex Structures: Cryptographers can build more complex mathematical structures on top of these finite fields. An elliptic curve, for example, is not just a curve on an infinite graph; it’s a curve defined by points whose coordinates belong to a massive finite field. The operations on these elliptic curve points (a special kind of “addition”) also form a Group, giving us all the properties we need for secure encryption.

While the concept of a Finite Field might feel incredibly abstract, it is the unsung hero that makes the most advanced forms of public-key cryptography possible. It provides a robust, complete, and bounded mathematical universe where cryptographic operations can be performed with absolute predictability and security.

In our next lecture, we will finally get our hands dirty with our first historical cryptosystem. We’ll leave the abstract algebra behind for a moment and apply our knowledge of modular arithmetic to the simple yet elegant Caesar Cipher.