Heuristic algorithm for solving restricted SVP and its applications
From MaRDI portal
Cites work
- A refined hardness estimation of LWE in two-step mode
- Advanced lattice sieving on GPUs, with tensor cores
- BKZ 2.0: Better lattice security estimates
- Estimating quantum speedups for lattice sieves
- Factoring polynomials with rational coefficients
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Finding closest lattice vectors using approximate Voronoi cells
- Hermite’s Constant and Lattice Algorithms
- scientific article; zbMATH DE number 1346524 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- Improved algorithms for the shortest vector problem and the closest vector problem in the infinity norm
- Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator
- Lattice decoding attacks on binary LWE
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- Learning with rounding, revisited. New reduction, properties and applications
- Lower bounds on lattice sieving and information set decoding
- LWE with side information: attacks and concrete security estimation
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ
- 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
- On the efficacy of solving LWE by reduction to unique-SVP
- Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all _p norms
- Shortest vector from lattice sieving: a few dimensions for free
- Sieve algorithms for the shortest vector problem are practical
- Sieve, Enumerate, Slice, and Lift:
- The general sieve kernel and new records in lattice reduction
- The nearest-colattice algorithm: time-approximation tradeoff for approx-CVP
- The randomized slicer for CVPP: sharper, faster, smaller, batchier
- Worst-case to average-case reductions for module lattices
This page was built for publication: Heuristic algorithm for solving restricted SVP and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969300)
