Solving BDD by Enumeration: An Update - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Solving BDD by Enumeration: An Update


Bounded Distance Decoding (BDD) is a basic lattice problem used in cryptanalysis: the security of most lattice-based encryption schemes relies on the hardness of some BDD, such as LWE. We study how to solve BDD using a classical method for finding shortest vectors in lattices: enumeration with pruning speedup, such as Gama-Nguyen-Regev extreme pruning from EUROCRYPT '10. We obtain significant improvements upon Lindner-Peikert's Search-LWE algorithm (from CT-RSA '11), and update experimental cryptanalytic results, such as attacks on DSA with partially known nonces and GGH encryption challenges. Our work shows that any security estimate of BDD-based cryptosystems must take into account enumeration attacks, and that BDD enumeration can be practical even in high dimension like 350.


Fichier principal
Vignette du fichier
LiuNguyen.pdf (228.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00864361 , version 1 (21-09-2013)



Mingjie Liu, Phong Q. Nguyen. Solving BDD by Enumeration: An Update. CT-RSA 2013 - The Cryptographers' Track at the RSA Conference 2013, Feb 2013, San Francisco, United States. pp.293-309, ⟨10.1007/978-3-642-36095-4_19⟩. ⟨hal-00864361⟩
450 View
2152 Download



Gmail Facebook Twitter LinkedIn More