The following pages link to (Q3549646):
Displaying 17 items.
- Lower bounds of shortest vector lengths in random NTRU lattices (Q477183) (← links)
- Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) (← links)
- Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) (← links)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
- Restricted parameter range promise set cover problems are easy (Q2258109) (← links)
- Revisiting lower dimension lattice attacks on NTRU (Q2681396) (← links)
- Improving convergence and practicality of slide-type reductions (Q2687993) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle (Q3088093) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH (Q5002683) (← links)
- LLL: A Tool for Effective Diophantine Approximation (Q5188542) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
- A Digital Signature Scheme Based on CVP ∞ (Q5445459) (← links)
- Approximate CVP_p in Time 2^{0.802 n} (Q5874513) (← links)
- A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (Q5892608) (← links)
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems (Q6644081) (← links)
