Part III · Math and code · 6 lessons · about 107 minutes
Engineer
For developers and engineers. Lattices and Learning With Errors, ML-KEM from the inside, hash-based signatures built from scratch, and the implementation bugs that bite.
By the end you can: Read FIPS 203 without flinching, implement hash-based signatures, and avoid the classic implementation mistakes.
- 13Lattices and Learning With Errors18 min · 1 interactiveWhy adding a little noise to linear equations makes a problem quantum computers can't shortcut, and how that noise lets you encrypt a bit.
- 14Inside ML-KEM20 min · 1 interactiveML-KEM from the inside: Module-LWE encryption, the NTT, compression, and the Fujisaki-Okamoto transform with implicit rejection, per FIPS 203.
- 15Lamport signatures: hash-based signing from scratch15 min · 1 interactiveBuild a quantum-resistant signature from nothing but a hash function, then see exactly why signing twice with one key hands an attacker forgeries.
- 16Winternitz chains and Merkle trees20 min · 2 interactiveShrink one-time signatures with hash chains, then put thousands of one-time keys under one 32-byte root. The engine inside LMS, XMSS and SLH-DSA.
- 17Implementation pitfalls: timing, state and randomness18 min · 1 interactiveThe math can be sound and the code still leaks. KyberSlash, a compiler-introduced branch, stateful-key reuse and broken RNGs, and how to avoid each.
- 18Cryptocurrency in a post-quantum world16 min · 1 interactiveBitcoin and Ethereum sign with secp256k1, which Shor breaks. When public keys are exposed on chain, what long and short exposure mean, and migration paths.
That's the whole curriculum
Ready to prove it? Take the final exam.
Track created by Kyeson Blake Utley.