The Enigma Machine Eric Roberts CS 106A February 3, 2016.

Slides:



Advertisements
Similar presentations
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesThe Mighty Mod.
Advertisements

Cryptography encryption authentication digital signatures
Using Cryptography to Secure Information. Overview Introduction to Cryptography Using Symmetric Encryption Using Hash Functions Using Public Key Encryption.
Classical Encryption Techniques Week 6-wend. One-Time Pad if a truly random key as long as the message is used, the cipher will be secure called a One-Time.
Ciphers and Permutations. Monoalphabetic Cipher is simply a permutation abcdefghijklmnopqrstuvwxyz SATBUCVDWEXFYGZRQPONMLKJIH Cycle Form (ASOZHDB) (CTNGVLF)
Cryptology Making & Breaking Codes & Ciphers. AJ 1152 Cryptology Cryptography –Science of creating codes or ciphers Cryptanalysis –Science of breaking.
Code Breaking during the Second World War An Introduction By Gary J Becea.
Cryptology  Terminology  plaintext - text that is not encrypted.  ciphertext - the output of the encryption process.  key - the information required.
Team Name: team13 Programmer: 陳則凱 b Tester: 劉典恆 b

A Presentation by: ~Ksenia Potapov ~Amariah Condon ~Janette Fong ~Janice Lau CRYPTOGRAPHY.
Solving the Enigma How the Western Allies Cracked the German Secret Codes During WW II.
David Evans CS588: Security and Privacy University of Virginia Computer Science Lecture 4: Captain Ridley’s Shooting Party.
Enigma? Several Images from Wikipedia (an online encyclopedia)
Enigma Meghan Emilio Faculty Sponsor: Ralph Morelli (Computer Science)
Modern Cryptography.
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.
String Processing Eric Roberts CS 106A February 3, 2010.
National Security and Cryptography Jude Vanover and Justin Gross.
A Glimpse of the History of Cryptography
Cryptography CS-103 Chapter 8. History Humans have been devising systems to encode information for at least 4000 years.Humans have been devising systems.
Introduction to Symmetric Block Cipher Jing Deng Based on Prof. Rick Han’s Lecture Slides Dr. Andreas Steffen’s Security Tutorial.
CS426Fall 2010/Lecture 21 Computer Security CS 426 Lecture 2 Cryptography: Terminology & Classic Ciphers.
Lecture 1 Overview.
Enigma Meghan Emilio Advisor: Professor Ralph Morelli April 2004.
What is Cryptography? Definition: The science or study of the techniques of secret writing, esp. code and cipher systems, methods, and the like Google.
CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.
Enigma 1 Enigma Enigma 2 Enigma  Developed and patented (in 1918) by Arthur Scherbius  Many variations on basic design  Eventually adopted by Germany.
Chapter 13: Electronic Commerce and Information Security Invitation to Computer Science, C++ Version, Fourth Edition SP09: Contains security section (13.4)
Cryptography Introduction, continued. Sufficient key space principle If an encryption scheme has a key space that is too small, then it will be vulnerable.
ENCRYPTION Jo Cromwell Cornelia Bradford. History of Encryption Encryption has been around since antiquity Cryptography began around 2,000 B.C in Egypt.
Classical Encryption Techniques
Chapter 8.  Cryptography is the science of keeping information secure in terms of confidentiality and integrity.  Cryptography is also referred to as.
IntroConcAnalysisPreviousSystemsRotors
History and Background Part 1: Basic Concepts and Monoalphabetic Substitution CSCI 5857: Encoding and Encryption.
Lecture 2 Overview.
Alan Turing and Code Breaking
CS110: Computers and the Internet Encryption and Certificates.
David Evans CS200: Computer Science University of Virginia Computer Science Lecture 12: Decrypting Work Circle Fractal.
Hill Cipher Developed by the mathematician Lester Hill in The encryption algorithm takes m successive plain text and substitute for them m cipher.
Team Name: team13 Programmer: 陳則凱 b Tester: 劉典恆 b
Cryptography By, Anthony Lonigro & Valentine Mbah.
Day 18. Concepts Plaintext: the original message Ciphertext: the transformed message Encryption: transformation of plaintext into ciphertext Decryption:
Module :MA3036NI Cryptography and Number Theory Lecture Week 3 Symmetric Encryption-2.
Terminology and classical Cryptology
CSCI 5857: Encoding and Encryption
Computer Security Cryptography. Cryptography Now and Before  In the past – mainly used for confidentiality  Today –Still used for confidentiality –Data.
Data Security and Encryption (CSE348) 1. Lecture # 3 2.
David Evans CS551: Security and Privacy University of Virginia Computer Science Lecture 3: Striving for Confusion Structures.
CRYPTOLOGY IN WWII ByJOE&SEAN. SIGABA SIGABA was similar to the Enigma in basic theory A series of rotors enciphered every character of the plaintext.
+ Security. + What is network security? confidentiality: only sender, intended receiver should “understand” message contents sender encrypts message receiver.
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,
Encryption CS110: Computer Science and the Internet.
Encryption Basics Module 7 Section 2. History of Encryption Secret - NSA National Security Agency –has powerful computers - break codes –monitors all.
“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.
Invitation to Computer Science 5 th Edition Chapter 8 Information Security.
Turing’s Bombes. Solve Enigma using known plaintext Depending on German patterns, e.g. weather reports Sometimes setup by seeding/farming Depended on.
The cracking of Enigma in World War II John Bibb Harry Caplan Abhishek Chhikara Vladimir Grantcharov Aditi Kulkarni Nigel Lawrence Andrew Muldowney Hou.
The Mathematics Behind
CIT 380: Securing Computer Systems
Eric Roberts and Jerry Cain
History and Background Part 3: Polyalphabetic Ciphers
Enigma Machine.
Rotor Ciphers.
slides courtesy of Eric Roberts
An electro-mechanical rotor cipher machine created by the German engineer Arthur Scherbius.
Modern Cryptography.
Presentation transcript:

