I am writing course notes, which I will update regularly. Current version is August 3, which should be the final version except for correcting typos.
Even JPMorgan thinks that you should learn quantum computing and post-quantum cryptography
Fully homomorphic encryption over the integers, by van Dijk, Gentry, Halevi, and Vaikuntanathan: journal version and conference version
Gentry's Computing arbitrary functions of encrypted data article, which contains the jewelry store analogy
Course materials
Week 1
- Slides from July 18 lecture and July 18 problem set
- Slides from July 19 lecture and July 19 problem set
- Slides from July 21 lecture and July 21 problem set
- Slides from July 22 lecture and July 22 problem set
Week 2
- Slides from July 25 lecture and July 25 problem set
Some further notes on post-quantum algorithms, which are adapted from a course I taught in 2021. These say more about the algorithms I didn't have time to talk about today.
A bonus self-study homework on code-based cryptography - Slides from July 26 lecture and July 26 problem set
- Slides from July 28 lecture and July 28 problem set
- Slides from July 29 lecture and July 29 problem set
Week 3