Cipher methods Polyalphabetic
Enigma machine
Electromechanical rotor machine of WWII. Breaking Enigma was a founding feat of modern computing.
- Family :
- Polyalphabetic
- Difficulty :
- Advanced
- Era :
- 1918-1945, Arthur Scherbius then German military
- Inventor :
- Arthur Scherbius
Also known as : Enigma · German cipher machine
The Enigma machine is probably the most famous cipher machine in history. Patented by German engineer Arthur Scherbius in 1918 and adopted by the Wehrmacht in the 1930s, it protected German military communications throughout World War II. Breaking it — through the work of Marian Rejewski, Alan Turing and the Bletchley Park team — shortened the war and gave birth to modern computing.
Principle
Enigma is an electromechanical machine applying a polyalphabetic substitution that changes at every keystroke. The circuit passes through:
- Plugboard (Steckerbrett) — a pre-substitution swapping pairs of letters.
- Rotors (three or four) — each applies a fixed permutation. After every keystroke, the rightmost rotor advances one notch, carrying the others through a notched system.
- Reflector (Umkehrwalze) — reflects the signal back through the rotors.
- Rotors are traversed again in reverse.
- Plugboard again, in reverse.
This double traversal makes Enigma involutive: to decrypt, configure the same machine to the same starting position and retype the ciphertext.
Daily configuration
Each day, operators received key booklets specifying:
- The three rotors to use out of five (later eight), and their order.
- Each rotor’s starting position.
- The plugboard pairings (up to ten).
This yielded a keyspace around 10²³ configurations — far more than the Allies could brute-force.
Example
A full Enigma encryption depends on the exact configuration. For illustration, a plausible ciphertext of CIPHERCHRONICLE might be QXPDWKNBZVRFMHA — the exact output depends on rotors, positions and the Steckerbrett.
How was Enigma broken?
- Marian Rejewski (1932, Poland) exploited a procedural flaw (double-typing of the daily key) to reconstruct the rotors.
- Alan Turing and Gordon Welchman (1940-43, Bletchley Park) built the cryptologic bombes: electromechanical machines testing massive configuration sets.
- Cribs — probable plaintext segments (
WETTERBERICHT, daily weather reports) — focused the search. - The no-self-encryption signature of the reflector is a fatal flaw: no letter can encrypt to itself, eliminating huge configuration sets.
Variants
- Enigma M3 — Wehrmacht version, 3 rotors out of 5.
- Enigma M4 — Kriegsmarine (U-boats) version, 4 rotors. Harder to break.
- Typex (British), SIGABA (American), Lorenz (Hitler-level) — contemporary machines, similar or more sophisticated.
In CipherChronicle
Enigma is the symbol of 20th-century cryptography. Its grids can stage the rotor clicks and invite the player to recover the configuration — a historical immersion into Bletchley Park.
Grid
- 1
Ciphertext
Perfectly flat distribution — every letter encrypts differently at each position.
- 2
Enigma fingerprint
No letter ever encrypts to itself — the reflector's characteristic signature.
- 3
Hypothesis: rotors I-II-III, positions A-A-A, reflector B, empty plugboard
The exact configuration (key set) must be reconstructed.
- 4
Apply the inverse
Enigma is involutive — once the rotors are reset to the same position, retyping the ciphertext yields the plaintext.
- 5
Message revealed
The plaintext appears once the exact configuration is found.