1. Lecture 4 Page 1 CS 136, Fall 2012 More on Cryptography CS 136 Computer Security Peter Reiher October 9, 2012

2. Lecture 4 Page 2 CS 136, Fall 2012 Outline Desirable characteristics of ciphers Stream and block ciphers Cryptographic modes Uses of cryptography Symmetric and asymmetric cryptography Digital signatures

3. Lecture 4 Page 3 CS 136, Fall 2012 Desirable Characteristics of Ciphers Well matched to requirements of application –Amount of secrecy required should match labor to achieve it Freedom from complexity –The more complex algorithms or key choices are, the worse

4. Lecture 4 Page 4 CS 136, Fall 2012 More Characteristics Simplicity of implementation –Seemingly more important for hand ciphering –But relates to probability of errors in computer implementations Errors should not propagate

5. Lecture 4 Page 5 CS 136, Fall 2012 Yet More Characteristics Ciphertext size should be same as plaintext size Encryption should maximize confusion –Relation between plaintext and ciphertext should be complex Encryption should maximize diffusion –Plaintext information should be distributed throughout ciphertext

6. Lecture 4 Page 6 CS 136, Fall 2012 Stream and Block Ciphers Stream ciphers convert one symbol of plaintext immediately into one symbol of ciphertext Block ciphers work on a given sized chunk of data at a time

7. Lecture 4 Page 7 CS 136, Fall 2012 Stream Ciphers PlaintextCiphertext Key Encryption fsnarT fsnar T SS fsna r q qS fsn a zzqS fs n m mzqS f s rrmzqS f e ermzqS Of course, actual cipher used could be arbitrarily complex

8. Lecture 4 Page 8 CS 136, Fall 2012 Advantages of Stream Ciphers +Speed of encryption and decryption Each symbol encrypted as soon as it’s available +Low error propagation Errors affect only the symbol where the error occurred Depending on cryptographic mode

9. Lecture 4 Page 9 CS 136, Fall 2012 Disadvantages of Stream Ciphers –Low diffusion Each symbol separately encrypted Each ciphertext symbol only contains information about one plaintext symbol –Susceptible to insertions and modifications –Not good match for many common uses of cryptography –Some disadvantages can be mitigated by use of proper cryptographic mode

10. Lecture 4 Page 10 CS 136, Fall 2012 Sample Stream Cipher: RC4 Creates a changing key stream –Supposedly unpredictable XOR the next byte of the key stream with the next byte of text to encrypt XOR ciphertext byte with same key stream byte to decrypt Alter your key stream as you go along

11. Lecture 4 Page 11 CS 136, Fall 2012 Creating an RC4 Key Fill an 8x8 array with 0-255 Choose a key of 1-255 bytes Fill a second 8x8 array with the key –Repeating, as necessary Use simple operation to swap around bytes in the first array That’s your key Swap two array bytes each time you encrypt

12. Lecture 4 Page 12 CS 136, Fall 2012 Characteristics of RC4 Around 100x faster than DES Significant cryptographic weakness in its initial key stream –Fixable by dropping a few hundred of the first keys Easy to use it wrong –Key reuse is a serious problem

13. Lecture 4 Page 13 CS 136, Fall 2012 Block Ciphers PlaintextCiphertext Key Encryption T r a n s f e r $ 1 0 T s r f $ a e 1 n r 0 T r a n s f e r $ 1 0 T s r f $ a e 1 n r 0

14. Lecture 4 Page 14 CS 136, Fall 2012 Advantages of Block Ciphers +Good diffusion Easier to make a set of encrypted characters depend on each other +Immunity to insertions Encrypted text arrives in known lengths Most common Internet crypto done with block ciphers

15. Lecture 4 Page 15 CS 136, Fall 2012 Disadvantages of Block Ciphers –Slower Need to wait for block of data before encryption/decryption starts –Worse error propagation Errors affect entire blocks

16. Lecture 4 Page 16 CS 136, Fall 2012 Cryptographic Modes Let’s say you have a bunch of data to encrypt –Using the same cipher and key How do you encrypt the entire set of data? –Given block ciphers have limited block size –And stream ciphers just keep going

