Why Natural Numbers Fail the Security Test: The Zero Divisor Trap
Explore why the natural numbers we use everyday are fundamentally unsuitable for encryption, and the mathematical traps that await those who don't understand fields.
Why Natural Numbers Fail the Security Test
You might wonder why we don’t just use the set of Natural Numbers (N = 1, 2, 3…) for encryption. On the surface, they seem fine, but they fail the most basic test of algebraic security because they aren’t even a “ring,” let alone a “field.”
The Fatal Flaw: Missing Additive Inverses
The fatal flaw? Natural numbers lack an additive inverse. For a system to be mathematically “strict” enough for crypto, every element must have an opposite that brings it back to the identity (zero). If you have 5, you need -5. Because natural numbers don’t include negatives, you can’t always “undo” an operation.
Without this balance, the mathematical “architecture” is too weak to support the complex, reversible transformations required by AES. Encryption requires:
- Every operation to be reversible
- A way to “get back” to the original value
- Mathematical structures that preserve information
Natural numbers simply cannot provide these guarantees.
The Zero Divisor Trap: When Math Breaks
In standard arithmetic, we’re taught that the only way to get zero when multiplying two numbers is if one of them is zero. In the world of modular arithmetic (the “clock math” used in crypto), this isn’t always true. This is the Zero Divisor Trap.
Take the set Z_8 (integers modulo 8). If you multiply 2 by 4, you get 8, which is 0 (mod 8). Even though neither 2 nor 4 is zero, their product is zero.
This is a disaster for encryption. If a set has zero divisors, it cannot be a “field” because it is mathematically impossible to find a multiplicative inverse for those elements. Without an inverse, you can’t “decrypt” what you’ve “encrypted.”
Proof by Contradiction
To prove this, we use a simple proof by contradiction:
- Assume an element a has an inverse a⁻¹
- Suppose a is a zero divisor, so a * b = 0 (where b is not zero)
- Multiply both sides by the inverse: a⁻¹ * a * b = a⁻¹ * 0
- This simplifies to: 1 * b = 0, which means b = 0
- Contradiction! We started by saying b was not zero
As the professor warns:
“If we are able to write this a * b = 0 where a is not equal to zero and b is not equal to zero… right away you conclude that we can’t find inverses… this cannot be a field.”
The Path Forward
The solution? We need finite fields where:
- Every element has an additive inverse
- Every non-zero element has a multiplicative inverse
- No zero divisors exist
This leads us to the beautiful mathematics of Z_p (when p is prime) and extension fields. Next, we’ll explore how computers use the simplest field Z_2 to build the complex arithmetic that powers AES.