Vigenère’s Cryptosystem

Slides:



Advertisements
Similar presentations
CLASSICAL ENCRYPTION TECHNIQUES
Advertisements

Cryptology Terminology and Early History. Cryptology Terms Cryptology –The science of concealing the meaning of messages and the discovery of the meaning.
Cryptology  Terminology  plaintext - text that is not encrypted.  ciphertext - the output of the encryption process.  key - the information required.
1 Codes, Ciphers, and Cryptography-Ch 2.1 Michael A. Karls Ball State University.
Creating Secret Messages. 2 Why do we need to keep things secret? Historically, secret messages were used in wars and battles For example, the Enigma.
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.
Intro To Encryption Exercise 1. Monoalphabetic Ciphers Examples:  Caesar Cipher  At Bash  PigPen (Will be demonstrated)  …
CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.
L1.1. An Introduction to Classical Cryptosystems Rocky K. C. Chang, February 2013.
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.
Cryptography Week-6.
History and Background Part 1: Basic Concepts and Monoalphabetic Substitution CSCI 5857: Encoding and Encryption.
Classical Monoalphabetic Ciphers Day 2. Keyword cipher Select a keyword, if the keyword has any repeated letters, drop all but the first occurrence. Write.
Introduction to CS Theory Lecture 1 – Introduction Piotr Faliszewski
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
1 University of Palestine Information Security Principles ITGD 2202 Ms. Eman Alajrami 2 nd Semester
Week 2 - Wednesday.  What did we talk about last time?  Encryption  Shift ciphers  Transposition ciphers.
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:
Pseudo-Random Functions 1/22 Encryption as Permutation Assume cryptosystem correct and P = C If x  x’ then E K (x)  E K (x’) So, no y is hit by more.
1 Chapter 2-1 Conventional Encryption Message Confidentiality.
Section 2.7: The Friedman and Kasiski Tests Practice HW (not to hand in) From Barr Text p. 1-4, 8.
Symmetric-Key Cryptography
An Introduction to Cryptography. What is cryptography? noun \krip- ˈ tä-grə-fē\ : the process of writing or reading secret messages or codes “Encryption”:
Module :MA3036NI Cryptography and Number Theory Lecture Week 3 Symmetric Encryption-2.
1 University of Palestine Information Security Principles ITGD 2202 Ms. Eman Alajrami.
Introduction to Ciphers Breno de Medeiros. Cipher types From “Cipher”, Wikipedia article.
Abstract: Cryptology is a combination of the processes of keeping a message secret (cryptography) and trying to break the secrecy of that message (cryptoanalysis).
Cryptography Part 1: Classical Ciphers Jerzy Wojdyło May 4, 2001.
Classical Crypto By: Luong-Sorin VA, IMIT Dith Nimol, IMIT.
Cryptography (Traditional Ciphers)
1 Cryptanalysis Four kinds of attacks (recall) The objective: determine the key ( Herckhoff principle ) Assumption: English plaintext text Basic techniques:
Traditional Symmetric-Key Ciphers
Encryption CS110: Computer Science and the Internet.
Introduction to Cryptography Lecture 8. Polyalphabetic Substitutions Definition: Let be different substitution ciphers. Then to encrypt the message apply.
Vigenére Cipher Kimberly Chiffens & Maria Jannelli.
Network Security Lecture 13 Presented by: Dr. Munam Ali Shah.
Polyalphabetic Ciphers History. Alberti Rennaisance Architect –First fountains of Trevi, Rome –Churches 1467 essay on cryptology –Frequency analysis –Cipher.
CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.
Substitution Ciphers Reference –Matt Bishop, Computer Security, Addison Wesley, 2003.
CHAPTER 14 ENCRYPTION AND DECRYPTION Sajina Pradhan
Computer Security By Rubel Biswas. Introduction History Terms & Definitions Symmetric and Asymmetric Attacks on Cryptosystems Outline.
Substitution Ciphers.
Vocabulary Big Data - “Big data is a broad term for datasets so large or complex that traditional data processing applications are inadequate.” Moore’s.
CSE565: Computer Security Lecture 2 Basic Encryption & Decryption
Chapter 2 Basic Encryption and Decryption
Introduction To Cryptography
Asad Gondal Ali Haider Mansoor
Monkeys and Coincidences
By: Mohsin Tahir waqas Akram Numan-Ul-Haq Ali Asghar Rao Arslan
Section 2.7 The Friedman and Kasiski Tests
Cryptography and Network Security
Computer and Data Security 4th Class
Basic Encryption Methods
History and Background Part 3: Polyalphabetic Ciphers
Taehyung Kim HPC Lab. POSTECH
Chapter 30 Cryptography Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Outline Some Basic Terminology Symmetric Encryption
History of Cryptography
PART VII Security.
Kasiski Method Reference
Homework #1 Chap. 1, 3, 4 J. H. Wang Oct. 2, 2018.
Digital Communications
Traditional Symmetric-Key Ciphers
National Cipher Challenge
Symmetric Encryption or conventional / private-key / single-key
Presentation transcript:

Vigenère’s Cryptosystem Le chiffre indéchiffrable April 6, 2005 copyright Kevin O'Bryant

