Cipher Machines From Antiquity to the Enigma Machine

Similar documents
Historical cryptography 2. CSCI 470: Web Science Keith Vertanen

La Storia dei Messaggi Segreti fino alle Macchine Crittografiche

B. Substitution Ciphers, continued. 3. Polyalphabetic: Use multiple maps from the plaintext alphabet to the ciphertext alphabet.

Alan Turing: Codebreaker

Code Breakers: Uncovering German Messages. by Rena Korb. Scott Foresman Reading Street 4.4.4

Cryptography. Module in Autumn Term 2016 University of Birmingham. Lecturers: Mark D. Ryan and David Galindo

Codes and Nomenclators

CPSC 467: Cryptography and Computer Security

Cryptography Made Easy. Stuart Reges Principal Lecturer University of Washington

Grade 7 and 8 Math Circles March 19th/20th/21st. Cryptography

Purple. Used by Japanese government. Not used for tactical military info. Used to send infamous 14-part message

Background Data: Naval Warfare, Battle of the Atlantic, Cryptography, and the Code Game. Battle of the Atlantic Allied Convoys vs.

1 Introduction to Cryptology

UNIT 19 Lesson Plan 1

SECURITY OF CRYPTOGRAPHIC SYSTEMS. Requirements of Military Systems

Encryption Systems 4/14/18. We have seen earlier that Python supports the sorting of lists with the built- in.sort( ) method

The depth HQIBPEXEZMUG is intercepted & read. September December Whole of Research Section works on trying to analyze the key produced by the depth

Classical Cryptography

CANDOER News. Volume 8 Number 2 Inside this issue

Math 1111 Math Exam Study Guide

Voting Systems, Mass Murder, and the Enigma Machine

Lecture 1: Introduction

Overview: The works of Alan Turing ( )

CSE 3482 Introduction to Computer Security.

Colored Image Ciphering with Key Image

An Introduction to Traditional Cryptography and Cryptanalysis for Amateurs. Chris Spackman

The number theory behind cryptography

A brief history of Communication

A STENO HIDING USING CAMOUFLAGE BASED VISUAL CRYPTOGRAPHY SCHEME

A Brief History of Computer Science and Computing

Chapter 4 The Data Encryption Standard

Computer Science as a Discipline

Drill Time: Remainders from Long Division

Reunion at Bletchley Park, 19 October 1991

A Balanced Introduction to Computer Science, 3/E

#27: Number Theory, Part II: Modular Arithmetic and Cryptography May 1, 2009

Block Ciphers Security of block ciphers. Symmetric Ciphers

Arithmetic, bones and counting

Public Key Cryptography

CRYPTANALYSIS OF THE PERMUTATION CIPHER OVER COMPOSITION MAPPINGS OF BLOCK CIPHER

The Invention of Paper Discussion Questions:

VII Monks in the scriptorium!

The Booklet. On the inside left page you will see a pony depicted in front of the leaning tower of Pisa.

Alan Turing and the Enigma of Computability

Cryptography s Application in Numbers Station

EMINENT & ENIGMATIC. 10 aspects of Alan Turing

The Imitation Game. Movie Summary

Chapter 4 MASK Encryption: Results with Image Analysis

Unit 8: In the Clouds

1. Out of Disorder (Introduction)

Adventures with Rubik s UFO. Bill Higgins Wittenberg University

Journal of Discrete Mathematical Sciences & Cryptography Vol. ( ), No., pp. 1 10

Introduction to Cryptography

From Turing Machines to Building a Brain

Example Enemy agents are trying to invent a new type of cipher. They decide on the following encryption scheme: Plaintext converts to Ciphertext

Analysis of Secure Text Embedding using Steganography

MA 111, Topic 2: Cryptography

ENIGMA. DECIPHER VICTORY Technical specifcaton of the exhibiton

MODERN MARVELS: CODES NETWORK: THE HISTORY CHANNEL Writer/Producer/Director: Adrian Maher Date: April 6, 2001 TEASE

Linear Congruences. The solutions to a linear congruence ax b (mod m) are all integers x that satisfy the congruence.

