Lattice reduction by random sampling and birthday methods

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

Volumn 2607, Issue , 2003, Pages 145-156

  Schnorr, Claus Peter ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

APPROXIMATION FACTOR; HIGH-DIMENSIONAL; LATTICE REDUCTION; LATTICE VECTORS; ORTHOGONAL BASIS; RANDOM SAMPLING; REDUCTION METHOD; SUB-LATTICES;

ALGORITHMS;

EID: 35248874386     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36494-3_14     Document Type: Article

References (25)

1. 2 is NP-hard for randomised reductions. Proc. 30th STOC, pp. 10-19, 1998.
2. M. Ajtai, The worst-case behaviour of Schnorr's algorithm approximating the shortest nonzero vector in a lattice. Preprint 2002.
3. M. Ajtai, R. Kumar, and D. Sivakumar, A sieve algorithm for the shortest lattice vector problem. Proc. 33th STOC, 2001.
4. P. Camion, and J. Patarin, The knapsack hash function proposed at Crypto'89 can be broken. Proc. Eurocrypt'91, LNCS 457, Springer-Verlag, pp. 39-53, 1991.
5. P. van Emde Boas, Another NP-complete partition problem and the complexity of computing short vectors in a lattice. Mathematics Department, University of Amsterdam, TR 81-04, 1981.
6. O. Goldreich, S. Goldwasser, and S. Halevi, Public key cryptosystems from lattice reduction problems. Proc. Crypto'97, LNCS 1294, Springer-Verlag, pp. 112-131, 1997.
7. B. Helfrich, Algorithms to construct Minkowski reduced and Hermite reduced bases. Theor. Comp. Sc. 41, pp. 125-139, 1985.
8. R. Kannan, Minkowski's convex body theorem and integer programming. Mathematics of Operations Research 12 pp. 415-440, 1987,
9. Preliminary version in Proc. 13th STOC, 1983.
10. D. E. Knuth, The Art of Computer Programming, Vol 1, Fundamental Algorithms. 3rd Edidtion, Addison-Wesley, Reading, 1997.
11. H. Koy and C.P. Schnorr, Segment and strong Segment LLL-reduction of lattice bases. Preprint University Frankfurt, 2002, http://www.mi.informatik.uni-frankfurt.de/research/papers.html
12. H. Koy and C.P. Schnorr, Segment LLL-reduction of lattice bases. Proc. CaLC 2001, LNCS 2146, Springer-Verlag, pp. 67-80, 2001.
13. H. Koy, Primale/duale Segment-Reduktion von Gitterbasen. Slides of a lecture, Frankfurt, December 2000.
14. H. Koy and C.P. Schnorr, Segment LLL-reduction of lattice bases with floating point orthogonalization. Proc. CaLC 2001, LNCS 2146, Springer-Verlag, pp. 81-96, 2001.
15. A. K. Lenstra, H. W. Lenstra, and L. Lovasz, Factoring polynomials with rational coefficients. Math. Ann. 261, pp. 515-534, 1982.
16. D. Micciancio, The shortest vector in a lattice is NP-hard to approximate to within some constant. Proc. 39th Symp. FOCS, pp. 92-98, 1998,
17. full paper SIAM Journal on Computing, 30 (6), pp. 2008-2035, March 2001.
18. P. Q. Nguyen, Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto'97. Proc. Crypto'99, LNCS 1666, Springer-Verlag, pp. 288-304, 1999.
19. P. Q. Nguyen and J. Stern, Lattice reduction in cryptology: an update. Proc. ANTS-IV, LNCS 1838, Springer-Verlag, pp. 188-112. full version http://www.di.ens.fr/∼{pnguyen,stern}/
20. V. Shoup, Number Theory Library, http: //www.shoup.net/ntl
21. C.P. Schnorr, A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comp. Sc. 53, pp. 201-224, 1987.
22. C.P. Schnorr, A more efficient algorithm for lattice reduction. J. of Algor. 9, 47-62, 1988.
23. C.P. Schnorr and M. Euchner, Lattice Basis Reduction and Solving Subset Sum Problems. Fundamentals of Comput. Theory, Lecture Notes in Comput. Sci., 591, Springer, New York, 1991, pp. 68-85.
24. The complete paper appeared in Math. Programming Studies, 66A, 2, pp. 181-199, 1994.
25. D. Wagner, A Generalized Birthday Problem. Proceedings Crypto'02, LNCS 2442, Springer-Verlag, pp. 288-303, 2002. full version http://www.cs.berkeley.edu/∼daw/papers/