The Mathematics Behind

Slides:



Advertisements
Similar presentations
Origin and Nature of the Allied Cryptographic Advantage During World War II By Grant Musick.
Advertisements

Ciphers and Permutations. Monoalphabetic Cipher is simply a permutation abcdefghijklmnopqrstuvwxyz SATBUCVDWEXFYGZRQPONMLKJIH Cycle Form (ASOZHDB) (CTNGVLF)
1 Codes, Ciphers, and Cryptography-Ch 3.2 Michael A. Karls Ball State University.
Code Breaking during the Second World War An Introduction By Gary J Becea.
The History and Technology of the Enigma Cipher Machine The History and Technology of the Enigma Cipher Machine Ralph Simpson
Team Name: team13 Programmer: 陳則凱 b Tester: 劉典恆 b
Solving the Enigma How the Western Allies Cracked the German Secret Codes During WW II.
Enigma? Several Images from Wikipedia (an online encyclopedia)
Enigma Meghan Emilio Faculty Sponsor: Ralph Morelli (Computer Science)
Chris Christensen Department of Mathematics and Statistics Northern Kentucky University.
Modern Cryptography.
J. Lyons accounting office Analytical Calculation  Reduce a problem to a 2 nd and then a 3 rd  Application of rules and procedures  Problem is.
Inner Workings of the German Enigma. History of the Enigma The concept was invented by a German named Albert Scherbius in 1918 Scherbius tried to take.
A Glimpse of the History of Cryptography
Purple 1 Purple Purple 2 Purple  Used by Japanese government o Diplomatic communications o Named for color of binder cryptanalysts used o Other Japanese.
James Tam The history of computers and computing: Part II The computers of the 20 th century and the people behind those machines.
Enigma Meghan Emilio Advisor: Professor Ralph Morelli April 2004.
Enigma 1 Enigma Enigma 2 Enigma  Developed and patented (in 1918) by Arthur Scherbius  Many variations on basic design  Eventually adopted by Germany.
Computing in the Modern World Ms. Stewart
U-Boats were undersea boats that attacked allied ships. The U-Boat.
Encryption Presentation Jamie Roberts. Encryption Defined: n The process of converting messages, information, or data into a form unreadable by anyone.
Alan Turing Presented By: Tyler Romero CSCE Spring 2014.
Alan Turing and Code Breaking
a connection between language and mathematics
David Evans CS200: Computer Science University of Virginia Computer Science Lecture 12: Decrypting Work Circle Fractal.
Future Computers.
Famous Firsts in Computation MSE 2400 Evolution & Learning
Cryptology By Greg Buss Pat Shields Barry Burke. What is Cryptology? Cryptology is the study of “secret writing.” Modern cryptology combines the studies.
The Turing machine Olena Lastivka. Definition Turing machine is a theoretical device that manipulates symbols on a strip of tape according to a table.
Team Name: team13 Programmer: 陳則凱 b Tester: 劉典恆 b
COMPUTERS. Computers are penetrating all spheres of human activity, in many of them they have become indispensible. They calculate orbits, guide spaceships.
ENCRYPTION Alex Piercey Erica Reid. What is Encryption?  Information secured to hide from the public  Used in many different ways but is mostly used.
Encryption: A Brief History Author: Margery Waldron.
1.History of a remarkable Man Call “Alan Turing”. 2.Study Life. 3.Work life during the world war 2 period. 4.His achievement after the world war. 5.His.
1 Chapter 2-1 Conventional Encryption Message Confidentiality.
Produced in conjunction with Tom Briggs, Education and Outreach Officer at Bletchley Park.
1 A+ Certification PC Maintenance and Troubleshooting Chapter 1 Introduction (history of computers )
National Institute of Science & Technology Cryptology and Its Applications Akshat Mathur [1] Cryptology and Its Applications Presented By AKSHAT MATHUR.
An Introduction to Cryptography. What is cryptography? noun \krip- ˈ tä-grə-fē\ : the process of writing or reading secret messages or codes “Encryption”:
CSCI 5857: Encoding and Encryption
WNA Physics. Experiment 1.1  Obtain one battery, one bulb, and one wire. Connect these in as many ways as you can. Sketch each arrangement in your notebook.
Enigma Plymstock School History Department. The Battle of the Atlantic The Battle of the Atlantic Since the evacuation of the British Army from the beaches.
Unit 3 Day 4. Warm-Up 1.Write the Now/Next Function Rule for3, -9, 27, -81, … 2.Write the Input/Output Function Rule for the table to the right: 3.In.
Alan M. Turing ( ) A Natalie Cluck Presentation.
© A+ Computer Science - Codes and ciphers have existed for hundreds of years. People have always had the need to hide secrets.
WWII - U-Boats A British convoy made it’s way from England to Nova Scotia because, it needed to protect supply ships from the ever present threat of German.
Encryption of WWII Philip Gebhardt 10/24/2011. Interest.
The Storyboard stage. Mention what will be your animation medium: 2D or 3D Mention the software to be used for animation development: JAVA, Flash, Blender,
“IT IS A RIDDLE, WRAPPED IN A MYSTERY, INSIDE AN ENIGMA” * By: Michaela Wontroba Mr Kuniega; PD 5,6,7.
CS 150 – Computing: From Ada to the Web Cryptography.
The cracking of Enigma in World War II John Bibb Harry Caplan Abhishek Chhikara Vladimir Grantcharov Aditi Kulkarni Nigel Lawrence Andrew Muldowney Hou.
The Enigma Machine Eric Roberts CS 106A February 3, 2016.
Museum Entrance Enigma Code Breaking Enigma SIGABA Native American Code Talkers Welcome to the Museum of WW2 Codes Curator ’ s Offices Back Room Actions.
By, Amanda Rydzynski O’Brien Computer Skills
Chris Christensen Department of Mathematics and Statistics Northern Kentucky University.
Code- and cipher-breaking have been in operation for centuries. However, cryptanalysis – the art of deciphering encoded messages – took on a new importance.
Warm Up 1) Solve: -2(x + 9) + 13 = -11 2) A triangle has side lengths of 5, 15, and 14. Is the triangle a right triangle? Why or Why not?
CS 154 Formal Languages and Computability April 5 Class Meeting Department of Computer Science San Jose State University Spring 2016 Instructor: Ron Mak.
Matt Salamone and Pete McIlwee
In this lesson we will understand:
History of Cryptography
Enigma Machine.
Rotor Ciphers.
Substitution Codes By Sarah Bonnell.
The Race to Crack the Enigma Machine
An electro-mechanical rotor cipher machine created by the German engineer Arthur Scherbius.
Enigma Cipher Machine By: Amber Churchwell.
The History and Technology of the Enigma Cipher Machine
The German Enigma Machine The Secret Battlefield of WW2
WORLD OF WONDERS : THE ENIGMA MACHINE
Presentation transcript:

