1. Symmetric Cipher Model Plaintext input 1- encryption algorithm 2- secret key Encryption Cipher text output Cipher text input 1- Decryption algorithm 2- secret key Decryption Plaintext output

2. Symmetric Cipher Model Plaintext: The original intelligible message or data that is fed into the algorithm as input. Encryption algorithm: The encryption algorithm performs various substitutions and transformations on the plaintext. Secret key: The secret key is also an input to the encryption algorithm. Ciphertext: The scrambled unintelligible message produced as output. Decryption algorithm: It takes the ciphertext and the secret key to produce the original plaintext.

3. Symmetric Cipher Model

4. Computer Security ( CS4800 ) Lecture 4 Ch.2 Classical Encryption Techniques Prepared by Dr. Lamiaa Elshenawy

5. Security Mathematics Encryption Y = E(K, X) Decryption X = D(K, Y) Chipertext Plaintext Secrete key Encryption algorithm Decryption algorithm

6. Security Requirements Strong encryption algorithm Secret key should be secret (sender/receiver)

7. Symmetric Cipher Model - Cryptology 1- Cryptography (enciphering) 2- Cryptanalysis (deciphering) - Cryptanalyst

8. Cryptography Encryption techniques  Substitution techniques  Transposition techniques Secret keys  Symmetric (single-key)  Asymmetric (two-key) Plaintext processing  Block cipher  Stream cipher

9. Cryptanalysis and Brute-Force Attack  Cryptanalysis ( plaintext-ciphertext pairs)  Brute-force attack (try possible keys) Objective recover the key

10. Cryptanalysis and Brute-Force Attack Unconditionally secure Computationally secure  Cost of breaking cipher > value of encrypted information.  Time of breaking cipher > lifetime of information.

11. 4-bit key 56-bit key (DES) 128-bit key (AES) Key Size (bits)Number of Alternative Keys Time required at 1 decryption/µs Time required at 10 6 decryptions/µs 32 2 32 = 4.3  10 9 2 31 µs= 35.8 minutes2.15 milliseconds 56 2 56 = 7.2  10 16 2 55 µs= 1142 years10.01 hours 128 2 128 = 3.4  10 38 2 127 µs= 5.4  10 24 years5.4  10 18 years 168 2 168 = 3.7  10 50 2 167 µs= 5.9  10 36 years5.9  10 30 years 26 characters (permutation) 26! = 4  10 26 2  10 26 µs= 6.4  10 12 years6.4  10 6 years Cryptanalysis and Brute-Force Attack

12. Symmetric Cipher Techniques Caesar Cipher Monoalphabetic Ciphers Playfair Cipher Hill Cipher Polyalphabetic Ciphers (Vigenère cipher–Vernam cipher) One-Time Pad - Substitution techniques - Transposition techniques Rail fence

13. Caesar Cipher plain: meet me after the party cipher: PHHW PH DIWHU WKH SDUWB abcdefghijklmnopqrstuvwxyz DEFGHIGKLMNOPQRSTUVWXYZABC Letter 3 rd letter

14. Caesar Cipher C = E(K, P) = (P + K) mod 26 P = D(K, C) = (C - K) mod 26 abcdefghijklm 0123456789 10 1112 nopqrstuvwxyz 13141516171819202122232425

15. Monoalphabetic Ciphers

17. Playfair Cipher 5 × 5 matrix Allied forces “MONARCHY” MONAR CHYBD EFGI/JK LPQST UVWXZ World War II

18. Hill Cipher C = E(K, P) = PK mod 26 P = D(K, C) = CK -1 mod 26 For 3 × 3 matrix

19. Polyalphabetic Ciphers Vigenère Cipher C i = (p i + k i mod m ) mod 26 p i = (C i - k i mod m ) mod 26

20. Vigenère Cipher “deceptive”

21. Vernam cipher

22. One-Time Pad Random key Unbreakable

23. Transposition techniques Rail fence “meet me after the toga party”

24. Symmetric Cipher Techniques Rotor machines Hebern rotor machine

25. Steganography Character marking Invisible ink Pin puncture Type writer correction ribbon

26. Thank you for your attention