Computer Security Lecture 2: Classical Encryption Techniques 1

Slide 1

Slide 1 text

Classical Encryption Techniques 1 Classical Encryption Techniques 1

Slide 2

Slide 2 text

Classical Encryption Techniques 1 Symmetric Encryption Substitution Techniques Caesar Cipher Monoalphabetic Cipher Playfair Cipher Hill Cipher

Slide 3

Slide 3 text

Classical Encryption Techniques 1 Symmetric Encryption Substitution Techniques Caesar Cipher Monoalphabetic Cipher Playfair Cipher Hill Cipher

Slide 4

Slide 4 text

Classical Encryption Techniques 1

Slide 5

Slide 5 text

Classical Encryption Techniques 1  Encryption algorithm: The encryption algorithm performs various substitutions and transformations on the plaintext.  Secret key: The secret key is also input to the encryption algorithm. The key is a value independent of the plaintext and of the algorithm. The algorithm will produce a different output depending on the specific key being used at the time.

Slide 6

Slide 6 text

Classical Encryption Techniques 1  Ciphertext: This is the scrambled message produced as output. It depends on the plaintext and the secret key.  Decryption algorithm: This is essentially the encryption algorithm run in reverse. It takes the ciphertext and the secret key and produces the original plaintext.

Slide 7

Slide 7 text

Classical Encryption Techniques 1  Symmetric-key algorithms are algorithms for cryptography that use the same cryptographic keys for both encryption of plaintext and decryption of ciphertext.

Slide 8

Slide 8 text

Classical Encryption Techniques 1 Symmetric Encryption Substitution Techniques Caesar Cipher Monoalphabetic Cipher Playfair Cipher Hill Cipher

Slide 9

Slide 9 text

Classical Encryption Techniques 1 Cipherered text 3 IODQN HDVW DWWDFN DW GDZQ 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 A B C 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 The clear text message would be encoded using a key of 3. 1 FLANK EAST ATTACK AT DAWN Shift the top scroll over by three characters (key of 3), an A becomes D, B becomes E, and so on. 2 The clear text message would be encrypted as follows using a key of 3. Clear text

Slide 10

Slide 10 text

Classical Encryption Techniques 1  Caesar Cipher  Monoalphabetic Ciphers  Playfair Cipher  Hill Cipher  Polyalphabetic Ciphers  Vigenère Cipher  Autokey Cipher  Vernam Cipher

Slide 11

Slide 11 text

Classical Encryption Techniques 1 Symmetric Encryption Substitution Techniques Caesar Cipher Monoalphabetic Cipher Playfair Cipher Hill Cipher

Slide 12

Slide 12 text

Classical Encryption Techniques 1 Caesar Cipher is one of the simplest and most widely known encryption techniques.

Slide 13

Slide 13 text

Classical Encryption Techniques 1

Slide 14

Slide 14 text

Classical Encryption Techniques 1

Slide 15

Slide 15 text

Classical Encryption Techniques 1

Slide 16

Slide 16 text

Classical Encryption Techniques 1  PlainText = dcodex  K=3 1) P=d 2) P=3 3) C=P+K mod 26=3+3 mod 26=6 mod 26 =6 4) C=g

Slide 17

Slide 17 text

Classical Encryption Techniques 1  PlainText = dcodex  K=3 1) P=x 2) P=23 3) C=P+K mod 26=23+3 mod 26=26 mod 26= 0 4) C=a

Slide 18

Slide 18 text

Classical Encryption Techniques 1  P= dcodex  C= gfrgha  K=3

Slide 19

Slide 19 text

Classical Encryption Techniques 1  CipherText = gfrgha  K=3 1) C=g 2) C=6 3) P=C-K mod 26=6-3 mod 26=3 4) P=d

Slide 20

Slide 20 text

Classical Encryption Techniques 1  CipherText = gfrgha  K=3 1) C=a 2) C=0 3) P=C-K mod 26=0-3 mod 26=-3 mod 26 =23 4) P=x

Slide 21

Slide 21 text

Classical Encryption Techniques 1  C= gfrgha  P= dcodex  K=3

Slide 22

Slide 22 text

Classical Encryption Techniques 1  Three important characteristics of this problem enabled us to use a bruteforce cryptanalysis: The encryption and decryption algorithms are known. There are only 25 keys to try. The language of the plaintext is known and easily recognizable.

Slide 23

Slide 23 text

Classical Encryption Techniques 1

Slide 24

Slide 24 text

