Faster LLL-type Reduction of Lattice Bases

DOI10.1145/2930889.2930917zbMath1364.11167OpenAlexW2498807607MaRDI QIDQ2985850

Arnold Neumaier, Damien Stehlé

Publication date: 10 May 2017

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

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

zbMATH Keywords

blockinglattice reductionLLL

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 (5)

Bounding basis reduction properties ⋮ Towards faster polynomial-time lattice reduction ⋮ Improving bounds on elliptic curve hidden number problem for ECDH key exchange ⋮ Fast practical lattice reduction through iterated compression ⋮ Fast reduction of algebraic lattices over cyclotomic fields

This page was built for publication: Faster LLL-type Reduction of Lattice Bases