Reductions from module lattices to free module lattices, and application to dequantizing module-LLL

ePrint Report: Reductions from module lattices to free module lattices, and application to dequantizing module-LLL

Gabrielle De Micheli, Daniele Micciancio, Alice Pellet-Mary, Nam Tran

In this article, we give evidence that free modules (i.e., modules which admit a basis) are no weaker than arbitrary modules, when it comes to solving cryptographic algorithmic problems (and when the rank of the module is at least 2). More precisely, we show that for three algorithmic problems used in cryptography, namely the shortest vector …

alice application article eprint report free modules report