scientific article; zbMATH DE number 6820265
From MaRDI portal
Publication:4598216
Recommendations
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- On Bounded Distance Decoding for General Lattices
- On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications
- A bounded-distance decoding algorithm for lattices obtained from a generalized code formula
- Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices
- On the Proximity Factors of Lattice Reduction-Aided Decoding
- On the unique shortest lattice vector problem
- Generalized minimum-distance decoding of Euclidean-space codes and lattices
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- Bounded distance decoding of linear error-correcting codes with Gröbner bases
Cited in
(12)- Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- Improved broadcast attacks against subset sum problems via lattice oracle
- A note on BDD problems with _2-gap
- Improved analysis of the reduction from BDD to uSVP
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- On the efficacy of solving LWE by reduction to unique-SVP
- On Bounded Distance Decoding for General Lattices
- Hardness of bounded distance decoding on lattices in lp norms
- Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE
- On module unique-SVP and NTRU
- Fast slicer for Batch-CVP: making lattice hybrid attacks practical
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598216)