The Enigma Machine Eric Roberts CS 106A February 3, 2016

Once upon a time...

Cryptography—Bletchley Park I’ve twice had the opportunity to teach cryptography at Stanford in Oxford, which made it possible to visit Bletchley Park—the home of the Government Code and Cipher School (GCCS), where the Enigma code was broken. Oxford Bletchley

Cryptography—Bletchley Park In our field trips to Bletchley Park, our tour was led by Jean Valentine, who worked with the Bombe decryption machine shown in these pictures.

The Enigma Machine

Overview of Assignment #4 Part 1: Check that a key is legal In a letter-substitution cipher, the key must be a permutation of the alphabet, which means that it contains all the letters of the alphabet in some order. Your job in Part 1 is to add code to check that the key entered in the LetterSubstitutionCipher program is legal, as in the following sample run: LetterSubstitutionCipher Letter-substitution cipher. Enter 26-letter key:SHORTKEY Plaintext:HAL 9000 Ciphertext: IBM 9000 That key is illegal. Enter 26-letter key:AABCDEFGHIJKLMNOPQRSTUVWXY That key is illegal. Enter 26-letter key:BCDEFGHIJKLMNOPQRSTUVWXYZA

Overview of Assignment #4 LZDRXPEAJYBQWFVIHCTGNOMKSU ABCDEFGHIJKLMNOPQRSTUVWXYZ |||||||||||||||||||||||||| HKRCGNTQPIXAWUVFLDYSZOMEJB RWA | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | | S | T | U | V | | X | Y | Z | Encryption key: Decryption key: Part 2: Invert a key In a letter-substitution cipher, the sender and receiver must use different keys, one for encryption and one for decryption. Your job in Part 2 is to write an invertKey method that determines the decryption key from the encryption key by going through the alphabet and, for each letter, figuring out what plaintext letter would have produced that letter in the ciphertext.

