Enigma Meghan Emilio Faculty Sponsor: Ralph Morelli (Computer Science)

Slides:

Advertisements

Similar presentations

Cryptography encryption authentication digital signatures

Advertisements

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)

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)

Secure communication Informatics for economists II Jan Přichystal

CS 555Topic 11 Cryptography CS 555 Topic 1: Overview of the Course & Introduction to Encryption.

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.

Sigaba 1 Sigaba Sigaba 2 Sigaba  Used by Americans during WWII o And afterwards (to about 1948)  Never broken o Germans quit collecting, considered.

Classical Cryptography

The Enigma Encryption System Andrew Regan CSC 290.

Purple 1 Purple Purple 2 Purple  Used by Japanese government o Diplomatic communications o Named for color of binder cryptanalysts used o Other Japanese.

CSE331: Introduction to Networks and Security Lecture 17 Fall 2002.

McGraw-Hill©The McGraw-Hill Companies, Inc., Security PART VII.

Index of Coincidence Meghan Emilio Professor Ralph Morelli February 18, 2004.

Review What is security: history and definition Security policy, mechanisms and services Security models.

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.

Classical Encryption Techniques

Chapter 2 – Classical Encryption Techniques

IntroConcAnalysisPreviousSystemsRotors

Cryptanalysis. The Speaker  Chuck Easttom  

Polyalphabetic Substitution Ciphers. First Steps Towards Complexity  If one alphabet is good, then two alphabets must be better!  By doubling the number.

Chapter 2 Basic Encryption and Decryption. csci5233 computer security & integrity 2 Encryption / Decryption encrypted transmission AB plaintext ciphertext.

CSCI 5857: Encoding and Encryption

Week 2 - Wednesday.  What did we talk about last time?  Encryption  Shift ciphers  Transposition ciphers.

T TT The Cryptography Istituto Tecnico Industriale “E.Divini” San Severino Marche.

Future Computers.

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

Lec. 5 : History of Cryptologic Research II

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:

1 Chapter 2-1 Conventional Encryption Message Confidentiality.

Module :MA3036NI Cryptography and Number Theory Lecture Week 3 Symmetric Encryption-2.

CSCI 5857: Encoding and Encryption

Polyalphabetic CIPHERS Linguistics 484. Summary The idea How to recognize: index of coincidence How many alphabets: Kasiski.

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.

Computer Security Cryptography. Cryptography Now and Before  In the past – mainly used for confidentiality  Today –Still used for confidentiality –Data.

xy ? {(3,-2), (5,4), (-2,0)}. A relation is set of ordered pairs, where one number is mapped to another number.

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.

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,

Introduction to Cryptography Lecture 8. Polyalphabetic Substitutions Definition: Let be different substitution ciphers. Then to encrypt the message apply.

Linear Cryptanalysis of DES

Symmetric Cipher Model Plaintext input 1- encryption algorithm 2- secret key Encryption Cipher text output Cipher text input 1- Decryption algorithm 2-

CS 150 – Computing: From Ada to the Web Cryptography.

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

The Mathematics Behind

Prof. Wenguo Wang Network Information Security Prof. Wenguo Wang Tel College of Computer Science QUFU NORMAL UNIVERSITY.

CHAPTER 14 ENCRYPTION AND DECRYPTION Sajina Pradhan

Secure communication Informatics for economists II Jan Přichystal

Eric Roberts and Jerry Cain

Chapter 2 Basic Encryption and Decryption

History and Background Part 3: Polyalphabetic Ciphers

Matt Salamone and Pete McIlwee

Enigma Machine.

PART VII Security.

slides courtesy of Eric Roberts

An electro-mechanical rotor cipher machine created by the German engineer Arthur Scherbius.

WORLD OF WONDERS : THE ENIGMA MACHINE

Modern Cryptography.

Meghan Emilio Professor Ralph Morelli February 18, 2004

Presentation transcript:

Enigma Meghan Emilio Faculty Sponsor: Ralph Morelli (Computer Science)

Objective There are two main objectives of this project First, to create a working simulation of an Enigma machine that is as faithful as possible. Second, to create an analyzer which will “break” Enigma. That is, decrypt messages even if little or no information about the original settings is known.

What is Enigma? Electrical enciphering machine widely used by the German Military during WWII. Breaking Enigma a turning point of the war. Has three rotating rotors, a plugboard and a reflector.

Rotors and Plugboard The rotors rotate in the following sequence: First rotor rotates each time a character is input. The second rotor rotates once each time the first rotor makes one full turn. The third rotor rotates once each time the second rotor has rotated completely. The plugboard provides a customizable swapping of pairs letters both before and after a character passed through the rotors.

Putting It All Together Rotor I Swap Rotor II Swap Rotor III Swap Plugboard Swap InputOutput Reflector Swap

Simulation Input English/Encrypted text and output Encrypted text/English Java Applet Faithful to rotor wirings and reflectors used during WWII

Analyzer Input encrypted text and output original English text No other input information is needed Assumes possession of an Enigma machine Assumes text was encrypted without a plug board Searches through possible decryptions using simulator and chooses the best one using Index of Coincidence (IC) as a scoring function

What is Index of Coincidence? Index of Coincidence (IC) is the probability that two randomly selected letters will be identical. IC is a statistical measure which distinguishes text encrypted polyalphabetically from text encrypted with a monoalphabetically. Every language has a calculated IC. For instance: English: Random Text:

Why IC? Enigma encryptions are polyalphabetic This allows for a heuristic algorithm Instead of searching all possible decryptions, take the first one that comes close to , as there should be only one. Effective on larger sample sizes (comparable to exhaustive search - see results) More efficient (relative to rotor setting - see results)

Problems with IC

Results

Conclusion A computer program was made that was able to break Enigma messages both efficiently and effectively. Modern day computers make it relatively easy to decrypt Enigma messages. Thus, Enigma is an inadequate form of encryption for the present day.