Pages that link to "Item:Q3546301"
From MaRDI portal
The following pages link to Hardness of approximating the shortest vector problem in lattices (Q3546301):
Displayed 17 items.
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) (← links)
- Restricted parameter range promise set cover problems are easy (Q2258109) (← links)
- The remote set problem on lattices (Q2353188) (← links)
- Post-quantum cryptography: lattice signatures (Q2390954) (← links)
- Improved analysis of the reduction from BDD to uSVP (Q2419802) (← links)
- Improved hardness results for unique shortest vector problem (Q2629774) (← links)
- (Q2913823) (← links)
- Lattice Point Enumeration on Block Reduced Bases (Q2947536) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle (Q3088093) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- Three Problems on Exponential Bases (Q3121314) (← links)
- Bounding the sum of square roots via lattice reduction (Q3584821) (← links)
- Identification and signatures based on NP-hard problems of indefinite quadratic forms (Q3612243) (← links)
- (Q5240427) (← links)
- Cryptography Based on Quadratic Forms: Complexity Considerations (Q5504549) (← links)