Dr. V.U.K.Sastry Professor (CSE Dept), Dean (R&D) SreeNidhi Institute of Science & Technology, SNIST Hyderabad, India. P = [ p

Chapter 1 An Introduction to Computer Science. INVITATION TO Computer Science 1

Vernam Encypted Text in End of File Hiding Steganography Technique

Math 1111 Math Exam Study Guide

Cracking the Code, Part 2: Codes & Combinations

Mathematics Explorers Club Fall 2012 Number Theory and Cryptography

FPGA Implementation of Secured Image STEGNOGRAPHY based on VIGENERE CIPHER and X BOX Mapping Techniques

COUNT ON US SECONDARY CHALLENGE STUDENT WORKBOOK GET ENGAGED IN MATHS!

Chapter 3 LEAST SIGNIFICANT BIT STEGANOGRAPHY TECHNIQUE FOR HIDING COMPRESSED ENCRYPTED DATA USING VARIOUS FILE FORMATS

COUNT ON US SECONDARY CHALLENGE STUDENT WORKBOOK

A BIT OF. Machines that learn. Make me invisible! The robot painter. Spies like us. Computer Science for Fun Issue 1

Number Theory and Public Key Cryptography Kathryn Sommers

A Steganography Algorithm for Hiding Secret Message inside Image using Random Key

Number Theory and Security in the Digital Age

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY

Successful Implementation of the Hill and Magic Square Ciphers: A New Direction

RICHARD FLETCHER, Secretary, the Bill Tutte Memorial Fund

Paper 2 - The Business of Fibonacci. Leonardo of Pisa, who went by the nickname Fibonacci, was born in Pisa, Italy in 1170


Cryptography. 2. decoding is extremely difficult (for protection against eavesdroppers);

The Fall Of Japan (World War II) By Keith Wheeler

SENDING MESSAGES. In the battle that followed, the British navy sank four German ships. Steady chaps!

Implementation and Performance Testing of the SQUASH RFID Authentication Protocol

Alan Turing s legacy. John Graham-Cumming INSTANT EXPERT Month 2010 NewScientist 1

What is a science programme? 16/06/2008

The NATIONAL AND INTERNATIONAL VALUE of BLETCHLEY PARK. A PLATFORM FOR DISCUSSION and its future

Dynamic Collage Steganography on Images

Sudoku an alternative history

Laboratory 1: Uncertainty Analysis

Part 1: Unit Overview. Unit Aims. Unit Abstract. Unit Outcomes. Unit Outcomes

o Broken by using frequency analysis o XOR is a polyalphabetic cipher in binary

10/4/10. An overview using Alan Turing s Forgotten Ideas in Computer Science as well as sources listed on last slide.

Public Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014

Computers and Mathematics

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY

Keywords: dynamic P-Box and S-box, modular calculations, prime numbers, key encryption, code breaking.

Course Outline. Textbook: G. Michael Schneider and Judith L. Gersting, "Invitation to Computer Science C++ Version," 3rd Edition, Thomson, 2004.

Keeping secrets secret

Software Security. Encryption. Encryption. Encryption. Encryption. Encryption. Week 5 Part 1. Masking Data from Unwelcome eyes

THE ORIGINS OF A NATION. The Anglo-Saxon and Medieval Periods

Transcription:

Cipher Machines From Antiquity to the Enigma Machine Wayne Summers Department of Computer Science Columbus State University Columbus, Georgia, USA Abstract More and more people worldwide are using the Internet for personal transactions. Many are transmitting personal data including credit card and identification numbers. This requires that a secure connection be established. This secure connection provides a mechanism for transmitting personal data in encrypted form so that others can not read the information. Encryption or encoding the data is not a new concept. History is punctuated with codes. They have decided the outcomes of battles and led to the deaths of kings and queens. [Singh, pg. x] This paper traces the history of machines for encryption from the earliest known encryption or cipher machines to the Enigma machine used in the first half of the 20 th century. Introduction to Cryptography and Encryption The word cryptography comes from the Greek words kryptos meaning hidden and grafi meaning writing and is the study of hiding written information through encoding or enciphering. Singh [Singh, xii] explains that a code is the replacing of a word or phrase with a word, number or symbol, while a cipher involves making letter-for-letter substitutions. Information can be hidden by either substituting other letters, words or symbols for the letters or words in the message or transposing the letters or words in the message. Many of the modern cryptographic algorithms use combinations of substitutions and transpositions. Cryptology is the overall study of codes and ciphers and cryptoanalysis is the science of the decryption of codes and ciphers. Encryption, or hiding the meaning of a message, appears to have begun in Egypt around 1900 BCE. The scribe for the Pharaoh Amenemhet II used hieroglyphic substitutions to impart dignity and authority to the inscriptions in the pyramids. [Higgs, pg. 3] From around 1500 BCE to 500 BCE, Assyrian and other cultures including Mesopotamian, Indian, Chinese, and Egyptian began hiding information using a variety of methods including tattooing the message on the heads of the messengers, carving the message in the stomach of animals, and hiding the message under new wax. This was the beginning of steganography or hiding messages. Around 600 BCE, the Hebrew scribes used a simple substitution cipher known as ATBASH. ATBASH uses a reverse alphabet where for example the third letter would be replaced with the third character from the end of the alphabet. This was used in writing the book of Jeremiah. - 1 -

The first appearance of a cipher device is the scytale (Fig. 1) which was used by the Greeks around 475 BCE. The scytale consists of a staff of wood around which a strip of papyrus, leather, or parchment is tightly wound. The message is written down the length of the staff in rows. The parchment is unwound leaving what appears to be nothing more than a series of disconnected letters. The secret key to deciphering the text is the circumference of the wood. If you use a scytale with the wrong circumference, the message is unusable. If someone else intercepts the message and has a piece of wood with the right circumference they are able to read the message. Figure 1 Scytale [Stallings] So the message the scytale is a transposition cipher becomes THESN EPCSS OICAS PCASP YTIHT RTEAA IRLNO Julius Caesar is reported to having developed a substitution cipher called the Caesar cipher. Each letter in the message is replaced with the letter that is three places further down the alphabet, looping back to the beginning of the alphabet when the end is reached. (Table 1). a b c d e f g h i j k l m n o p q r s t u v w X y z D E F G H I J K L M N O P Q R S T U V W X Y Z A B C Table 1 Caesar cipher table The message the caesar cipher is a substitution cipher becomes WKHFD HVDUF LSKHU LVDVX EVWLW XWLRQ FLSKH U Cryptanalysis was developed by the Arabs around the 8th century A.D. by Abu 'Abd al-rahman al-khalil ibn Ahmad ibn 'Amr ibn Tammam al Farahidi al-zadi al Yahmadi who solved a cryptogram in Greek for the Byzantine emperor and was the first to discover and write down the methods of cryptanalysis. Another Arab of the 9 th century, Abu Yusuf Ya'qub ibn Is-haq ibn as- Sabbah ibn 'omran ibn Ismail al-kindi wrote "A Manuscript on Deciphering Cryptographic Messages". In 1412, the Arabic knowledge of cryptology was fully described in the Subh al-a 'sha, a huge 14-volume encyclopedia, written by Shihab al-din abu 'l-abbas Ahmad ben Ali ben Ahmad Abd Allah al-qalqashandi [Higgs, pp.9-11]. During the Middle Ages in Europe, encryption was primarily restricted to the monks. " Around 1250 A.D., Roger Bacon, wrote the "Epistle on the Secret Works of Art and the Nullity of Magic which described seven deliberately vague methods of concealing a secret. Around 1392, - 2 -

Geoffrey Chaucer wrote six short passages in cipher in his "The Equatorie of the Planetis" notes to his "Treatise on the Astrolabe [Higgs, 12-13]. Early Cipher Machines By the 15 th century, both cryptography and cryptoanalysis were in widespread use throughout Europe, especially in diplomatic communications. Except for the scytale, all of the encryption techniques required manual computations typically aided by writing down the tables. In addition, all of the substitution algorithms were monoalphabetic where each letter was mapped to only one other letter. This was changed by Leon Battista Alberti (1404-1472) when he developed a cipher machine for mechanical encryption [Fig. 2]. The machine is based on the Caesar cipher algorithm. During the 1460's, while walking through the gardens of the Vatican, Leon Alberti had a casual conversation about cryptography with the pontifical secretary, Leonardo Dato. Alberti developed and published the first polyalphabetic cipher and designed a cipher disk to simplify the process. Cryptography historian David Kahn titles him the "Father of Western Cryptography", pointing to three significant advances in the field which can be attributed to Alberti: "the earliest Western exposition of cryptanalysis, the invention of polyalphabetic substitution, and the invention of enciphered code" [Wikpedia]. Alberti described his invention: Fig. 2 Alberti cipher disk [Higgs, 17] "I make two circles out of copper plates. One, the larger, is called stationary, the smaller is called movable. The diameter of the stationary plate is one-ninth greater than that of the movable plate. I divide the circumference of each circle into 24 equal parts [called] cells. In the various cells of the larger circle I write the capital letters, one at a time in red, in the usual order of the letters [whilst those around the movable circle are] not in regular order like the stationary characters, but scattered at random. [I then] place the smaller circle upon the larger so that a needle driven through the centres of both may serve as the axis of both and the movable plate may be revolved around it." (Alberti, "Trattati in Cifra", 1470, cited in Kahn, 1996, pp127-128.) - 3 -

Alberti then explained how he introduced "polyalphabetic substitution cipher" using his cipher disk: "After writing three or four words, I shall change the position of the index in our formula by turning the circle, so that the index k may be, say, under D [] and all the other stationary letters [] will receive new meanings." (Alberti, "Trattati in Cifra", 1470, cited in Kahn, 1996, pp128-129.) In 1586, Blaise de Vigenère (1523-1596) wrote a book on ciphers that described the Vigenère polyalphabetic algorithm. This method uses different monoalphabetic encryptions selected from a Vigenère square (Table 2) using a keyword. The keyword and Vigenère are shared between the sender and receiver of the encrypted message. Without the keyword you cannot define which cipher character belongs to the according plaintext character. You can use any agreed upon keyword you want. For demonstrating the encryption method we choose the keyword "cipher" and use it with the plaintext we want to encrypt. Keyword: CIPHERCIPHE Plaintext: encrypt this! Ciphertext: GVRYC GVBWP W For getting this result you need to find the ciphertext letter in the matrix according to the x-axis (e) and the y-axis (C). The result is obviously G. a b c d e f g h i j k l m n o p q r s t u v w x y z A B C D E F G H I J K L M N O P Q R S T U V W X Y Z B C D E F G H I J K L M N O P Q R S T U V W X Y Z A C D E F G H I J K L M N O P Q R S T U V W X Y Z A B D E F G H I J K L M N O P Q R S T U V W X Y Z A B C E F G H I J K L M N O P Q R S T U V W X Y Z A B C D F G H I J K L M N O P Q R S T U V W X Y Z A B C D E G H I J K L M N O P Q R S T U V W X Y Z A B C D E F H I J K L M N O P Q R S T U V W X Y Z A B C D E F G I J K L M N O P Q R S T U V W X Y Z A B C D E F G H J K L M N O P Q R S T U V W X Y Z A B C D E F G H I K L M N O P Q R S T U V W X Y Z A B C D E F G H I J L M N O P Q R S T U V W X Y Z A B C D E F G H I J K M N O P Q R S T U V W X Y Z A B C D E F G H I J K L N O P Q R S T U V W X Y Z A B C D E F G H I J K L M O P Q R S T U V W X Y Z A B C D E F G H I J K L M N P Q R S T U V W X Y Z A B C D E F G H I J K L M N O Q R S T U V W X Y Z A B C D E F G H I J K L M N O P R S T U V W X Y Z A B C D E F G H I J K L M N O P Q S T U V W X Y Z A B C D E F G H I J K L M N O P Q R T U V W X Y Z A B C D E F G H I J K L M N O P Q R S U V W X Y Z A B C D E F G H I J K L M N O P Q R S T V W X Y Z A B C D E F G H I J K L M N O P Q R S T U W X Y Z A B C D E F G H I J K L M N O P Q R S T U V X Y Z A B C D E F G H I J K L M N O P Q R S T U V W Y Z A B C D E F G H I J K L M N O P Q R S T U V W X Z A B C D E F G H I J K L M N O P Q R S T U V W X Y Table 2 - Vigenère square - 4 -

In the late-1790s, Thomas Jefferson built a polyalphabetic substitution wheel cipher machine [Fig. 3]. The wheel consists of 26 wooden disks threaded onto a spindle. Each disk can be turned separately and contains a scrambled alphabet inscribed on it. To encrypt a message, you would line up all of the letters of the plaintext message. Then select one of the other rows of letters and copy that as the encrypted message. The recipient of the encrypted message would need a similar device. The recipient would line up all of the letters of the encrypted message and then look for a row that has meaningful words in it. The major disadvantage to the wheel cipher machine is that a copy of the machine has to be distributed to everyone who will be receiving messages. Ironically, a French cryptologist devised a similar device in 1890, and the U.S. Army introduced an electrical version prior to World War I that was used until the early 1940s. Figure 3 Jefferson Cylinder The Wheatstone Cryptograph (Fig. 4), originally invented by Wadsworth in 1817, but developed by Wheatstone in 1860's, comprised two concentric wheels with two hands. When the larger hand pointed to the plaintext letter, the smaller hand would point to its cipher equivalent. Because of the way the gears were arranged, the smaller hand would change after each letter was encrypted. This was used to generate a polyalphabetic cipher. Figure 3 Wheatstone Cryptograph [Stallings] - 5 -

In the 19th century, the public became familiar with cryptography through literature. Jules Verne's refers to the decipherment of a parchment filled with runic characters in the Journey to the Center of the Earth. Sir Arthur Conan Doyle's detective, Sherlock Holmes, was an expert in cryptography. The Adventure of the Dancing Men, involves a cipher consisting of stick men, each representing a distinct letter. Edgar Allan Poe issued a challenge to the readers of Philadelphia's Alexander Weekly Messenger, claiming that he could decipher any monoalphabetic substitution cipher. He successfully deciphered all of the hundreds of submissions. In 1843, he wrote a short story, "The Gold Bug". This is one of the finest piece of fictional literature on the subject of cryptography. [Higgs, pp. 31-32] Rotor Cipher Machines During the first half of the 20th century, the most popular type of cipher machine was the rotor machine which was used for both encryption and decryption. Rotor machines are electromechanical devices consisting of a set of rotating disks with electrical contacts on both sides called rotors. [Fig. 4] The wiring between the contacts implements a fixed substitution of the letters. After encrypting each letter, the rotors change the substitution by their positions. This implements a complex polyalphabetic substitution cipher. [Answers, pg. 1] Figure 4 Rotors The first rotor machine was built in 1915 by two Dutch naval officers, Theo A. van Hengel and R. P.C. Spengler (de Leeuw). A number of inventors independently developed similar rotor machines around the same time. In the U.S., Edward Hebern built a single rotor machine in 1917 for use by the U.S. Navy. Other early rotor machine inventors were the Dutchman Hugo Koch and the Swede Arvid Gerhard Damm. Most of the rotor machines used a typewriter-like - 6 -

keyboard for input and lighted letters for the output. Some of the later devices used punched card and paper tape for input and/or output. The most famous example of a rotor machine is the Enigma machine [Fig. 5]. Figure 5 Naval Enigma Machine The Enigma machine was designed by Arthur Scherbius (20 October 1878 13 May 1929). Scherbius was a German electrical engineer who patented an invention for a mechanical cipher machine, later sold as the Enigma machine. Scherbius worked for several electrical firms in Germany and Switzerland. In 1918, he founded the firm of Scherbius & Ritter and applied for a patent for a cipher machine. He began to market the Enigma cypher machine for commercial use. Scherbius' company also purchased the rights to another patent for a rotor machine from Hugo Koch. There were several commercial models, and one of them was adopted by the German Navy (in a modified version) in 1926. Other branches of the German military adopted the same machine (also in a modified version somewhat different than the Navy's) a few years later. The Enigma cipher machine was used extensively during WW2 by the German military to keep their communications secret. The standard Enigma machine has three interchangeable rotors geared together. Later machines added two additional rotors for a total of five to select the three working rotors from. Each rotor had 26 letters, so there were possible 26 x 26 x 26 combinations of letters. The rotors were designed so that after the first rotor turned through the 26 letters, it would turn the middle rotor. After the middle rotor turned through its 26 positions, it would then turn the third rotor. This provided for 17576 combinations for each letter. Selecting three rotors from five possible rotors provided another 60 combinations for a total of 1054560 combinations. The Enigma designed for the German Navy had four working rotors. An additional feature called a Steckerverbindungen - 7 -

