Instructors:
Where: Typically, room B1
When: Wednesday, 1:30pm-3:30pm
Evaluation: Evaluation will take place at the end of December. If there are no more than 12 students, then 50% report on an article + 50% presentation of that article. If there are more students, then 50% report on an article + 50% written exam. This will be decided in mid-October.
Prerequisites (advisable but not mandatory):
Readings:
Week | Class Topic | Notes |
---|---|---|
11.09 | Lattices and lattice sieving | Lecture 1 |
18.09 | Lattice sieving | Lecture 2, see also this survey |
25.09 | More lattice background | Lecture 3 |
02.10 | The LLL and BKZ algorithms | Lecture 4 |
09.10 | Basic applications of LLL (factoring integers polynomials, simultaneous Diophantine approximations) | |
18.10 | Univariate Coppersmith method | |
23.10 | Multivariate Coppersmith method | |
06.11 | Elementary factoring algorithms | |
13.11 | Faster factoring algorithms | |
27.11 | Information set decoding | Lecture on ISD |
02.12 | Learning Parity with Noise and the BKW algorithm | Lecture on LPN |
04.12 | Factoring algorithms | |
11.12 | DLP algorithms | |
18.12 | Learning With Errors and algorithms to solve it |