Improved algorithms for the shortest vector problem and the closest vector problem in the infinity norm
From MaRDI portal
(Redirected from Publication:5091027)
Recommendations
- Sampling methods for shortest vectors, closest vectors and successive minima
- Faster exponential time algorithms for the shortest vector problem
- A sieve algorithm for the shortest lattice vector problem
- A sieve algorithm based on overlattices
- Shortest vector from lattice sieving: a few dimensions for free
Cites work
- A decade of lattice cryptography
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- A sieve algorithm for the shortest lattice vector problem
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
- Covering cubes and the closest vector problem
- Factoring polynomials with rational coefficients
- Finding shortest lattice vectors in the presence of gaps
- scientific article; zbMATH DE number 1852142 (Why is no real title available?)
- Improved low-density subset sum algorithms
- Integer Programming with a Fixed Number of Variables
- Just take the average! An embarrassingly simple \(2^n\)-time algorithm for SVP (and CVP)
- Minkowski's Convex Body Theorem and Integer Programming
- 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
- Sampling methods for shortest vectors, closest vectors and successive minima
- Sieve algorithms for the shortest vector problem are practical
- Solving the shortest vector problem in 2ⁿ time using discrete Gaussian sampling (extended abstract)
- Some sieving algorithms for lattice problems
Cited in
(8)- Approximate CVP\(_p\) in time \(2^{0.802n}\)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm!
- scientific article; zbMATH DE number 634031 (Why is no real title available?)
- On the security of OSIDH
- Simultaneous rational number codes: decoding beyond half the minimum distance with multiplicities and bad primes
- Heuristic algorithm for solving restricted SVP and its applications
- Decoding simultaneous rational evaluation codes
- Another look at the quantum security of the vectorization problem with shifted inputs
This page was built for publication: Improved algorithms for the shortest vector problem and the closest vector problem in the infinity norm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091027)