(plug-board) was introduced in 1928. The Stecker (similar to a telephonist s switchboard) was added between the keyboard and the first rotor. Initially the Stecker allowed six pairs of letters to be swapped. This was later expanded to 10 pairs. This increased the number of possible settings (keys) to 159,000,000,000,000,000,000 (159 million million million). If you don't know the Enigma setting, the message is virtually indecipherable. Scherbius calculated that if 1,000 cryptographers, each with a captured Enigma, tested 4 keys/minute, all day, every day, it would take 1.8 billion years to try them all. [Higgs, pg. 42] The Enigma included a feature called a reflector. The Enigma was designed so that the signal was reflected back through the disks before going to the lamps. This feature was designed to allow the Enigma to be symmetrical, so that encrypting the encrypted message again returns the message to the original plain text message. If you know the machine s settings, you can type the ciphertext back in and it will unscramble the message back to the original plaintext. The reflector was unique to the Enigma and introduced a flaw in the encryption. No letter could be enciphered as itself. This feature was instrumental in allowing the British to break the cipher. The Enigma was designed to be easy in enciphering, sending, receiving, and deciphering messages. Enigma operators were provided a codebook each month that specified the key for the day. The key for the day consisted of the rotors to be used, the rotor settings and the plugboard settings. For example the key might be: a) Use rotors 2-4-3 b) Set the rotors to V-F-P c) Use plugboard settings B/T D/G I/R - P/Y S/V W/Z Each day the operator would implement these settings by inserting the designated rotors in the order specified, spinning the rotors to line up the settings, and connect the letters together specified in the plugboard settings. Since all of the hundreds or thousands of messages were sent using the same daily key, each message was assigned a random key. This message key was transmitted twice prior to the message being transmitted. For example if the day key is V-F-P, the operator might pick a message key of WAS. Using the day key to encrypt the message key, the operator would then transmit WAS WAS followed by the message. The receiving operator would set his Enigma machine to VFP and receive the message key. After seeing that the message key is WAS, he would then reset the rotors to WAS for this message. After receiving the message, the rotors would be reset to the day key in preparation for receiving the next message key. Note that the day key was only used to transmit the message key. The German authorities believed the codes generated by the Enigma were unbreakable. However, with the help of Polish mathematicians who had managed to acquire a machine prior to the outbreak of WW2, British code breakers stationed at Bletchley Park managed to exploit weaknesses in the machine that led to the cracking of the Enigma code. Breaking the Enigma ciphers gave the Allies a key advantage. According to historians, this shortened the war by six months to two years and saved many lives. - 8 -

