Miklós Ajtai
ABSTRACT
We present a randomized 2^{O(n)} time algorithm to compute a shortest non-zero vector in an n-dimensional rational lattice. The best known time upper bound for this problem was 2^{O(n\log n)} first given by Kannan [7] in 1983. We obtain several consequences of this algorithm for related problems on lattices and codes, including an improvement for polynomial time approximations to the shortest vector problem. In this improvement we gain a factor of log log n in the exponent of the approximating factor.
- 1.M. Ajtai. Generating hard instances of lattice problems. Proc. 28th ACM Symposium on Theory of Computing, pp. 99-108, 1996. Full version available as ECCC Technical Report TR96-007 at www.eccc.uni-trier.de/eccc/ . Google Scholar
Digital Library
- 2.M. Ajtai. The shortest vector problem in L2 is NP-hard for randomized reductions. Proc. 30th ACM Symposium on Theory of Computing, pp. 10-19, 1998. Google ScholarDigital Library
- 3.A. Blum, A. Kalai, and H. Wasserman. Noise-tolerant learning, the parity problem, and the statistical query model. Proc. 32nd ACM Symposium on Theory of Computing, pp. 435-440, 2000. Google ScholarDigital Library
- 4.P. van Emde Boas. Another NP-complete partition problem and the complexity of computing short vectors in lattices. Mathematics Department, University of Amsterdam, TR 81-04, 1981.Google Scholar
- 5.O. Goldreich and S. Goldwasser. On the limits of nonapproximability of lattice problems. Journal of Computer and System Sciences, 60(3):540-563, 2000. Google ScholarDigital Library
- 6.B. Helfrich. Algorithms to construct Minkowski reduced and Hermite reduced bases. Theoretical Computer Science, 41:125-139, 1985. Google ScholarDigital Library
- 7.R. Kannan. Minkowski's convex body theorem and integer programming. Mathematics of Operations Research, 12:415-440, 1987. Preliminary version in ACM Symposium on Theory of Computing 1983. Google ScholarDigital Library
- 8.P. Klein. Finding the closest lattice vector when it's unusually close. Proc. 11th Symposium on Discrete Algorithms, 2000. Google ScholarDigital Library
- 9.R. Kumar and D. Sivakumar. On polynomial approximations to the shortest lattice vector length. Proc. 12th Symposium on Discrete Algorithms, 2001. To appear. Google ScholarDigital Library
- 10.A. K. Lenstra, H. W. Lenstra, and L. Lovasz. Factoring polynomials with rational coefficients. Mathematische Annalen, 261:515-534, 1982.Google ScholarCross Ref
- 11.L. Lovasz. An Algorithmic Theory of Numbers, Graphs and Convexity. CBMS-NSF Regional Conference Series on Applied Mathematics, SIAM, 1986.Google Scholar
- 12.D. Micciancio. The shortest vector in a lattice is hard to approximate to within some constant. Proc. 39th IEEE Symposium on Foundations of Computer Science, pp. 92-98, 1998. Google ScholarDigital Library
- 13.C. P. Schnorr. A hierarchy of polynomial time basis reduction algorithms. Theoretical Computer Science, 53:201-224, 1987. Google ScholarDigital Library
Index Terms
- A sieve algorithm for the shortest lattice vector problem
Recommendations
The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice
STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computingSchnorr's algorithm for finding an approximation for the shortest nonzero vector in an n dimensional lattice depends on a parameter k. He proved that for a fixed k ≤ n his algorithm (block 2k-reduction) provides a lattice vector whose length is greater ...
Faster exponential time algorithms for the shortest vector problem
SODA '10: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithmsWe present new faster algorithms for the exact solution of the shortest vector problem in arbitrary lattices. Our main result shows that the shortest vector in any n-dimensional lattice can be found in time 23.199n (and space 21.325n), or in space 2...
Sampling Short Lattice Vectors and the Closest Lattice Vector Problem
CCC '02: Proceedings of the 17th IEEE Annual Conference on Computational ComplexityWe present a 2^{O(n)} time Turing reduction from the closest lattice vector problem to the shortest lattice vector problem. Our reduction assumes access to a subroutine that solves SVP exactly and a subroutine to sample short vectors from a lattice, and ...
Comments