The Math Problem That Secures the Internet
Every time you log in to your bank, make an online purchase, or send an encrypted message, you're relying on a single mathematical fact: it's easy to multiply two large prime numbers together, but almost impossibly hard to factor the result back into those primes. The entire architecture of digital trust depends on this asymmetry.
Every time you log in to your bank, make an online purchase, or send an encrypted message, you're relying on a single mathematical fact: it's easy to multiply two large prime numbers together, but almost impossibly hard to factor the result back into those primes. The entire architecture of digital trust depends on this asymmetry.
This is called RSA encryption, invented in 1977 by Rivest, Shamir, and Adleman at MIT. It solved a problem that had stumped cryptographers for millennia: how do you share a secret with someone you've never met before, over a channel that might be monitored?
The old way was symmetric — both sides agreed on a key in advance, then used it to encode and decode messages. Julius Caesar's cipher was symmetric. So was the Enigma machine. But this only works if you can first meet in person, or use a courier, to exchange the key.
The internet made this impossible. You can't personally meet your bank before logging in. You need to establish a secure connection with a stranger, right now, over a network full of eavesdroppers.
RSA solves this with a mathematical trick. Each participant has two keys — a public key everyone can see, and a private key kept secret. The keys are generated from two large prime numbers, multiplied together. The product becomes part of your public key. The original primes become part of your private key.
Here's the magic: the public key can encrypt a message that only the private key can decrypt. To break it, an attacker would need to factor the public number back into those original primes. For a 2048-bit number — typical today — this would take all the computers on Earth working together longer than the age of the universe.
This is why cryptographers worry about quantum computers. Quantum algorithms can factor large numbers efficiently, breaking RSA entirely. Current estimates suggest a quantum computer capable of breaking 2048-bit RSA is still a decade or more away, but once it exists, a huge fraction of the internet's security disappears overnight.
New quantum-resistant encryption algorithms are already being standardized. The transition will be massive — every phone, every website, every piece of encrypted data will need to migrate.
All of modern civilization's digital infrastructure rests on a mathematical observation that Euclid would have understood. Primes, it turns out, are the unsung heroes of the internet.