A complete analysis of the BKZ lattice reduction algorithm
From MaRDI portal
Lattices and convex bodies (number-theoretic aspects) (11H06) Quadratic forms (reduction theory, extreme forms, etc.) (11H55) Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Recommendations
Cites work
- A hierarchy of polynomial time lattice basis reduction algorithms
- A mean value theorem in geometry of numbers
- A modification of the LLL reduction algorithm
- A new principle in the geometry of numbers, with some applications.
- A sieve algorithm for the shortest lattice vector problem
- Advanced lattice sieving on GPUs, with tensor cores
- Analyzing blockwise lattice algorithms using dynamical systems
- BKZ 2.0: Better lattice security estimates
- Bounding basis reduction properties
- Bounds for Cofactors and Arithmetic Minima of Quadratic Forms
- Computing a lattice basis revisited
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Faster LLL-type Reduction of Lattice Bases
- Finding short lattice vectors within Mordell's inequality
- scientific article; zbMATH DE number 3750287 (Why is no real title available?)
- scientific article; zbMATH DE number 3456979 (Why is no real title available?)
- scientific article; zbMATH DE number 1346524 (Why is no real title available?)
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator
- Improving convergence and practicality of slide-type reductions
- Lattice enumeration using extreme pruning
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- Lower bounds on lattice enumeration with extreme pruning
- Observation on the Minimum of a Positive Quadratic Form in Eight Variables
- On the KZ Reduction
- Predicting Lattice Reduction
- Projection matrices, generalized inverse matrices, and singular value decomposition.
- Random sampling revisited: lattice enumeration with discrete pruning
- Rankin’s Constant and Blockwise Lattice Reduction
- Slide reduction, revisited -- filling the gaps in SVP approximation
- Solving the shortest vector problem in 2ⁿ time using discrete Gaussian sampling (extended abstract)
- The general sieve kernel and new records in lattice reduction
- The incomplete beta function - a historical profile
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes
Cited in
(5)- Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/2
- Cryptanalysis of an efficient signature based on isotropic quadratic forms
- Discrete Gaussian sampling for BKZ-reduced basis
- Quantum collision search for ternary LWE keys
- Solving the shortest vector problem in \(2^{0.63269n+o(n)}\) time on random lattices
This page was built for publication: A complete analysis of the BKZ lattice reduction algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665548)
