Lane A. Hemaspaandra
Skip Abstract Section
Abstract
We present high-level technical summaries of five recent results on the computational complexity of the shortest lattice vector problem.
- M. Ajtai. Generating hard instances of lattice problems. Proc. 28th ACM Symposium on Theory of Computing, pp. 99-108, 1996. Google Scholar
Digital Library
- 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
- M. Ajtai and C. Dwork. A public-key cryptosystem with worst-case/average-case equivalence. Proc. 29th ACM Symposium on Theory of Computing, pp. 284-293, 1997. Google ScholarDigital Library
- M. Ajtai, R. Kumar, and D. Sivakumar. A sieve algorithm for the shortest lattice vector problem. Proc. 33rd ACM Symposium on Theory of Computing, pp. 601-610, 2001. Google ScholarDigital Library
- J.-Y. Cai. Some recent progress on the complexity of lattice problems. Proc. 14th IEEE Conference on Computational Complexity, pp. 158-179, 1999. Google ScholarDigital Library
- J.-Y. Cai and A. Nerurkar. A note on the non-NP hardness of approximate lattice problems under general Cook reductions. Information Processing Letters, 76:61-66, 2000. Google ScholarDigital Library
- O. Goldreich and S. Goldwasser, and S. Halevi. Public-key cryptosystems from lattice reduction problems. Journal of Computer and System Sciences, 60(3):540-563, 2000. Google ScholarDigital Library
- O. Goldreich, S. Goldwasser, and S. Halevi. Public-key cryptosystems from lattice reduction problems. Proc. CRYPTO, Springer LNCS 1294:105-111, 1997. Google ScholarDigital Library
- R. Kannan. Minkowski's convex body theorem and integer programming. Mathematics of Operations Research, 12:415-440, 1987. Google ScholarDigital Library
- J. Lagarias, H. W. Lenstra, and C. P. Schnorr. Korkino-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica, 10:333-348, 1990.Google ScholarCross Ref
- A. K. Lenstra, H. W. Lenstra, and L. Lovász. Factoring polynomials with rational coefficients. Mathematishe Annalen, 261:515-534, 1982.Google ScholarCross Ref
- D. Micciancio. On the Hardness of the Shortest Vector Problem. Ph.D. Thesis, MIT, 1998. Google ScholarDigital Library
- 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
- C. P. Schnorr. A hierarchy of polynomial time basis reduction algorithms. Theoretical Computer Science 53:201-224, 1987. Google ScholarDigital Library
Index Terms
- Complexity theory
Recommendations
Kolmogorov Complexity Theory over the Reals
Kolmogorov Complexity constitutes an integral part of computability theory, information theory, and computational complexity theory-in the discrete setting of bits and Turing machines. Over real numbers, on the other hand, the BSS-machine (aka real-RAM) ...
Comments