1 Solve it with the Computer Rick Spillman CSCE 115 Spring 2012 Lecture 8.

Slides:



Advertisements
Similar presentations
Week 2 - Friday.  What did we talk about last time?  Substitution ciphers  Vigenère ciphers  One-time pad.
Advertisements

A Presentation by: ~Ksenia Potapov ~Amariah Condon ~Janette Fong ~Janice Lau CRYPTOGRAPHY.
Introduction to Cryptography and Security Mechanisms: Unit 5 Theoretical v Practical Security Dr Keith Martin McCrea
EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 5 Wenbing Zhao Department of Electrical and Computer Engineering.
Steganography Rayan Ghamri.
CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.
Section 2.9 The Hill Cipher; Matrices
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.
Cryptanalysis. The Speaker  Chuck Easttom  
Section 3.6: An Introduction to Cryptography
Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 9: Cryptography.
1 Introduction to Security and Cryptology Enterprise Systems DT211 Denis Manley.
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
CS110: Computers and the Internet Encryption and Certificates.
Topic 21 Cryptography CS 555 Topic 2: Evolution of Classical Cryptography CS555.
Encryption: A Brief History Author: Margery Waldron.
Secret Codes.  A code is a system of symbols, letters, words, or signals that are used instead of ordinary words and numbers to send messages or store.
Section 2.1: Shift Ciphers and Modular Arithmetic Practice HW from Barr Textbook (not to hand in) p.66 # 1, 2, 3-6, 9-12, 13, 15.
Produced in conjunction with Tom Briggs, Education and Outreach Officer at Bletchley Park.
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.
Announcements: Please pass in Assignment 1 now. Please pass in Assignment 1 now. Assignment 2 posted (when due?) Assignment 2 posted (when due?)Questions?
Polyalphabetic CIPHERS Linguistics 484. Summary The idea How to recognize: index of coincidence How many alphabets: Kasiski.
Abstract: Cryptology is a combination of the processes of keeping a message secret (cryptography) and trying to break the secrecy of that message (cryptoanalysis).
Lecture 3 Page 1 Advanced Network Security Review of Cryptography Advanced Network Security Peter Reiher August, 2014.
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.
Data Security and Encryption (CSE348) 1. Lecture # 3 2.
Section 2.5 Polyaphabetic Substitutions
Encryption CS110: Computer Science and the Internet.
Intro to Cryptography Lesson Introduction
Introduction to Cryptography Lecture 8. Polyalphabetic Substitutions Definition: Let be different substitution ciphers. Then to encrypt the message apply.
Network Security Lecture 13 Presented by: Dr. Munam Ali Shah.
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.
Department of Computer Science Chapter 5 Introduction to Cryptography Semester 1.
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 ”
1 Solve it with the Computer Rick Spillman CSCE 115 Spring 2013 Lecture 12.
Secret Key Cryptography
Encryption with Keys and Passwords
Vocabulary Big Data - “Big data is a broad term for datasets so large or complex that traditional data processing applications are inadequate.” Moore’s.
Chapter 2 Basic Encryption and Decryption
CAP Cryptographic Analysis Program
Asad Gondal Ali Haider Mansoor
Cryptography & Security
CS4780 Cryptography and Information Security
Basic Encryption Methods
Polyalphabetic Ciphers
Lecture 3: Symmetric Key Encryption
Security through Encryption
Encryption with Keys and Passwords
Obscurity and Code Availability
An Introduction to VEX IQ Programming with Modkit
Encryption and Decryption
Security.
Classical Polyalphabetic Ciphers
Cryptanalysis of Vigenere Cipher
Encryption with Keys and Passwords
Outline Using cryptography in networks IPSec SSL and TLS.
Traditional Symmetric-Key Ciphers
EKRJGTU CTG CYGUQOG! Can you break the code?.
Presentation transcript:

1 Solve it with the Computer Rick Spillman CSCE 115 Spring 2012 Lecture 8

2 Outline Review History Autokey Cipher

3 Review

4 Turning Grille in CAP CAP will easily implement a Turning Grille

5 History of Ciphers

6 Censorship During WWII, the US set up a censorship service  By the end of the war it had over 14,000 employees at 90 sites throughout the country  It opened over 1 million pieces of mail a day  It listened to phone conversations, scanned movies, magazines and radio scripts To plug up steganographic channels it banned in advance whole classes of mail  Chess games by mail  Crossword puzzles  Newspaper clippings  One letter containing knitting instructions was held up until the examiner could actually knit the sweater  Loose stamps were replaced by others of equal value but of a different number and denomination

7 Null Ciphers One type of open code that was used to get by the censors was a null cipher where only certain words or letters are significant  Every fifth word  The first letter of every word Example of a letter sent by a German spy during WWI President’s embargo ruling should have immediate notice. Grave situation affecting international law. Statement forshadows ruin of many neutrals. Yellow journals unifying national excitement immensely. Pershing sails from NY June 1

8 Missed Opportunities 1 The allies had set up jargon coded messages to send to the underground in Europe  When the BBC broadcast “It is hot in Suez” the Resistance was to put into effect the Green Plan which called for sabotaging railroad tracks and equipment The most famous of these jargon code messages was the one announcing D-Day which the Nazis intercepted, recognized and ignored.

