Lecture 15 Outline

Reading: text, §10^*, 11.1^*–11.2^*, 11.4^*
Assignments: Homework 3, due Nov. 4; Lab 3, due Nov. 4

1. Greetings and felicitations!
2. Puzzle of the Day
3. Public-Key Cryptography
   1. Basic idea: 2 keys, one private, one public
   2. Cryptosystem must satisfy:
      1. Given public key, computationally infeasible to get private key;
      2. Cipher withstands chosen plaintext attack;
      3. Encryption, decryption computationally feasible (note: commutativity not required)
   3. Benefits: can give confidentiality or authentication or both
4. Use of public key cryptosystem
   1. Normally used as key interchange system to exchange secret keys (cheap)
   2. Then use secret key system (too expensive to use public key cryptosystem for this)
5. RSA
   1. Provides both authenticity and confidentiality
   2. Go through algorithm:
      Idea: C = M^e mod n, M = C^d mod n, with ed mod φ(n) = 1
      Public key is (e, n); private key is d. Choose n = pq; then φ(n) = (p−1)(q−1).
   3. Example: p = 5, q = 7; then n = 35, φ(n) = (5−1)(7−1) = 24. Pick d = 11. Then ed mod φ(n) = 1,
      so e = 11
      To encipher 2, C = M^e mod n = 2¹¹ mod 35 = 2048 mod 35 = 18, and M = C^d mod n = 18¹¹ mod 35 = 2.
   4. Example: p = 53, q = 61; then n = 3233, φ(n) = (53−1)(61−1) = 3120. Pick d = 791. Then e = 71
      To encipher M = RENAISSANCE, use the mapping A = 00, B = 01, …, Z = 25, ␢ = 26.
      Then: M = RE NA IS SA NC E␢ = 1704 1300 0818 1800 1302 0426
      So: C = 1704⁷¹ mod 3233 = 3106; … = 3106 0100 0931 2691 1984 2927
6. Cryptographic Checksums
   1. Function y = h(x): easy to compute y given x; computationally infeasible to compute x given y
   2. Variant: given x and y, computationally infeasible to find a second x′ such that y = h(x′)
   3. Keyed vs. keyless
7. Key Exchange
   1. Needham-Schroeder and Kerberos
   2. Public key; man-in-the-middle attacks
8. Key Generation
   1. Cryptographically random numbers
   2. Cryptographically pseudorandom numbers
   3. Strong mixing function
9. Cryptographic Key Infrastructure
   1. Certificates (X.509, PGP)
   2. Certificate, key revocation
10. Digital Signatures
    1. Judge can confirm, to the limits of technology, that claimed signer did sign message
    2. RSA digital signatures: sign, then encipher