scientific article; zbMATH DE number 5485482
From MaRDI portal
Publication:3549646
Cited in
(20)- Sampling methods for shortest vectors, closest vectors and successive minima
- Approximate CVP\(_p\) in time \(2^{0.802n}\)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm!
- Restricted parameter range promise set cover problems are easy
- Revisiting lower dimension lattice attacks on NTRU
- Improving convergence and practicality of slide-type reductions
- Algorithms for the shortest and closest lattice vector problems
- Approximating the closest vector problem using an approximate shortest vector oracle
- The geometry of lattice cryptography
- Lower bounds of shortest vector lengths in random NTRU lattices
- Parameterized intractability of even set and shortest vector problem from Gap-ETH
- LLL: a tool for effective Diophantine approximation
- Cryptographic functions from worst-case complexity assumptions
- A Digital Signature Scheme Based on CVP ∞
- Approximate CVP_p in Time 2^{0.802 n}
- A simple deterministic reduction for the gap minimum distance of code problem
- Verification of NP-Hardness Reduction Functions for Exact Lattice Problems
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
- Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding
- Improved (provable) algorithms for the shortest vector problem via bounded distance decoding
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 Q3549646)
