Lecture plan
This is only the tentative plan and it will be changed through the semester. Those in grey are mostly copied from the previous lecture and they are subject to change. Contents for the current week are colored in blue.
Most contents of the lectures are not covered by the previous lecture notes. Please refer to the lecture slides and notes for details. The same slides and notes are also available on Blackboard.
BS refers to notes of Boneh and Shoup which are very good reference to this lecture and closely match our lectures.
SYM, DH, PKE, SHOR and SIG refer to the previous lecture notes. HAC is the "Handbook of Applied Cryptography". NTA is "A Computational Introduction to Number Theory and Algebra".
| Week | Topic | Key words | Material |
|---|---|---|---|
| 34 | Introduction | Classical ciphers, confidentiality, one-time pad (OTP) | SYM 3.1-3, 3.8 |
| 35 | Symmetric encryption, stream ciphers. | One-time pad (continue), perfect security, stream ciphers. pseudo-random generators (PRGs) | Slides on Blackboard |
| 36 | Block ciphers. Message authentication. | Block ciphers. Modes of operations. Message authentication codes (starting) | BS 4 and see summary in Blackboard |
| 37 | Message authentication. Hash functions. | Integrity. Message authentication codes (continue). Hash functions. Collision resistance. | BS 6.1, 6.3, 6.4.3, 6.5.1.1; 8.1 - 8.3 |
| 38 | Hash. Authenticated encryption. | Merkle-Damgård. Authenticated encryption. | BS 8.4; 9.1, 9.4. |
| 39 | Key exchange. | Diffie-Hellman. Discrete Logarithm and its application. | BS 10.4, 10.5, 10.6.1 |
| 40 | Public-key encryption (I). | Public key encryption, IND-CPA security. ElGamal. RSA. | BS 11.2, 11.3, 11.5. 10.3, 11.4. |
| 41 | Public-key encryption (II). | Random oracle model. RSA-based PKE. More applications based on RSA: key exchange, hash. | BS 8.10.2; 11.4. 10.3.1, 10.6.2. |
| 42 | PKE and Digital signature (I) | Hashed ElGamal and CCA security. Twin Diffie-Hellman (DH). Digital signatures. | BS 12.4; 13.1. For twin DH, Theorem 2 and Section 4 in this paper |
| 43 | Digital signature (II) | RSA Full Domain Hash (FDH). Schnorr signatures and zero knowledge. | BS 13.1-13.4. (For the Schnorr part, it is enough to just look at notes from the lecture.) |
| 44 | Computational number theory (I) | Primality testing. Elliptic curves (EC). | DH 4. (Here gives a simple description of Fermat's test. Miller-Rabin test is from NTA 10.2); DH 6.1 (or BS 15.2) gives the definition of the operation law of EC. |
| 45 | Computational number theory (II) | Algorithms for breaking discrete logarithms. | DH 3. |
| 46 | Current research in cryptography. | (Structure-preserving) signatures and non-interactive zero-knowledge proofs. | |
| 47 | Summary. Trial exam |