Building the Unbreakable Code Whose Breaking Won WWII
summary
Recreates an Enigma emulator in Ruby using Test Driven Development, implementing rotors, a reflector and a spindle so rotors advance after each keystroke; demonstrates the real claim (an emulator that enciphers and deciphers with identical daily settings) and shows tests passing with the true rotor mechanics including 17,576 starting positions per rotor order and the historical jump to ~150 million million million total settings. Optional plugboard is left as a clear extension and the codebase is organized into keyboard, rotor, spindle and reflector modules.
AI-written summary · about
chapters (14)
- 0:00Enigma and Bletchley Park intro
- 10:38Enigma as OOP model
- 13:29OOP design principles
- 17:25Enigma project setup
- 24:08Substitution cipher with Enigma
- 32:49Advancing rotors mission
- 35:50Encapsulation in rotor design
- 47:14Rotor dependencies management
- 53:00Rotor spindle class
- 1:00:00Refactoring Enigma with dependency injection
- 1:04:20Reflector rotor implementation
- 1:13:35Deciphering with reflector
- 1:20:23Final demo and future
- 1:25:25Q&A
