How Did Alan Turing and Bletchley Park Break the Enigma Machine?

The Unbreakable Machine: 158 Quintillion Combinations

Invented in 1918 by German engineer Arthur Scherbius for commercial banking security, the Enigma machine was adopted and heavily militarized by the German Wehrmacht, Luftwaffe, and Kriegsmarine in the 1930s [1,2]. Looking like an oversized typewriter in a wooden box, Enigma encrypted messages through a combination of mechanical keyboard presses, an interchangeable set of 3 to 5 rotating wired wheels (rotors), a reversing reflector (Umkehrwalze), and a front plugboard (Steckerbrett) [1,3].

With every keystroke, the rightmost rotor stepped forward by one position, constantly altering the electrical circuit path across all rotors. The resulting electrical polyalphabetic cipher produced 158 quintillion (1.58 x 10^20) possible daily key configurations [1,3]. German military command considered the machine mathematically uncrackable, confident that no human cryptanalyst could test sufficient permutations before daily settings were changed at midnight [1,2,3].

"With 158 quintillion possible daily key settings, German military command believed Enigma was mathematically unbreakable by human cryptanalysts."

The Polish Breakthrough: Rejewski and the First Cryptologic Bombes

The first breakthrough against military Enigma was achieved not in Britain, but in Poland. In December 1932, brilliant young mathematician Marian Rejewski of the Polish Cipher Bureau (Biuro Szyfrów), alongside Jerzy Różycki and Henryk Zygalski, applied permutation group theory to reconstruct the internal wiring of Enigma’s military rotors without ever seeing the machine [4,5].

The Poles built the first electromechanical codebreaking machines—named Bomba kryptologiczna—which automated rotor permutation checks [4,5]. In July 1939, five weeks before Hitler invaded Poland, Polish intelligence met British and French counterparts in the Pyry forest outside Warsaw, handing over duplicate reconstructed Enigma machines and mathematical blueprints, laying the foundation for Allied codebreaking at Bletchley Park [2,4,5].

"Polish mathematician Marian Rejewski used permutation group theory to reconstruct Enigma’s internal wiring in 1932, inventing the first codebreaking bombes."

Alan Turing, the Bletchley Bombe, and the Fatal Flaw (Hut 8)

At Bletchley Park in Buckinghamshire, Cambridge mathematician Alan Turing joined the Government Code and Cypher School (GC&CS) and spearheaded the decryption of German naval Enigma in Hut 8 [1,2,6]. Turing recognized that manual codebreaking was too slow; machines had to be defeated by machines [1,2].

Turing exploited Enigma’s single fatal architectural flaw: the machine could never encipher a letter as itself (e.g., an "A" could become any letter from B to Z, but never "A") [1,2,6]. Exploiting predictable military messages called cribs (such as standard 06:00 weather reports starting with WETTERVORHERSAGE), Turing and mathematician Gordon Welchman designed the British Bombe—a massive 1-ton electromechanical computer incorporating 36 duplicate Enigma rotor stacks and a "diagonal board" that tested thousands of circuit contradictions simultaneously in seconds [1,2,6].

By 1943, over 200 Bombes operated 24/7, deciphering over 80,000 German military signals per month under the codename Ultra [1,2,7]. Ultra intelligence alerted the Allies to U-boat wolfpack coordinates in the Battle of the Atlantic, Rommel’s supply lines in North Africa, and German troop positions on D-Day, with historians estimating that Turing’s work shortened the war by two to four years and saved over 14 million lives [1,2,7].

"Turing exploited Enigma’s fatal flaw—that no letter could encode as itself—building the 1-ton electromechanical Bombe that decrypted 80,000 signals monthly."