1. CSCE 715: Network Systems Security Chin-Tser Huang huangct@cse.sc.edu University of South Carolina

2. 08/31/20102 Block Ciphers One of the most widely used types of cryptographic algorithms Provide confidentiality and/or authentication services E.g. DES (Data Encryption Standard)

3. 08/31/20103 Block vs Stream Ciphers Block ciphers divide message into blocks, each of which is then encrypted into ciphertext block of same length Like a substitution on very big characters (64 bits or more) Stream ciphers encrypt message a bit or byte at a time

4. 08/31/20104 Block Cipher Principles Most symmetric block ciphers are based on a Feistel Cipher Structure Needed since must be able to decrypt ciphertext to recover messages efficiently Block ciphers look like an extremely large substitution Would need table of 2 64 entries if block size is 64 bits Instead, create from smaller building blocks using idea of product cipher

5. 08/31/20105 Shannon’s Proposal Cipher needs to completely obscure statistical properties of original message One-time pad does this, but impractical In 1949 Claude Shannon proposed two more practical concepts of confusion and diffusion diffusion – dissipates statistical structure of plaintext over bulk of ciphertext confusion – makes relationship between ciphertext and key as complex as possible

6. 08/31/20106 Substitution-Permutation Networks Modern substitution-transposition product cipher Basis of modern block ciphers Achieve diffusion by performing some permutation followed by applying some function Achieve confusion by applying complex substitution algorithm

7. 08/31/20107 Feistel Cipher Structure Horst Feistel devised the feistel cipher based on concept of invertible product cipher Input block partitioned into two halves process through multiple rounds in each round, first perform a substitution on left data half based on round function of right half & subkey then have permutation swapping halves Implement Shannon’s substitution- permutation network concept

8. 08/31/20108 Feistel Cipher Structure

9. 08/31/20109 Feistel Cipher Design Principles Block size increasing block size improves security, but slows cipher Key size increasing key size improves security, makes exhaustive key searching harder, but may slow cipher Number of rounds increasing number of rounds improves security, but slows cipher Subkey generation greater complexity can make analysis harder, but slows cipher Round function greater complexity can make analysis harder, but slows cipher Fast software en/decryption & ease of analysis are more recent concerns for practical use and testing

10. 08/31/201010 Feistel Encryption and Decryption

11. 08/31/201011 Data Encryption Standard (DES) Most widely used block cipher in world First developed by IBM, adopted in 1977 by NBS (now NIST) Its pioneer LUCIFER encrypts 64-bit data block using 128-bit key DES encrypts 64-bit data block using 56-bit key Was controversial because of key size reduction, but encouraged subsequent research in cryptography

12. 08/31/201012 DES Encryption

13. 08/31/201013 Initial Permutation (IP) First step of the data computation IP reorders the input data bits Even bits to LH half, odd bits to RH half Quite regular in structure (easy in h/w) see textbook Table 3.2 Example: IP(675a6967 5e5a6b5a) = (ffb2194d 004df6fb)

14. 08/31/201014 Initial Permutation Table

15. 08/31/201015 DES Round Structure Uses two 32-bit L & R halves Like any Feistel cipher, can be described as L i = R i–1 R i = L i–1 xor F(R i–1, K i ) Take 32-bit R half and 48-bit subkey expands R to 48 bits using perm E XOR with subkey passes through 8 S-boxes to get 32-bit result finally permutes this using 32-bit perm P

16. 08/31/201016 Single Round of DES

17. 08/31/201017 Expansion and Permutation

18. 08/31/201018 Substitution Boxes (S-box) Have eight S-boxes which map 6 to 4 bits Each S-box works as follows outer bits 1 & 6 (row bits) select one row inner bits 2-5 (col bits) are substituted result is 8 lots of 4 bits, or 32 bits Row selection depends on both data and key feature known as autoclaving (autokeying) Example: S(18 09 12 3d 11 17 38 39) = 5fd25e03

19. 08/31/201019 Definition of DES S-box

20. 08/31/201020 Structure of DES S-boxes

21. 08/31/201021 DES Key Schedule Derive subkeys used in each round Consist of initial permutation of the key (PC1) which selects 56-bits in two 28-bit halves 16 stages consisting of selecting 24 bits from each half permuting them by PC2 for use in function F rotating each half separately either 1 or 2 places depending on the key rotation schedule K

22. 08/31/201022 DES Decryption Decryption must unwind steps of data computation With Feistel design, do encryption steps again Use subkeys in reverse order (SK16 … SK1) IP undoes final step (IP -1 ) of encryption 1st round with SK16 undoes 16th encryption round, and proceed until 16th round with SK1 undoes 1st encryption round Final IP -1 undoes initial permutation IP Thus recovering original data value

23. 08/31/201023 Avalanche Effect Desirable property of encryption algorithm Changing one bit in plaintext or key results in changing approx. half of bits in ciphertext DES exhibits strong avalanche effect

