1. ISA 400 Management of Information Security Philip Robbins – March 14, 2015 Cryptography Information Security & Assurance Program University of Hawai'i West Oahu Week #4 1

2. 2 Cryptography Agenda Domain #4: Cryptography Quiz #3 Assignment #3

3. 3 Cryptography Cryptology comes from “Crypto” - Meaning: To Hide Definition: The science of hiding communications. Why? - Protect email, PII, transactions & data. Cryptographic systems use - Codes: “secret keys” - Ciphers: hiding the true meaning of a message

4. 4 Cryptography & Encryption Confidentiality - The process of protecting plaintext messages from monitoring or eavesdropping. - Cryptography vs.. Encryption?? ENCRYPTIONDECRYPTION N1 N2 DATA / PLAINTEXT CLEARTEXT - Algorithm - Key LAN CIPHERTEXT - Algorithm - Key DATA / PLAINTEXT CLEARTEXT

5. 5 Cryptography 3 Basic Elements of Cryptography - Algorithm - Key - Data

6. 6 Cryptography Basic Elements: Algorithm - Describes the process (instruction set) involved in producing a desired output. - In the case of Cryptography what is our desired output? Encryption / cipher text / Confidentiality Does more Complexity = (mean) more Security?

7. 7 Cryptography Non-reputation - Sender can’t deny sending a message. Authentication - Associated with validating a user’s identity - Also associated with the integrity of the message

8. 8 Cryptography Authentication Digital Signatures - Uses Hash Function & Encryption together Digital Certificates - Ensure identity of remote computer - Trust; who are you sending your information to?

9. 9 Cryptography Substitution Algorithm - Caesar’s Cipher - Rotate (shift) alphabet - Easy to decipher (frequency of common words, i.e. “the”) Key? Key Length?

10. 10 Cryptography Transposition Algorithm - Encryption by changing position of plaintext. - Rail Fence Cipher DATA: 'WE ARE DISCOVERED. FLEE AT ONCE‘ KEY: 3 ‘Rails’ (rows) CIPHERTEXT:

11. 11 Cryptography Steganography (not stenography) - Security through obscurity – concealing content. - Not recommended as encryption substitute. Concealment Cipher - Not actually encrypted – just hidden. - A message (hidden) within a message. - Example: Message = Newspaper Page #, Word #, … Running Key Cipher - Text is used for a very long key stream. - Clever use of components in the world. - Example: Key = Every 3 rd word from a book.

12. 12 Cryptography Vernam Cipher - Gilbert Vernam - 1917 - Uses a basic Boolean XOR Function!! XOR Truth Table XOR Logic Gate Symbols

13. 13 Cryptography Stream Cipher: Dividing the message into bits for processing (Encrypting data one bit at a time).

14. 14 Cryptography Stream vs.. Block Cipher

15. 15 Cryptography Block Cipher: Dividing the message into blocks for processing 1 Block

16. 16 Cryptography Key & Algorithm Relationship - Algorithm’s are static mathematic functions. - Algorithm does not change; the key does. - The purpose of a key is to add randomization. - The key is a group of instructions for the algorithms. - Larger key space means better security: 128 bit strength = 2^128 = 3.4 x 10^38 possible keys (key space) - Processing power can brute force keys < 128 bit

17. 17 Cryptography Key & Algorithm Relationship

18. 18 Cryptography Symmetric (Private) Key Algorithm - The same key is used to encipher plaintext to produce cipher text Plaintext ⊕ Key = Ciphertext *and to* - decipher cipher text to yield the original plaintext Ciphertext ⊕ Key = Plaintext

19. 19 Cryptography Symmetric (Private) Key Algorithm - How is confidentiality maintained?

20. 20 Cryptography Symmetric Key Algorithm - Advantages Fast Hard to break if large key is used. - Disadvantages Only provides for confidentiality Key Management Distribution

21. 21 Cryptography Symmetric Key Algorithm - Disadvantages Key Management Assume 10 people want to communicate with each other while ensuring confidentiality. How many keys would you need? = n(n-1)/2 # of communication channels

22. 22 Cryptography Symmetric Key Algorithm - Disadvantages (Most serious deficiency) Distribution How would we transfer symmetric keys securely? What if someone is monitoring our comms? If sent in clear text someone can intercept.

