Lecture plan (final)
Chapters are from Stinson's book, except where marked HAC (Handbook of Applied Cryptography).
| Week | Topic | Key words | Chapters |
|---|---|---|---|
| 34 | Course overview - Introduction of main concepts - Classical ciphers | Confidentiality, monoalphabetic & polyalphabetic ciphers. | 1.1-1.2. |
| 35 | Classical ciphers (ctd.) - Finite fields | Perfect secrecy, Transposition cipher, Finite fields, irreducible & primitive polynomials. | 1.1-1.2, 2.3, 6.4, HAC 4.5. |
| 36 | Modern ciphers | Stream ciphers & LFSRs, Block ciphers. | 3.1-3.2, 3.6-3.7, HAC 5.4.3, 6.2 (up to Fact 6.20). |
| 37 | How to agree on a secret - Analysis of DH-KAP | Diffie-Hellman (DH) key agreement protocol (KAP), Fast modular exponentiation, Primality testing: Fermat. | 11.2, 5.4, HAC 4.2. |
| 38 | Analysis of DH-KAP (ctd.) | Primality testing: Solovay-Strassen & Miller-Rabin, DLog: Shank's Baby-step-Giant-step, Pohlig-Hellman. | 5.2.2, 5.4, 6.2. |
| 39 | Analysis of DH-KAP (ctd.) | DLog: Pollard's rho, Index calculus, Generic groups. | 6.2-6.3, HAC 3.6.5(ii). |
| 40 | Public key cryptography | RSA & attacks, Factoring: Fermat, Pollard's rho & p-1. | 5.1,5.3,5.5-5.6, 5.7.1-2. |
| 41 | Public key cryptography (ctd.) | Factoring: Dixon's random squares, Semantic security, ElGamal. | 5.5-5-6,6.1,6.7. |
| 42 | Efficient DH-"safe" constructions | Elliptic curves. | 6.5. |
| 43 | Hash functions | Collisions, preimages, second preimages, iterated hash functions. | 4.1-4.3. |
| 44 | Digital signatures | RSA, Schnorr signatures and zero knowledge. | 7.1-7.2, 7.4.1, 7.5.2, 9.4. |
| 45 | Message Authentication Codes | Integrity, CBC-MAC, HMAC, Polynomial based MAC. | 4.4-4.5. |
| 46 | Miscellanea | Blind signatures & digital cash, secret sharing, card games over the telephone, side channel attacks. | 13.1, HAC 11.8.1. |
| 47 | Recap | ||
| 50 | Exam | All of the above. |