24. 08/31/201024 Strength of DES – Key Size 56-bit keys have 2 56 = 7.2 x 10 16 values Brute-force search looks hard But recent advances have shown possibility in 1997 on Internet in a few months in 1998 on dedicated h/w (EFF) in a few days in 1999 above combined in 22hrs! Still, must be able to recognize plaintext Alternatives to DES have been proposed and adopted

25. 08/31/201025 Strength of DES – Timing Attacks Attack actual implementation of cipher Use knowledge of consequences of implementation to derive knowledge of some/all subkey bits Specifically use fact that calculations can take varying times depending on the value of the inputs to it

26. 08/31/201026 Strength of DES – Analytic Attacks Several analytic attacks on DES Utilize some deep structure of the cipher by gathering information about encryptions can eventually recover some/all of the sub-key bits if necessary then exhaustively search for the rest Generally are statistical attacks differential cryptanalysis linear cryptanalysis related key attacks

27. 08/31/201027 Block Cipher Design Principles Basic principles are still like Feistel in 1970’s Number of rounds more is better, making exhaustive search the best attack Function F provides “confusion”, is nonlinear, avalanche Key schedule complex subkey creation, key avalanche

28. 08/31/201028 Modes of Operation Block ciphers encrypt fixed size blocks Given arbitrary amount and type of information to encrypt, we need specific ways to use block ciphers in practice Four were defined for DES in ANSI standard Now have 5 modes for DES and AES

29. 08/31/201029 Electronic Codebook (ECB) Message is broken into independent blocks which are encrypted Each block is a value which is substituted, like a codebook Each block is encoded independently of the other blocks C i = E K1 (P i ) Uses: secure transmission of single value

30. 08/31/201030 Electronic Codebook (ECB)

31. 08/31/201031 Advantages and Limitations of ECB Repetitions in message may show in ciphertext if repetition aligned with message block particularly with graphic data or with messages that change very little, which become a code-book analysis problem Weakness due to encrypted message blocks being independent Main use is sending a few blocks of data

32. 08/31/201032 Cipher Block Chaining (CBC) Message is broken into blocks that are chained together in the encryption operation Each previous cipher block is chained with current plaintext block Use Initial Vector (IV) to start process C i = E K1 (P i XOR C i-1 ) C -1 = IV Uses: bulk data encryption, authentication

33. 08/31/201033 Cipher Block Chaining (CBC)

34. 08/31/201034 Advantages and Limitations of CBC Each ciphertext block depends on all message blocks Thus, a change in message affects all ciphertext blocks after the change as well as the original block Need Initial Vector (IV) known to sender & receiver however if IV is sent in the clear, an attacker can change bits of the first block, and change IV to compensate hence either IV must be a fixed value or it must be sent encrypted in ECB mode before rest of message At end of message, handle possible last short block by padding either with known non-data value (e.g. nulls) or pad last block with count of pad size E.g. [b1 b2 b3 0 0 0 0 5] means 3 data bytes followed by 5 bytes of pad+count

35. 08/31/201035 Cipher FeedBack (CFB) Message is treated as a stream of bits XOR-ed with output of the block cipher to produce ciphertext Ciphertext is also feedback for next stage Standard allows any number of bit (1, 8, 64 or whatever) to be feed back denoted CFB-1, CFB-8, CFB-64 etc Most efficient when using all 64 bits (CFB-64) C i = P i XOR E K1 (C i-1 ) C -1 = IV Uses: stream data encryption, authentication

36. 08/31/201036 Cipher FeedBack (CFB)

37. 08/31/201037 Advantages and Limitations of CFB Appropriate when data arrives in bits/bytes Most common stream mode Need to stall while do block encryption after every n-bits Errors propagate for several blocks

38. 08/31/201038 Output FeedBack (OFB) Message is treated as a stream of bits XOR-ed with output of the block cipher to produce ciphertext Output of block cipher is feedback for next stage Feedback is independent of message Can be computed in advance C i = P i XOR O i O i = E K1 (O i-1 ) O -1 = IV Uses: stream encryption over noisy channels

39. 08/31/201039 Output FeedBack (OFB)

40. 08/31/201040 Advantages and Limitations of OFB Used when error feedback is a problem or where need to encrypt before message is available Superficially similar to CFB, but feedback is from the output of cipher and is independent of message Must never reuse the same sequence (key+IV) Sender and receiver must remain in sync, and some recovery method is needed to ensure this occurs Structure is similar to stream ciphers but with the distinction that OFB encrypts one plaintext block every time

41. 08/31/201041 Counter (CTR) A “new” mode, though proposed early on Similar to OFB, but encrypts counter value rather than any feedback value Must have a different counter value for every plaintext block (never reused) C i = P i XOR O i O i = E K1 (i) Uses: high-speed network encryptions

42. 08/31/201042 Counter (CTR)

43. 08/31/201043 Advantages and Limitations of CTR Efficiency can do parallel encryptions in advance of need good for bursty high speed links Random access to encrypted data blocks Provable security (as good as other modes) But must ensure never reuse counter values

44. Comparison of Modes of Operation 08/31/201044

45. 08/31/201045 Next Class More symmetric encryption standards Read Chapters 5, 6, 7