Lecture plan
This plan will change through the semester.
Chapter numbers refer to Stinson, except where marked. HAC is the Handbook of Applied Cryptography. NTA is A computational Introduction to Number Theory and Algebra.
| Week | Topic | Key words | Chapters |
|---|---|---|---|
| 34 | How to agree on a secret and what to do with it | Diffie-Hellman. Classical ciphers, confidentiality, perfect security | 11.2, 1.1, 1.2, 2.3 |
| 35 | Classical ciphers, modern ciphers | 1.1, 1.2, 3.1, |
|
| 36 | How to break DH | Integrity, message authentication codes. Finite cyclic groups. Discrete logarithms. | |
| 37 | Pohlig-Hellman. Primality testing. | 5.4, 6.2 | |
| 38 | Primality testing. Baby-step-Giant-step. Pollard's rho. | 5.4, 6.2.1-3 | |
| 39 | Generic groups. Finite fields, index calculus. Elliptic curves. | 6.2.4, 6.3, 6.4, 6.5 (only point compression in 6.5.4). | |
| 40 | PKC | Elliptic curves | 6.5 (only point compression in 6.5.4)., 6.1 |
| 41 | Public key encryption, ElGamal, RSA, factoring. | 6.1, 6.7.2, 5.1, 5.3, 5.5 | |
| 42 | RSA, Pollard's rho and p-1, Index calculus for factoring | 5.5-5.6, 5.7.1-2 | |
| 43 | Hash functions | Collisions, preimages, second preimages, iterated hash functions | 4.1-4.3, 4.4 |
| 44 | Digital signatures | RSA. Schnorr signatures and zero knowledge. | 7.1-7.2, 7.4.1, 7.5.2 |
| 45 | Random numbers | Partially covered by NTA Ch. 6 | |
| 46 | Random numbers, summary | ||
| 47 | Old exams |