| Date | Topic | Notes/References | |
|---|---|---|---|
| Wed | Sept 3 | intro to cryptography | week 1 (Boneh) |
| Mon | Sept 8 | one-time pad, key size lower bound | [BS, Sec. 2.1] |
| Wed | Sept 10 | stream cipher, semantic security | [BS, Sec. 2.2] |
| Mon | Sept 15 | bit-guessing, a first reduction | [BS, Sec. 2.2.5] |
| Wed | Sept 17 | PRG security | [BS, Thm. 3.1], cool talk tmr |
| Mon | Sept 22 | PRG properties; RC4 | [BS, Secs. 3.1 & 3.9] |
| Wed | Sept 25 | RC4, Salsa20, cryptanalysis | [BS, Sec. 3.6] |
| Mon | Sept 29 | coin flipping & bit commitment | [BS, Sec. 3.12] |
| Tues | Sept 30 | Homework 1 released (due Oct 20): Latex | |
| Wed | Oct 1 | block cipher, PRF, PRP; PRF to PRG | [BS, Secs. 4.1 & 4.4; Thm. 4.8] |
| Mon | Oct 6 | DES, PRF to PRP (Feistel and Luby-Rackoff) | [BS, Secs. 4.2 & 4.5; Thm. 4.9] |
| Wed | Oct 8 | Merkle puzzles in random permutation model | [BS, Sec. 10.8], Merkle's notes |
| Mon | Oct 13 | No class: Thanksgiving Day | |
| Wed | Oct 15 | Merkle puzzles; Diffie-Hellman (DH) | [BS, Secs. 10.8 & 10.4] |
| Mon | Oct 20 | groups and cyclic groups; DH attack for even q | [Shoup, Sec. 6], [BS, Ex. 10.24] |
| Wed | Oct 22 | cyclicity of Zp* (part 1); Lagrange's theorem | [Shoup, Thm. 7.28; my notes] |
| Mon | Oct 27 | cyclicity of Zp* (part 2) | as above |
| Wed | Oct 29 | DH and DLP over cyclic groups; def'n of E(Fp) | [HPS, Sec. 6.2] |
| Mon | Nov 3 | quantum and cryptography; HSP attack on DLP | [my notes 1, 2], [Childs, Sec. 5.4] |
| Wed | Nov 5 | RSA PKE | [RSA] |
| Tues | Nov 7 | Homework 2 released (due Nov 24): Latex | |
| Mon | Nov 10 | No class: midterm break / Remembrance Day | |
| Wed | Nov 12 | No class: midterm break / Remembrance Day | |
| Mon | Nov 17 | RSA DSA; crypto on the Internet | [BS, Sec. 13.3.1], Chrome DevTools S&P |
This is a graduate-level introductory course to cryptography. The first half will be lectures on foundational topics and the second half will be student- or instructor-led presentations of research papers. The first half will focus on symmetric and asymmetric cryptography, which concerns the secure communication of information.
The main references will be Introduction to Modern Cryptography by Katz and Lindell (KL), An Introduction to Mathematical Cryptography by Hoffstein, Pipher, and Silverman (HPS), and A Graduate Course in Applied Cryptography by Boneh and Shoup (BS).
Tentative list of topics:
As an introductory course, prior knowledge of cryptography is not a prerequisite. The main prerequisites are mathematical maturity and some prior knowledge of probability from, say, MATH 302.
|
|