1. Encipherment Using Modern Symmetric-Key Ciphers

2. 8.2 Objectives ❏ To show how modern standard ciphers, such as DES or AES, can be used to encipher long messages.

3. 8.3 8-1 USE OF MODERN BLOCK CIPHERS Symmetric-key encipherment can be done using modern block ciphers. Modes of operation have been devised to encipher text of any size employing either DES or AES.

4. 8.4 Continued Modes of operation

5. 8.5 The simplest mode of operation is called the electronic codebook (ECB) mode. Electronic Codebook (ECB) Mode Electronic codebook (ECB) mode

6.  Pattern at block level are preserved  Block independence creates opportunities for Eve to exchange some cipher text block without knowing key. 8.6

7. Assume that Eve works in a company a few hours per month (her monthly payment is very low). She knows that the company uses several blocks of information for each employee in which the seventh block is the amount of money to be deposited in the employee’s account. Eve can intercept the ciphertext sent to the bank at the end of the month, replace the block with the information about her payment with a copy of the block with the information about the payment of a full-time colleague. Each month Eve can receive more money than she deserves. Example

8. 8.8 Error Propagation A single bit error in transmission can create errors in the corresponding block. However, the error does not have any effect on the other blocks.

9. 8.9 In CBC mode, each plaintext block is exclusive-ored with the previous ciphertext block before being encrypted. Cipher Block Chaining (CBC) Mode Cipher block chaining (CBC) mode

10. 8.10 Cipher block chaining (CBC) mode

11. Continued It can be proved that each plaintext block at Alice’s site is recovered exactly at Bob’s site. Because encryption and decryption are inverses of each other, Initialization Vector (IV) The initialization vector (IV) should be known by the sender and the receiver.

12. 8.12 Error Propagation In CBC mode, a single bit error in ciphertext block C j during transmission may create error in most bits in plaintext block P j during decryption.

13. 8.13 In some situations, we need to use DES or AES as secure ciphers, but the plaintext or ciphertext block sizes are to be smaller. Cipher Feedback (CFB) Mode Encryption in cipher feedback (CFB) mode

14. 8.14 The relation between plaintext and ciphertext blocks is shown below: In CFB mode, encipherment and decipherment use the encryption function of the underlying block cipher. Note

15. 8.15 CFB as a Stream Cipher Cipher feedback (CFB) mode as a stream cipher

16. 8.16 In this mode each bit in the ciphertext is independent of the previous bit or bits. This avoids error propagation. Output Feedback (OFB) Mode Encryption in output feedback (OFB) mode

17. 8.17 OFB as a Stream Cipher Output feedback (OFB) mode as a stream cipher

18. 8.18 In the counter (CTR) mode, there is no feedback. The pseudorandomness in the key stream is achieved using a counter. Counter (CTR) Mode Encryption in counter (CTR) mode

19. 8.19 Counter (CTR) mode as a stream cipher

20. 8.20 Comparison of Different Modes

21. 8.21 USE OF STREAM CIPHERS Although the five modes of operations enable the use of block ciphers for encipherment of messages or files in large units and small units, sometimes pure stream are needed for enciphering small units of data such as characters or bits. RC4 A5/1

22. RC4 RC4 is a byte-oriented stream cipher in which a byte (8 bits) of a plaintext is exclusive-ored with a byte of key to produce a byte of a ciphertext. State RC4 is based on the concept of a state.

23. 8.23 The idea of RC4 stream cipher

24. 8.24 Initialization Initialization is done in two steps:

25. Key Stream Generation The keys in the key stream are generated, one by one.

26. 8.26 Algorithm

27. 8.27 Algorithm Continued

28. 8.28 A5/1 (a member of the A5 family of ciphers) is used in the Global System for Mobile Communication (GSM), a network for mobile telephone communication.. A5/1 General outline of A5/1

29. 8.29 Key Generator A5/1 uses three LFSRs with 19, 22, and 23 bits. Three LFSR’s in A5/1

30. 8.30 Initialization 1. set all bits in three LFSRs to 0. 2. Mix the 64 bit key with the value of register according to following code 3. Repeat above procedure but use 22 bit frame buffer

31. 8.31 4. For 100 cycles clock the whole generator but use majority function to see which LFSR should be clocked.

32. 1011110110101101010 1011100100101010111001 10101010011011101100101 clock control 181716 0 21 20 0 0 21 22 20 C3 C2 C1 R2 R1 R3 1 1 0 0 1 011110110101101010 011100100101010111001 0101010011011101100101 111101101011010101 1 1 0 0 1 A5/1 working example

33. 8.33 Encryption/Decryption The bit streams created from the key generator are buffered to form a 228-bit key that is exclusive-ored with the plaintext frame to create the ciphertext frame. Encryption/decryption is done one frame at a time.

34.  Prevent (or at least detect) unauthorized modification of data  Encryption provides confidentiality (prevents unauthorized disclosure)  Encryption alone does not assure integrity 8.34

35.  The cryptography systems that we have studied so far provide secrecy, or confidentiality, but not integrity. However, there are occasions where we may not even need secrecy but instead must have integrity  One way to preserve the integrity of a document is through the use of a fingerprint. If Alice needs to be sure that the contents of her document will not be changed, she can put her fingerprint at the bottom of the document. 8.35

36. 11.36 The electronic equivalent of the document and fingerprint pair is the message and digest pair. Message and Message Digest Message and digest

37. 11.37 The two pairs (document / fingerprint) and (message / message digest) are similar, with some differences. The document and fingerprint are physically linked together. The message and message digest can be unlinked separately, and, most importantly, the message digest needs to be safe from change. Difference The message digest needs to be safe from change. Note

38. 11.38 Checking Integrity Checking integrity

39. 11.39 A cryptographic hash function must satisfy three criteria: preimage resistance, second preimage resistance, and collision resistance. Cryptographic Hash Function Criteria Criteria of a cryptographic hash function

40. 11.40 Preimage Resistance Preimage

41. 11.41 Second Preimage Resistance Second preimage

42. 11.42 Collision Resistance Continued Collision

43.  A message digest does not authenticate the sender of the message. To provide message authentication, Alice needs to provide proof that it is Alice sending the message and not an impostor. The digest created by a cryptographic hash function is normally called a modification detection code (MDC). What we need for message authentication is a message authentication code (MAC). 8.43

44.  A modification detection code (MDC) is a message digest that can prove the integrity of the message: that message has not been changed.  If Alice needs to send a message to Bob and be sure that the message will not change during transmission, Alice can create a message digest, MDC, and send both the message and the MDC to Bob.  Bob can create a new MDC from the message and compare the received MDC and the new MDC. If they are the same, the message has not been changed. 8.44

45. 8.45

46. 11.46 Message Authentication Code (MAC) Message authentication code

47. 11.47 The security of a MAC depends on the security of the underlying hash algorithm. Note

48. 11.48 Nested MAC Continued Nested MAC

49. 11.49 HMAC Continued Details of HMAC Ipad=(36)H Opad=(5c)H

50. 11.50 Continued CMAC

51. 8.51