Title: Post Quantum Cryptography Abstract: Public key cryptosystems rely on hard mathematical problems. Classical systems rely on the difficulty of factoring large integers (RSA) or solving various discret logarithm problems (DH, ECC). In the mid-1990's Peter Shor explained how a quantum computer would be able to break all of these systems, which has led to the construction and study of so-called quantum-resistant cryptosystems, that is, systems for which there is no (known) fast quantum algorithm. In this talk I will give a brief history of pre- and post-quantum cryptography, after which I will describe the hard lattice problems that lie at the heart of many quantum-resistant algorithms and give the details of one such cryptosystem.