Abstract: In the past few decades, public key cryptography has been constructed using primitives whose security is based on the assumption that integer factorization problems and discrete logarithm problems are hard. Advances in quantum computers, however, threaten to undermine these assumptions. In this talk, I'll discuss several cryptosystems that are believed to be resistant to quantum adversaries. These systems take hash-based, lattice-based, code-based, and knapsack-based approaches to cryptography.
Sponsored jointly by CSoI and Purdue CS Department.