CS 292G: Graduate Course in Cryptography

Recent breakthrough of "quantum supremacy" by Google has brought us one step closer to building quantum computers that pose a threat to secure systems being used in practice. The main goal of this course is to study the theory of post-quantum cryptographic systems -- those that are secure even if quantum computers come into existence. We will introduce different types of cryptographic schemes and show how to build them from mathematical assumptions that resist known quantum attacks. Some topics include (but is not limited to): pseudo-random functions, fully homomorphic encryption, functional encryption and non-interactive zero-knowledge. Prerequisites: 1) A discrete mathematics course 2) Ability to understand, write and debug mathematical proofs. 3) Basic familiarity with linear algebra and probability.