Faster LLL-type Reduction of Lattice Bases

DOI10.1145/2930889.2930917MaRDI QIDQ2985850zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Fast LLL-type lattice reduction
• Towards faster polynomial-time lattice reduction
• An experimental comparison of some LLL-type lattice basis reduction algorithms
• A more efficient algorithm for lattice basis reduction
• scientific article; zbMATH DE number 3958726
• scientific article; zbMATH DE number 799775
• Segment LLL reduction of lattice bases using modular arithmetic
• Fast reduction of algebraic lattices over cyclotomic fields
• Progress on LLL and lattice reduction
• A generalization of LLL lattice basis reduction over imaginary quadratic fields

Cited in

(27)

• Segment LLL reduction of lattice bases using modular arithmetic
• Fast reduction of algebraic lattices over cyclotomic fields
• Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
• Towards faster polynomial-time lattice reduction
• A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths
• Bounding basis reduction properties
• Fast LLL-type lattice reduction
• Reduction of lattice bases for arbitrary norms
• scientific article; zbMATH DE number 3958726 (Why is no real title available?)
• Complexity Analysis of a Parallel Lattice Basis Reduction Algorithm
• scientific article; zbMATH DE number 1256681 (Why is no real title available?)
• scientific article; zbMATH DE number 1263369 (Why is no real title available?)
• scientific article; zbMATH DE number 1852137 (Why is no real title available?)
• LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
• Computing an LLL-reduced basis of the orthogonal latice
• A verified efficient implementation of the LLL basis reduction algorithm
• Adaptive precision floating point LLL
• An LLL-reduction algorithm with quasi-linear time complexity, extended abstract
• Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)
• Heuristics on lattice basis reduction in practice
• Improving bounds on elliptic curve hidden number problem for ECDH key exchange
• Fast practical lattice reduction through iterated compression
• A complete analysis of the BKZ lattice reduction algorithm
• An experimental comparison of some LLL-type lattice basis reduction algorithms
• New results on elliptic curve hidden number problem for ECDH key exchange
• Towards a modern LLL implementation
• Optimal systems of fundamental \(S\)-units for LLL-reduction

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2985850)