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 9 items.
- Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) (← links)
- Post-quantum cryptography: lattice signatures (Q2390954) (← links)
- (Q2913823) (← 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)
- 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)
- Cryptography Based on Quadratic Forms: Complexity Considerations (Q5504549) (← links)