Outline for October 11, 2021

Reading: text, §10.4–10.5, 11.1, 11.2
Due: Homework 2, due October 20

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

2. 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. Session and interchange keys

4. Key Exchange

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, 2021 at 10:48PM

You can also obtain a PDF version of this.