Segment LLL-reduction of lattice bases

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

Volumn 2146, Issue , 2001, Pages 67-80

  Koy, Henrik ^a   Schnorr, Claus Peter ^b  

^a DEUTSCHE BANK AG   (Germany)

^b GOETHE UNIVERSITY   (Germany)

Author keywords

Divide and conquer; Iterated segments; LLL reduction; Local coordinates; Local LLL reduction; Segments; Shortest lattice vector

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DIVIDE AND CONQUER; ITERATED SEGMENTS; LATTICE VECTORS; LLL-REDUCTION; LOCAL COORDINATE; LOCAL LLL-REDUCTION; SEGMENTS;

CRYPTOGRAPHY;

EID: 84958953465     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44670-2_7     Document Type: Conference Paper

References (14)

1. D. Bleichenbacher and P.Q. Nguyen, Noisy Polynomial Interpolation and Noisy Chinese Remaindering, Proc. Eurocrypt’00, LNCS 1807, Springer-Verlag, pp. 53-69, 2000.
2. D. Boneh, Finding Smooth Integers in Small Intervals Using CRT Decoding, Proc. STOC’00, ACM Press, pp. 265-272, 2000.
3. J. Cai, The Complexity of some Lattice Problems, Proc. ANTS’00, LNCS 1838, Springer-Verlag, pp. 1-32, 2000.
4. D. Coppersmith, Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities, J. Crypt. 10, pp. 233-260, 1997.
5. R. Kannan, Minkowski’s Convex Body Theorewm and Integer Programming. Mathematical Operation Research, 12, pp. 415-440, 1984.
6. H. Koy, Notes of a Lecture. Frankfurt 2001.
7. H. Koy and C.P. Schnorr, LLL-Reduction with Floating Point Orthogonalization. This proceedings CaLC 2001, pp. 81-96.
8. A.K. Lenstra, H.W. Lenstra and L. Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261, pp. 515-534, 1982.
9. P.Q. Nguyen and J. Stern, Lattice Reduction in Cryptology, An Update, Proc. ANTS’00, LNCS 1838, Springer-Verlag, pp. 85-112, 2000.
10. C.P. Schnorr, A hierarchy of polynomial time lattice basis reduction algorithms, Theoretical Computer Science 53, pp. 201-224, 1987.
11. C.P. Schnorr and M. Euchner, Lattice Basis Reduction and Solving Subset Sum Problems. Proceedings FCT’91, LNCS 591, Springer-Verlag, pp. 68-85, 1991. The complete paper appeared in Mathematical Programming Studies, 66, 2, pp. 181-199, 1994.
12. C.P. Schnorr, Block Reduced Lattice Bases and Successive Minima, Combinatorics, Probability and Computing, 3, pp. 507-522, 1994.
13. C.P. Schnorr and H. Hörner, Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction. Proceedings Eurocrypt’95, LNCS 921, Springer-Verlag, pp. 1-12, 1995.
14. A. Schönhage, Factorization of univariate integer polynomials by Diophantine approximation and improved lattice basis reduction algorithm, Proc. 11-th Coll. Automata, Languages and Programming, Antwerpen 1984, LNCS 172, Springer-Verlag, pp. 436-447, 1984.