- Chapter 1: Introduction: notes ; slides
- Chapter 2: Classical encryption: notes ; slides
- Chapter 3: Block ciphers: notes ; slides
- Chapter 4: Pseudorandom functions: notes ; slides
- Chapter 5: Symmetric encryption: notes ; slides
- Chapter 6: Hash functions: notes ; slides
- Chapter 7: Message authentication: notes ; slides
- Chapter 8: Authenticated encryption: notes ; slides
- Chapter 9: Computational number theory: notes ; more notes ; slides
- Chapter 11: Asymmetric encryption: notes ; slides
- Chapter 12: Digital Signatures: notes ; slides
- Chapter 13: Password-based login: notes ; slides
- Chapter 14: Key distribution: slides
- Chapter 15: Applications and Protocols: notes ; slides
- Appendix: The birthday problem: pdf

- Chapter 3: You can skip the specifics of the design of AES. (But you do need to know what AES is, what are its parameters, and what we know or believe about its security, since AES will often be used as a tool to build other things.)
- Chapter 4: You can skip Sections 4.2.2 and 4.4.
- Chapter 5: You can skip Sections 5.6, 5.7.1, 5.7.2, 5.9 and 5.10.
- Chapter 6: You can ignore anything related to the cr0 and cr1 notions; we are only concerned with cr2, which we call collision-resistance.
- Chapter 11: You can skip Sections 11.2.2, 11.3, the proof of Theorem 11.6, and Theorem 11.7 and its proof.
- Chapter 12: You can skip Sections 12.3.5 and 12.3.6.