A note on BDD problems with lambda(2)-gap
In CRYPTO 2009, Lyubashevsky and Micciancio presented reductions BDD1/2 gamma (Bounded Distance Decoding Problem) <= uSVP(gamma) (Unique Shortest Vector Problem) <= BDD1/gamma, and posed an open problem whether the reduction gap can be closed. This paper concerns bounded distance decoding (BDD) problems for lattices with large lambda(2)-gap. In the presence of larger lambda(2)-gap, better reductions from BDD to uSVP and exact SVP are obtained. Some result can be regarded as a partial solution to the open problem. (C) 2013 Elsevier B.V. All rights reserved.
bdd usvp lattice cryptography successive minima