On Lattices, Learning with Errors, Random Linear Codes, and Cryptography 6: The Smoothing Parameter Satisfies η_ε(L) ≥ √(ln(1/ε)/π)/λ₁(L*) ≥ √(ln(1/ε)/π)·λ_n(L)/nResearch Paper
The learning with errors (LWE) problem underlies much of post-quantum public-key cryptography, and its hardness rests on Regev's reduction from worst-case lattice problems to LWE (Regev, J. ACM 2009). Every step of that reduction is calibrated by the smoothing parameter of Micciancio and Regev (SIAM J. Comput. 2007): the Gaussian width…