Lattice Reduction Algorithms: Theory and Practice - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Lattice Reduction Algorithms: Theory and Practice


Lattice reduction algorithms have surprisingly many applications in mathematics and computer science, notably in cryptology. On the one hand, lattice reduction algorithms are widely used in public-key cryptanalysis, for instance to attack special settings of RSA and DSA/ECDSA. On the other hand, there are more and more cryptographic schemes whose security require that certain lattice problems are hard. In this talk, we survey lattice reduction algorithms, present their performances, and discuss the differences between theory and practice.

Dates and versions

hal-01109971 , version 1 (27-01-2015)



Phong Q. Nguyen. Lattice Reduction Algorithms: Theory and Practice. EUROCRYPT 2011 - 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 2011, Talinn, Estonia. pp.2-6, ⟨10.1007/978-3-642-20465-4_2⟩. ⟨hal-01109971⟩
106 View
0 Download



Gmail Facebook X LinkedIn More