Lably
Skip to content

Cryptanalysis of the Enigma

Decryption of World War II cipher

  • 61 min read
  • 6 chapters

Related on Lably

Through World War II, Nazi Germany and Warsaw

The Enigma machines were a family of portable cipher machines with rotor scramblers. Good operating procedures, properly enforced, would have made the plugboard Enigma machine unbreakable to the Allies at that time.

The German plugboard-equipped Enigma became the principal crypto-system of the German Reich and later of other Axis powers. In December 1932 it was broken by mathematician Marian Rejewski at the Polish General Staff's Cipher Bureau, using mathematical permutation group theory combined with French-supplied intelligence material obtained from German spy Hans-Thilo Schmidt. By 1938 Rejewski had invented a device, the cryptologic bomb, and Henryk Zygalski had devised his sheets, to make the cipher-breaking more efficient. Five weeks before the outbreak of World War II, in late July 1939 at a conference just south of Warsaw, the Polish Cipher Bureau shared its Enigma-breaking techniques and technology with the French and British.

During the German invasion of Poland, core Polish Cipher Bureau personnel were evacuated via Romania to France, where they established the PC Bruno signals intelligence station with French facilities support. Successful cooperation among the Poles, French, and British continued until June 1940, when France surrendered to the Germans.

From this beginning, the British Government Code and Cypher School at Bletchley Park built up an extensive cryptanalytic capability. Initially the decryption was mainly of Luftwaffe (German air force) and a few Heer (German army) messages, as the Kriegsmarine (German navy) employed much more secure procedures for using Enigma. Alan Turing, a Cambridge University mathematician and logician, provided much of the original thinking that led to upgrading of the Polish cryptologic bomb used in decrypting German Enigma ciphers. However, the Kriegsmarine introduced an Enigma version with a fourth rotor for its U-boats, resulting in a prolonged period when these messages could not be decrypted. With the capture of cipher keys and the use of much faster US Navy bombes, regular, rapid reading of U-boat messages resumed. Many commentators say the flow of Ultra communications intelligence from the decrypting of Enigma, Lorenz, and other ciphers shortened the war substantially and may even have altered its outcome.

General principles

The Enigma machines combined multiple levels of movable rotors and plug cables to produce a particularly complex polyalphabetic substitution cipher.

During World War I, inventors in several countries realised that a purely random key sequence, containing no repetitive pattern, would, in principle, make a polyalphabetic substitution cipher unbreakable. This led to the development of rotor machines which alter each character in the plaintext to produce the ciphertext, by means of a scrambler comprising a set of rotors that alter the electrical path from character to character, between the input device and the output device. This constant altering of the electrical pathway produces a very long period before the pattern—the key sequence or substitution alphabet—repeats.

Decrypting enciphered messages involves three stages, defined somewhat differently in that era than in modern cryptography. First, there is the identification of the system in use, in this case Enigma; second, breaking the system by establishing exactly how encryption takes place, and third, solving, which involves finding the way that the machine was set up for an individual message, i.e. the message key. Today, it is often assumed that an attacker knows how the encipherment process works (see Kerckhoffs's principle) and breaking is often used for solving a key. Enigma machines, however, had so many potential internal wiring states that reconstructing the machine, independent of particular settings, was a very difficult task.

Sign in to keep reading

5 more chapters are free with a Lably account.

More in Computing and communication