Final Exam: The registrar confirms that the final exam is as previously announced on Thursday December 16 12:30-2:30 pm in our usual classroom.
Problem Set 1 (PostScript) (PDF) Solutions 1 (PostScript) (PDF)
Problem Set 2 (PostScript) (PDF) Solutions 2 (PostScript) (PDF)
Problem Set 3 (PostScript) (PDF) Solutions 3 (PostScript) (PDF)
Problem Set 4 (PostScript) (PDF) Solutions 4 (PostScript) (PDF)
Problem Set 5 (PostScript) (PDF) Solutions 5 (PostScript) (PDF)
Problem Set 6 (PostScript) (PDF) Solutions 6 (PostScript) (PDF)
Problem Set 7 (PostScript) (PDF) Solutions 7 (PostScript) (PDF)
Problem Set 8 (PostScript) (PDF) Solutions 8 (PostScript) (PDF)
Problem Set 9 (PostScript) (PDF) Solutions 9 (PostScript) (PDF)
Notes for lectures 1-2 (Sep 7-9: Information-Theoretic Encryption) (PostScript) (PDF)
Notes for lectures 3-5 (Sep 14-21: Pseudorandom Generators: Unpredictability and Blum-Micali Construction) (PostScript) (PDF)
Notes for lectures 6-7 (Sep 23-28: Pseudorandom Generators: Indistinguishability) (PostScript) (PDF)
Notes for lecture 8 (Sep 30: Chinese Remainder Theorem and Blum-Blum-Shub PRG) (PostScript) (PDF)
Notes for lectures 9-11 (Oct 5-12: Polynomially Secure Encryption; Rabin, Blum-Goldwasser and RSA) (PostScript) (PDF)
Notes for lectures 12-14 (Oct 14-21: One-Way and Trapdoor, Semantic Security, History, Diffie-Hellman, ElGamal, Practical Issues) (PostScript) (PDF)
Notes for lectures 15-18 (Oct 26-Nov 4: Lamport's One-Time Signatures; Collision-Resistant Hashing; Signatures for arbitrary-length messages and Merkle trees/signatures) (PostScript) (PDF)
Notes for lectures 19-20 (Nov 9-16: Random Oracles and Full Domain Hash; PKI) (PostScript) (PDF)
Notes for lectures 21-23 (Nov 18-30: PKI wrap-up; PRFs and symmetric encryption; MACs) (PostScript) (PDF)
Lecture 24 (Dec 2, no notes): Shamir's secret sharing (see A. Shamir, "How to Share a Secret," CACM 22(11), 1979); applications to distributed computation of sums/averages, modular exponentiation, and generic multiplarty computation by Ben-Or, Goldwasser and Wigderson (STOC'88)
Lecture 25 (Dec 7, no notes): Answers to student-submitted questions on cryptography
Lecture 26 (Dec 9, no notes): Course review
Notes for lectures 1-2 (Information-Theoretic Encryption) (PostScript) (PDF)
Notes for lectures 3-5 (Pseudorandom Generators: Unpredictability and Blum-Micali Construction) (PostScript) (PDF)
Notes for lectures 6-7 (Pseudorandom Generators: Indistinguishability) (PostScript) (PDF)
Notes for lecture 8 (Chinese Remainder Theorem and Blum-Blum-Shub PRG) (PostScript) (PDF)
Notes for lectures 9-11 (Polynomially Secure Encryption; Rabin, Blum-Goldwasser and RSA) (PostScript) (PDF)
Notes for lectures 12-14 (One-Way and Trapdoor, Semantic Security, History, Diffie-Hellman, ElGamal, Practical Issues) (PostScript) (PDF)
Notes for lectures 15-18 (Lamport's One-Time Signatures; Collision-Resistant Hashing; Signatures for arbitrary-length messages and Merkle signatures) (PostScript) (PDF)
Notes for lectures 19-20 (Random Oracles and Full Domain Hash; PKI) (PostScript) (PDF)
Notes for lectures 21-24 (PKI wrap-up; PRFs and symmetric encryption; MACs) (PostScript) (PDF)
Note: to view Adobe Acrobat files, you need to install the free Acrobat Reader.