A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge
From MaRDI portal
Publication:4964363
DOI10.1007/978-981-15-5191-8_15zbMath1459.94150OpenAlexW3094465367MaRDI QIDQ4964363
Publication date: 25 February 2021
Published in: International Symposium on Mathematics, Quantum Theory, and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-981-15-5191-8_15
Related Items (8)
A trace map attack against special ring-LWE samples ⋮ Solving the search-LWE problem over projected lattices ⋮ An extension of Kannan's embedding for solving ring-based LWE problems ⋮ Revisiting lower dimension lattice attacks on NTRU ⋮ Development and analysis of massive parallelization of a lattice basis reduction algorithm ⋮ Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems ⋮ LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme ⋮ Application of mixed integer quadratic program to shortest vector problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors
- On Lovász' lattice reduction and the nearest lattice point problem
- A modification of the LLL reduction algorithm
- 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
- Shortest vector from lattice sieving: a few dimensions for free
- Development of a dual version of DeepBKZ and its application to solving the LWE challenge
- Fast lattice basis reduction suitable for massive parallelization and its application to the shortest vector problem
- Lower bounds on lattice enumeration with extreme pruning
- Estimate all the {LWE, NTRU} schemes!
- Self-dual DeepBKZ for finding short lattice vectors
- The general sieve kernel and new records in lattice reduction
- A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths
- Explicit formula for Gram-Schmidt vectors in LLL with deep insertions and its applications
- Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
- Practical, Predictable Lattice Basis Reduction
- Mathematics of Public Key Cryptography
- Tuning GaussSieve for Speed
- Tuple lattice sieving
- BKZ 2.0: Better Lattice Security Estimates
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Sieve algorithms for the shortest vector problem are practical
- Lattice Enumeration Using Extreme Pruning
- Similarity estimation techniques from rounding algorithms
- Minkowski's Convex Body Theorem and Integer Programming
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
- On the equidistribution of Hecke points
- A sieve algorithm for the shortest lattice vector problem
- Hermite’s Constant and Lattice Algorithms
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- Fast Lattice Point Enumeration with Minimal Overhead
- Predicting Lattice Reduction
- Improved Algorithms for the Approximate k-List Problem in Euclidean Norm
- Random Sampling Revisited: Lattice Enumeration with Discrete Pruning
This page was built for publication: A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge
