Chris Christensen Department of Mathematics and Statistics Northern Kentucky University.

Slides:



Advertisements
Similar presentations
CLASSICAL ENCRYPTION TECHNIQUES
Advertisements

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.
The Beginning of Allied Successes Against Enigma Chris Christensen Department of Mathematics and Statistics Northern Kentucky University.
Ciphers and Permutations. Monoalphabetic Cipher is simply a permutation abcdefghijklmnopqrstuvwxyz SATBUCVDWEXFYGZRQPONMLKJIH Cycle Form (ASOZHDB) (CTNGVLF)
Classical Cryptosystems Shift Ciphers (Caesar) y= x+k (mod 26) Affine Ciphers y=ax+b (mod 26) Vigenere Ciphers codes=(02,14,03,04,18) Substitution Ciphers.
Permutations and Combinations
Counting Chapter 6 With Question/Answer Animations.
1 Codes, Ciphers, and Cryptography-Ch 3.2 Michael A. Karls Ball State University.
The History and Technology of the Enigma Cipher Machine The History and Technology of the Enigma Cipher Machine Ralph Simpson
Warm-Up Problem Can you predict which offers more choices for license plates? Choice A: a plate with three different letters of the alphabet in any order.
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.
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.
A Glimpse of the History of Cryptography
Combinations We should use permutation where order matters
Purple 1 Purple Purple 2 Purple  Used by Japanese government o Diplomatic communications o Named for color of binder cryptanalysts used o Other Japanese.
Lecture 2.2: Private Key Cryptography II CS 436/636/736 Spring 2012 Nitesh Saxena.
Chris Christensen Department of Mathematics and Statistics Northern Kentucky University.
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
1 Codes, Ciphers, and Cryptography-Ch 3.1 Michael A. Karls Ball State University.
Barcodes and ISBN numbers: which are better at detecting errors? Virtually all packaged products have a barcode on so that optical readers can recognise.
Chapter 2 – Classical Encryption Techniques
Learn the musical alphabet of the piano keyboard Introduction to the musical alphabet.
Dan Boneh Introduction History Online Cryptography Course Dan Boneh.
Cipher Machines: From Antiquity to the Enigma Machine
Computer Science 101 Cryptography Part I. Notes based on S. Singh, The Code Book: The Evolution of Secrecy from Mary, Queen of Scots to Quantum Cryptography.
Hill Cipher Developed by the mathematician Lester Hill in The encryption algorithm takes m successive plain text and substitute for them m cipher.
Lec. 5 : History of Cryptologic Research II
Topic 21 Cryptography CS 555 Topic 2: Evolution of Classical Cryptography CS555.
Chapter 6 With Question/Answer Animations 1. Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients.
Based on Applied Cryptography by Schneier Chapter 1: Foundations Dulal C. Kar.
Cryptography and Network Security (CS435) Part Two (Classic Encryption Techniques)
Day 18. Concepts Plaintext: the original message Ciphertext: the transformed message Encryption: transformation of plaintext into ciphertext Decryption:
 Classic Crypto  Slides based on those developed by Dr. Lawrie Brown at the Australian Defence Force Academy, University College, UNSW  See
1 Chapter 2-1 Conventional Encryption Message Confidentiality.
Chapter 3 Permutations and combinations
National Institute of Science & Technology Cryptology and Its Applications Akshat Mathur [1] Cryptology and Its Applications Presented By AKSHAT MATHUR.
Module :MA3036NI Cryptography and Number Theory Lecture Week 3 Symmetric Encryption-2.
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.
Data Security and Encryption (CSE348) 1. Lecture # 3 2.
Encryption of WWII Philip Gebhardt 10/24/2011. Interest.
Museum Entrance Code Makers Code Breakers Enigma Code Welcome to the Museum of WW2 Secret Codes Curator ’ s Offices Room Five Artifact 22 Artifact 23 Back.
Section 2.3: Substitution Ciphers
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.
Counting Principles Multiplication rule Permutations Combinations.
CS 150 – Computing: From Ada to the Web Cryptography.
SECTION 9 Orbits, Cycles, and the Alternating Groups Given a set A, a relation in A is defined by : For a, b  A, let a  b if and only if b =  n (a)
8.6 Counting Principles. Listing Possibilities: Ex 1 Eight pieces of paper are numbered from 1 to 8 and placed in a box. One piece of paper is drawn from.
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.
5.5 Generalized Permutations and Combinations
The Enigma Machine Eric Roberts CS 106A February 3, 2016.
By, Amanda Rydzynski O’Brien Computer Skills
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?
The Mathematics Behind
Prof. Wenguo Wang Network Information Security Prof. Wenguo Wang Tel College of Computer Science QUFU NORMAL UNIVERSITY.
CRYPTOGRAPHY Cryptography is art or science of transforming intelligible message to unintelligible and again transforming that message back to the original.
What Was the Purple Cipher?
In this lesson we will understand:
Enigma Machine.
Rotor Ciphers.
The Race to Crack the Enigma Machine
The German Enigma Machine The Secret Battlefield of WW2
WORLD OF WONDERS : THE ENIGMA MACHINE
Presentation transcript:

