Network Security Lecture 12 Presented by Dr Munam

Network Security Lecture 12 Presented by: Dr. Munam Ali Shah

Part 2 (b) Cryptography as a Network Security Tool

Summary of the previous lecture n We had overviewed the 3 -dimensions of a cryptographic system, i. e. , type of operation to transform the plain text into cipher text, number of keys used and the way in which plain text is processed n We also discussed unconditional and computational security. One example of unconditional security is OTP n The difference between Cryptanalysis and Brute Force attacks, were also discussed. n And lastly, we practically perform cryptography through the Shift Cipher

Outlines of today’s lecture We will: n Explore a couple of more examples of Shift Cipher n Continue the discussion on Mono-alphabetic Cipher with an example will also be discussed n Perform a cryptanalysis on a cipher text to reveal the plain text.

Objectives n You would be able to present an overview of more cryptographic schemes and you will understand the limitation of each scheme. n You would be able to break the code (ideally. . )

Concepts n A private key cipher is composed of two algorithms l encryption algorithm E l decryption algorithm D n The same key K is used for encryption & decryption n K has to be distributed beforehand

Caesar Cipher n If each letter is assigned a number (a=0, z=25), Encryption/Decryption defined as: C = E(p) = (P + 3) mod (26) P = D(c) = (C – 3) mod (26) n Example: meet me after the toga party phhw ph diwhu wkh wrjd sduwb

Caesar Cipher: Encryption Example n K=7 n P = Rome is the greatest empire n C = yvtl pz aol nylhalza ltwpyl

Caesar Cipher: Decryption Example n K=7 n C = yvtl dhz uva ibpsa pu h khf n P = Rome was not built in a day

Caesar Cipher: Decryption with Unknown Key n C=tfnriujuzvdrepkzdvjsvwfivkyvziuvrkyjkyvmrczrekevmvikrjkvfwuvrkyslkfetv n tfnriuj uzv drep kzdvj svwfiv kyvzi uvrkyj; kyv mrczrek evmvi krjkv fw uvrky slk fetv Ø P = Cowards die many times before their deaths; the valiant never taste of death but once. (K = 17) l Julius Caesar by William Shakespeare

Cryptanalysis of Caesar Cipher n Only have 26 possible ciphers l A maps to A, B, . . Z n Could simply try each in turn n A brute force search n Given ciphertext, just try all shifts of letters n Do need to recognize when have plaintext

Monoalphabetic Cipher n Instead of substituting each letter in a sequential order (shift), substitute the letters arbitrarily n Each plaintext letter maps to a unique ciphertext letter n Hence key is 26 letters long

Monoalphabetic Cipher Security n How many total keys are there? l 26! = 4 x 1026 keys n With so many keys, is it secure? l No n It is secure against brute force attack but problem lies in language characteristics l Called frequency analysis attack

Language Redundancy and Cryptanalysis n Human languages are redundant n Thats why we can compress text files n Letters are not equally commonly used n Which is the most common letter? l E n Which is the least common letter? l Z

English Letter Frequencies

Language Redundancy and Cryptanalysis n Have tables of single, double & triple letter frequencies for various languages n Which is the most common digram? l TH n Which is the most common trigram? l THE

Use in Cryptanalysis n Key concept – mono-alphabetic substitution ciphers do not change relative letter frequencies n Each occurrence of a particular plaintext letter maps to the same ciphertext letter n So attack is easy: l Calculate letter frequencies for ciphertext l Compare counts/plots against known values

Example Cryptanalysis n Given ciphertext uzqsovuohxmopvgpozpevsgzwszopfpesxudbmetsxaiz vuephzhzshzowsfpappdtsvpquzwymxuzuhsxepyepopd zszufpombzwpfupzhmdjudtmohmq n Frequency Analysis P 13. 33 H 5. 83 F 3. 33 B 1. 67 C 0. 00 Z 11. 67 D 5. 00 W 3. 33 G 1. 67 K 0. 00 S 8. 33 E 5. 00 Q 2. 50 Y 1. 67 L U 8. 33 V 4. 17 T 2. 50 I 0. 83 N 0. 00 O 7. 50 X 4. 17 A 1. 67 J 0. 83 R 0. 00 M 6. 67 0. 00

Example Cryptanalysis n Guess P & Z are E and T, respectively n utqsovuohxmoevgeoteevsgtwstoefeesxud bmetsxaitvueehthtshtowsfeaeedtsvequt wymxutuhsxeeyeeoedtstufeombtwefuethm djudtmohmq

Example Cryptanalysis n Among digrams starting with Z, ZW has the highest occurrence (3 times) n Guess ZW is TH n Utqsovuohxmoevgeoteevsgthstoefeesxud bmetsxaitvueehthtshtowsfeaeedtsvequt hymxutuhsxeeyeeoedtstufeombthefuethm djudtmohmq n Hence ZWP is THE

Example Cryptanalysis n Utqsovuohxmoevgeoteevsgthstoefeesxud bmetsxaitvueehthtshtowsfeaeedtsvequt hymxutuhsxeeyeeoedtstufeombthefuethm djudtmohmq n Guess S is A n Utqaovuohxmoevgeoteevagthatoefeeaxud bmetaxaitvueehthtahtowafeaeedtavequt hymxutuhaxeeyeeoedtatufeombthefuethm djudtmohmq

Example Cryptanalysis n U, V and M may correspond to O, I and N n Continuing with trial and error, we finally get the following plaintext It was disclosed yesterday that several informal but direct contacts have been made with political representatives of the Viet Cong in Moscow

Summary of today’s lecture n We discussed more examples of Shift/Ceaser Cipher n We also discussed examples of mono-alphabetic cipher and poly-alphabetic cipher

Next lecture topics n Our discussion on more cryptographic schemes will continue. n We will explore One Time Pad and OTP n An example of Vigenere Cipher will also be discussed with its limitations. n Transposition Cipher with an example of Rail Fence Cipher will form part of our next lecture.

The End