The Enigma Encryption System Andrew Regan CSC 290.

Slides:



Advertisements
Similar presentations
Ciphers and Permutations. Monoalphabetic Cipher is simply a permutation abcdefghijklmnopqrstuvwxyz SATBUCVDWEXFYGZRQPONMLKJIH Cycle Form (ASOZHDB) (CTNGVLF)
Advertisements

Kyle Johnson. Cryptology Comprised of both Cryptography and Cryptanalysis Cryptography - which is the practice and study of techniques for secure communication.
1 Codes, Ciphers, and Cryptography-Ch 3.2 Michael A. Karls Ball State University.
Team Name: team13 Programmer: 陳則凱 b Tester: 劉典恆 b
Enigma? Several Images from Wikipedia (an online encyclopedia)
Enigma Meghan Emilio Faculty Sponsor: Ralph Morelli (Computer Science)
CMSC 414 Computer and Network Security Lecture 3 Jonathan Katz.
Enigma Machine - Design Presentation Group M1 Adithya Attawar Shilpi Chakrabarti Zavo Gabriel Michael Sokolsky Digital World War II Enigma Cipher Wed.
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.
Classical Cryptography
ICS 454: Principles of Cryptography
Index of Coincidence Meghan Emilio Professor Ralph Morelli February 18, 2004.
Evolving a Faster Keyboard Christopher P Walker. Overview Motivation Algorithm Considerations Design of the EA The nonexistent preliminary results Future.
Chapter 2 Basic Encryption and Decryption (part B)
Enigma Meghan Emilio Advisor: Professor Ralph Morelli April 2004.
Classical Encryption Techniques
L1.1. An Introduction to Classical Cryptosystems Rocky K. C. Chang, February 2013.
3.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 3 Traditional Symmetric-Key Ciphers.
IntroConcAnalysisPreviousSystemsRotors
Cryptanalysis. The Speaker  Chuck Easttom  
Dan Boneh Introduction History Online Cryptography Course Dan Boneh.
Chapter 2 Basic Encryption and Decryption. csci5233 computer security & integrity 2 Encryption / Decryption encrypted transmission AB plaintext ciphertext.
Diffusion and Confusion Two properties that a good cryptosystem should have: Diffusion: change of one character in the plaintext results in several characters.
Week 2 - Wednesday.  What did we talk about last time?  Encryption  Shift ciphers  Transposition ciphers.
Differential Cryptanalysis - quite similar to linear cryptanalysis - exploits the relationship between the difference of two inputs and the difference.
Team Name: team13 Programmer: 陳則凱 b Tester: 劉典恆 b
Computer Security coursework 2 Dr Alexei Vernitski.
Cryptography Data communications and networks Momina Tariq: Ambreen Sohail: Data Communications and Networks.
Topic 21 Cryptography CS 555 Topic 2: Evolution of Classical Cryptography CS555.
Day 18. Concepts Plaintext: the original message Ciphertext: the transformed message Encryption: transformation of plaintext into ciphertext Decryption:
Symmetric-Key Cryptography
Announcements: Please pass in Assignment 1 now. Please pass in Assignment 1 now. Assignment 2 posted (when due?) Assignment 2 posted (when due?)Questions?
Terminology and classical Cryptology
Cryptographic Attacks on Scrambled LZ-Compression and Arithmetic Coding By: RAJBIR SINGH BIKRAM KAHLON.
Dan Boneh Symmetric Encryption History Crypto. Dan Boneh History David Kahn, “The code breakers” (1996)
Cryptograpy By Roya Furmuly W C I H D F O P S L 7.
1 Cryptanalysis Four kinds of attacks (recall) The objective: determine the key ( Herckhoff principle ) Assumption: English plaintext text Basic techniques:
Le Trong Ngoc Security Fundamentals (2) Encryption mechanisms 4/2011.
24-Nov-15Security Cryptography Cryptography is the science and art of transforming messages to make them secure and immune to attacks. It involves plaintext,
Encryption of WWII Philip Gebhardt 10/24/2011. Interest.
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.
Vigenére Cipher Kimberly Chiffens & Maria Jannelli.
K. Salah1 Cryptography Module I. K. Salah2 Cryptographic Protocols  Messages should be transmitted to destination  Only the recipient should see it.
Introduction to Cryptography Lecture 8. Polyalphabetic Substitutions Definition: Let be different substitution ciphers. Then to encrypt the message apply.
Computer Security coursework 3 Dr Alexei Vernitski.
The Enigma Machine Eric Roberts CS 106A February 3, 2016.
Print the sample banner slides or customize with your own message. Click on the letter and type your own text. Use one character per slide. C.
Chapter 2 Basic Encryption and Decryption
Monkeys and Coincidences
Quantifying Uncertainty
Topics discussed in this section: 30-2 SYMMETRIC-KEY CRYPTOGRAPHY Symmetric-key cryptography started thousands of years ago when people needed.
Simplified IDEA Cryptography and Network Security.
Matt Salamone and Pete McIlwee
Rotor Ciphers.
Five-minute starter task
W Customize this banner with your own message! Select the letter and add your own text. Use one character per slide.
B Customize this banner with your own message! Select the letter and add your own text. Use one character per slide.
H Customize this banner with your own message! Select the letter and add your own text. Use one character per slide.
B Customize this banner with your own message! Select the letter and add your own text. Use one character per slide.
W Customize this banner with your own message! Select the letter and add your own text. Use one character per slide.
Fun with Cryptography The Science of Secrecy.
H Customize this banner with your own message! Select the letter and add your own text. Use one character per slide.
W Customize this banner with your own message! Select the letter and add your own text. Use one character per slide.
C Customize this banner with your own message! Select the letter and add your own text. Use one character per slide.
An electro-mechanical rotor cipher machine created by the German engineer Arthur Scherbius.
W Customize this banner with your own message! Select the letter and add your own text. Use one character per slide.
W Customize this banner with your own message! Select the letter and add your own text. Use one character per slide.
W Customize this banner with your own message! Select the letter and add your own text. Use one character per slide.
H Customize this banner with your own message! Select the letter and add your own text. Use one character per slide.
Meghan Emilio Professor Ralph Morelli February 18, 2004
Presentation transcript:

