Towards a modern LLL implementation

DOI10.1007/978-981-95-5099-9_3MaRDI QIDQ7228240zbMATH OpenFDO

Authors Léo Ducas, Ludo N. Pulles, Marc Stevens

Publication date 13 April 2026

Full work available at URL https://doi.org/10.1007/978-981-95-5099-9_3

zbMATH Keywords

concrete performancedivide and conquerlattice reductionLLLparallelismsegmentation

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A more efficient algorithm for lattice basis reduction
• Accuracy and Stability of Numerical Algorithms
• Advanced lattice sieving on GPUs, with tensor cores
• Algorithmic Number Theory
• An LLL algorithm with quadratic complexity
• An LLL-reduction algorithm with quasi-linear time complexity, extended abstract
• Analyzing blockwise lattice algorithms using dynamical systems
• BKZ 2.0: Better lattice security estimates
• Bounding basis reduction properties
• Exploiting fast matrix multiplication within the level 3 BLAS
• Factoring polynomials and the knapsack problem
• Factoring polynomials with rational coefficients
• Fast LLL-type lattice reduction
• Fast practical lattice reduction through iterated compression
• Faster LLL-type Reduction of Lattice Bases
• Finding short lattice vectors within Mordell's inequality
• Floating-Point LLL: Theoretical and Practical Aspects
• Gaussian elimination is not optimal
• Geometry of Numbers
• H-LLL: using Householder inside LLL
• scientific article; zbMATH DE number 3870586 (Why is no real title available?)
• scientific article; zbMATH DE number 3909733 (Why is no real title available?)
• scientific article; zbMATH DE number 3910295 (Why is no real title available?)
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 1263369 (Why is no real title available?)
• scientific article; zbMATH DE number 1273650 (Why is no real title available?)
• scientific article; zbMATH DE number 1962809 (Why is no real title available?)
• scientific article; zbMATH DE number 1852137 (Why is no real title available?)
• scientific article; zbMATH DE number 1852138 (Why is no real title available?)
• Integer and polynomial multiplication: towards optimal Toom-Cook matrices
• Lattice attacks on NTRU and LWE: a history of refinements
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Lattice enumeration using extreme pruning
• LLL reducing with the most significant bits
• MPFR
• New directions in nearest neighbor searching with applications to lattice sieving
• On lattices, learning with errors, random linear codes, and cryptography
• On Lovász' lattice reduction and the nearest lattice point problem
• Perturbation analysis of the QR factor R in the context of LLL lattice basis reduction
• PotLLL: a polynomial time version of LLL with deep insertions
• Predicting Lattice Reduction
• Progress on LLL and lattice reduction
• Shortest vector from lattice sieving: a few dimensions for free
• Sieve algorithms for the shortest vector problem are practical
• Simultaneous reduction of a lattice basis and its reciprocal basis
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Solving low density knapsacks
• The general sieve kernel and new records in lattice reduction
• The LLL algorithm. Survey and applications
• Towards faster polynomial-time lattice reduction

Cited in

(1)

• Cool + cruel = dual, and new benchmarks for sparse LWE

This page was built for publication: Towards a modern LLL implementation

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