Pré-Publication, Document De Travail (Preprint/Prepublication) Année : 2023

Reductions from module lattices to free module lattices

Résumé

In this article, we give evidences 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 problem, the Hermite shortest vector problem and a variant of the closest vector problem, there is a reduction from solving the problem in any module of rank n ≥ 2 to solving the problem in any free module of the same rank n.

Fichier principal
Vignette du fichier
main.pdf (438.16 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-04119912 , version 1 (06-06-2023)

Licence

Identifiants

  • HAL Id : hal-04119912 , version 1

Citer

Alice Pellet-Mary, Nam Tran. Reductions from module lattices to free module lattices. 2023. ⟨hal-04119912⟩
119 Consultations
623 Téléchargements

Partager

  • More