The Complexity of Algebraic Algorithms for LWE

ePrint Report: The Complexity of Algebraic Algorithms for LWE

Matthias Johann Steiner

Arora & Ge introduced a noise-free polynomial system to compute the secret of a Learning With Errors (LWE) instance via linearization. Albrecht et al. later utilized the Arora-Ge polynomial model to study the complexity of Gröbner basis computations on LWE polynomial systems under the assumption of semi-regularity. In this paper we revisit the Arora-Ge polynomial and prove that it satisfies a genericity condition recently introduced by Caminata & …

algorithms amp complexity compute eprint report errors free instance noise report secret study system