23. 23 Cryptography Asymmetric (Public Key) Encryption - One key is required to encrypt. Plaintext ⊕ Public Key = Ciphertext *and* - another key is required to decrypt. Ciphertext ⊕ Private Key = Plaintext Key Pair {Public Key, Private Key}

24. 24 Cryptography Asymmetric (Public Key) Encryption Key Pair {Public Key, Private Key}

25. 25 Cryptography Asymmetric Encryption given to anyone kept secret

26. 26 Cryptography Asymmetric Encryption - SENDER Messages are encrypted with either the public or private key. The public key can be given to anyone. - RECIEVER Only the matching key pair will decrypt it. The private key is kept secret.

27. 27 Cryptography Asymmetric Encryption - Mathematically, It should not be possible to get a key pair’s private key from the public key. - Anyone with a private key can generate its public pair. - This is done using one-way (hash) functions.

28. 28 Cryptography Asymmetric Encryption - Advantages Key Management Distribution Confidentiality, Integrity, and Non-repudiation - Disadvantages Can’t encrypt large amounts of data.

29. 29 Cryptography Asymmetric Encryption - Advantages Solves Key Management Problem!! Assume you wanted to communicate with 10 other people while ensuring confidentiality. How many keys would you need now?

30. 30

31. 31 Cryptography Hashing - Taking variable amounts of data and compressing it into a fixed length value, producing unique outputs. - A different MD5 hash would indicate the file has been altered or corrupted. - Message digest helps to verify integrity. - Integrity and/or nonrepudiation

32. 32 Cryptography Digital Signatures -Message goes through a Hashing algorithm. -The message and the message digest is encrypted with the sender’s private key. -The receiver validates the digital signature by decrypting it with the sender’s public key. -Provides integrity, authenticity, and non-repudiation. If I use my private key to encrypt something then it proves it came from me.

33. 33 Cryptography Understanding Digital Signatures

34. 34 Cryptography Understanding Digital Signatures How is integrity and non-repudiation maintained?

35. 35 Cryptography Cryptographic Algorithms

36. 36 Cryptography Cryptographic Algorithms Symmetric Key Cryptography: Encryption Standards

37. 37 Cryptography Characteristics of Strong Algorithms: - Confusion Changing a char in plaintext doesn’t create predictable cipher text. Reverse Engineering process is difficult. Contains Complexity. - Diffusion Changes in plaintext creates large change in cipher text; avoiding discovery of key.

38. 38 Cryptography Characteristics of Strong Algorithms: - Complexity A flat cipher is created by distributing the frequency of characters evenly.

39. 39 Cryptography Kerckoff’s Principal: “…the security of a cipher system should depend on the key and not the algorithm…” Why would it be advantageous to release the cipher algorithm to the public? Why wouldn’t it be…?

40. 40

41. 41 How did they do that??? They sell you the private key.

42. 42 Cryptography Attacks Birthday Attack - Used to find the same hash value for two different inputs Reveals any mathematical weaknesses in the hashing algorithm. Total Hashes Input attempts required for 50% chance of output collision

43. 43 Cryptography Attacks Brute-Force Attack - Tries all possible keys in a key space.

44. 44 Cryptography Attacks Mathematical Attacks Properties of the algorithm are attacked. MAIN CATAGORIES Chosen-plaintext attack: access to PT and CT to determine key. Known plaintext attack: access to “known” PT and CT forms. Chosen-ciphertext attack: access to the CT ready to be decrypted. Ciphertext-only attack: access to CT but not the PT. Side-channel attack: misc info, EM emissions, noise, vibrations,...

45. 45 Review Questions Question #1 What is Cryptography?

46. 46 Review Questions Question #1 What is Cryptography? The science of hiding communications.

47. 47 Review Questions Question #2 What is encryption?

48. 48 Review Questions Question #2 What is encryption? Transforming data into an unreadable format.

49. 49 Review Questions Question #3 What is an algorithm?

50. 50 Review Questions Question #3 What is an algorithm? Describes the process (instruction set) involved in producing a desired output.

51. 51 Review Questions Question #4 What is a Cryptographic Key?

52. 52 Review Questions Question #4 What is a Cryptographic Key? Piece of information that controls how the cryptographic algorithm functions (works).

53. 53 Review Questions Question #5 What is Cryptanalysis?

54. 54 Review Questions Question #5 What is Cryptanalysis? Breaking cryptography; act of obtaining plain text from cipher text.