17. Lecture 4 Page 17 CS 136, Fall 2012 The Basic Situation 1840326 $100.00 5610993 $550.00 3370259 $100.00 6840924 $225.00 Let’s say our block cipher has a block size of 7 characters and we use the same key for all Now let’s encrypt J2?@=4l sS^0’sq Dor72m/ 2ci;aE9 Sv&`>oo sS^0’sq Xl3lu*m #rdL04, There’s something odd here... sS^0’sq Is this good? Why did it happen?

18. Lecture 4 Page 18 CS 136, Fall 2012 Another Problem With This Approach 5610993 $550.00 J2?@=4l sS^0’sq Dor72m/ 2ci;aE9 Sv&`>oo sS^0’sq Xl3lu*m #rdL04, What if these are transmissions representing deposits into bank accounts? 1840326350 22015685000 33702598800 5610993479 68409242500 843601810 450 1029 8900 2725 So far, so good... What if account 5610993 belongs to him? Dor72m/ 2ci;aE9 1579 Insertion Attack!

19. Lecture 4 Page 19 CS 136, Fall 2012 What Caused the Problems? Each block of data was independently encrypted –With the same key So two blocks with identical plaintext encrypt to the same ciphertext Not usually a good thing We used the wrong cryptographic mode –Electronic Codebook (ECB) Mode

20. Lecture 4 Page 20 CS 136, Fall 2012 Cryptographic Modes A cryptographic mode is a way of applying a particular cipher –Block or stream The same cipher can be used in different modes –But other things are altered a bit A cryptographic mode is a combination of cipher, key, and feedback –Plus some simple operations

21. Lecture 4 Page 21 CS 136, Fall 2012 So What Mode Should We Have Used? Cipher Block Chaining (CBC) mode might be better Ties together a group of related encrypted blocks Hides that two blocks are identical Foils insertion attacks

22. Lecture 4 Page 22 CS 136, Fall 2012 Cipher Block Chaining Mode Adds feedback into encryption process The encrypted version of the previous block is used to encrypt this block For block X+1, XOR the plaintext with the ciphertext of block X –Then encrypt the result Each block’s encryption depends on all previous blocks’ contents Decryption is similar

23. Lecture 4 Page 23 CS 136, Fall 2012 What About the First Block? If we send the same first block in two messages with the same key, –Won’t it be encrypted the same way? Might easily happen with message headers or standardized file formats CBC as described would encrypt the first block of the same message sent twice the same way both times

24. Lecture 4 Page 24 CS 136, Fall 2012 Initialization Vectors A technique used with CBC –And other crypto modes –Abbreviated IV Ensures that encryption results are always unique –Even for duplicate message using the same key XOR a random string with the first block –plaintext  IV –Then do CBC for subsequent blocks

25. Lecture 4 Page 25 CS 136, Fall 2012 Encrypting With An IV 11010001 First block of message 01001100 Initialization vector 10011101 XOR IV and message Encrypt msg and send IV plus message Second block of message 0001100000110111 Use previous msg for CBC Apply CBC 00101111 Encrypt and send second block of msg No need to also send 1 st block again 10011110

26. Lecture 4 Page 26 CS 136, Fall 2012 How To Decrypt With Initialization Vectors? First block received decrypts to P = plaintext  IV plaintext = P  IV No problem if receiver knows IV –Typically, IV is sent in the message Subsequent blocks use standard CBC –So can be decrypted that way

27. Lecture 4 Page 27 CS 136, Fall 2012 An Example of IV Decryption IP header Encrypted data Initialization vector Now decrypt the message 10011101 And XOR with the plaintext IV 01001100 11010001 The message probably contains multiple encrypted blocks

28. Lecture 4 Page 28 CS 136, Fall 2012 For Subsequent Blocks 00110111 Use previous ciphertext block instead of IV Now decrypt the message 00101111 And XOR with the previous ciphertext block 00011000 11000011

29. Lecture 4 Page 29 CS 136, Fall 2012 Some Important Crypto Modes Electronic codebook mode (ECB) Cipher block chaining mode (CBC) Cipher-feedback mode (CFB) and Output-feedback mode (OFB) Both convert block to stream cipher

