* Reading*: §9.4, 10.1–10.2

- Greetings and felicitations!
- Puzzle of the day

- 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

- Function
- Key Exchange
- Needham-Schroeder and Kerberos

You can also obtain a PDF version of this. | Version of November 19, 2006 at 7:25 PM |