Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
In this paper we introduce a new technique to solve lattice problems. The technique is based on dual HKZ-bases. Using this technique we show how to solve the closest vector problem in lattices with rank n in time n! · s O(1), where s is the input size of the problem. This is an exponential improvement over an algorithm due to Kannan and Helfrich [16,15]. Based on the new technique we also show how to compute the successive minima of a lattice in time n! · 3n · s O(1), where n is the rank of the lattice and s is the input size of the lattice. The problem of computing the successive minima plays an important role in Ajtai’s worst-case to average-case reduction for lattice problems. Our results reveal a close connection between the closest vector problem and the problem of computing the successive minima of a lattice.
Unable to display preview. Download preview PDF.
- 1.M. Ajtai, “Generating Hard Instances of Lattice Problems”, Proc. 28th Symposium on Theory of Computing 1996, pp. 99–108.Google Scholar
- 3.S. Arora, C. Lund, “Hardness of Approximations”, in D. S. Hochbaum (ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing, 1997.Google Scholar
- 5.M. Ajtai, C. Dwork“A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence”, Proc. 29th Symposium on Theory of Computing 1997, pp. 284–293.Google Scholar
- 8.J. Blömer, J.-P. Seifert, “The Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice”, Proc. 21stth Symposium on Theory of Computing 1999, pp. 711–720.Google Scholar
- 9.J. W. S. Cassels, An Introduction to the Geometry of Numbers, Springer-Verlag, 1971.Google Scholar
- 10.J. Y. Cai, “A New Transference Theorem and Applications to Ajtai’s Connection Factor”, Proc. 14th Conference on Computational Complexity 1999, pp. 205–214.Google Scholar
- 11.J. Y. Cai, “Some Recent Progress on the Complexity of Lattice Problems”, Proc. 14th Conference on Computational Complexity 1999, pp. 158–177.Google Scholar
- 12.J. Y. Cai, A. P. Nerurkar, “An Improved Worst-Case to Average-Case Reduction for Lattice Problems”, Proc. 38th Symposium on Foundations of Computer Science 1997, pp. 468–477.Google Scholar
- 13.I. Dinur, G. Kindler, S. Safra, “Approximating CVP to Within Almost-Polynomial Factors is NP-Hard”, Proc. 39th Symposium on Foundations of Computer Science 1998, pp 99–109.Google Scholar
- 14.O. Goldreich, S. Goldwasser, “On the Limits of Non-Approximability of Lattice Problems”, Proc. 30th Symposium on Theory of Computing 1998, pp. 1–9.Google Scholar
- 17.L. Lovasz, An Algorithmic Theory of Graphs, Numbers and Convexity, SIAM, 1986.Google Scholar