A note on BDD problems with _2-gap
From MaRDI portal
A note on BDD problems with \(\lambda 2\)-gap
Recommendations
Cites work
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
- Cryptanalysis of the Goldreich-Goldwasser-Halevi cryptosystem from Crypto '97
- Factoring polynomials with rational coefficients
- Improved low-density subset sum algorithms
- Minkowski's Convex Body Theorem and Integer Programming
- On Bounded Distance Decoding for General Lattices
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- On Lovász' lattice reduction and the nearest lattice point problem
- Predicting Lattice Reduction
- Public-key cryptosystems from lattice reduction problems
- Solving low-density subset sum problems
Cited in
(3)
This page was built for publication: A note on BDD problems with \(\lambda_2\)-gap
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2350585)