-
Floating-Point LLL Revisited
Everybody knows the Lenstra-Lenstra-Lovász lattice basis reduction algorithm (LLL), which has proved invaluable in public-key cryptanalysis and in many other fields.... -
Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomia...
International audience -
Euclidean lattice basis reduction: algorithms and experiments for disclosing ...
We review polynomial time approaches for computing simultaneous integer relations among real numbers. A variant of the LLL lattice reduction algorithm (A. Lenstra, H.... -
Some numerical considerations for lattice basis reduction
Fastest algorithms and implementations for LLL basis reduction are highly hybrid symbolic-numeric. A "numerical engine" computes, via a orthogonalization process, the... -
Changing the ordering of Grobner Bases with LLL: Case of Two Variables
Colloque avec actes et comité de lecture. internationale.
