Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
From MaRDI portal
Recommendations
- Sieve algorithms for the shortest vector problem are practical
- Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector problem
- Rigorous and Efficient Short Lattice Vectors Enumeration
- Faster exponential time algorithms for the shortest vector problem
- A sieve algorithm for the shortest lattice vector problem
Cited in
(55)- Sampling methods for shortest vectors, closest vectors and successive minima
- Shortest vector from lattice sieving: a few dimensions for free
- On the asymptotic complexity of solving LWE
- On lattice-based algebraic feedback shift registers synthesis for multisequences
- Second order statistical behavior of LLL and BKZ
- Approximate Voronoi cells for lattices, revisited
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- The convergence of slide-type reductions
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- New orthogonality criterion for shortest vector of lattices and its applications
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes
- Subexponential time relations in the class group of large degree number fields
- Scalable revocable identity-based signature over lattices in the standard model
- Improving convergence and practicality of slide-type reductions
- Finding shortest lattice vectors in the presence of gaps
- A sieve algorithm based on overlattices
- Subexponential class group and unit group computation in large degree number fields
- Lower bounds of shortest vector lengths in random NTRU lattices
- A fast phase-based enumeration algorithm for SVP challenge through \(y\)-sparse representations of short lattice vectors
- Lattice Point Enumeration on Block Reduced Bases
- Reducing number field defining polynomials: an application to class group computations
- Algorithms for the shortest and closest lattice vector problems
- Analysis of Gauss-sieve for solving the shortest vector problem in lattices
- BKZ 2.0: Better lattice security estimates
- Sieve algorithms for the shortest vector problem are practical
- Rigorous and Efficient Short Lattice Vectors Enumeration
- Improvements in closest point search based on dual HKZ-bases
- Sieve, Enumerate, Slice, and Lift:
- Cloud-assisted LLL: a secure and efficient outsourcing algorithm for approximate shortest vector problem
- Hermite’s Constant and Lattice Algorithms
- LLL: a tool for effective Diophantine approximation
- Analyzing blockwise lattice algorithms using dynamical systems
- A Digital Signature Scheme Based on CVP ∞
- Cryptography Based on Quadratic Forms: Complexity Considerations
- Random sampling revisited: lattice enumeration with discrete pruning
- scientific article; zbMATH DE number 6607548 (Why is no real title available?)
- Improvements in the analysis of Kannan's CVP algorithm
- Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation
- Structured ( ,+)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems
- Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation
- Attacking (EC)DSA scheme with ephemeral keys sharing specific bits
- On polynomial modular number systems over \(\mathbb{Z}/p\mathbb{Z}\)
- A new bound for the orthogonality defect of HKZ reduced lattices
- Concrete analysis of quantum lattice enumeration
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
- Attacking (EC)DSA with partially known multiples of nonces
- A complete analysis of the BKZ lattice reduction algorithm
- On the smallest ratio problem of lattice bases
- On the ability to approximate k-DSP of HKZ, BKZ and slide reduction
- Extending Regev's quantum algorithm to elliptic curves
- A quasi-polynomial time algorithm for the extrapolated dihedral coset problem over power-of-two moduli
- Cryptanalysis of LWE and SIS-based cryptosystems by using quantum annealing
- Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding
- Improved (provable) algorithms for the shortest vector problem via bounded distance decoding
This page was built for publication: Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612549)
