Lattice sparsification and the approximate closest vector problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 6607548
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- Approximate CVP\(_p\) in time \(2^{0.802n}\)
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- Some sieving algorithms for lattice problems
Cited in
(15)- The closest vector problem in tensored root lattices of type A and in their duals
- Approximate CVP\(_p\) in time \(2^{0.802n}\)
- Covering convex bodies and the closest vector problem
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm!
- Approx-SVP in ideal lattices with pre-processing
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices
- Some sieving algorithms for lattice problems
- Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights
- A polynomial time algorithm for solving the closest vector problem in zonotopal lattices
- Covering cubes and the closest vector problem
- scientific article; zbMATH DE number 6607548 (Why is no real title available?)
- The nearest-colattice algorithm: time-approximation tradeoff for approx-CVP
- Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE
- The identification of parameter in a finite set under one-bit quantized observations
- Nearest lattice point algorithms on semi k-reduced basis
This page was built for publication: Lattice sparsification and the approximate closest vector problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741786)