Cracking the Enigma machine was not a result of flaws in Scherbius s design, but rather a combination of fortuitous events and flaws in the implementation. Three Polish mathematicians, Marian Rejewski, Henryk Zigalski, and Jerzy Rozycki, were able to reduce the problem of cracking the enigma code significantly by concentrating on the rotor settings exploiting the fact that the message key was transmitted twice. This was facilitated by being provided the design of the Enigma machine from a disgruntled German civil servant, Hans-Thilo Schmidt. Rejewski and his team then developed a machine called a bombe that simulated the working of six Enigma machines working in unison to try and determine the daily key. In the early part of 1939, the Polish General Staff decided to share their knowledge of the Enigma machine with the British and French. To facilitate working on cracking the Enigma codes, the British Government Code and Cipher School (GC&CS) opened a secret site at Bletchley Park to locate the large number of codebreakers needed to decipher the German and Italian codes. The team of codebreakers was led by mathematicians, Alan Turing and Gordon Welchman, who took the Polish concept of the bombe and expanded it. Turing and Welchman s bombe [Figs. 6&7] consisted of twelve sets of electrically linked Enigma scramblers. Figure 6 Bombe - 9 -

Figure 7 Inside the Bombe Looking through the material that had been decrypted at Bletchley, Turing was able to recognize that many of the messages consistently used the same words and phrases often in the same part of the message. For example, the Germans sent a regular enciphered weather report shortly after 6 a.m. every day. An encrypted message received shortly after 6 would almost certainly contain the German word for weather, wetter. This piece of plaintext associated with a piece of ciphertext is known as a crib and can be used with the bombe in determining the message key. These cribs were instrumental in cracking the Enigma code. Other implementation flaws that were to aid the Bletchley team included the previously mentioned repetition of the message key. Knowing that plaintext is repeated and its location provides clues that can be exploited in the cracking of the cipher. As mentioned earlier, by design the reflector prevented a plaintext letter from enciphering to the same letter. To ensure that the operators did not get complacent, the German military insisted that the arrangement of the rotors could not be repeated during the month. This allowed Turing s team to eliminate half of the rotor arrangements when trying to determine the key for the day. Over the duration of the war, there were over 400 bombes built for use at Bletchley Park. The Enigma machine was designed to be portable so that it could be used in the field. The Germans designed a more complex cipher machine called the Lorenz [Fig. 8] to be used exclusively for the most important messages passed between the German Army Field marshals and their Central High Command in Berlin. Its size meant that it was not a portable device like Enigma. - 10 -

