Segment LLL-Reduction with Floating Point Orthogonalization
Authors:
- 17 September 2001
- book chapter
- Published by Springer Nature
- p. 81-96
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Segment LLL-Reduction of Lattice Bases2001
- Public-key cryptosystems from lattice reduction problems1997
- An optimal, stable continued fraction algorithm for arbitrary dimensionLecture Notes in Computer Science, 1996
- Solving Least Squares Problems1995
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems1991
- A more efficient algorithm for lattice basis reductionJournal of Algorithms, 1988
- A hierarchy of polynomial time lattice basis reduction algorithmsTheoretical Computer Science, 1987
- Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm1984
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982