Lecture 19 Outline (May 11, 2015)

Reading: §9
Assignment: Homework 3, due May 20, 2015

1. Greetings and felicitations!
2. Product ciphers: DES, AES
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, b̸ = 26.
      Then: M = RE NA IS SA NC Eb̸ = 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