Figure 8 the Lorenz machine The Lorenz used the International Teleprinter Code, in which each letter of the alphabet is represented by a series of five electrical impulses. Messages were enciphered by adding, character by character, a series of apparently randomly generated letters (key) to the original text. To decrypt the enciphered message, the key was generated by Lorenz s 12 rotors, five of which followed a regular pattern, while another five followed a pattern dictated by two pin wheels used for deception with the last two rotors used for control. Cracking the Lorenz relied on determining the starting position of the Lorenz machine s rotors. In 1941 John Tiltman, the great cryptanalyst, broke the first Lorenz messages at Bletchley using hand-methods that relied on statistical analysis. By 1944 the Germans had introduced complications which made it virtually impossible to break the Lorenz by hand alone. Dr Max Newman and his team were assigned the task of building a machine to break the Lorenz encryption. The first machine designed to break the Lorenz was built at the Post Office research department at Dollis Hill and called Heath Robinson after the cartoonist designer of fantastic machines. Although Heath Robinson worked well enough to show that Max Newman s concepts were correct, it was slow and unreliable. Upon the recommendation of Alan Turing, Max Newman enlisted the help of a brilliant Post Office Electronics Engineer, Tommy Flowers. Flowers and his team designed and built Colossus, a much faster and more reliable machine that used 1,500 thermionic valves (vacuum tubes). The first Colossus machine arrived at Bletchley in December 1943. This was the world s first practical electronic digital information processing machine a forerunner of today s computers. Colossus could read paper tape at 6,000 characters per second and the paper tape in its wheels traveled at 30 miles per hour. This meant that the huge amount of mathematical work - 11 -

