1. 30.1 Chapter 30 Cryptography Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

2. 30.2 Figure 30.1 Cryptography components

3. 30.3 Figure 30.2 Categories of cryptography

4. 30.4 Figure 30.3 Symmetric-key cryptography

5. 30.5 In symmetric-key cryptography, the same key is used by the sender (for encryption) and the receiver (for decryption). The key is shared. Note

6. 30.6 Figure 30.4 Asymmetric-key cryptography

7. 30.7 Figure 30.5 Keys used in cryptography

8. 30.8 Figure 30.6 Comparison between two categories of cryptography

9. 30.9 30-2 SYMMETRIC-KEY CRYPTOGRAPHY Symmetric-key cryptography started thousands of years ago when people needed to exchange secrets (for example, in a war). We still mainly use symmetric-key cryptography in our network security.

10. 30.10 Ciphers 1.Traditional 2.Simple Modern 3.Modern Round

11. 30.11 Traditional Ciphers

12. 30.12 Traditional Ciphers 1.Substitution Cipher 2.Transposition Cipher

13. 30.13 Substitution Ciphers 1.Monoalphabetic Cipher 2.Polyalphabetic Cipher

14. 30.14 A substitution cipher replaces one symbol with another. Note

15. 30.15 Monoalphabetic Cipher 1.A character (or a symbol) in the plaintext is always changed to the same character (or symbol) in the ciphertext regardless of its position in the text. 2.For example, if the algorithm says that character A in the plaintext is changed to character D, every character A is changed to character D. 3.Relationship between characters in the plaintext and the ciphertext is a one-to-one relationship.

16. 30.16 Polyalphabetic Cipher 1.Each occurrence of a character can have a different substitute. 2.The relationship between a character in the plaintext to a character in the ciphertext is a one-to-many relationship. 3.For example, character A could be changed to D in the beginning of the text, but it could be changed to N at the middle.

17. 30.17 The following shows a plaintext and its corresponding ciphertext. Is the cipher monoalphabetic? Example 30.1 Solution The cipher is probably monoalphabetic because both occurrences of L’s are encrypted as O’s.

18. 30.18 The following shows a plaintext and its corresponding ciphertext. Is the cipher monoalphabetic? Example 30.2 Solution The cipher is not monoalphabetic because each occurrence of L is encrypted by a different character. The first L is encrypted as N; the second as Z.

19. 30.19 The shift cipher is sometimes referred to as the Caesar cipher. Note

20. 30.20 Use the shift cipher with key = 15 to encrypt the message “HELLO.” Solution We encrypt one character at a time. Each character is shifted 15 characters down. Letter H is encrypted to W. Letter E is encrypted to T. The first L is encrypted to A. The second L is also encrypted to A. And O is encrypted to D. The cipher text is WTAAD. Example 30.3

21. 30.21 Use the shift cipher with key = 15 to decrypt the message “WTAAD.” Solution We decrypt one character at a time. Each character is shifted 15 characters up. Letter W is decrypted to H. Letter T is decrypted to E. The first A is decrypted to L. The second A is decrypted to L. And, finally, D is decrypted to O. The plaintext is HELLO. Example 30.4

22. 30.22 A transposition cipher reorders symbols in a block of symbols. Note

23. 30.23 Transposition cipher

24. 30.24 Encrypt the message “HELLO MY DEAR,” using the key shown in Figure 30.8. Solution We first remove the spaces in the message. We then divide the text into blocks of four characters. We add a bogus character Z at the end of the third block. The result is HELL OMYD EARZ. We create a three-block ciphertext ELHLMDOYAZER. Example 30.5

25. 30.25 Using Example 30.5, decrypt the message “ELHLMDOYAZER”. Solution The result is HELL OMYD EARZ. After removing the bogus character and combining the characters, we get the original message “HELLO MY DEAR.” Example 30.6

26. 30.26 Modern Ciphers With the advent of the computer, ciphers need to be bit-oriented. This is so because the information to be encrypted is not just text; it can also consist of numbers, graphics, audio, and video data. It is convenient to convert these types of data into a stream of bits, encrypt the stream, and then send the encrypted stream.

27. 30.27 Simple Modern Ciphers 1.XOR Cipher 2.Rotation Cipher 3.Substitution Cipher: S-box 4.Transposition Cipher: P-box

28. 30.28 XOR cipher 1.An XOR operation needs two data inputs plaintext, as the first and a key as the second. 2.One of the inputs is the block to be the encrypted, the other input is a key; the result is the encrypted block. 3.Size of the key, the plaintext, and the ciphertext are all the same.

29. 30.29 Rotation cipher 1.If the length of the original stream is N, after N rotations, we get the original input stream. 2.It is useless to apply more than N - 1 rotations. In other words, the number of rotations must be between 1 and N- 1.

30. 30.30 S-box: Substitution Box Substitution Cipher

31. 30.31 Transposition Cipher: P-box Ciphers 1.Straight Permutation 2.Expansion Permutation 3.Compression Permutation

32. 30.32 P-boxes: straight, expansion, and compression

33. 30.33 Modern Round Ciphers 1.The ciphers of today are called round ciphers because they involve multiple rounds, where each round is a complex cipher made up of the simple ciphers. 2.The key used in each round is a subset or variation of the general key called the round key. 3.If the cipher has N rounds, a key generator produces N keys, Kb Kz,..., KN, where K1 is used in round 1, K2 in round 2, and so on. 4.DES and AES ciphers are referred to as block ciphers because they divide the plaintext into blocks and use the same key to encrypt and decrypt the blocks.

34. 30.34 Modern Round Ciphers 1.DES: Data Encryption Standard 2.AES: Advanced Encryption Standard

35. 30.35 DES DES was designed by IBM and adopted by the U.S. government as the standard encryption method

36. 30.36 DES

37. 30.37 DES 1.DES has two transposition blocks (P-boxes) and 16 complex round ciphers (they are repeated). 2.16 iteration round ciphers are conceptually the same, each uses a different key derived from the original key. 3.Initial and final permutations are keyless straight permutations that are the inverse of each other. 4.Permutation takes a 64-bit input and permutes them according to predefined values.

38. 30.38 DES ROUNDS

39. 30.39 Figure 30.14 One round in DES ciphers

40. 30.40 DES FUNCTION

41. 30.41 Figure 30.15 DES function

42. 30.42 Figure 30.16 Triple DES

43. 30.43 Table 30.1 AES configuration

44. 30.44 AES has three different configurations with respect to the number of rounds and key size. Note

45. 30.45 Figure 30.17 AES

46. 30.46 Figure 30.18 Structure of each round

47. 30.47 Digital Signature 1.A digital signature or digital signature scheme is a mathematical scheme for demonstrating the authenticity of a digital message or document. 2.A valid digital signature gives a recipient reason to believe that the message was created by a known sender, and that it was not altered in transit. 3.Digital signatures are commonly used for software distribution, financial transactions http://www.youdzone.com/signature.html

48. 30.48 Digital Signature http://www.youdzone.com/signature.html Visit this link