Worst-Case to Average-Case Hardness of LWE: A Simple and Practical Perspective

ePrint Report: Worst-Case to Average-Case Hardness of LWE: A Simple and Practical Perspective

Divesh Aggarwal, Leong Jin Ming, Alexandra Veliche

In this work, we study the worst-case to average-case hardness of the Learning with Errors problem (LWE) under an alternative measure of hardness $−$ the maximum success probability achievable by a probabilistic polynomial-time (PPT) algorithm. Previous works by Regev (STOC 2005), Peikert (STOC 2009), and Brakerski, Peikert, Langlois, Regev, Stehle (STOC 2013) give worst-case to average-case reductions from lattice problems, …

case eprint report errors measure perspective problem report simple study under work