that needed to be done could be carried out in hours, rather than weeks. Mark I Colossus was upgraded to a Mark II in June 1944. It was working in time for the Allies to be sure that Hitler had swallowed the deception campaigns prior to D-Day on June 6th 1944. There were eventually 10 working Colossus machines at Bletchely Park, all but two were destroyed immediately after the war with the remaining two being sent to GC&CS. Conclusions The paramount requirement for all cryptosystems is reliability. This means that cryptosystems must be decipherable without ambiguity, without delay, and without error secondary requirements are security and rapidity. [Kahn, pg. 453] Cipher machines are designed to provide the reliability along with rapidity and the hope for enhanced security. Encryption has become an important part of our society today as we take for granted that our financial and personal transactions on the Internet are secure. Dedicated cipher machines have become less important today with the emergence of modern, multi-purpose computers. Ironically, the development of today s computers is a direct result of the work done at Bletchley Park in breaking the cipher machines used by the Axis Powers in World War II. These factors provided the impetus behind the development at Bletchley Park of a remarkable range of deductive techniques aimed at finding the daily Enigma and Lorenz settings, and analytical machines whose task was to speed up the task of code breaking. The latter comprised the use of Hollerith machines, in use by business and governments since the 1890s and particularly valued in the breaking of Naval Enigma, the development from late 1939 under Turing and Welchman (and the engineering team headed by Harold (Doc) Keen) of the electromechanical bombe machines and from 1942 of the valve-powered Robinson and Colossus machines under Max Newman and Tommy Flowers of the Post Office, designed to speed the decryption of the Lorenz code (codenamed Fish). Colossus II, delivered in June 1944, vies with the US Ordnance Department s ENIAC machine, developed in part to project trajectories and calculations for the atomic bomb but not completed until 1946, for the distinction of being the world s first programmable electronic computer. [National and International Value of Bletchley Park] References Alan Turing Homepage, (last viewed 14 July 2005), http://www.turing.org.uk/turing/ Alberti Cipher Wheel, (last viewed 14 July 2005), http://library.thinkquest.org/04oct/00451/alberti.htm Alberti from Wikpedia encyclopedia, (last viewed 14 July 2005), http://en.wikipedia.org/wiki/leone_battista_alberti Codes and Ciphers in History, Part 1 - To 1852, (last viewed 14 July 2005), http://www.smithsrisca.demon.co.uk/crypto-ancient.html Copeland, B. Jack (ed), The Essential Turing, (Oxford: Oxford University Press, 2004). De Leeuw, Karl, The Dutch invention of the rotor machine, 1915 1923. Crytpologia, 27, 2003, pp. 73-94. - 12 -