The Mathematics Behind The Enigma Machine The Mathematics Behind

My project.. My EPQ project is based around the enigma machine from world war two. Not only did I look into the maths behind the machine but also: it’s detailed history Use during and after the war the mechanics of the machine itself how the code of the machine was finally broken in the 1940s From looking at the applications of Tommy Flowers’ work on decoding the machine, I also discussed the mathematics of computers that we use today, as his machine (Colossus) is described as the world’s first digital, programmable and electronic computer.

The enigma machine is an electro-mechanical rotor cipher machine which was used for the encryption of secret messages. It was originally invented by German inventor Arthur Scherbius near the end of world war one. Over the course of the next few decades, the machine was adopted by the military and governments of several countries, the most well known being that of the Nazi's during world war two. After world war two, Winston Churchill told king George VI that “it was thanks to Ultra that we won the war”. He also called the codebreakers “the geese that laid the golden eggs and never cackled”. Allied commander general Dwight d. Eisenhower wrote to the head of mi6, passing on his “heartfelt admiration and sincere thanks for the magnificent services” which “saved thousands of British and American lives” The work at Bletchley park on decoding the wartime messages was so secret that there was a lifetime ban on members disclosing information on their work. The enigma machine..

A brief timeline.. the earliest commercial models appeared in the 1920s. The first branch of the military to adopt the use of the machine was the German navy in 1926 using 29 letters: A-Z, Ä, Ö and Ü. The decoding of the machines began in 1931 when German Hans Thilo Schmidt turned to a life of espionage with the French. Marian Rejewski was the first person to break Enigma in 1932, aged just 27. It took 8 years after this time for the first wartime enigma encoded message to be deciphered (by British mathematician Peter Twinn) in January 1940. By April 1940, encoded messages were being deciphered and read within 24 hours of interception thanks to the work of Alan Turing. By 1945, nearly all German Enigma messages were being read but the German military still believed that the system was secure.

The enigma machine has a standard mechanical layout which – over the duration of World War Two – was altered in order for messages to become harder to decode. When the letter on the keyboard was pressed, an electric current passed through the machine through a series of scrambling elements: a plugboard three wheel rotors a reflector end disc Once the current had passed through the machine, a corresponding light bulb lit up on the light board. The mechanics.. Reflector Rotors Entry disc lightboard keyboard plugboard

The mechanics.. In this diagram’s example, “w” is pressed on the machine’s keyboard. But – according to the plugboard – socket “w” is plugged to socket “x” so current flows up to the entry disc (E) at point X. The current then passes through the internal wiring in the rotors.. ..To the reflector. At the reflector, the current is turned round and flows back through the rotors (but in a different order).. ..now emerging at entry disc terminal “h”. This “h” terminal is connected to socket “h” on the plugboard but according to the plugboard this socket is connected to socket “I”. Finally, the current flows from socket “I” to lamp “I” which lights up. So, in this example, when the letter “W” is pressed, it is enciphered to “I”. Reflector Rotors Entry Disc Keyboard Plugboard Lightboard

