Introduction to Modern Cryptography

By: Mihir Bellare and Phillip Rogaway

Functions as course notes for UCSD courses CSE207 and CSE291 and UCD course ECS 227. Feedback, corrections and comments on these notes is much appreciated.


Chapter Files Last Modified
Table of Contents postscript ; pdf Oct 29, 2003
1. Introduction postscript ; pdf Oct 1, 2003
2. Block Ciphers postscript ; pdf Oct 8, 2003
3. Pseudorandom Functions postscript ; pdf Oct 28, 2003
4. Symmetric Encryption postscript ; pdf Oct 29, 2003
5. Hash Functions postscript ; pdf Nov 5, 2003
6. Message Authentication postscript ; pdf Oct 30, 2002
7. Authenticated Encryption postscript ; pdf
8. Computational Number Theory postscript ; pdf Oct 30, 2002
9. Number-Theoretic Primitives postscript ; pdf Nov 26, 2002
10. Asymmetric Encryption postscript ; pdf Nov 14, 2002
11. Digital Signatures postscript ; pdf Dec 5, 2002
12. Authenticated Key Exchange postscript ; pdf
13. The Asymptotic Approach
14. Interactive Proofs and Zero-Knowledge postscript ; pdf
Appendix A: The birthday problem postscript ; pdf Oct 4, 2002
Appendix B: Tail inequalities postscript ; pdf Oct 1, 2001
Appendix C: Information-Theoretic security postscript ; pdf Oct 22, 2002
Bibliography postscript ; pdf Oct 4, 2002