Outline for October 13, 2023

Reading: text, §10.23–10.5
Due: Homework 2, due October 23; Background Research, due October 27

1. Product ciphers
   2. AES

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

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

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

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

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

ECS 235A, Computer and Information Security Version of October 11, 2023 at 11:27PM

You can also obtain a PDF version of this.