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
- Cryptographic Checksums
- Function y = h(x): easy to compute y given x; computationally infeasible to compute x given y
- Variant: given x and y, computationally infeasible to find a second x′ such that y = h(x′)
- Keyed vs. keyless
- Digital Signatures
- Judge can confirm, to the limits of technology, that claimed signer did sign message
- RSA digital signatures: sign, then encipher
- Interchange and Session Keys
- Key Exchange
- Needham-Schroeder and Kerberos