Outline for October 11, 2024

Reading: text, § 10.3–10.6
Due: Homework 2, due October 23; Project progress report, due November 1

1. 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

2. 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)

3. RSA
   1. Provides both authenticity and confidentiality
   2. Based on difficulty of computing totient, φ(n), when n is difficult to factor

4. 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

5. Digital Signatures
   1. Judge can confirm, to the limits of technology, that claimed signer did sign message
   2. RSA digital signatures: sign, then encipher, then sign
   3. El Gamal digital signatures

Matt Bishop Office: 2209 Watershed Sciences Phone: +1 (530) 752-8060 Email: mabishop@ucdavis.edu

ECS 235A, Computer and Information Security Version of October 8, 2024 at 7:14PM

You can also obtain a PDF version of this.