Cryptography: The Weird Bits
summary
Live code implements an Enigma replica in Zig that reproduces the double-stepping bug and demonstrates outputs where no letter ever encrypts to itself, runs via zig build run and shows example ciphertext; a Blum Blum Shub PRNG is implemented with arbitrary-size integers, seed/m modulus checks and unit tests that pass; Shor’s algorithm is explained with a small worked example (323 = 17×19, order 48) and a Qiskit Python demo; SHA‑256 constants are computed at comp-time constant generation to ship baked values.
AI-written summary · about
chapters (8)
- 0:00Cryptography 102
- 1:05Enigma machine basics
- 8:26Implementing Enigma in Zig
- 19:05Blum Blum Shub PRNG
- 32:35Shaw's algorithm & quantum
- 47:50Quantum gates & error correction
- 51:41SHA-256 hash functions
- 1:00:38Q&A
related talks
55mThe secrets of Cryptography
29mMaths or magic? End-to-end encryption explained like I'm five
25mCryptography Isn't Scary
51m48 Dirty Little Secrets Cryptographers Don’t Want You To Know
58mKeynote: Crypto means Cryptography!
42mBreak Crypto like a Pro!
01h 04m Cryptography For Newcomers - The hitchhiker's guide to cipher in devs 
42mEverything I always wanted to know about crypto