On the right side of every wheel were 26 pins – current entry points - and each left side with corresponding 26 contact plates – current exit points. Adjacent pins & plates on neighbouring wheels touched, allowing the current to flow through (from both right to left and left to right). Within every wheel were 26 wires which connected the 26 entry points with the 26 exit points; however, each pin was connected to a differing plate, i.e. The “a” pin was connected to the “I” plate. At the reflector wheel (the umkehrwalze), The current was ‘bounced back’ then re- passing through the wheels in reverse order. The mechanics.. entry points wires exit Wheel #1 an example of internal wirings within wheel #1 Connections between adjacent wheels an example of internal wirings within wheel #2 (each wiring is different to the first wheel’s) entry points wires exit Wheel #2

The mathematics.. All three wheel rotors were chosen from a range of three, the maximum possible ways of positioning all 3 rotors in the 3 slots available is 6: 3 x 2 x 1 = 6 There was a choice of 26 positions from which each wheel could start from so the total number of possible ways of setting the starting position of each rotor is: 26 x 26 x 26 = 17,576 Each time a letter on the keyboard was pressed the first rotor turned by one place and once it had done a full turn of 26 turns, the rotor to it’s left would turn one place (this then also happened for the third rotor also). the point from which the first rotor would turn the second rotor could be changed, as could the position from which the middle rotor would turn the last. 26 x 26 = 676

The plugboard's job was to connect a letter that was pressed on the keyboard to another letter value from which the internal current would flow from and with 26 letters to connect there is a maximum connection number of: 26! = 26 x 25 x 24 x...x 2 x 1 = 403,291,461,126,605,635,584,000,000 403 septillion However, this system leads to a “redundancy”, i.e.: (AB, CD) = (CD, AB) (AC, BD) = (BD, AC) (AD, BC) = (BC, AD) So, by dividing the entire equation used for calculating the total number of connections achievable by two , you allow for this redundancy, meaning that the equation becomes (for a generalised formula where there are k wires between 26 letters is: The mathematics..

The mathematics.. Where the k values between 1 and 13 are: 1 pair 325 2 pairs 44,850 3 pairs 3,453,450 4 pairs 164,038,875 5 pairs 5,019,589,575 6 pairs 100,391,791,500 7 pairs 1,305,093,289,500 8 pairs 10,767,019,638,375 9 pairs 58,835,098,191,875 10 pairs 150,738,274,937,250 11 pairs 205,552,193,096,250 12 pairs 102,776,096,548,125 13 pairs 7,905,853,580,625 So, for the enigma machine which only pairs 20 letters (leaving the remaining 6 unpaired) into 10 pairs, there is a k value of: 150,738,274,937,250 150 trillion A vast drop from the initial value of: 403 septillion  26!

The mathematics.. So, The number of permutations for the enigma machine in total is: 6 x 17,576 = 105,456 105,456 x 150,738,274,937,250 = 15,896,255,521,782,636,000 = 15 quintillion = 1.5 x 1018 However, in 1938, an additional two wheel options were introduced, increasing the total value from 6 to 60: 5 x 4 x 3 = 60 This continues to increase the overall number of combinations to 158 trillion as: 60 x 17,576 = 1,054,560 ∴ 1,054,560 x 150,738,274,937,250 = 158,962,555,217,826,360,000 So the new total (updated) value for the machine is 158 quintillion (or 1.58 x 1018) 

Later, When the German Navy added 6th, 7th and 8th wheels to the available options and made an enigma machine which used four rotors, the new overall value became: (8 x 7 x 6 x 5) x 264 x 263 x 150,738,274,937,250 = 2.033978034 x 1027 2 octillion. In 1933, the enigma II was being used, an eight-rotor model, with the overall number of permutations for this machine being: 8! X 268 x 267 x 150,738,274,937,250 = 1.019399189 x 1040 10 Duodecillion However, this machine was soon withdrawn because it was unreliable and tended to jam frequently. The mathematics..

In order for the deciphering of the machines to occur, some settings needed to be known about the enigma machine being used on any one day, including: The choice of rotors being used and their positions within the machine Rotor starting positions The message key Plugboard wirings The bombe machine (invented in 1939 by Alan Turing) could calculate all of these daily settings. Manual methods were then used to try and complete the entire decryption process the purpose of the bombe machine was to simply reduce the assumptions of wheel orders and scrambling positions to manageable numbers (i.e. from trillions to hundreds). The main reasons as to why enigma was broken are due to operator mistakes, captured information & hardware as well as flaws in procedures; not the machine itself, which is why the bombe could work so well. The code breaking..

Thank you for listening – any questions? The end..