Course code: 2DMI00
Lecturer: Berry Schoenmakers, MF 6.105, email@example.com (or, firstname.lastname@example.org)
Schedule 2020-21 3rd Quarter
- Wednesdays 10.45-12.30h (3rd+4th hour), see Canvas
- Fridays 13.30-15.15h (5th+6th hour), see Canvas
|Week 1||February 3. Preface, Sections 1.1, 1.2.1-3.|
|February 5. Sections 1.2.4, 1.3.1-2.|
|Week 2||February 10. Section 1.3.3.|
|February 12. Section 1.3.4, Appendix A "Fundamental Lemma of Cryptology". Click to try MPyC.|
|Week 3||February 24. Section 2.1.|
|February 26. Section 2.2, Chapter 3.|
|Week 4||March 3. Sections 4.1-4, 4.5.1-2.|
|March 5. Sections 4.5.3, 4.6, 5.1, 5.2.1-2.|
|Week 5||March 10. Sections 5.2.3-4, 5.3.|
|March 12. Sections 5.2.5, 5.4.1.|
|Week 6||March 17. Sections 5.4.2-3.|
|March 19. Chapter 6.|
|Week 7||March 24. Chapter 7.|
|March 26. Chapter 8, MPyC.|
Written exam: Friday April 16, 2021, 13.30-16.30h; resit: Wednesday June 23, 2021, 18.00-21.00h.
Version 1.6 of the Lecture Notes Cryptographic Protocols (incl. solutions to all exercises) is available as of January 30, 2021. Please print out a copy for yourself.
Also see the matching Lecture Slides Cryptographic Protocols. (Handout version of slides without animations).
All exams since 2004 are available as well. Solutions to the exam problems will not be provided; also see Appendix B "Rating of Exercises" to find out which exercises are at exam level.
The following books are recommended as background and advanced resources:
- A Computational Introduction to Number Theory and Algebra (Version 2) by Victor Shoup, Cambridge University Press, 2008. Great textbook providing extensive background, and beyond. Free download available.
- Secure Multiparty Computation and Secret Sharing by Ronald Cramer, Ivan Damgård, and Jesper Buus Nielsen, Cambridge University Press, 2015. Great expository text on information-theoretic secure multiparty computation and supporting techniques. See online information.
- Cryptography: An Introduction by Nigel Smart, McGraw-Hill, 2003. Modern introduction at a reasonable level of detail. The 3rd edition can still be downloaded for free. Text has been reworked into a new book Cryptography Made Simple.
- Introduction to Modern Cryptography by Jonathan Katz and Yehuda Lindell, Chapman & Hall/CRC Press, 2007. An extensive, rigorous, yet accessible treatment of modern cryptography, based on formal security definitions and with security proofs; mostly covering basic encryption and authentication techniques though. See online information.
- Foundations of Cryptography by Oded Goldreich, 2001 (Vol. 1), 2004 (Vol. 2). Thorough treatment of theoretical results in cryptography, with an extensive treatment
of zero-knowledge protocols and general two/multi-party protocols. See online information.
- Fundamentals of Cryptology: A Professional Reference and Interactive Tutorial by Henk van Tilborg, Kluwer Academic Publishers, 2000. See online information. Classic text with many worked examples in Mathematica (PDF and Mathematica notebook).
- Cryptography: Theory and Practice by Douglas Stinson and Maura Paterson, 4th edition, CRC Press, 2018. See online information.
- Complexity and Cryptography: An Introduction by John Talbot and Dominic Welsh, Cambridge University Press, 2006. Accessible treatment mainly of cryptographic algorithms, but also of some cryptographic protocols, combined with the relevant notions and ideas of computational complexity. See online information.
- Handbook of Applied Cryptography by Alfred Menezes, Paul C. van Oorschot, and Scott Vanstone, 1997. Download for free at cacr.uwaterloo.ca/hac/.
Last year's course page.