1. Computer and Network Security Rabie A. Ramadan Lecture 2

2. Table of Contents 2 Grading Security Services and Mechanisms Symmetric Cipher Model Substitution techniques Transposition Techniques Stream and Block Ciphers

3. Security Attacks 3 Snooping Traffic Analysis Modification Masquerading Replaying Denial of Service ConfidentialityIntegrityAvailability

4. Security Services and Mechanisms 4 International Telecommunication Union Telecommunication Standardization (ITU-T) Provides: Services Mechanisms

5. Security Services 5 Authentication - assurance that the communicating entity is the one claimed Access Control - prevention of the unauthorized use of a resource Data Confidentiality –protection of data from unauthorized disclosure Data Integrity - assurance that data received is as sent by an authorized entity Non-Repudiation - protection against denial by one of the parties in a communication

6. Security Mechanisms 6 Specific security mechanisms : Implemented on specific layer (OSI model) Encipherment, digital signatures, access controls, data integrity, authentication exchange, routing control, notarization Pervasive security mechanisms : Not related to a specific layer Trusted functionality, security labels, event detection

7. Model for Network Security 7

8. 8 Using this model requires us to: Design a suitable algorithm for the security transformation. Generate the secret information (keys) used by the algorithm. Develop methods to distribute and share the secret information. Specify a protocol enabling the principals to use the transformation and secret information for a security service.

9. 9 Symmetric Cipher Model

10. 10 Known as: Conventional Encryption Single-Key Encryption Plaintext Original text/msg Ciphertext Coded msg Enciphering/Encryption The process of converting the plaintext to ciphertext Deciphering/Decryption The process of converting the ciphertext to plaintext

11. Symmetric Cipher Model (Cont.) 11 Cryptography The developed encryption schemes Cryptanalysis Techniques used to get the plaintext out of the ciphertext without prior knowledge to the encryption scheme (breaking the code) Cryptology Both the cryptography and cryptanalysis

12. More Definitions 12 Unconditional Security The ciphertext provides insufficient information to uniquely determine the corresponding plaintext. Computational Security The time needed for calculations is greater than age of universe

13. Symmetric Cipher Model (Cont.) 13

14. Symmetric Cipher Model 14 Requirements Strong Key  the opponent can not figure it out even if he/she has a number of ciphertexts The key must be exchanged through a secure channel Y = E(K,X) ~ Y = E K (X) X =D(K,Y) ~ X = D K (Y)

15. Brute Force Search 15 Always possible to simply try every key Most basic attack, proportional to key size

16. 16 Substitution Ciphers

17. Lets have Fun 17 You are spying on your friend Ahmed while he is chatting with John, you received the following message: “Ygjcxgvqmnnvjgrgumfgpv” Can you decrypt this message?

18. Answer 18 Ahmed is telling John: “Ygjcxgvqmnnvjgrgumfgpv” “We have to kill the president” Encryption Key: Replacement Table Plaintext ABCDEFGHIJKLMNOPQRSTUVWXYZ Ciphertext CDEFGHIJKLMNOPQRSTUVWXYZAB Encryption Technique Each letter is replaced by the second one after it Remove blanks

19. Caesar Cipher 19 Earliest known substitution cipher by Julius Caesar first attested use in military affairs replaces each letter by 3 rd one after it E.g. meet me after the toga party PHHW PH DIWHU WKH WRJD SDUWB

20. Caesar Cipher (Cont.) 20 Transformation : Mathematically give each letter a number a b c d e f g h i j k l m 0 1 2 3 4 5 6 7 8 9 10 11 12 n o p q r s t u v w x y Z 13 14 15 16 17 18 19 20 21 22 23 24 25 Then have Caesar cipher as: C = E(p) = (p + k) mod (26) p = D(C) = (C – k) mod (26)

21. Caesar Cipher (Cont.) 21 Cryptanalysis Only have 26 possible ciphers A maps to A,B,..Z Could simply try each in turn

22. Monoalphabetic Cipher 22 Rather than just shifting the alphabet Could shuffle (jumble) the letters arbitrarily Each plaintext letter maps to a different random ciphertext letter The key is 26 letters long Plain: abcdefghijklmnopqrstuvwxyz Cipher: DKVQFIBJWPESCXHTMYAUOLRGZN Plaintext: ifwewishtoreplaceletters Ciphertext: WIRFRWAJUHYFTSDVFSFUUFYA

23. Monoalphabetic Cipher Security 23 now have a total of 26! = 4 x 1026 keys with so many keys, might think is secure but would be !!!WRONG!!! Language Characteristics Problem Using the occurrence frequency of each letter, we can deduce the letters in the ciphertext

