A note on BDD problems with λ2-gap - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Information Processing Letters Year : 2014

A note on BDD problems with λ2-gap


In CRYPTO 2009, Lyubashevsky and Micciancio presented reductions BDD1/2γ (Bounded Distance Decoding Problem) ⩽ uSVPγ (Unique Shortest Vector Problem) ⩽ BDD1/γ, and posed an open problem whether the reduction gap can be closed. This paper concerns bounded distance decoding (BDD) problems for lattices with large λ2-gap. In the presence of larger λ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.
No file

Dates and versions

hal-00922234 , version 1 (25-12-2013)



Mingjie Liu, Xiaoyun Wang, Guangwu Xu, Xuexin Zheng. A note on BDD problems with λ2-gap. Information Processing Letters, 2014, 114 (1-2), pp.9-12. ⟨10.1016/j.ipl.2013.10.004⟩. ⟨hal-00922234⟩
221 View
0 Download



Gmail Facebook X LinkedIn More