30. Lecture 4 Page 30 CS 136, Fall 2012 Uses of Cryptography What can we use cryptography for? Lots of things –Secrecy –Authentication –Prevention of alteration

31. Lecture 4 Page 31 CS 136, Fall 2012 Cryptography and Secrecy Pretty obvious Only those knowing the proper keys can decrypt the message –Thus preserving secrecy Used cleverly, it can provide other forms of secrecy

32. Lecture 4 Page 32 CS 136, Fall 2012 Cryptography and Authentication How can I prove to you that I created a piece of data? What if I give you the data in encrypted form? –Using a key only you and I know Then only you or I could have created it –Unless one of us told someone else the key...

33. Lecture 4 Page 33 CS 136, Fall 2012 Using Cryptography for Authentication If both parties cooperative, standard cryptography can authenticate –Problems with non-repudiation, though What if three parties want to share a key? –No longer certain who created anything –Public key cryptography can solve this problem What if I want to prove authenticity without secrecy?

34. Lecture 4 Page 34 CS 136, Fall 2012 Cryptography and Non- Alterability Changing one bit of an encrypted message completely garbles it –For many forms of cryptography If a checksum is part of encrypted data, that’s detectable If you don’t need secrecy, can get the same effect –By encrypting only the checksum

35. Lecture 4 Page 35 CS 136, Fall 2012 Symmetric and Asymmetric Cryptosystems Symmetric - the encrypter and decrypter share a secret key –Used for both encrypting and decrypting Asymmetric – encrypter has different key than decrypter

36. Lecture 4 Page 36 CS 136, Fall 2012 Description of Symmetric Systems C = E(K,P) P = D(K,C) E() and D() are not necessarily the same operations

37. Lecture 4 Page 37 CS 136, Fall 2012 Advantages of Symmetric Key Systems +Encryption and authentication performed in a single operation +Well-known (and trusted) ones perform faster than asymmetric key systems +Doesn’t require any centralized authority Though key servers help a lot

38. Lecture 4 Page 38 CS 136, Fall 2012 Disadvantage of Symmetric Key Systems –Encryption and authentication performed in a single operation Makes signature more difficult –Non-repudiation hard without servers –Key distribution can be a problem –Scaling

39. Lecture 4 Page 39 CS 136, Fall 2012 Scaling Problems of Symmetric Cryptography K1K1 K1K1 K2K2 K2K2 K3K3 K3K3 K4K4 K4K4 K5K5 K5K5 K6K6 K6K6 How many keys am I going to need to handle the entire Internet????

40. Lecture 4 Page 40 CS 136, Fall 2012 Sample Symmetric Key Ciphers The Data Encryption Standard The Advanced Encryption Standard There are many others

41. Lecture 4 Page 41 CS 136, Fall 2012 The Data Encryption Standard Well known symmetric cipher Developed in 1977, still much used –Shouldn’t be, for anything serious Block encryption, using substitutions, permutations, table lookups –With multiple rounds –Each round is repeated application of operations Only serious problem based on short key

42. Lecture 4 Page 42 CS 136, Fall 2012 The Advanced Encryption Standard A relatively new cryptographic algorithm Intended to be the replacement for DES Chosen by NIST –Through an open competition Chosen cipher was originally called Rijndael –Developed by Dutch researchers –Uses combination of permutation and substitution

43. Lecture 4 Page 43 CS 136, Fall 2012 Increased Popularity of AES Gradually replacing DES –As was intended Various RFCs describe using AES in IPsec FreeS/WAN IPsec (for Linux) includes AES Some commercial VPNs use AES Used in modern Windows systems –Also recent versions of Mac OS

44. Lecture 4 Page 44 CS 136, Fall 2012 Is AES Secure? No complete breaks discovered so far But some disturbing problems –Attacks that work on versions of AES using fewer rounds –Attacks that can get keys in less time than pure brute force But not practical time (e.g. in 2 126 operations) But unusable crypto flaws often lead to usable ones

