The complexity of some lattice problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1838, Issue , 2000, Pages 1-32

  Cai, Jin Yi ^a  

^a the State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HARDNESS;

AVERAGE CASE; CLOSEST VECTOR PROBLEM; COMPLEXITY RESULTS; DUAL LATTICES; LATTICE PROBLEMS; NP-HARDNESS; RECENT PROGRESS; SHORTEST VECTOR PROBLEM;

NUMBER THEORY;

EID: 84931069763     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722028_1     Document Type: Conference Paper

References (66)

1. M. Ajtai. Generating hard instances of lattice problems. In Proc. 28th ACM Symposium on the Theory of Computing, 1996, 99-108. Full version available from ECCC as TR96-007.
2. 2 is NP-hard for randomized reductions. In Proc. 30th ACM Symposium on the Theory of Computing, 1998, 10-19. Full version available from ECCC as TR97-047.
3. M. Ajtai and C. Dwork. A public-key cryptosystem with worst-case/average-case equivalence. In Proc. 29th ACM Symposium on the Theory of Computing, 1997, 284-293. Full version available from ECCC as TR96-065.
4. N. Alon and J. Spencer. The Probabilistic Method (with an appendix on open problems by Paul Erdös). Wiley, 1992.
5. S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear equations. In Proc. 34th IEEE Symposium on Foundations of Computer Science, 1993, 724-733.
6. L. Babai. On Lovász’ lattice reduction and the nearest lattice point problem. Combinatorica, 6: 1-13, 1986.
7. n. Proceedings of the American Mathematical Society, 97(3): 465-473, 1986.
8. W. Banaszczyk. Polar Lattices from the point of view of nuclear spaces. Rev. Mat. Univ. Complutense Madr. 2 (special issue): 35-46, 1989.
9. W. Banaszczyk. New Bounds in Some Transference Theorems in the Geometry of Numbers. Mathematische Annalen, 296: 625-635, 1993.
10. J. Blömer and J-P. Seifert. On the complexity of computing short linearly independent vectors and short bases in a lattice. Proc. 31st ACM Symposium on Theory of Computing, pp711-720, 1999.
11. D. Boneh and R. Venkatesan. Hardness of computing the most significant bits of secret keys in Di e-Hellman and related schemes. Lecture Notes in Computer Science, 1109 (1996), 129-142.
12. R. Boppana, J. Håstad and S. Zachos. Does Co-NP have Short Interactive Proofs? Information Processing Letters, 25: 127-132, 1987.
13. J.-Y. Cai. Some recent progress on the complexity of lattice problems. Available as TR99-006 at http://www.eccc.uni-trier.de/eccc/.
14. J.-Y. Cai. A New Transference Theorem in the Geometry of Numbers. The 5th International Computing and Combinatorics Conference, 113-122, (COCOON) 1999, Tokyo, Japan. Lecture Notes in Computer Science, 1627.
15. J.-Y. Cai. Applications of a New Transference Theorem to Ajtai’s Connection Factor. In the Proceedings of the 14th Annual IEEE Conference on Computational Complexity, pp 205-214, 1999.
16. J.-Y. Cai. A Relation of Primal-Dual Lattices and the Complexity of Shortest Lattice Vector Problem. Theoretical Computer Science 207: 105-116, 1998.
17. J.-Y. Cai and T. Cusick. A Lattice-Based Public-Key Cryptosystem. Information and Computation 151, 17-31, 1999.
18. J.-Y. Cai, G. Havas, B. Mans, A. Nerurkar, J-P. Seifert and I. Shparlinski. On routing in circulant graphs. The 5th International Computing and Combinatorics Conference, 360-369, (COCOON) 1999, Tokyo, Japan. Lecture Notes in Computer Science, 1627.
19. J.-Y. Cai and A. Nerurkar. An Improved Worst-Case to Average-Case Connection for Lattice Problems. In Proc. 38th IEEE Symposium on Foundations of Computer Science, 1997, 468-477.
20. ∈is NP-hard under randomized reductions. In Proc. of the 13th IEEE Conference on Computational Complexity, 1998, 46-55.
21. J.-Y. Cai, A. Pavan and D. Sivakumar. On the Hardness of Permanent. In Proc. of the 16th International Symposium on Theoretical Aspects of Computer Science, 1999.
22. J.-Y. Cai and A. Nerurkar. A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. Submitted to Information Processing Letters.
23. J.-Y. Cai. A Worst-Case to Average-Case Connection for CVP. Manuscript. To appear.
24. J. W. S. Cassels. An Introduction to the Geometry of Numbers. Berlin Göttingen Heidelberg: Springer 1959.
25. D. Coppersmith. Small solutions to polynomial equations, and low exponent RSA vulnerabilities. Journal of Cryptology, 10: 233-260, 1997.
26. I. Dinur, G. Kindler and S. Safra. Approximating CVP to within almost-polynomial factors is NP-hard. In Proc. 39th IEEE Symposium on Foundations of Computer Science, 1998, 99-109.
27. P. G. L. Dirichlet. Über die Reduktion der positiven quadratischen Formen mit drei unbestimmten ganzen Zahlen. Journal für die Reine und Angewandte Mathematik, 40: 209-227, 1850.
28. A. Dupré. Sur le nombre de divisions à effectuer pour obtenir le plus grande commun diviseur entre deux nombres entiers. Journal de Mathématiques, 11: 41-74, 1846.
29. S. Even, A. L. Selman and Y. Yacobi. The Complexity of Promise Problems with Applications to Public-key Cryptography. Information and Control 61: 159-173, 1984.
30. U. Feige and C. Lund. On the hardness of computing permanent of random matrices. In Proc. 14th ACM Symposium on Theory of Computing, 1982, 643-654.
31. P. Gemmell and M. Sudan. Highly resilient correctors for polynomials. Information Processing Letters, 43: 169-174, 1992.
32. O. Goldreich and S. Goldwasser. On the Limits of Non-Approximability of Lattice Problems. In Proc. 30th ACM Symposium on Theory of Computing, 1998, 1-9.
33. O. Goldreich, S. Goldwasser, and S. Halevi. Collision-free hashing from lattice problems. Available from ECCC as TR96-042.
34. O. Goldreich, S. Goldwasser, and S. Halevi. Public-key cryptosystems from lattice reduction problems. In Advances in Cryptology - CRYPTO '97, Burto S. Kaliski Jr. (Ed.), Lecture Notes in Computer Science, 1294: 112-131, Springer-Verlag, 1997.
35. O. Goldreich, S. Goldwasser, and S. Halevi. Eliminating decryption errors in the Ajtai-Dwork cryptosystem. In Advances in Cryptology - CRYPTO '97, Burto S. Kaliski Jr. (Ed.), Lecture Notes in Computer Science, 1294: 105-111, Springer-Verlag, 1997.
36. O. Goldreich, D. Micciancio, S. Safra and J-P. Seifert Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. Available from ECCC as TR99-002.
37. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer Verlag, 1988.
38. O. Goldreich and D. Ron and M. Sudan. Chinese remaindering with errors. Available from ECCC as TR 98-062.
39. P. M. Gruber and C. G. Lekkerkerker. Geometry of Numbers. North-Holland, 1987.
40. J. Håstad. Dual Vectors and Lower Bounds for the Nearest Lattice Point Problem. Combinatorica, 8: 75-81, 1988.
41. C. Hermite. Extraits de lettres de M. Ch. Hermite à M. Jacobi sur di érents objets de la théorie des nombres. Journal für die Reine und Angewandte Mathematik, 40: 261-278, 279-290, 291-307, 308-315, 1850.
42. E. Hewitt and K. A. Ross. Abstract Harmonic Analysis, Vol II. Berlin Göttingen Heidelberg: Springer 1970.
43. E. Kaltofen. Polynomial factorization 1987-1991. LATIN '92, Simon (Ed.), Lecture Notes in Computer Science, 583: 294-313, Springer, 1992.
44. R. Kannan. Minkowski’s convex body theory and integer programming. Mathematics of Operations Research, 12: 415-440, 1987.
45. N. Koblitz. Introduction to Elliptic Curves and Modular Forms. Springer-Verlag, GTM 97, 1984.
46. A. Korkin and G. Zolotarev. Sur les formes quadratiques positives quaternaires. Mathematische Annalen, 5: 581-583, 1872.
47. J. C. Lagarias. The computational complexity of simultaneous diophantine approximation problems. SIAM Journal of Computing, 14: 196-209, 1985.
48. J. C. Lagarias, H. W. Lenstra, and C. P. Schnorr. Korkin-Zolotarev Bases and Successive Minima of a Lattice and its Reciprocal Lattice. Combinatorica, 10(4): 333-348, 1990.
49. J. C. Lagarias and A. M. Odlyzko. Solving low-density subset sum problems. In Proc. 24th IEEE Symposium on Foundations of Computer Science, 1983, 1-10.
50. A. K. Lenstra, H. W. Lenstra, and L. Lovász. Factoring polynomials with rational coefficients. Mathematische Annalen, 261: 515-534, 1982.
51. H. W. Lenstra, Jr. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8: 538-548, 1983.
52. L. Lovász. An Algorithmic Theory of Numbers, Graphs and Convexity. SIAM, Philadelphia, 1986.
53. L. Lovász and H. Scarf. The generalized basis reduction algorithm. Mathematics of Operations Research, 17(3): 751-764, 1992.
54. K. Mahler. Ein Übertragungsprinzip für konvexe Körper. Čas. Pěstoväní Mat. Fys. 68: 93-102, 1939.
55. D. Micciancio. The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant. In Proc. 39th IEEE Symposium on Foundations of Computer Science, 1998, 92-98.
56. J. Milnor and D. Husemoller. Symmetric Bilinear Forms. Berlin Heidelberg New York: Springer 1973.
57. H. Minkowski. Über die positiven quadratischen Formen und über kettenbruchähnliche Algorithmen. Crelles Journal für die Reine und Angewandte Mathematik, 107: 278-297, 1891.
58. P. Nguyen and J. Stern. A converse to the Ajtai-Dwork security proof and its cryptographic implications. Available from ECCC as TR98-010.
59. P. Nguyen and J. Stern. Lattice Reduction in Cryptology: An Update. In these proceedings.
60. A. Odlyzko and H.J.J. te Riele. Disproof of the Mertens conjecture. Journal für die Reine und Angewandte Mathematik, 357: 138-160, 1985.
61. S. Ravikumar and D. Sivakumar. A note on the shortest lattice vector problem. In the Proceedings of the 14th Annual IEEE Conference on Computational Complexity, pp 200-204, 1999.
62. C. P. Schnorr. A hierarchy of polynomial time basis reduction algorithms. Theory of Algorithms, 375-386, 1985.
63. C. P. Schnorr and M. Euchner. Lattice basis reduction: Improved practical algorithms and solving subset sum problems. Mathematical Programming, 66: 181-199, 1994.
64. L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47: 85-93, 1986.
65. B. Vallée. Un problème central en géométrie algorithmique des nombres: la réduction des réseaux;atour de l’algorithme LLL. Inform. Théor. Appl., 345-376, 1989. English transl. by E. Kranakis, CWI Quart 3: 95-120, 1990.
66. P. van Emde Boas. Another NP-complete partition problem and the complexity of computing short vectors in lattices. Technical Report 81-04, Mathematics Department, University of Amsterdam, 1981.