Lecture plan
This plan will change through the semester.
SYM, DH, PKE, SHOR, LAT and SIG refer to the lecture notes. HAC is the Handbook of Applied Cryptography. NTA is A computational Introduction to Number Theory and Algebra.
| Week | Topic | Key words | Material |
|---|---|---|---|
| 35 | How to agree on a secret and what to do with it | Diffie-Hellman. Classical ciphers, confidentiality. | DH 1-2, SYM 1, 2, 3.1-3; Stinson 11.2, 1.1, 1.2, 2.3 |
| 36 | Classical ciphers, perfect security, modern ciphers. | SYM 3.4-9; Stinson 1.1, 1.2, 3.1, 3.7 | |
| 37 | How to break DH | Finite cyclic groups. Discrete logarithms. Pohlig-Hellman. | DH 3.1-3; Stinson 6.2.3 |
| 38 | Primality testing. Elliptic curves. | DH 4, 6; Stinson 5.4.1-2, 6.5 (only point compression in 6.5.4) | |
| 39 | Elliptic curves | DH 6; Stinson 6.5 (only point compression in 6.5.4) | |
| 40 | Baby-step-Giant-step. Pollard's rho. Finite fields, index calculus. | DH 3.4-5, 5; Stinson 6.2 | |
| 41 | PKC | Public key encryption, ElGamal. | PKE 1-4; Stinson 6.1, 6.7.2 |
| 42 | RSA, factoring, Pollard's rho and p-1. Index calculus for factoring. | PKE 4-5; Stinson 5.1, 5.3, 5.5-6, 5.7.1-2 | |
| 43 | Future cryptography | Quantum computers. Lattice-based cryptography. | SHOR 1-4, LAT 1-2 |
| 44 | + Integrity | Lattice-based cryptography, LLL algorithm. Integrity. Message authentication codes. | LAT 2-4, DH 7, SYM 4-5. Stinson 4.1-4.5. |
| 45 | Digital signatures. RSA. Collisions, preimages, second preimages. Iterated hash functions. | PKE 6, SIG 1-4; Stinson 4.1-4.5, HAC 4.5. | |
| 46 | Digital signatures | Schnorr signatures and zero knowledge. | SIG 5, 6; Stinson 7.1-7.2, 7.4.1, 7.5.2 |
| 47 | Summary. Old exams |