Co-authored with Katharina Boudgoust, Adeline Roux-Langlois, and Weiqiang Wen.
In the proceedings of Asiacrypt 2020.
Get paper on IACR ePrint or here
We prove that the module learning with errors (M-LWE) problem with arbitrary polynomial-sized modulus \(p\) is classically at least as hard as standard worst-case lattice problems, as long as the module rank \(d\) is not smaller than the number field degree \(n\). Previous publications only showed the hardness under quantum reductions. We achieve this result in an analogous manner as in the case of the learning with errors (LWE) problem. First, we show the classical hardness of M-LWE with an exponential-sized modulus. In a second step, we prove the hardness of M-LWE using a binary secret. And finally, we provide a modulus reduction technique. The complete result applies to the class of power-of-two cyclotomic fields. However, several tools hold for more general classes of number fields and may be of independent interest.