Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Towards Classical Hardness of Module-LWE: The Linear Rank Case

Abstract : 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 powerof-two cyclotomic fields. However, several tools hold for more general classes of number fields and may be of independent interest.
Document type :
Conference papers
Complete list of metadata
Contributor : Adeline Roux-Langlois Connect in order to contact the contributor
Submitted on : Thursday, December 3, 2020 - 12:01:53 PM
Last modification on : Monday, April 4, 2022 - 9:28:31 AM
Long-term archiving on: : Thursday, March 4, 2021 - 6:59:51 PM


Files produced by the author(s)


  • HAL Id : hal-03038053, version 1


Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen. Towards Classical Hardness of Module-LWE: The Linear Rank Case. Asiacrypt 2020 - 26th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2020, Virtual, France. ⟨hal-03038053⟩



Record views


Files downloads