Segment LLL-reduction with floating point orthogonalization

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

Volumn 2146, Issue , 2001, Pages 81-96

  Koy, Henrik ^a   Schnorr, Claus Peter ^b  

^a DEUTSCHE BANK AG   (Germany)

^b GOETHE UNIVERSITY   (Germany)

Author keywords

Floating point arithmetic; Householder reflexion; LLL reduction; Local LLL reduction; Scaled basis; Segment LLL reduction; Stability

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; CRYPTOGRAPHY;

HOUSEHOLDER REFLEXION; LLL-REDUCTION; LOCAL LLL-REDUCTION; ORTHOGONAL VECTORS; ORTHOGONALIZATION; QR FACTORIZATIONS; REDUCTION ALGORITHMS; SCALED BASIS;

DIGITAL ARITHMETIC;

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

References (9)

1. 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.
2. H. Koy and C.P. Schnorr, Segment LLL-Reduction of Lattice Bases. Proceedings CaLC 2001, pp. 67-80.
3. A.K. Lenstra, H.W. Lenstra, and L. Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261, pp. 515-534, 1982.
4. C.L. Lawson and R.J. Hanson, Solving Least Square Problems, SIAM, Philadelphia, 1995. NTL. NTL homepage: http://www.shoup.net/ntl/, 2000.
5. C. Rössner and C.P. Schnorr, An optimal stable continued fraction algorithm for arbitrary dimension. 5.-th IPCO, LNCS 1084, pp. 31-43, Springer-Verlag, 1996.
6. C.P. Schnorr, A hierarchy of polynomial time lattice basis reduction algorithms, Theoretical Computer Science 53, pp. 201-224, 1987.
7. C.P. Schnorr, A more efficient algorithm for lattice basis reduction, J. Algorithms 9, pp. 47-62, 1988.
8. C.P. Schnorr and M. Euchner, Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems, Proc. Fundamentals of Computation Theory’91, L. Budach, ed., LNCS 529, Springer-Verlag, pp. 68-85, 1991. (Complete paper in Mathematical Programming Studies 66A, No 2, pp.181-199, 1994.)
9. 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.