The convergence of slide-type reductions

DOI10.1007/978-3-030-75245-3_3zbMath1479.94264OpenAlexW3164485760MaRDI QIDQ2061912

Yanyan Li

Publication date: 21 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75245-3_3

zbMATH Keywords

dynamical systems analysislattice block reduction algorithms

Mathematics Subject Classification ID

Cryptography (94A60) Lattices and convex bodies (number-theoretic aspects) (11H06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Improving convergence and practicality of slide-type reductions

Cites Work

• Unnamed Item
• Unnamed Item
• A hierarchy of polynomial time lattice basis reduction algorithms
• Factoring polynomials with rational coefficients
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
• Slide reduction, revisited -- filling the gaps in SVP approximation
• The general sieve kernel and new records in lattice reduction
• Bounding basis reduction properties
• Post-quantum cryptography: lattice signatures
• Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
• Practical, Predictable Lattice Basis Reduction
• Approximating the densest sublattice from Rankin’s inequality
• Lattice Point Enumeration on Block Reduced Bases
• BKZ 2.0: Better Lattice Security Estimates
• Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
• Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
• Predicting Lattice Reduction
• Algorithms for the Densest Sub-Lattice Problem

This page was built for publication: The convergence of slide-type reductions