55. 55 Review Questions Question #6 Which of the following is a disadvantage of symmetric key encryption? A.Key Size B.Speed C.Key Management D.Key Strength

56. 56 Review Questions Question #6 Which of the following is a disadvantage of symmetric key encryption? A.Key Size B.Speed C.Key Management D.Key Strength

57. 57 Review Questions Question #7 Which of the following attacks requires an attacker to obtain several encrypted messages that have been encrypted using the same encryption algorithm? A.Know plain text attack B.Cipher text attack C.Clear text attack D.Replay attack

58. 58 Review Questions Question #7 Which of the following attacks requires an attacker to obtain several encrypted messages that have been encrypted using the same encryption algorithm? A.Know plain text attack B.Cipher text attack C.Clear text attack D.Replay attack

59. 59 Review Questions Question #8 Why does a digital signature contain a message digest? A.To detect any alteration of the message B.To indicate the encryption algorithm C.To confirm the identity of the sender D.To enable transmission in a digital format

60. 60 Review Questions Question #8 Why does a digital signature contain a message digest? A.To detect any alteration of the message B.To indicate the encryption algorithm C.To confirm the identity of the sender D.To enable transmission in a digital format

61. 61 Review Questions Question #9 Which is NOT a property of a one-way hash function? A.It converts a message of a fixed length into a message digest of arbitrary length B.It is computationally infeasible to construct two messages with the same digest C.It converts a message of arbitrary length into a message of a fixed length D.Given a digest value, it is computationally infeasible to find the corresponding message

62. 62 Review Questions Question #9 Which is NOT a property of a one-way hash function? A.It converts a message of a fixed length into a message digest of arbitrary length B.It is computationally infeasible to construct two messages with the same digest C.It converts a message of arbitrary length into a message of a fixed length D.Given a digest value, it is computationally infeasible to find the corresponding message

63. 63 Review Questions Question #10 What are the three most important functions that digital signatures perform? A.Integrity, Confidentiality, and Authorization B.Integrity, Authentication, and Nonrepudiation C.Authorization, Authentication, and Nonrepudiation D.Authorization, Detection, and Accountability

64. 64 Review Questions Question #10 What are the three most important functions that digital signatures perform? A.Integrity, Confidentiality, and Authorization B.Integrity, Authentication, and Nonrepudiation C.Authorization, Authentication, and Nonrepudiation D.Authorization, Detection, and Accountability

65. 65 Review Questions Question #11 What is the result of a hash algorithm being applied to a message? A.A digital signature B.A cipher text C.A message digest D.A plaintext

66. 66 Review Questions Question #11 What is the result of a hash algorithm being applied to a message? A.A digital signature B.A cipher text C.A message digest D.A plaintext

67. 67 Review Questions Question #12 A hash value is a fixed-length string used to verify message integrity? A.TRUE B.FALSE

68. 68 Review Questions Question #12 A hash value is a fixed-length string used to verify message integrity? A.TRUE B.FALSE

69. 69 Review Questions Question #13 Why did the NSA decide to drop support for DES? A.The cost was too high. B.The encryption algorithm was too slow. C.The processing power of computers had increased. D.It was too difficult for government agencies to use.

70. 70 Review Questions Question #13 Why did the NSA decide to drop support for DES? A.The cost was too high. B.The encryption algorithm was too slow. C.The processing power of computers had increased. D.It was too difficult for government agencies to use.

71. 71 Review Questions Question #14 Two different messages producing the same hash value results in which of the following? A.Duplicate key B.Corrupt key C.Collision D.Message digest

72. 72 Review Questions Question #14 Two different messages producing the same hash value results in which of the following? A.Duplicate key B.Corrupt key C.Collision D.Message digest

73. 73 Review Questions Question #15 Which of the following is an asymmetric algorithm? A.DES B.AES C.RSA D.Blowfish

74. 74 Review Questions Question #15 Which of the following is an asymmetric algorithm? A.DES B.AES C.RSA D.Blowfish

75. 75 Review Questions Question #16 (last one) What type of cryptographic algorithm is being used?

76. 76 Review Questions Question #16 (last one) What type of cryptographic algorithm is being used? Caesar Cipher / Substitution Algorithm / ROT

77. 77 Quiz #3 Short answer, closed book, closed notes.

78. 78 Questions? probbins@hawaii.edu www2.hawaii.edu/~probbins https://www.dorkatron.com/docs/ISA400/