Classical Encryption Techniques 1 How to implement Caesar Cipher technique on Arabic letters?

Slide 25

Slide 25 text

Classical Encryption Techniques 1 Symmetric Encryption Substitution Techniques Caesar Cipher Monoalphabetic Cipher Playfair Cipher Hill Cipher

Slide 26

Slide 26 text

Classical Encryption Techniques 1 A monoalphabetic cipher uses fixed substitution over the entire message Random Key

Slide 27

Slide 27 text

Classical Encryption Techniques 1  Example: Plaintext alphabets: ABCDEFGHIJKLMNOPQRSTUVWXYZ Ciphertext alphabet: ZEBRASCDFGHIJKLMNOPQTUVWXY  P= ITEMS  Encoding  C= FQAIP  Decoding  P= ITEMS

Slide 28

Slide 28 text

Classical Encryption Techniques 1  Relative Frequency of Letters in English Text

Slide 29

Slide 29 text

Classical Encryption Techniques 1  C=

Slide 30

Slide 30 text

Classical Encryption Techniques 1  cipher letters P and Z are the equivalents of plain letters e and t

Slide 31

Slide 31 text

Classical Encryption Techniques 1  Finally, The complete plaintext

Slide 32

Slide 32 text

Classical Encryption Techniques 1 How to implement Monoalphabetic Cipher technique on Arabic letters?

Slide 33

Slide 33 text

Classical Encryption Techniques 1 Symmetric Encryption Substitution Techniques Caesar Cipher Monoalphabetic Cipher Playfair Cipher Hill Cipher

Slide 34

Slide 34 text

Classical Encryption Techniques 1  The Playfair system was invented by Charles Wheatstone, who first described it in 1854.  Used by many countries during wartime  The Playfair algorithm is based on the use of a 5 x 5 matrix of letters constructed using a keyword.

Slide 35

Slide 35 text

Classical Encryption Techniques 1  In this case, the keyword is monarchy.

Slide 36

Slide 36 text

Classical Encryption Techniques 1  4 Rules: 1) If both letters are the same (or only one letter is left), add an "X" after the first letter. 2) If the letters appear on the same row of your table, replace them with the letters to their immediate right respectively

Slide 37

Slide 37 text

Classical Encryption Techniques 1  4 Rules: 3) If the letters appear on the same column of your table, replace them with the letters immediately below respectively 4) If the letters are not on the same row or column, replace them with the letters on the same row respectively but at the other pair of corners of the rectangle defined by the original pair.

Slide 38

Slide 38 text

Classical Encryption Techniques 1  P=Hide the gold in the tree stump (note the null "X" used to separate the repeated "E"s)  P= HI DE TH EG OL DI NT HE TR EX ES TU MP  K= playfair example

Slide 39

Slide 39 text

Classical Encryption Techniques 1  How to build 5x5 Matrix (assuming that I and J are interchangeable), the table becomes (omitted letters in red):

Slide 40

Slide 40 text

Classical Encryption Techniques 1  P= HI DE TH EG OL DI NT HE TR EX ES TU MP

Slide 41

Slide 41 text

Classical Encryption Techniques 1  P= HI DE TH EG OL DI NT HE TR EX ES TU MP

Slide 42

Slide 42 text

Classical Encryption Techniques 1  P= HI DE TH EG OL DI NT HE TR EX ES TU MP

Slide 43

Slide 43 text

Classical Encryption Techniques 1  P= HI DE TH EG OL DI NT HE TR EX ES TU MP

Slide 44

Slide 44 text

Classical Encryption Techniques 1  P= HI DE TH EG OL DI NT HE TR EX ES TU MP

Slide 45

Slide 45 text

Classical Encryption Techniques 1 C= BM OD ZB XD NA BE KU DM UI XM MO UV IF the message "Hide the gold in the tree stump" becomes "BMODZ BXDNA BEKUD MUIXM MOUVI F"

Slide 46

Slide 46 text

Classical Encryption Techniques 1 Using Playfair Cipher how to decrepit the following cipher text: C= “BMODZ BXDNA BEKUD MUIXM MOUVI F” K= playfair example

Slide 47

Slide 47 text

Classical Encryption Techniques 1 Symmetric Encryption Substitution Techniques Caesar Cipher Monoalphabetic Cipher Playfair Cipher Hill Cipher

Slide 48

Slide 48 text

Classical Encryption Techniques 1  The Hill Cipher was invented by Lester S. Hill in 1929  The Hill Cipher based on linear algebra  Encryption  2 x 2 Matrix Encryption  3 x 3 Matrix Encryption

