Almost perfect lattices, the covering radius problem, and applications to Ajtai's connection factor

SIAM Journal on Computing

Volumn 34, Issue 1, 2005, Pages 118-169

  Micciancio, Daniele ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Almost perfect lattices; Average case complexity; Closest vector problem with preprocessing; Covering radius; Cryptography; Hash functions; Point lattices; Shortest vector problem

Indexed keywords

ALMOST PERFECT LATTICES; AVERAGE-CASE COMPLEXITY; CLOSEST VECTOR PROBLEM WITH PREPROCESSING; COVERING RADIUS; HASH FUNCTIONS; POINT LATTICES; SHORTEST VECTOR PROBLEM;

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; DECODING; PROBABILITY; VECTORS;

RANDOM PROCESSES;

EID: 16244401113     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703433511     Document Type: Article

References (42)

1. D. AHARONOV AND O. REGEV, Lattice problems in NP intersect coNP, in 45th Annual IEEE Symposium on Foundations of Computer Science, Rome, Italy, 2004, to appear.
2. M. AJTAI, Generating hard instances of lattice problems (extended abstract), in Proceedings of the 28th Annual ACM Symposium on Theory of Computing, Philadelphia, PA, 1996, pp. 99-108.
3. 2 is NP-hard for randomized reductions (extended abstract), in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, TX, 1998, pp. 10-19.
4. M. AJTAI AND C. DWORK, A public-key cryptosystem with worst-case/average-case equivalence, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 284-293.
5. M. AJTAI, R. KUMAR, AND D. SIVAKUMAR, A sieve algorithm for the shortest lattice vector problem, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, Heraklion, Crete, Greece, 2001, pp. 266-275.
6. L. BABAI, On Lovasz' lattice reduction and the nearest lattice point problem, Combinatorica, 6 (1986), pp. 1-13.
7. W. BANASZCZYK, New bounds in some transference theorems in the geometry of numbers, Math. Ann., 296 (1993), pp. 625-635.
8. J. BLÖMER AND J.-P. SEIFERT, On the complexity of computing short linearly independent vectors and short bases in a lattice, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Atlanta, GA, 1999, pp. 711-720.
9. J. BRUCK AND M. NAOR, The hardness of decoding linear codes with preprocessing, IEEE Trans. Inform. Theory, 36 (1990), pp. 381-385.
10. G. J. BUTLER, Simultaneous packing and covering in Euclidean space, Proc. London Math. Soc., 25 (1972), pp. 721-735.
11. J.-Y. CAI AND A. P. NERURKAR, An improved worst-case to average-case connection for lattice problems (extended abstract), in Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, Miami Beach, FL, 1997, pp. 468-477.
12. J. H. CONWAY AND N. J. A. SLOANE, Sphere Packings, Lattices and Groups, 3rd ed., Springer-Verlag, New York, 1998.
13. I. DINUR, G. KINDLER, R. RAZ, AND S. SAFRA, Approximating CVF to within almost-polynomial factors is NP-hard, Combinatorica, 23 (2003), pp. 205-243.
14. M. DYER, A. FRIEZE, AND R. KANNAN, A random polynomial-time algorithm for approximating the volume of convex bodies, J. ACM, 38 (1991), pp. 1-17.
15. U. FEIGE AND D. MICCIANCIO, The inapproximability of lattice and coding problems with preprocessing, J. Comput. System Sci., 69 (2004), pp. 45-67.
16. O. GOLDREICH, Foundation of Cryptography - Basic Tools, Cambridge University Press, Cambridge, UK, 2001.
17. O. GOLDREICH AND S. GOLDWASSER, On the limits of nonapproximability of lattice problems, J. Comput. System Sci., 60 (2000), pp. 540-563.
18. O. GOLDREICH, S. GOLDWASSER, AND S. HALEVI, Collision-free hashing from lattice problems, Tech. report TR96-056, Electronic Colloquium on Computational Complexity, 1996, http://www.eccc.uni-trier.de/eccc/.
19. O. GOLDREICH, D. MICCIANCIO, S. SAFRA, AND J.-P. SEIFERT, Approximating shortest lattice vectors is not harder than approximating closest lattice vectors, Inform. Process. Lett., 71 (1999), pp. 55-61.
20. V. GURUSWAMI, D. MICCIANCIO, AND O. REGEV, The complexity of the covering radius problem on lattices and codes, in Proceedings of the 19th Annual IEEE Conference on Computational Complexity, Amherst, MA, 2004, pp. 161-173.
21. I. HONKALA AND A. TIETÄVÄINEN, Codes and number theory, Handbook of Coding Theory, Vol. 2, Elsevier, New York, 1998, pp. 1141-1194.
22. R. KANNAN, Algorithmic geometry of numbers, in Annual Reviews of Computer Science Vol. 2, Annual Review Inc., Palo Alto, CA, 1987, pp. 231-267.
23. R. KANNAN, Minkowski's convex body theorem and integer programming, Math. Oper. Res., 12 (1987), pp. 415-440.
24. R. KANNAN, Lattice translates of a polytope and the Frobenius problem, Combinatorica, 12 (1992), pp. 161-177.
25. R. KANNAN AND S. VEMPALA, Sampling lattice points, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 696-700.
26. J. C. LAGARIAS, H. W. LENSTRA, JR., AND C.-P. SCHNORR, Korkine-Zolotarev bases and successive minima of a lattice and its reciprocal lattice, Combinatorica, 10 (1990), pp. 333-348.
27. A. K. LENSTRA, H. W. LENSTRA, JR., AND L. LOVÁSZ, Factoring polynomials with rational coefficients, Math. Ann., 261 (1982), pp. 513-534.
28. A. LOBSTEIN, The hardness of solving subset sum with preprocessing, IEEE Trans. Inform. Theory, 36 (1990), pp. 943-946.
29. J. E. MAZO AND A. M. ODLYZKO, Lattice points in high dimensional spheres, Monatsh. Math., 110 (1990), pp. 47-61.
30. A. MCLOUGHLIN, The complexity of computing the covering radius of a code, IEEE Trans. Inform. Theory, 30 (1984), pp. 800-804.
31. D. MICCIANCIO, The hardness of the closest vector problem with preprocessing, IEEE Trans. Inform. Theory, 47 (2001), pp. 1212-1215.
32. D. MICCIANCIO, Improving lattice based cryptosystems using the Hermite normal form, in Cryptography and Lattices Conference, Lecture Notes in Comput. Sci. 2146, J. Silver-man, ed., Springer-Verlag, Berlin, 2001, pp. 126-145.
33. D. MICCIANCIO, The shortest vector in a lattice is hard to approximate to within some constant, SIAM J. Comput., 30 (2001), pp. 2008-2035.
34. D. MICCIANCIO, Generalized compact knapsaks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions, in Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, Vancouver, BC, Canada, 2002, pp. 356-365.
35. D. MICCIANCIO, Improved cryptographic hash functions with worst-case/average-case connection, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, Montréal, Québec, Canada, 2002, pp. 609-618.
36. D. MICCIANCIO AND S. GOLDWASSER, Complexity of Lattice Problems: A Cryptographic Perspective, Kluwer Internat. Ser. Engrg. Comput. Sci. 671, Kluwer Academic Publishers, Boston, 2002.
37. J. MILNOR AND D. HUSEMOLLER, Symmetric Bilinear Forms, Springer-Verlag, New York, 1973.
38. O. REGEV, Improved inapproximability of lattice and coding problems with preprocessing, in Proceedings of the 18th Annual IEEE Conference on Computational Complexity, Arhus, Denmark, 2003, pp. 315-322.
39. O. REGEV, New lattice based cryptographic constructions, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, San Diego, CA, 2003, pp. 407-426.
40. C. A. ROGERS, A note on coverings and packings, J. London Math. Soc., 25 (1950), pp. 327-331.
41. C.-P. SCHNORR, A hierarchy of polynomial time lattice basis reduction algorithms, Theoret. Comput. Sci., 53 (1987), pp. 201-224.
42. A. VARDY, Algorithmic complexity in coding theory and the minimum distance problem, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 92-109.