Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
Theoretical Computer Science
Minkowski's convex body theorem and integer programming
Mathematics of Operations Research
A hierarchy of polynomial time lattice basis reduction algorithms
Theoretical Computer Science
A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM (JACM)
A course in computational algebraic number theory
A course in computational algebraic number theory
The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the complexity of computing short linearly independent vectors and short bases in a lattice
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Finding the closest lattice vector when it's unusually close
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On the limits of nonapproximability of lattice problems
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
A sieve algorithm for the shortest lattice vector problem
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Complexity of Lattice Problems
Complexity of Lattice Problems
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
SIAM Journal on Computing
Approximating-CVP to within Almost-Polynomial Factors is NP-Hard
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Sampling Short Lattice Vectors and the Closest Lattice Vector Problem
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Hardness of approximating the shortest vector problem in lattices
Journal of the ACM (JACM)
Lattice problems and norm embeddings
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Tensor-based hardness of the shortest vector problem to within almost polynomial factors
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Efficient reductions among lattice problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Improved analysis of Kannan's shortest lattice vector algorithm
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Proceedings of the forty-second ACM symposium on Theory of computing
Analysis of gauss-sieve for solving the shortest vector problem in lattices
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Covering cubes and the closest vector problem
Proceedings of the twenty-seventh annual symposium on Computational geometry
Algorithms for the shortest and closest lattice vector problems
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
A O(1/ε2)n-time sieving algorithm for approximate integer programming
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
| Hi-index | 5.23 |
We study four problems from the geometry of numbers, the shortest vector problem(Svp), the closest vector problem(Cvp), the successive minima problem(Smp), and the shortest independent vectors problem (Sivp). Extending and generalizing results of Ajtai, Kumar, and Sivakumar we present probabilistic single exponential time algorithms for all four problems for all @?"p norms. The results on Smp and Sivp are new for all norms. The results on Svp and Cvp generalize previous results of Ajtai et al. for the Euclidean @?"2 norm to arbitrary @?"p norms. We achieve our results by introducing a new lattice problem, the generalized shortest vector problem (GSvp). We describe a single exponential time algorithm for GSvp. We also describe polynomial time reductions from Svp,Cvp,Smp, and Sivp to GSvp, establishing single exponential time algorithms for the four classical lattice problems. This approach leads to a unified algorithmic treatment of the lattice problems Svp,Cvp,Smp, and Sivp.