 |
Thirteenth Algorithmic Number Theory Symposium ANTS-XIII
|
Current trends and challenges in post-quantum cryptography
Steven Galbraith
Abstract: If large enough quantum computers can be built then they will factor integers and solve elliptic curve discrete logarithms, and therefore break most public key cryptosystems in current use. This makes security professionals nervous. Worse, it endangers the comfortable careers of computational number theorists (like myself) who work in public key cryptography. Luckily a whole new field of post-quantum cryptography (cryptosystems that can be implemented on classical computers but are secure against an attacker with a quantum computer) has been initiated and is rapidly growing. I will survey some of the main trends in post-quantum crypto, focussing primarily on systems based on isogenies and lattices, and present a number of challenges and open problems.
Files available: slides