H-LLL

DOI10.1145/1576702.1576740zbMath1237.65041OpenAlexW2013585949MaRDI QIDQ2883828

Damien Stehlé, Gilles Villard, Ivan Morel

Publication date: 13 May 2012

Published in: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1576702.1576740

Mathematics Subject Classification ID

Algebraic number theory computations (11Y40) Orthogonalization in numerical linear algebra (65F25)

Related Items (7)

Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction ⋮ Algebraic number fields and the LLL algorithm ⋮ Fast practical lattice reduction through iterated compression ⋮ Computations of the Mertens function and improved bounds on the Mertens conjecture ⋮ Gradual sub-lattice reduction and a new complexity for factoring polynomials ⋮ LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme ⋮ On the complexity of the BKW algorithm on LWE

This page was built for publication: H-LLL