LLL reducing with the most significant bits

DOI10.1145/2608628.2608645zbMath1325.68298OpenAlexW2071721855MaRDI QIDQ3452418

Ivan Morel, Saruchi, Gilles Villard, Damien Stehlé

Publication date: 11 November 2015

Published in: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

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

zbMATH Keywords

floating point arithmeticLLLlattice basis reduction

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06)

Related Items (7)

Towards faster polynomial-time lattice reduction ⋮ Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem ⋮ Algebraic number fields and the LLL algorithm ⋮ Fast practical lattice reduction through iterated compression ⋮ The PSLQ algorithm for empirical data ⋮ Thrackles: An Improved Upper Bound ⋮ Revisiting orthogonal lattice attacks on approximate common divisor problems

Uses Software

• Jordan

Cites Work

• Unnamed Item
• Unnamed Item
• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
• Cylindrical algebraic decomposition using validated numerics
• The Jordan Curve Theorem, Formally and Informally
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Definability and decision problems in arithmetic

This page was built for publication: LLL reducing with the most significant bits