Chris Christensen Department of Mathematics and Statistics Northern Kentucky University

1917 Edward Hebern (USA) 1918 Arthur Scherbius (Germany) 1919 Hugo Koch (Dutch) Arvid Damm (Sweden) 1915 Two Dutch military officers

1926 Reichsmarine 1928 Reichswehr 1928 the Poles were confronted by messages that – because of the randomness of letters in the messages – were thought to be generated by a machine cipher. Early in 1929 the Cipher Bureau began a cryptology course for mathematics students at Poznań University.

Marian Rejewski Jerzy Rozycki Henryk Zygalski

(ae)(bj)(cm)(dz)(fl)(gy)(hx)(iv)(kw)(nr)(oq)(pu)(st)

Rotors6 x 26 x 26 x 26 = 105,456 Plugboard 100,391,791,500 Number of setups 10,586,916,764,424,000

abcdefghijklmnopqrstuvwxyz OHELCPYBSURDZTAFXKINJWVQGM (ao)(bh)(ce)(dl)(fp)(gy)(is)(ju)(kr)(mz)(nt)(qx)(vw)

If we have a sufficient number of messages (about eighty) for a given day, then, in general, all the letters of the alphabet will occur in all six places at the openings of the messages. Marian Rejewski

AD(a)(bc)(dvpfkxgzyo)(eijumnqlht)(rw)(s) BE(axt)(blfqveoum)(cgy)(d)(hjpswizrn)(k) CF(abviktjgfcqny)(duzrekhxwpsmo)

The disjoint cycles for AD, BE, and CF assume a characteristic form “generally different for each day [i.e., for each rotor order and ground setting] ….”

The Theorem that Won the War Cipher A. Devours Afterward to How Polish Mathematicians Deciphered the Enigma Marian Rejewski, July 1981

“If we multiply two permutations, consisting solely of [disjoint] transpositions, then the product has an even number of cycles of the same length. So, AD, BE, and CF “consist of cycles of the same length in even numbers.” AD(a)(bc)(dvpfkxgzyo)(eijumnqlht)(rw)(s) BE(axt)(blfqveoum)(cgy)(d)(hjpswizrn)(k) CF(abviktjgfcqny)(duzrekhxwpsmo)

The theoretical possible number of disjoint cycle structures for each of AD, BE, and CF is the number of partitions of 13, which is 101.

The theoretical possible number of disjoint cycle structures for each of AD, BE, and CF is the “number of partitions of 13,” which is 101. The triples of composed permutations AD, BE, and CF could theoretically have 101 x 101 x 101 = 1,030,301 possible sets of disjoint cycles. The number of rotor system settings is 105,465.

The Cyclometer

Determine the disjoint cycle structure for AD, BE, and CF for all 105,456 possible rotor orders and ground settings.

One had to note on a card the position of the drums and the number of bulbs that were lit, and to order the cards themselves in a specified way; for example by the lengths of the cycles. AD(a)(bc)(dvpfkxgzyo)(eijumnqlht)(rw)(s) Notation 6 BE(axt)(blfqveoum)(cgy)(d)(hjpswizrn)(k) 9+3+1Notation 9 CF(abviktjgfcqny)(duzrekhxwpsmo) 13Notation 1

Once all six card catalogues [one for each rotor order] were ready, though, obtaining a daily key was usually a matter of twenty minutes. The card told the drum positions, the box from which the card had been taken told the drum sequence.

21,230 disjoint cycle decompositions appear. Of these, (or 54.40%) correspond to a unique setting will have 10 or fewer settings to check.

Unfortunately, on 2 November 1937, when the card catalogue was ready, the Germans exchanged the reversing drum that they had been using, which they designated letter A, for another drum, a B drum, and consequently, we had to do the whole job over again …. Marian Rejewski

And, more and more changes until 1 September 1939.