copyright Kevin O'Bryant Office Hours I have lunch in Revelle cafeteria after class Barry will have office hours in AP&M 6402c, Tuesdays noon-2pm and Fridays 8am-10am (except this week, when Friday will be replaced with Thursday 2pm-4pm) April 6, 2005 copyright Kevin O'Bryant

A Genetic Algorithm Q(k):=( (Ni-Fi)2+  (Nij-Fij)2)-1 1. Generate 100 random keys (and call them “adults”). 2. Assign to each adult a quality: Q(k):=( (Ni-Fi)2+  (Nij-Fij)2)-1 where Fi is the frequency in English of the i-th letter, and Fij is the percentage of letter i which are followed by j, and Ni and Nij are the corresponding observed statistics produced by the adult k. 3. Kill the 50 lowest quality adults. Pair off the remaining 50 (to get 25 pairs), and mate each pair four times, to get four children. Randomly alter a small percentage of the children. Call the 100 children “adults”, and proceed to step 2. Variations: Q(k), 100, 50, mating process, random alteration. April 6, 2005 copyright Kevin O'Bryant

The Two Uses of Frequency Analysis We use frequency analysis for two things figure out cryptograms fast automatic language recognition April 6, 2005 copyright Kevin O'Bryant

copyright Kevin O'Bryant Three ciphers Call the message m0, m1, m2, … Caesar ci = mi + k mod 26 Monoalphabetic ci = (mi) In both, the letter “e” is encrypted the same way throughout the message. Vigenère ci = mi + ki mod L mod 26 The key is a string of L numbers k0, k1, …, kL-1. April 6, 2005 copyright Kevin O'Bryant

copyright Kevin O'Bryant Example Let’s encrypt “attack at dawn” using keyword “usa”. Message a t c k d w n Code 19 2 10 3 22 13 key 20 18 sum 11 14 cipher text U L T K D O N Note that both “a” and “c” get encrypted to “U”. Sometimes “t” is encrypted to “L”, and sometimes to “T”. April 6, 2005 copyright Kevin O'Bryant

Vigenère’s Cryptosystem Let’s encrypt the plaintext “prince is my favorite musician” with the keyword “GUITAR”. Step 1: strip formatting: “prince ismyfa vorite musici an” using blocks the same length as our keyword. Step 2: encrypt the first letter of each block with the Caeser-cipher that sends “a” to “G”, the second with that C- c that sends “a” to “U”, the third with that C-c that sends “a” to “I”, the fourth by sending “a” to “T”, fifth by sending “a” to “A”, the sixth by sending “a” to “R”. VLQGCV OMURFR BIZBTV SOABCZ GH Step 3: reformat into a (possibly) different block length. VLQG CVOM URFR BIZB TVSO ABCZ GH April 6, 2005 copyright Kevin O'Bryant

Vigenère’s Cryptosystem History Idea of entertwining two keys came from Leon Battista Alberti around 1465 in Florence Developed by Johannes Trithemius Giovanni Porta Blaise de Vigenère April 6, 2005 copyright Kevin O'Bryant

The Alpha and the Omega of Vigenère’s cryptosystem April 6, 2005 copyright Kevin O'Bryant

Vigenère’s Cryptosystem History Idea of entertwining two keys came from Leon Battista Alberti around 1465 in Florence Developed by Johannes Trithemius Giovanni Porta Blaise de Vigenère Broken by Charles Babbage Publicly broken by Friedrich Kasiski April 6, 2005 copyright Kevin O'Bryant

The Vision of Sin (excerpt) Sit thee down, and have no shame, Cheek by jowl, and knee by knee: What care I for any name? What for order or degree? Let me screw thee up a peg: Let me loose thy tongue with wine: Callest thou that thing a leg? Which is thinnest? Thine or mine? Thou shalt not be saved by works: Thou has been a sinner too: Ruined trunks on withered forks, Empty scarecrows, I and you! Fill the cup, and fill the can: Have a rouse before the morn: Every moment dies a man, Every moment one is born. Alfred Tennyson Image taken from http://charon.sfsu.edu/TENNYSON/tennyson.html April 6, 2005 copyright Kevin O'Bryant

copyright Kevin O'Bryant Babbage to Tennyson [suggested correction to “otherwise beautiful” poem] It must be manifest that if this were true, the population of the world would be at a standstill . . . I would suggest that in the next edition of your poem you have it read – “Every moment dies a man, Every moment 1 1/16 is born.” The actual figure is so long I cannot get it onto a line, but I believe the figure 1 1/16 will be sufficiently accurate for poetry. April 6, 2005 copyright Kevin O'Bryant

Vigenère’s Cryptosystem Strengths Infinite number of keywords Averages frequencies Easy to remember key Considered unbreakable in Black chambers for 200 years Weaknesses Can perform frequency analysis if we know-or guess-the length of the keyword April 6, 2005 copyright Kevin O'Bryant

copyright Kevin O'Bryant Applets There are applets on our website http://www.math.ucsd.edu/~crypto There are applets for encrypting, decrypting, and breaking: Monoalphabetic Vigenere (Caesar is special case) Rectangular Transposition The “computer homework” mentioned in the introduction of the class will consist of breaking three ciphertexts (each person gets their own) using the applets. The results will be automatically recorded! You can use the applets for practice, but the homework isn’t set up yet. Patience is a virtue. April 6, 2005 copyright Kevin O'Bryant