How the Real Machine Worked
Each keypress on an Enigma machine sent an electrical signal through a plugboard (swapping pairs of letters), then through three rotors in sequence, into a reflector that sent the signal back through the same three rotors in reverse, and finally back through the plugboard to light a lamp showing the output letter. Crucially, before each letter was encrypted, the right rotor stepped forward by one position — and depending on the positions of the other rotors, the middle and left rotors could step too. This simulator implements the same wiring tables (rotors I–V and reflectors B/C) used by the historical 3-rotor Wehrmacht Enigma I.
The "Double-Stepping" Quirk
Enigma's rotor mechanism has a famous mechanical anomaly: normally, the middle rotor only steps when the right rotor passes its notch. But if the middle rotor is itself sitting at its own notch position when a key is pressed, it steps again immediately — and drags the left rotor forward with it. This means the middle rotor can step on two consecutive keypresses in a row, which is mechanically odd but was a direct consequence of how the stepping pawls were physically arranged. Cryptanalysts at Bletchley Park had to account for this exact quirk when building their models of Enigma's behavior — it's not a simplification, it's implemented here exactly as the real machine behaved.
Why Enigma Was Eventually Broken
Despite its complexity — roughly 10114 possible settings for a full 3-rotor military configuration — Enigma had a structural weakness that proved decisive: no letter could ever encrypt to itself, a direct consequence of how the reflector works (a letter goes in, bounces off the reflector, and comes back out, but the reflector wiring guarantees it never maps a letter to itself). Polish and later British cryptanalysts at Bletchley Park, including Alan Turing, exploited this property along with operational mistakes (like reusing message keys) to build the Bombe machines that dramatically narrowed the search space. It's a vivid, historical illustration of a broader lesson in cryptography: a huge keyspace alone doesn't guarantee security if the algorithm has an exploitable structural pattern.
Curious how frequency analysis or the Bombe's logical deduction techniques would approach breaking a cipher like this? Try the Frequency Analysis Visualizer on a substitution cipher, or compare against modern algorithms with genuinely no known structural weaknesses in the Cryptography Fundamentals Assessment.