An LLL-reduction algorithm with quasi-linear time complexity
From MaRDI portal
Publication:5419110
DOI10.1145/1993636.1993691zbMath1288.68294OpenAlexW2025623851MaRDI QIDQ5419110
Damien Stehlé, Andrew Novocin, Gilles Villard
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1993636.1993691
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (17)
Bounding basis reduction properties ⋮ Towards faster polynomial-time lattice reduction ⋮ Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction ⋮ Constructing totally p-adic numbers of small height ⋮ A log-log speedup for exponent one-fifth deterministic integer factorisation ⋮ PotLLL: a polynomial time version of LLL with deep insertions ⋮ Deterministic factoring with oracles ⋮ On the modular inversion hidden number problem ⋮ Fast practical lattice reduction through iterated compression ⋮ On the computation of the HNF of a module over the ring of integers of a number field ⋮ Storage efficient algorithm for Hermite normal form using LLL ⋮ LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme ⋮ An experimental comparison of some LLL-type lattice basis reduction algorithms ⋮ Modular polynomials on Hilbert surfaces ⋮ Fast reduction of algebraic lattices over cyclotomic fields ⋮ Revisiting orthogonal lattice attacks on approximate common divisor problems ⋮ On the quantum complexity of the continuous hidden subgroup problem
This page was built for publication: An LLL-reduction algorithm with quasi-linear time complexity
