🔐 Cryptography: The Math of Secrets

What you’ll learn

1. Ciphers You Can DoDo and break classic ciphers — Caesar, Vigenère, and the Enigma machine — and learn why each one falls.Ciphers scramble messages using a secret key. The Caesar shift breaks by brute force; any letter-swap cipher breaks by frequency analysis. The Vigenère cipher used a keyword to resist that for centuries before falling to pattern-spotting. By WWII, Enigma machines industrialized encryption, and cracking them at Bletchley Park helped launch the computer age.
2. The Key ProblemUnderstand the key distribution problem and the one-way-lock idea that finally solved it in the 1970s.Every classical cipher needs both sides to share a key in advance, which is impossible to do secretly over open networks — the key distribution problem. The solution is a public lock anyone can close paired with a private key only you can open, so no secret travels. Diffie, Hellman, and RSA turned this into working math that underpins the internet.
3. Public-Key's Brilliant TrickGrasp public-key cryptography through the paint-mixing intuition and the one-way hardness of factoring primes.Public-key security rests on one-way math: multiplying two huge primes is easy, but factoring the result is practically impossible. The paint-mixing analogy shows how two people reach a shared secret in public. The same key pair also enables digital signatures, proving who sent a message. Security comes from tasks too vast for any computer to finish.
4. Hashing and Everyday CryptoUnderstand hashing as one-way fingerprints and see where cryptography protects you daily — passwords, HTTPS, and messaging.A hash crunches any input into a fixed-length fingerprint that changes completely if the input changes at all, and can't be reversed — which is why sites store password hashes, not passwords. HTTPS uses public-key crypto to set up a shared key, then fast encryption for data, and end-to-end apps let only sender and recipient read messages. Strong, unique passwords and 2FA apply the math to you, but most breaches exploit human error, not broken math.
5. The Quantum Question, HonestlyUnderstand honestly what quantum computers threaten, what's still hype, and how post-quantum cryptography prepares for it.Shor's algorithm shows a large quantum computer could factor big numbers, threatening RSA in principle. But real machines are far too weak today; the near-term worry is 'harvest now, decrypt later.' The response is post-quantum cryptography, with NIST's first standards published in 2024. Hashing and symmetric encryption are far less affected. Cryptography adapts, as always.

Questions this course answers

Grounded in trusted sources

• Encyclopaedia Britannica
• U.S. National Institute of Standards and Technology (NIST)
• The Code Book by Simon Singh

Every Wunder lesson is built from real, reputable sources — never invented.

Related Math courses