A note on BDD problems with λ2 -gap

Authors:
Mingjie Liu;Xiaoyun Wang;Guangwu Xu;Xuexin Zheng
Affiliations:
Beijing International Center for Mathematical Research, Peking University, Beijing 100871, China and Institute for Advanced Study, Tsinghua University, Beijing 100084, China;Institute for Advanced Study, Tsinghua University, Beijing 100084, China and Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong University, Jinan 25 ...;Institute for Advanced Study, Tsinghua University, Beijing 100084, China and Computer Science, University of Wisconsin-Milwaukee, Milwaukee, WI 53201, USA;Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong University, Jinan 250100, China
Venue:
Information Processing Letters
Year:
2014

Solving low-density subset sum problems

Journal of the ACM (JACM)
On Lova´sz' lattice reduction and the nearest lattice point problem

Combinatorica
Minkowski's convex body theorem and integer programming

Mathematics of Operations Research
Improved low-density subset sum algorithms

Computational Complexity
Approximating shortest lattice vectors is not harder than approximating closet lattice vectors

Information Processing Letters
Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Public-Key Cryptosystems from Lattice Reduction Problems

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem

CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Predicting lattice reduction

EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
On bounded distance decoding for general lattices

APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation

Hi-index	0.89

In CRYPTO 2009, Lyubashevsky and Micciancio presented reductions BDD"1"/"2"@c (Bounded Distance Decoding Problem) =