* Reading*: text, §9.4, 10.1–10.2, 10.4.2, 10.6,
11.1, 11.3

- 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
- Public key; man-in-the-middle attacks

- Cryptographic Key Infrastructure
- Certificates (X.509, PGP)
- Certificate, key revocation

- Digital Signatures
- udge can confirm, to the limits of technology, that claimed signer did sign message
- RSA digital signatures: sign, then encipher

- Types of attacks
- Forward searches
- Misordered blocks
- Statistical regularities (repetitions)

- Networks and ciphers
- Where to put the encryption
- Link vs. end-to-end

Version of February 27, 2006 at 1:29 PM

You can also obtain a PDF version of this.