CS588: Cryptography, Spring 2005
|
20 January: Lecture 1: Introduction (Notes)
Lectures 25 January: Lecture 2: Entropy (Notes)
1 February: Lecture 4: Enigma (Notes)
3 February: Lecture 5: Finishing Enigma, Projects, Modern Symmetric Ciphers
8 February: Lecture 6: Striving for Confusion (DES)
10 February: Lecture 7: Use and Analysis of Block Ciphers
15 February: Lecture 8: Hashing
22 February: Lecture 9: Detecting Encrypted Viruses (Nate Paul)
24 February: Lecture 10: Modern Block Ciphers (AES)
15 March: Lecture 11: Key Distribution
17 March: Lecture 12: Non-secret Key Cryptosystems (How Euclid, Fermat and Euler Created E-Commerce)
22 March: Lecture 13: Security of RSA (Squeamish Ossifrage)
29 March: Lecture 14: Public-Key Infrastructure
12 April: Lecture 15: Notes on Computational Complexity
12 April: Lecture 16: Security through Complexity (Ana Nora Sovarel)
12 April: Lecture 17: Dating and Voting
14 April: Lecture 18: Money
19 April: Lecture 19: Authentication
21 April: Lecture 20: Malcode
23 April: Lecture 21: Countermeasures
28 April: Lecture 22: Photons and MD5 Collisions (Isabelle Stanton, Chalermpong Worawannotai)
University of Virginia Department of Computer Science CS 588: Cryptology - Principles and Applications |
cs588–staff@cs.virginia.edu |