Slide 49

Slide 49 text

Classical Encryption Techniques 1  square matrix by the equation −1= −1= , where is the identity matrix.  C = P*K mod 26

Slide 50

Slide 50 text

Classical Encryption Techniques 1

Slide 51

Slide 51 text

Classical Encryption Techniques 1  Example of Key 2 x 2  = = 7 8 11 11  plaintext message "short example“  = short example  = ℎ = 18 7 14 17 19 4 23 0 12 15 11 4

Slide 52

Slide 52 text

Classical Encryption Techniques 1  = ℎ = 18 7 14 17 19 4 23 0 12 15 11 4  = ∗ 26  0 1 2 3 ∗ 0 1 = 0 ∗ 0 + 1 ∗ 1 2 ∗ 0 + 3 ∗ 1  7 8 11 11 ∗ 18 7 = 7 ∗ 18 + 8 ∗ 7 11 ∗ 18 + 11 ∗ 7 = 182 275  = 182 275 26 = 0 15 =

Slide 53

Slide 53 text

Classical Encryption Techniques 1  = ℎ = 18 7 14 17 19 4 23 0 12 15 11 4

Slide 54

Slide 54 text

Classical Encryption Techniques 1  = ℎ = 18 7 14 17 19 4 23 0 12 15 11 4

Slide 55

Slide 55 text

Classical Encryption Techniques 1  = ℎ = 18 7 14 17 19 4 23 0 12 15 11 4

Slide 56

Slide 56 text

Classical Encryption Techniques 1  = ℎ = 18 7 14 17 19 4 23 0 12 15 11 4

Slide 57

Slide 57 text

Classical Encryption Techniques 1  = ℎ = 18 7 14 17 19 4 23 0 12 15 11 4

Slide 58

Slide 58 text

Classical Encryption Techniques 1  =  This gives us a final ciphertext of "APADJ TFTWLFJ"

Slide 59

Slide 59 text

Classical Encryption Techniques 1  =  This gives us a final ciphertext of "APADJ TFTWLFJ“  = = 7 8 11 11  We want to find −1

Slide 60

Slide 60 text

Classical Encryption Techniques 1  1 − ℎ ℎ  = 7 ∗ 11 − 8 ∗ 11 = −11 26 = 15 −1 = 1 26 = 15 ∗ −1 15 ∗ −1 26 = 1 Try and Test 1 26 = 105 105 mod 26 =1 −1 = 7

Slide 61

Slide 61 text

Classical Encryption Techniques 1  2 − ℎ  = − −  7 8 11 11 = 11 −8 −11 7 mod 26 = 11 18 15 7

Slide 62

Slide 62 text

Classical Encryption Techniques 1  3 ℎ ℎ ℎ  7 ∗ 11 18 15 7 = 77 126 105 49 26 = 25 22 1 23 = −1

Slide 63

Slide 63 text

Classical Encryption Techniques 1  = = 0 15 0 3 9 19 5 19 22 11 5 9

Slide 64

Slide 64 text

Classical Encryption Techniques 1  = = 0 15 0 3 9 19 5 19 22 11 5 9

Slide 65

Slide 65 text

Classical Encryption Techniques 1  = = 0 15 0 3 9 19 5 19 22 11 5 9

Slide 66

Slide 66 text

Classical Encryption Techniques 1  = = 0 15 0 3 9 19 5 19 22 11 5 9

Slide 67

Slide 67 text

Classical Encryption Techniques 1  = = 0 15 0 3 9 19 5 19 22 11 5 9

Slide 68

Slide 68 text

Classical Encryption Techniques 1  = = 0 15 0 3 9 19 5 19 22 11 5 9

Slide 69

Slide 69 text

Classical Encryption Techniques 1 Using Hill Cipher how to implement 3x3 matrix encryption ? The key for a hill cipher is a matrix e.g. = 2 4 5 9 2 1 3 17 7 and message= ATTACK AT DAWN

Slide 70

Slide 70 text

Classical Encryption Techniques 1  Use MS Word  Send me mail to [email protected] with email subject “ Classical Encryption Techniques 1 “  Put your name on Arabic with department and section on word and email body  Finally, press Send  Deadline Next Lecture

Slide 71

Slide 71 text

Classical Encryption Techniques 1 facebook.com/mloey [email protected] twitter.com/mloey linkedin.com/in/mloey [email protected] mloey.github.io