45. Lecture 4 Page 45 CS 136, Fall 2012 Public Key Encryption Systems The encrypter and decrypter have different keys C = E(K E,P) P = D(K D,C) Often, works the other way, too

46. Lecture 4 Page 46 CS 136, Fall 2012 History of Public Key Cryptography Invented by Diffie and Hellman in 1976 Merkle and Hellman developed Knapsack algorithm in 1978 Rivest-Shamir-Adelman developed RSA in 1978 –Most popular public key algorithm Many public key cryptography advances secretly developed by British and US government cryptographers earlier

47. Lecture 4 Page 47 CS 136, Fall 2012 Practical Use of Public Key Cryptography Keys are created in pairs One key is kept secret by the owner The other is made public to the world If you want to send an encrypted message to someone, encrypt with his public key –Only he has private key to decrypt

48. Lecture 4 Page 48 CS 136, Fall 2012 Authentication With Shared Keys If only two people know the key, and I didn’t create a properly encrypted message - –The other guy must have But what if he claims he didn’t? Or what if there are more than two? Requires authentication servers

49. Lecture 4 Page 49 CS 136, Fall 2012 Authentication With Public Keys If I want to “sign” a message, encrypt it with my private key Only I know private key, so no one else could create that message Everyone knows my public key, so everyone can check my claim directly

50. Lecture 4 Page 50 CS 136, Fall 2012 Scaling of Public Key Cryptography KeKe KdKd KeKe KdKd KeKe KdKd KeKe KdKd KeKe KdKd KeKe KdKd KeKe KdKd KeKe KdKd KeKe KdKd KeKe KdKd KeKe KdKd KeKe KdKd KeKe KdKd Nice scaling properties

51. Lecture 4 Page 51 CS 136, Fall 2012 Key Management Issues To communicate via shared key cryptography, key must be distributed –In trusted fashion To communicate via public key cryptography, need to find out each other’s public key –“Simply publish public keys”

52. Lecture 4 Page 52 CS 136, Fall 2012 Issues of Key Publication Security of public key cryptography depends on using the right public key If I am fooled into using the wrong one, that key’s owner reads my message Need high assurance that a given key belongs to a particular person Which requires a key distribution infrastructure

53. Lecture 4 Page 53 CS 136, Fall 2012 RSA Algorithm Most popular public key cryptographic algorithm In wide use Has withstood much cryptanalysis Based on hard problem of factoring large numbers

54. Lecture 4 Page 54 CS 136, Fall 2012 RSA Keys Keys are functions of a pair of 100-200 digit prime numbers Relationship between public and private key is complex Recovering plaintext without private key (even knowing public key) is supposedly equivalent to factoring product of the prime numbers

55. Lecture 4 Page 55 CS 136, Fall 2012 Comparison of AES and RSA AES is much more complex However, AES uses only simple arithmetic, logic, and table lookup RSA uses exponentiation to large powers –Computationally 1000 times more expensive in hardware, 100 times in software RSA key selection also much more expensive

56. Lecture 4 Page 56 CS 136, Fall 2012 Security of RSA Conjectured that security depends on factoring large numbers –But never proven –Some variants proven equivalent to factoring problem Probably the conjecture is correct Key size for RSA doesn’t have same meaning as DES and AES

57. Lecture 4 Page 57 CS 136, Fall 2012 Attacks on Factoring RSA Keys In 2005, a 663 bit RSA key was successfully factored A 768 bit key factored in 2009 Research on integer factorization suggests keys up to 2048 bits may be insecure Insecure key length will only increase The longer the key, the more expensive the encryption and decryption

58. Lecture 4 Page 58 CS 136, Fall 2012 Elliptical Cryptography RSA and similar algorithms related to factoring products of large primes Other math can be used for PK, instead –Properties of elliptical curves, e.g. Can give same security as other public key schemes, with much smaller keys Widely studied, regarded as safe –Often used for small devices

59. Lecture 4 Page 59 CS 136, Fall 2012 Combined Use of Symmetric and Asymmetric Cryptography Common to use both in a single session Asymmetric cryptography essentially used to “bootstrap” symmetric crypto Use RSA (or another PK algorithm) to authenticate and establish a session key Use AES with that session key for the rest of the transmission