English Heritage Bletchley Park, (last viewed 14 July 2005), http://www.englishheritage.org.uk/bletchleypark Enigma cipher machine, (last viewed 14 July 2005), http://www.codesandciphers.org.uk/enigma/index.htm Enigma machine, (last viewed 14 July 2005), http://encycl.opentopia.com/term/enigma_machine Enigma Story, (last viewed 14 July 2005), http://www.zetleins.onau.net/reviews/worldfaceoff/worldtimer_faceoff.htm ENIGMA CIPHER MACHINES, FIALKA, NEMA, OTHER CIPHER MACHINES, ANTIQUE COMPUTERS AND CALCULATORS, (last viewed 14 July 2005), http://www.chss.montclair.edu/~pererat/mcpu.htm From Bombe stops to Enigma keys, (last viewed 14 July 2005), http://www.bletchleypark.org.uk/upload/bombestops.pdf Higgs, Bryan J. (last viewed 14 July 2005), Cryptography Through The Ages http://www.rivier.edu/departments/mathcs/ Resources/LectureSeries/CryptographyThroughTheAges.ppt History of Encryption, (last viewed 14 July 2005), http://www.deathstar.ch/security/encryption/history/history.htm Hodges, Andrew, Alan Turing: The Enigma (London: Vintage, 1992). Kahn, David, The Codebreakers: The Story of Secret Writing (New York: Macmillan, 1967). Kallis, Jr., Stephen A., (last viewed 14 July 2005), Codes and Ciphers, http://www.otr.com/ciphers.html Jefferson's Wheel Cipher, (last viewed 14 July 2005), http://www.lewisclark.org/content/content-article.asp?articleid=2224 M-94, (last viewed 14 July 2005), http://encycl.opentopia.com/term/m-94 NATIONAL AND INTERNATIONAL VALUE of BLETCHLEY PARK, (last viewed 14 July 2005), http://www.englishheritage.org.uk/filestore/conserving/characterisation/pdf/values_paper_july_04.pdf NEMA Model 45 Cipher Machine, (last viewed 14 July 2005), http://www.snyderstreasures.com/pages/nema.htm Rotor machine, (last viewed 14 July 2005), http://www.answers.com/topic/rotor-machine SigABA, (last viewed 14 July 2005), http://encycl.opentopia.com/term/sigaba Singh, Simon(1999), The Code Book. Doubleday. Stallings, William (last viewed 14 July 2005), Classical Cryptography http://williamstallings.com/extras/security-notes/lectures/classical.html Typex, (last viewed 14 July 2005), http://en.wikipedia.org/wiki/typex Virtual U.S. Army Cipher Device, Model M-94, (last viewed 14 July 2005), http://members.aon.at/cipherclerk/virtualm94.html WWII Codes and Ciphers: http://www.codesandciphers.org.uk/ - 13 -