Every time you buy something online, log into your bank account, or send an encrypted message, you are relying on a mathematical truth that a Greek scholar proved around 300 BCE. Euclid of Alexandria demonstrated that there are infinitely many prime numbers. He could never have imagined that this elegant fact would one day protect the financial transactions of billions of people.
Prime numbers, those stubborn integers divisible only by one and themselves, have fascinated mathematicians for millennia. They seemed, for most of history, like the purest example of knowledge for its own sake. Beautiful but useless. Then, in 1977, three researchers at MIT turned that assumption on its head and changed the world.
Euclid’s Elegant Proof
Book IX, Proposition 20 of Elements contains one of the most celebrated proofs in all of mathematics. Euclid’s argument is a masterpiece of logical reasoning, and it goes something like this: assume you have a finite list of all the prime numbers. Multiply them all together and add one. The resulting number is either prime itself (and therefore not on your list) or divisible by a prime not on your list. Either way, your supposedly complete list is incomplete. There must always be another prime.
What makes this proof extraordinary is not just its conclusion but its method. It is a proof by contradiction, one of the first recorded uses of this technique. Euclid did not need to find new primes. He simply showed that any claim of having found them all leads to an absurdity. The logic is airtight, and it has not aged a single day in twenty-three centuries.
The Kronecker Wallis edition of Euclid’s Elements presents this proof alongside the rest of Euclid’s monumental work, completing Oliver Byrne’s visually striking color-coded edition. Holding it, you can trace the very argument that makes your passwords safe.
Two Thousand Years of Prime Obsession
After Euclid, mathematicians kept poking at primes, trying to understand their distribution. The primes thin out as numbers get larger, but they never disappear entirely. They pop up unpredictably, like wildflowers through concrete. This combination of pattern and chaos has driven some of the greatest minds in history to near madness.
A few highlights from the long history of prime hunting:
- Eratosthenes (circa 240 BCE) invented his famous “sieve,” a systematic way to filter out composite numbers and reveal the primes hiding among them.
- Pierre de Fermat studied primes in the 1600s and proposed several conjectures, some brilliant, some wrong. His so-called “Fermat primes” turned out to be far rarer than he hoped.
- Leonhard Euler proved in the 1700s that the sum of the reciprocals of the primes diverges, meaning primes are, in a precise sense, not that rare after all.
- Carl Friedrich Gauss, as a teenager, conjectured the Prime Number Theorem, describing how primes thin out logarithmically. It took another century before anyone could prove him right.
- Bernhard Riemann connected prime distribution to a mysterious function in complex analysis. His hypothesis about that function, proposed in 1859, remains unproven and carries a million-dollar prize.
Throughout all of this, the study of primes remained firmly in the realm of pure mathematics. Number theorists delighted in primes the way birdwatchers delight in rare species: with passion, dedication, and absolutely no expectation of practical payoff.
Enter the Machines
The twentieth century brought computers, and computers brought a new urgency to an old question: how do you keep information secret?
During World War II, Alan Turing and his colleagues at Bletchley Park cracked the Enigma cipher, demonstrating both the power and the fragility of encryption schemes. The lesson was clear. Any code that relies on keeping its method secret is only as secure as its weakest human link. What cryptographers needed was a system where the method could be completely public and the messages would still be unbreakable.
Turing’s wartime work, beautifully documented in the Kronecker Wallis edition of Turing’s Treatise on the Enigma, laid the intellectual groundwork for modern computer science. And it was computer science that would finally give prime numbers their practical purpose.
The Key Exchange Problem
Imagine you want to send a locked box to someone, but you cannot meet in person to exchange keys. If you send the key alongside the box, anyone who intercepts the package can open it. This is the fundamental problem of cryptography, and for centuries, the only solution was to somehow get the key to the recipient through a separate, secure channel.
In 1976, Whitfield Diffie and Martin Hellman published a revolutionary idea: what if there were a lock that used two different keys? One key locks the box, and a completely different key unlocks it. You could publish the locking key for the whole world to see. Anyone could lock a message to you. But only you, with your secret unlocking key, could open it.
This was the birth of public-key cryptography. The concept was clear. But they needed a mathematical operation that was easy to perform in one direction and practically impossible to reverse.
RSA: When Primes Became Guardians
In 1977, Ron Rivest, Adi Shamir, and Leonard Adleman (the R, S, and A) found the answer. Their insight was deceptively simple: multiplying two large prime numbers together is easy, but factoring the result back into its prime components is extraordinarily hard.
Take two prime numbers, each hundreds of digits long. A computer can multiply them together in a fraction of a second. But given only the product, finding the original two primes would take the same computer longer than the age of the universe. This asymmetry, easy one way and effectively impossible the other, is the foundation of RSA encryption.
Here is how it works in broad strokes:
- You choose two enormous prime numbers and multiply them together to get a composite number. This composite becomes part of your public key.
- The two original primes are your private key. You never share them.
- Anyone can encrypt a message using your public key (the composite number and some related values).
- Only someone who knows the two prime factors (you) can decrypt the message.
The beauty of this system is that its security does not depend on secrecy of the method. The algorithm is published. The public key is, well, public. The only secret is the factorization, and mathematics itself guarantees that secret is safe.
The Scale of the Numbers Involved
Modern RSA typically uses keys of 2,048 bits, which correspond to numbers with about 617 decimal digits. The primes involved are each roughly 300 digits long. To appreciate how large these numbers are: there are approximately 10 to the power of 80 atoms in the observable universe. A 300-digit number dwarfs that figure entirely.
Finding primes this large is itself a remarkable feat, relying on probabilistic primality tests that would have astounded Euclid. We cannot check every possible divisor (there are too many). Instead, we use clever shortcuts rooted in number theory, some of which trace back to Fermat’s work in the seventeenth century.
Newton, Euler, and the Mathematical Ecosystem
No mathematical breakthrough happens in isolation. RSA depends on results from number theory, algebra, and computational complexity, fields shaped by centuries of accumulated insight. Isaac Newton’s development of systematic mathematical methods in Principia Mathematica helped establish the rigorous framework within which later mathematicians like Euler and Gauss could study primes with precision.
Euler’s work on modular arithmetic, the mathematics of remainders, is directly used in the RSA algorithm. When you encrypt a message with RSA, you are performing modular exponentiation, a technique Euler formalized in the 1700s. He proved what is now called Euler’s theorem, and it is literally baked into the decryption step of every RSA transaction happening right now.
The Quantum Threat
In 1994, mathematician Peter Shor devised a theoretical algorithm that could factor large numbers efficiently, if run on a quantum computer. Shor’s algorithm does not break the mathematics of RSA. It breaks the computational assumption. If a sufficiently powerful quantum computer is ever built, it could factor RSA keys in hours rather than billions of years.
This has triggered a global race to develop “post-quantum” cryptographic systems that do not rely on the difficulty of factoring. Lattice-based cryptography, hash-based signatures, and other exotic approaches are being tested. The irony is rich: the very primes that have guarded our secrets may one day need replacing, not because mathematicians found a flaw in Euclid’s proof, but because physicists built a machine that thinks differently.
Why Ancient Mathematics Still Matters
The story of primes and cryptography is perhaps the most dramatic example of why pure mathematics matters. When Euclid proved that primes are infinite, he was not trying to solve a practical problem. When Euler studied modular arithmetic, he was not thinking about electronic commerce. When Gauss conjectured the Prime Number Theorem, online banking was unimaginable.
Yet each of these discoveries turned out to be essential. The timeline from pure insight to world-changing application can stretch across millennia, but the connection, when it arrives, can be total.
This is what makes the history of science so endlessly surprising. The works that seemed most abstract, the theorems proved for their own beauty, often end up being the most consequential. Euclid’s Elements is not just a historical artifact. It is the intellectual bedrock beneath every secure connection on the internet.
If you want to hold that bedrock in your hands, the Kronecker Wallis edition of Euclid’s Elements is a stunning way to experience the work that started it all. A handcrafted edition of the most influential mathematics book ever written, and the unlikely origin story of digital security.
No products in the cart.