Lattice Enumeration Using Extreme Pruning - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Lattice Enumeration Using Extreme Pruning

Résumé

Lattice enumeration algorithms are the most basic algorithms for solving hard lattice problems such as the shortest vector problem and the closest vector problem, and are often used in public-key cryptanaly-sis either as standalone algorithms, or as subroutines in lattice reduction algorithms. Here we revisit these fundamental algorithms and show that surprising exponential speedups can be achieved both in theory and in practice by using a new technique, which we call extreme pruning. We also provide what is arguably the first sound analysis of pruning, which was introduced in the 1990s by Schnorr et al.
Fichier principal
Vignette du fichier
ACTI-GAMA-2010-1.pdf (268.6 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01083526 , version 1 (17-11-2014)

Identifiants

Citer

Nicolas Gama, Phong Q. Nguyen, Oded Regev. Lattice Enumeration Using Extreme Pruning. Proceedings of the 29th International Conference on Cryptology - EUROCRYPT 2010, May 2010, Nice, France. pp.257 - 278, ⟨10.1007/978-3-642-13190-5_13⟩. ⟨hal-01083526⟩
549 Consultations
798 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More