Quantum Algorithms for the Approximate k-List Problem and their Application to Lattice Sieving
The Shortest Vector Problem (SVP) is one of the mathematical foundations of lattice based cryptography. Lattice sieve algorithms are amongst the foremost methods of solving SVP. The asymptotically fastest known classical and quantum sieves solve SVP in a $d$-dimensional lattice in $2^{\const d + \smallo(d)}$ time steps with $2^{\const' d + \smallo(d)}$ memory for constants $c, c'$. In this work, w
