Lecture 16 Outline

Reading: §10.4–10.5, 11.1, 11.2.1.1
Due: Homework 3, due on May 9, 2018 at 11:59pm; Lab 2, due on May 7, 2018 at 11:59pm

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
3. Interchange and Session Keys
4. Key Exchange
   1. Needham-Schroeder and Kerberos

Matt Bishop Office: 2209 Watershed Sciences Phone: +1 (530) 752-8060 Email: [email protected]

ECS 153, Computer Security Version of May 8, 2018 at 11:01PM

You can also obtain a PDF version of this.