The Enigma Encryption System Andrew Regan CSC 290

Key Components for Encryption/Decryption Plugboard 3 Rotating Removable Rotors Reflector

Sample Encryption/Decryption

Enigma

Enigma Properties 3 rotors  26x26x26 = 17,576 initial settings Rotor order  3x2x1 = 6 possible arrangements Swapping 6 letters  100,391,791,500 Approximately = 10,000,000,000,000,000 keys Later versions of the Enigma had even more keys. –Swapped more than 6 letters –Selected 3 rotors from set of 5

Ciphertext-Only Attack Developed by James Gillogly. Find initial rotor setting and rotor order. Uses Index of Coincidence. Iterate through all possible initial rotor settings and rotor orders with no plugboard. Largest IOC is the most likely rotor arrangement. Uses rotor settings from step 1. Finds one new plugboard setting for each iteration. Decrypt the text with every possible character pair. –25x26 = 650 pairs. Trigram analysis on the 650 decrypted texts. Add the setting to the plugboard with the best decrypted text. Step 1:Step 2:

Ciphertext-Only Attack Step 1 Results

Ciphertext-Only Attack Step 1 Results Cont. # CharactersAvg. IOC Index out of 105, # CharactersSuccessful Decryptions

Current Trigram Results Attempted analyzing text based on most probable trigrams in English plaintext. –+1 for “good” trigram, -1 for “bad.” –Highest score wins. –To many swaps initially to be accurate. Currently working on developing trigram statistics for partially decrypted Enigma texts to use in the initial rounds of finding the plugboard settings.