24. English Letter Frequencies 24

25. Playfair Cipher 25 Invented by Charles Wheatstone in 1854, but named after his friend Baron Playfair. Encrypts multiple letters Uses Playfair Matrix Uses some of the rules to interpret the matrix

26. Playfair Key Matrix 26 A 5X5 matrix of letters based on a keyword Fill in letters of keyword (Avoid repetition) Fill rest of matrix with other letters E.g. using the keyword MONARCHY MONAR CHYBD EFGI/JK LPQST UVWXZ

27. Playfair Rules 27 Plaintext encrypted two letters at a time: if a pair is a repeated letter, insert a filler like 'X', eg. "balloon" encrypts as "ba lx lo on" If both letters fall in the same row, replace each with letter to right (wrapping back to start from end), eg. “ar" encrypts as "RM" If both letters fall in the same column, replace each with the letter below it (again wrapping to top from bottom), eg. “mu" encrypts to "CM" Otherwise each letter is replaced by the one in its row in the column of the other letter of the pair, eg. “hs" encrypts to "BP", and “ea" to "IM" or "JM" (as desired)

28. Group Activity 28 Based on Playfair encryption, encrypt the word “Hello” Key : Note: The key is an arrangement of all of the alphabetic letters LGDBA QMHEC URNI/JF XVSOK ZYWTP

29. Answer 29 Step 1: Group the letters He ll o 1 st rule  repeated letters ll He lx lo Step 2: find the corresponding text in the key He  EC - rule 2 H and e on the same row ( replace each with letter to right)  EC Lx  QZ -- rule 3 L and x at the same column (replace each with the letter below it)  QZ lo  BX -- rule 4 l and o at different rows and columns ( replaced by the one in its row in the column of the other letter of the pair) E (Hello) “ECQZBX”

30. Security of the Playfair Cipher 30 Security much improved over monoalphabetic Since have 26 x 26 = 676 diagrams Was widely used for many years (eg. US & British military in WW1) It can be broken, given a few hundred letters since still has much of plaintext structure

31. Polyalphabetic Ciphers 31 Another approach to improving security is to use multiple cipher alphabets Makes cryptanalysis harder with more alphabets to guess and flatter frequency distribution Use a key to select which alphabet is used for each letter of the message Use each alphabet in turn Repeat from start after end of key is reached

32. Vigenère Cipher 32 Simplest polyalphabetic substitution cipher effectively multiple caesar ciphers key is multiple letters long K = k1 k2... kd i th letter specifies i th alphabet to use use each alphabet in turn repeat from start after d letters in message decryption simply works in reverse

33. 33

34. Example 34 eg using repeated keyword deceptive key: deceptivedeceptivedeceptive plaintext: wearediscoveredsaveyourself ciphertext:ZICVTWQNGRZGVTWAVZHCQYGLMGJ From the previous table lookup the key letter then the plain text letter. The cipher letter is the intersection letter

35. Security of Vigenère Ciphers 35 have multiple ciphertext letters for each plaintext letter Letter frequencies are obscured But not totally lost

36. Autokey Cipher 36 Ideally want a key as long as the message Vigenère proposed the autokey cipher The keyword is prefixed to message as key Still have frequency characteristics to attack Eg. given key deceptive key: deceptivewearediscoveredsav plaintext: wearediscoveredsaveyourself ciphertext: ZICVTWQNGKZEIIGASXSTSLVVWLA

37. One-Time Pad 37 Select a random key that is equal to the message length. Use a table structure such as Vigenère table Problems: Generating long random keys Bandwidth problem  sending the key as long as the Msg

38. 38 Transposition/Permutation Ciphers

39. Transposition (Cont.) 39  The letters of the message are rearranged  Columnar transposition  The number of columns is required  Example: THIS IS A MESSAGE TO SHOW HOW A COLMUNAR TRANSPOSITION WORKS

40. Transposition (Cont.) 40 T H I S I S A M E S S A G E T O S H O W H O W A C O L M U N A R T R A N S P O S I T I O N W O R K S tssoh oaniw haaso lrsto imghw utpir seeoa mrook istwc nasna

41. Group Activity 41 Given the following message “ This is the second lecture” Divide the message onto a block of 5 letters block Transpose the message Use Autokey cipher to encrypt the result Key : “ NetworkSecurity”

42. Stream Vs. Block Ciphers 42  Stream  converts one symbol of plaintext into a symbol of ciphertext  Block  encrypts a group of plaintext symbols as one block.

43. Reading materials 43  Stallings  Chapter 1  Chapter 2