60. Lecture 4 Page 60 CS 136, Fall 2012 Combining Symmetric and Asymmetric Crypto AliceBob K EA K DA K EB K DB K EA K EB KSKS Alice wants to share the key only with Bob Bob wants to be sure it’s Alice’s key C=E(K S,K EB ) Only Bob can decrypt it M=E(C,K DA ) Only Alice could have created it MC=D(M,K EA )K S =D(C,K DB ) But there are problems we’ll discuss later

61. Lecture 4 Page 61 CS 136, Fall 2012 Quantum Cryptography Using quantum mechanics to perform crypto –Mostly for key exchange Rely on quantum indeterminacy or quantum entanglement Existing implementations rely on assumptions –Quantum hacks have attacked those assumptions Not ready for real-world use, yet Quantum computing (to attack crypto) even further off

62. Lecture 4 Page 62 CS 136, Fall 2012 Digital Signature Algorithms In some cases, secrecy isn’t required But authentication is The data must be guaranteed to be that which was originally sent Especially important for data that is long-lived

63. Lecture 4 Page 63 CS 136, Fall 2012 Desirable Properties of Digital Signatures Unforgeable Verifiable Non-repudiable Cheap to compute and verify Non-reusable No reliance on trusted authority Signed document is unchangeable

64. Lecture 4 Page 64 CS 136, Fall 2012 Encryption and Digital Signatures Digital signature methods are based on encryption The basic act of having performed encryption can be used as a signature –If only I know K, then C=E(P,K) is a signature by me –But how to check it?

65. Lecture 4 Page 65 CS 136, Fall 2012 Signatures With Shared Key Encryption Requires a trusted third party Signer encrypts document with secret key shared with third party Receiver checks validity of signature by consulting with trusted third party Third party required so receiver can’t forge the signature

66. Lecture 4 Page 66 CS 136, Fall 2012 For Example, When in the Course of human events it becomes necessary for one KsKs KsKs Elas7pa 1o’gw0mega 30’sswp. 1f43’-s 4 32.doas3 Dsp5.a#l ^o,a 02 When in the Course of human events it becomes necessary for one

67. Lecture 4 Page 67 CS 136, Fall 2012 Signatures With Public Key Cryptography Signer encrypts document with his private key Receiver checks validity by decrypting with signer’s public key Only signer has the private key –So no trusted third party required But receiver must be certain that he has the right public key

68. Lecture 4 Page 68 CS 136, Fall 2012 For Example, When in the Course of human events it becomes necessary for one KeKe KdKd Elas7pa 1o’gw0mega 30’sswp. 1f43’-s 4 32.doas3 Dsp5.a#l ^o,a 02 When in the Course of human events it becomes necessary for one Alice’s public key

69. Lecture 4 Page 69 CS 136, Fall 2012 Problems With Simple Encryption Approach Computationally expensive –Especially with public key approach Document is encrypted –Must be decrypted for use –If in regular use, must store encrypted and decrypted versions

70. Lecture 4 Page 70 CS 136, Fall 2012 Steganography Another means of hiding data in plain sight In general terms, refers to embedding data into some other data In modern use, usually hiding data in an image –People have talked about using sound and other kinds of data

71. Lecture 4 Page 71 CS 136, Fall 2012 An Example Transfer $100 to my savings account Run these through outguess

72. Lecture 4 Page 72 CS 136, Fall 2012 Voila! The one on the right has the message hidden in it

73. Lecture 4 Page 73 CS 136, Fall 2012 How It Works Encode the message in the low order bits of the image Differences in these bits aren’t human- visible More sophisticated methods also work Detected by looking for unlikely patterns Often foiled by altering images Steganography designers try to be robust against these problems

74. Lecture 4 Page 74 CS 136, Fall 2012 What’s Steganography Good For? Used by some printer manufacturers to prove stuff came from them Stories of use by Al-Qaeda –No evidence of truth of stories Recent Shady Rat attacks apparently used it to hide code to contact botnet servers Most useful if opponents don’t suspect you’re using it