9 Missed Opportunities 2 Abwehr headquarters had discovered that D-Day would be signaled to the underground by a certain piece of music  So, the German 15 th Army set up a special 30-man interception crew to listen for the signal headed by Colonel Meyer  On June 1 at 9 pm Sergeant Walter Reichling of the team heard the signal and reported it to Colonel Meyer  Colonel Meyer telephoned the two German headquarters charged with the defense of France  But nothing was done about it – each headquarters had assumed that the other would sound the alarm

10 The Atomic Bomb As you would expect the development of atomic weapons during WWII was highly secret  The project sights were located in remote regions around the US  As a result, key personnel would travel from sight to sight and occasionally need to use the telephone  So the need arose for some sort of telephone cipher that could be easily used in the field  They developed a simple checkerboard cipher

11 The Atomic Cipher One of the 10 x 10 checkerboards used looked like: I P IO U O P N W E U T E K L O E UG NB T N S T T AZM D IO E S V TJ EYH N A OL SGH F C BA R S R I C WY U M N M V T H P IQ L S R E D A E N U O I RA D X HT E Encrypt “atom” A 42 T - 05 O - 69 M These would be spoken over the phone Why are there several squares with the same letter? Why are there so many U’s? - 88

12 More on Jargon Codes Jargon codes are frequently used with voice transmissions and that was the case with the atomic bomb program For example, when Enrico Fermi succeeded ahead of schedule in producing the first controlled chain reaction, Arthur Compton called James Conant using a on-the-fly jargon code: Arthur: “Jim, the Italian navigator has just landed in the new world. The earth is not as large as he had estimated and he arrived sooner than expected.” Conant: “Were the natives friendly?” Arthur: “Yes. Everyone landed safe and happy.”

13 AutoKey Ciphers

14 Fixing Vigenere Since a small key length is a weakness of a Vigenere cipher one fix that has been used is called an autokey cipher.  Select a keyword  Use the keyword to encipher the first segment of plaintext  Use the ciphertext (or the plaintext segment which was just enciphered) as the key for the next segment anautokeycipherprovidesalongkeyword cap cnp AutoKey-Ciphertext example wgd CAP will implement this cipher

15 Break This Autokey Cipher There is one major weakness in the autokey- ciphertext Consider what happens when you use the ciphertext as the key to decipher c n p w g d g k b i s q p w h a a a a a a a a a a a a a a a c n p w g d g k b i s q p w h l c h k x d e r h k y f h l c n p w g d g k b i s q p w h m j r h a h v y r i x g s c n p w g d g k b i s q p w h u t o k e y c i p h e r Key word

16 Autokey Plaintext Cipher So, it is not a good idea (though it has been done) to use the ciphertext as the running key The alternative is to use the plaintext as the key anautokeycipherprovidesalongkeyword cap cnp ana uao uto exm key... CAP will implement this cipher

17 Breaking the Autokey Plaintext Cipher This is not as easy to break as the autokey- ciphertext but... A Kasiski-like method exists to determine the “group length”  The group-length is the actual keyword length but since the keyword is not repeated, the group-length describes the length of segments of the running key  These segments define the distance between a plaintext letter being enciphered and becoming a key letter

18 Group Length For example, if the keyword is “alice” a possible cipher structure could be given by t h i s i s a n e x a m p l e a l i c e t h i s i s a n e x t t is enciphered t t is a key letter 5

19 Finding the Group Length It is possible to discover the group length from the ciphertext  Assume the group length is 5 then every plaintext letter will be enciphered by the letter 5 positions to its left and in turn will encipher the letter 5 positions to its right.  Since plaintext has a lot of repeated characters there will be an unusually large number of identical letters separated by the group length Example Key:... R... S Plaintext:... S... R Ciphertext:... J... J S S R There is a good chance that this kind of event will occur Group length

20 Procedure Find the distances between all letter repetitions The most common distances are strong candidates for the group-length CAP will automatically calculate these distances:

21 Using the Group Length Knowledge of the group length reveals how the plaintext is divided into segments.  If the group length is 5, then the first segment consists of every 5 th letter beginning with the first letter We know the encipher chain for this segment, for example: t h i s i s a n e x a m p l e a l i c e t h i s i s a n e x t s q u m l h v w f s m c p b t a s

22 Brute Force Attack We can use a brute force attack because each segment is defined by its beginning character (which is from the key word) Ciphertext (known) Key character (unknown) plaintext (unknown) t ? ? l ? ? s ? ? a Guess t t a s ts s Try all 26 guesses Use a low frequency character test

23 Example Given the ciphertext below created using an autokey – plaintext cipher, find the keyword and the plaintext: Find the key length Break the ciphertext into segments Try all possible keyword letters Run a low frequency character analysis nzmlw tsxyt mkmmp nawxl sskck zrziq ixnqm lqdql cbacx ksbbe nkugo exmmm njmgz xrjmi ezevz dnbui qajbu kdlcg spzzv qrxug gktuh gbwvh ytbcq favli dwcnp yllst qgvlv rllke itfw

24 Find the Group Length Run the keyword length option  Under the polyalphabetic tools click on Autokey Length Either 1 or 3 1 is a real possibility however it is weaker than longer keys so start by trying 3, if that doesn’t work then come back to 1

25 Solution With a good guess for the keyword length, run the autokey solution option Keyword found If “use” is not correct try combinations of these