On the Hardness of Module Learning with Errors with Short Distributions - Equipe Cybersécurité et Cryptographie Accéder directement au contenu
Article Dans Une Revue Journal of Cryptology Année : 2023

On the Hardness of Module Learning with Errors with Short Distributions

Résumé

The Module Learning With Errors (M-LWE) problem is a core computational assumption of lattice-based cryptography which offers an interesting trade-off between guaranteed security and concrete efficiency. The problem is parameterized by a secret distribution as well as an error distribution. There is a gap between the choices of those distributions for theoretical hardness results (standard formulation of M-LWE, i.e., uniform secret modulo $q$ and Gaussian error) and practical schemes (small bounded secret and error). In this work, we make progress towards narrowing this gap. More precisely, we prove that M-LWE with uniform $\eta$-bounded secret for any $1 \leq \eta \ll q$ and Gaussian error, in both its search and decision variants, is at least as hard as the standard formulation of M-LWE, provided that the module rank $d$ is at least logarithmic in the ring degree $n$. We also prove that the search version of M-LWE with large uniform secret and uniform $\eta$-bounded error is at least as hard as the standard M-LWE problem, if the number of samples $m$ is close to the module rank $d$ and with further restrictions on $\eta$. The latter result can be extended to provide the hardness of search M-LWE with uniform η-bounded secret and error under specific parameter conditions. Overall, the results apply to all cyclotomic fields, but most of the intermediate results are proven in more general number fields.
Fichier principal
Vignette du fichier
2022-12-01_hardness_mlwe_with_short_distributions_eprint_revised.pdf (1.18 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04028217 , version 1 (14-03-2023)

Licence

Paternité

Identifiants

Citer

Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen. On the Hardness of Module Learning with Errors with Short Distributions. Journal of Cryptology, 2023, 36 (1), pp.1-72. ⟨10.1007/s00145-022-09441-3⟩. ⟨hal-04028217⟩
189 Consultations
352 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More