Concrete Security from Worst-Case to Average-Case Lattice Reductions

ePrint Report: Concrete Security from Worst-Case to Average-Case Lattice Reductions

Joel Gärtner

A famous reduction by Regev shows that random instances of the Learning With Errors (LWE) problem are asymptotically at least as hard as a worst-case lattice problem. As such, by assuming that standard lattice problems are hard to solve, the asymptotic security of cryptosystems based on the LWE problem is guaranteed. However, it has not been clear to which extent, if any, this reduction provides support for the …

case eprint report errors hard joel problem problems random report security standard