Overview of Assignment #4 Part 3: Simulate the Enigma Machine

The Enigma Rotors

The Enigma Structure

Operation of the Enigma Machine Whenever the operator types a letter key on the Enigma, the following things happen: 1.The force of the key press advances the fast rotor one position. If the indicator on the fast rotor wraps around from Z to A, that action “carries” to the medium rotor, just like the digits on an odometer. Similarly, if the medium rotor passes Z, the slow rotor advances one position. 2.An electrical signal is fed into the wire corresponding to the key, which then flows through seven letter-substitution steps: –Through the fast rotor from right to left. –Through the medium rotor from right to left. –Through the slow rotor from right to left. –Through the reflector, which turns the signal around. –Through the slow rotor from left to right. –Through the medium rotor from left to right. –Through the fast rotor from left to right and then on to the lamp.

Encoding the Letter “A”

The Next “A” Is Different

What Made Enigma Vulnerable? Early in the war, mathematicians working for the Polish Resistance were able to smuggle Enigma machines to France and England along with a strategy for breaking the code. The British government established a top-secret cryptography center at Bletchley Park and staffed it with the top British mathematicians. The decryption team at Bletchley was able to exploit the following facts about the Enigma machine: –The encoding is symmetrical. –The Enigma machine can never map a character into itself. The codebreakers were also helped by the fact that the Germans were both careless and overconfident. In believing they had an unbreakable encoding machine, they failed to take adequate measures to safeguard the integrity of their communications.

Breaking the Enigma Code The most common technique used at Bletchley Park was the known-plaintext attack, in which the codebreakers guess that a particular sequence of characters exists somewhere in the decoded message. A sequence of characters that you guess is part of the plaintext is called a crib. Breaking an Enigma message required the following steps: –Align the crib with the ciphertext to eliminate crashes in which a letter appears to map to itself. –Create a menu recording the links between letter pairs in the crib and ciphertext. –Identify loops in the menu at which a chain of letter pairs cycles back to the original letter. –Use the loops in the menu to create a wiring pattern for an electromechanical device called a Bombe that searches for settings of the Enigma rotors that produce the observed pattern.

Step 1: Align the Crib and Ciphertext UAENFVRLBZPWMEPMIHFSRJXFMJKWRAXQEZ KEINEBESONDERENEREIGNISSEKEINEBESONDERENEREIGNISSEKEINEBESONDERENEREIGNISSEKEINEBESONDERENEREIGNISSEKEINEBESONDERENEREIGNISSEKEINEBESONDERENEREIGNISSE No crashes exist in this alignment, so it is a feasible solution.

Step 2: Construct the Menu V K 0 R E 1 L I 2 B N 3 Z E 4 P B 5 W E 6 M S 7 E O 8 P N 9 M D 10 I E 11 H R 12 F E 13 S N 14 R E 15 J R 16 X E 17 F I 18 M G 19 J N 20 K I 21 W S 22 R S 23 A E 24 LKV OFIHPB ZERJNG AXWSMD , V K 0 R E 1 L I 2 B N 3 Z E 4 P B 5 W E 6 M S 7 E O 8 P N 9 M D 10 I E 11 H R 12 F E 13 S N 14 R E 15 J R 16 X E 17 F I 18 M G 19 J N 20 K I 21 W S 22 R S 23 A E 24

Step 3: Find the Loops V K 0 R E 1 L I 2 B N 3 Z E 4 P B 5 W E 6 M S 7 E O 8 P N 9 M D 10 I E 11 H R 12 F E 13 S N 14 R E 15 J R 16 X E 17 F I 18 M G 19 J N 20 K I 21 W S 22 R S 23 A E 24 LKV OFIHPB ZERJNG AXWSMD ,

Enigma Decryption

The End