Biography. William Youmans, Ph.D. is a postdoctoral fellow at Clemson University, where he studies post-quantum cryptography and quantum algorithms. His current work includes a collaboration with the Savannah River National Laboratory focused on the intersection of post-quantum cryptography and artificial intelligence. Before joining Clemson, he was a postdoctoral fellow at Florida Atlantic University, where he developed quantum algorithms for lattice-based cryptographic problems. He earned his Ph.D. in mathematics from the University of South Florida, where his research focused on classical algorithms in ideal lattice–based cryptography.
Abstract.
The Learning With Errors (LWE) problem is a basic building block of many post-quantum cryptographic constructions since LWE, like most lattice problems, is believed to be hard for a quantum adversary. Regev showed that LWE can be reduced to the quantum Dihedral Coset Problem (DCP) (FOCS '02). Brakerski et al. later showed LWE is actually polynomial-time equivalent to a relaxation of DCP called the Extrapolated Dihedral Coset Problem (EDCP) (PKC '18), which they conjectured could be easier than DCP. In this talk we will present a new quasi-polynomial time quantum algorithm for EDCP and discuss its impact on LWE. In particular, we discuss why this algorithm still performs no better than classical algorithms for LWE. This is joint work with Shi Bai, Hansraj Jangir, Elena Kirshinova, and Tran Ngo.