Skip to Main content Skip to Navigation
Conference papers

Lattice Reduction Algorithms: Theory and Practice

Phong Q. Nguyen 1, 2
2 CASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR 8548
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-01109971
Contributor : Brigitte Briot <>
Submitted on : Tuesday, January 27, 2015 - 11:41:24 AM
Last modification on : Tuesday, May 4, 2021 - 2:06:02 PM

Links full text

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

219