Pages that link to "Item:Q3595403"
From MaRDI portal
The following pages link to On Bounded Distance Decoding for General Lattices (Q3595403):
Displayed 10 items.
- Hardness of approximating the closest vector problem with pre-processing (Q430834) (← links)
- Dual lattice attacks for closest vector problems (with preprocessing) (Q826277) (← links)
- A note on BDD problems with \(\lambda_2\)-gap (Q2350585) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic (Q5091762) (← links)
- Hardness of bounded distance decoding on lattices in lp norms (Q5092487) (← links)
- Kissing Numbers and Transference Theorems from Generalized Tail Bounds (Q5232155) (← links)
- Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE (Q6108625) (← links)
- Classical reduction of gap SVP to LWE: a concrete security analysis (Q6112249) (← links)