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

Slides:



Advertisements
Similar presentations
Using Cryptography to Secure Information. Overview Introduction to Cryptography Using Symmetric Encryption Using Hash Functions Using Public Key Encryption.
Advertisements

 Caesar used to encrypt his messages using a very simple algorithm, which could be easily decrypted if you know the key.  He would take each letter.
1 Codes, Ciphers, and Cryptography-Ch 2.3 Michael A. Karls Ball State University.
Enigma Meghan Emilio Faculty Sponsor: Ralph Morelli (Computer Science)
Encryption and Encoding
1 Codes, Ciphers, and Cryptography-Ch 2.1 Michael A. Karls Ball State University.
Classical Cryptography
Cryptography Cryptography: art or science of keeping messages secret Cryptology: branch of mathematics that studies the mathematical foundations of cryptographic.
Encryption Theory CSC380 – Flint Joasaint, Marcial White.
CRYPTOGRAPHY Lecture 5. A B C D E F G H I J K L M N O P Q R S T U V W X Y Z B C D E F G H I J K L M N O P Q R S T U V W X Y Z A C D E F G H I J K L M.
CSE331: Introduction to Networks and Security Lecture 17 Fall 2002.
CYPHER INDEX n Introduction n Background n Demo INTRODUCTION n Cypher is a software toolkit designed to aid in the decryption of standard (historical)
Chapter 2 Basic Encryption and Decryption (part B)
Enigma Meghan Emilio Advisor: Professor Ralph Morelli April 2004.
CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.
Chapter 2 – Classical Encryption Techniques
3.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 3 Traditional Symmetric-Key Ciphers.
Polyalphabetic Substitution Ciphers. First Steps Towards Complexity  If one alphabet is good, then two alphabets must be better!  By doubling the number.
Cryptanalysis of the Vigenere Cipher Using Signatures and Scrawls To break a Vigenere cipher you need to know the keyword length. – The Kasiski and Friedman.
Chapter 2 Basic Encryption and Decryption. csci5233 computer security & integrity 2 Encryption / Decryption encrypted transmission AB plaintext ciphertext.
Cryptography Programming Lab
A Technical Seminar Presentation CLASSICAL CRYPTOGRAPHY
Week 2 - Wednesday.  What did we talk about last time?  Encryption  Shift ciphers  Transposition ciphers.
Chapter 2 – Elementary Cryptography  Concepts of encryption  Cryptanalysis  Symmetric (secret key) Encryption (DES & AES)(DES & AES)  Asymmetric (public.
Cryptography Data communications and networks Momina Tariq: Ambreen Sohail: Data Communications and Networks.
ITIS 3200: Introduction to Information Security and Privacy Dr. Weichao Wang.
Topic 21 Cryptography CS 555 Topic 2: Evolution of Classical Cryptography CS555.
Cryptography and Network Security (CS435) Part Two (Classic Encryption Techniques)
Section 2.7: The Friedman and Kasiski Tests Practice HW (not to hand in) From Barr Text p. 1-4, 8.
Symmetric-Key Cryptography
Module :MA3036NI Cryptography and Number Theory Lecture Week 3 Symmetric Encryption-2.
9/03/15UB Fall 2015 CSE565: S. Upadhyaya Lec 2.1 CSE565: Computer Security Lecture 2 Basic Encryption & Decryption Shambhu Upadhyaya Computer Science &
Classical Cryptography I CS432 - Security in Computing Copyright © 2005, 2010 by Scott Orr and the Trustees of Indiana University.
Elementary Cryptography  Concepts of encryption  Symmetric (secret key) Encryption (DES & AES)(DES & AES)  Asymmetric (public key) Encryption (RSA)(RSA)
Data Security and Encryption (CSE348) 1. Lecture # 4 2.
Section 2.5: Polyalphabetic Substitutions Practice HW (not to hand in) From the Barr Text p. 118 # 1-6.
Traditional Symmetric-Key Ciphers
1 Codes, Ciphers, and Cryptography-Ch 2.2 Michael A. Karls Ball State University.
Computer Security Cryptography. Cryptography Now and Before  In the past – mainly used for confidentiality  Today –Still used for confidentiality –Data.
Basic Encryption & Decryption Codebreaking 101 Copyright © 2000 by the Trustees of Indiana University except as noted CRYPTOGRAPHY Encryption: a means.
Vigenere Cipher For example, choose a word “GOLD” for a key. And, add “GOLDGOLDGOLD….” to your plaintext Plaintext: t o o m u c h h y p e Key : GOLDGOLDGOLD.
Section 2.5 Polyaphabetic Substitutions
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.
ROT13 cipher. The ROT13 cipher is a substitution cipher with a specific key where the letters of the alphabet are offset 13 places. Example: all 'A's.
CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.
Encryption. LEARNING OBJECTIVES: BY THE END OF THE LESSON YOU SHOULD KNOW. What encryption is and why it is important The basics of encryption techniques.
Substitution Ciphers Reference –Matt Bishop, Computer Security, Addison Wesley, 2003.
Lecture 2 Classical Cipher System SIMPLE SUBSTITUTION CIPHERS By: NOOR DHIA AL- SHAKARCHY
CS480 Cryptography and Information Security Huiping Guo Department of Computer Science California State University, Los Angeles 4. Traditional and Modern.
3.1 Chapter 3 Traditional Symmetric-Key Ciphers Part2.
Lecture 3 Page 1 CS 236 Online Basic Encryption Methods Substitutions –Monoalphabetic –Polyalphabetic Permutations.
CRYPTOGRAPHY G REEK WORD MEANING “ SECRET WRITING ”
Substitution Ciphers.
CSE565: Computer Security Lecture 2 Basic Encryption & Decryption
Chapter 2 Basic Encryption and Decryption
Asad Gondal Ali Haider Mansoor
Monkeys and Coincidences
Section 2.7 The Friedman and Kasiski Tests
Cryptography and Network Security
Basic Encryption Methods
Computer and Data Security 4th Class
Polyalphabetic Ciphers
Outline Some Basic Terminology Symmetric Encryption
A Technical Seminar Presentation CLASSICAL CRYPTOGRAPHY
Classical Polyalphabetic Ciphers
Kasiski Method Reference
Cryptanalysis of Vigenere Cipher
Traditional Symmetric-Key Ciphers
Presentation transcript:

Polyalphabetic CIPHERS Linguistics 484

Summary The idea How to recognize: index of coincidence How many alphabets: Kasiski

The idea Remove the invariant that a plaintext letter always maps to the same cryptotext letter. Smooth out the frequency distribution, removing clues.

Monoalphabetic PlaintextCryptosystem Ciphertext

Polyalphabetic Plaintext AA Cryptosystem Ciphertext BB CC

Polyalphabetic Plaintext AA Cryptosystem Ciphertext BB CC

Polyalphabetic Plaintext AA Cryptosystem Ciphertext BB CC

Polyalphabetic Plaintext AA Cryptosystem Ciphertext BB CC

Polyalphabetic system Cryptosystem with several components. Systematic way of moving from one cryptosystem to the next.

Vigenère (simplified) Component ciphers are shift ciphers, using so called Direct Standard Alphabet You use each alphabet for one character, then move on.

Vigenère (simplified) ABCDEFGHIJKLMNOPQRSTUVWXYZ ABCDEFGHIJKLMNOPQRSTUVWXYZ BCDEFGHIJKLMNOPQRSTUVWXYZA CDEFGHIJKLMNOPQRSTUVWXYZAB ZABCDEFGHIJKLMNOPQRSTUVWXY

You and your friend agree a single letter key, say ‘S’. Encrypt the first letter with the ‘S’ alphabet, second with ‘T’ alphabet, and so on.

Vigenère (simplified) key=”s” ABCDEFGHIJKLMNOPQRSTUVWXYZ.... STUVWXYZABCDEFGHIJKLMNOPQR TUVWXYZABCDEFGHIJKLMNOPQRS UVWXYZABCDEFGHIJKLMNOPQRST VWXYZABCDEFGHIJKLMNOPQRSTU.. BOOKJWVP

Polyalphabetic system Cryptosystem with several components. Systematic way of moving from one cryptosystem to the next. But two weaknesses in simplified Vigenère. Direct standard alphabets. Breaking one character gets whole alphabet. Pattern of movement is too obvious.

Full Vigenère Use keyword to control jump between alphabets Pattern of movement no longer as obvious.

Vigenère key=”SYMBOL” ABCDEFGHIJKLMNOPQRSTUVWXYZ STUVWXYZABCDEFGHIJKLMNOPQR YZABCDEFGHIJKLMNOPQRSTUVWX MNOPQRSTUVWXYZABCDEFGHIJKL BCDEFGHIJKLMNOPQRSTUVWXYZA OPQRSTUVWXYZABCDEFGHIJKLMN LMNOPQRSTUVWXYZABCDEFGHIJK THE ATOMIC ENERGYL..

Exercise Encipher THE ATOMIC ENERGY with the keyword SYMBOL Decipher AVYUL HWLEE UCZLL LTYVI YOFJI ZSLNI knowing that the keyword is HOUSE

Vigenère key=”HOUSE” ABCDEFGHIJKLMNOPQRSTUVWXYZ HIJKLMNOPQRSTUVWXYZABCDEFG OPQRSTUVWXYZABCDEFGHIJKLMN UVWXYZABCDEFGHIJKLMNOPQRST STUVWXYZABCDEFGHIJKLMNOPQR EFGHIJKLMNOPQRSTUVWXYZABCD AVYUL TH...

How many alphabets? Index of co-incidence Babbage-Kasiski examination Once you have how many alphabets, use frequency analysis as for regular shift ciphers. Breaking Vigenère.

Index of co-incidence Based on arguments about probability. Intuition: measure roughness of frequency distribution Mathematical details follow

Roughness of distributions Smoothest distribution has each letter happening 1/26th of the time. Roughest has one letter happening 100% of the time Normal English has some uneveness, less smooth than totally uniform.

Index of co-incidence Get a frequency f[letter] for each letter. Multiply f[letter]*(f[letter]-1) to get number of co- incidences involving that letter. Add the results for all letters together. Divide by the number of co-incidences you would expect if all the letters were the same.

Index of co-incidence IC = sum(f[letter]*(f[letter]-1)) / N(N-1) / N(N-1)

Index of coincidence IC has a value of if the letters are evenly distributed, which is what you get if the polyalphabet uses many many alphabets It has a value of for English text, monoalphabetic encryptions of English text, many other things

Number of alphabets IC large0.038

Idea to quantify roughness Count the number of times a pair of letters drawn at random from the text happen to be the same. For the roughest possible, we always get the same letter, so a text of length N has N(N-1) repeats. For the smoothest possible, we get way fewer.

Babbage-Kasiski method Explained well in Code Book p Key idea: what does it mean if we find a sequence of repeated characters in a message that has been encoded using a repeated keyword.

Babbage-Kasiski method Key idea: what does it mean if we find a sequence of four or more repeated characters in a message that has been encoded using a repeated keyword. Most likely: a sequence of four or more English characters in the plaintext has been encoded twice starting from the same place in the repeating keyword. Less likely: it’s an accident, some other arrangement of English letters gives rise to a repeat by chance.

Repeats OK, if a repeat is due to the fact that the same thing is encoded twice in the same way, then the keyword must be used a whole number of times to get from one to the other. So, keep track of the spacing between repeats.

Repeats Nearly every repeat will have a spacing that divides evenly by the length of the keyword. So, break the spacings into factors and look for something that (almost) always turns up.

Repeats sequencespacingfactors EFIQ PSDLP55 WCXYM ETRL

Once you have how many alphabets, use frequency analysis as for regular shift ciphers. If there are five different alphabets, tally up characters 1,6,11,... into one table, 2,7,12,... into a second, 3,8,13,... into the third, and so on up to the fifth. The results will show the characteristic frequency pattern of a shifted alphabet (high A, E close to each other, low J,K next to each other, X,Y,Z all low, etc.) Breaking Vigenère.

Once you have how many alphabets, use frequency analysis as for regular shift ciphers. The results will show the characteristic frequency pattern of a shifted alphabet (high A, E close to each other, low J,K next to each other, X,Y,Z all low, etc.) See if the keyword is sensible. Might be an English word. Then plug in letters and check whether the message works out. Breaking Vigenère.