Pages that link to "Item:Q3535352"
From MaRDI portal
The following pages link to Explicit Hard Instances of the Shortest Vector Problem (Q3535352):
Displaying 9 items.
- Generating shorter bases for hard random lattices (Q537918) (← links)
- Optimization of search space for finding very short lattice vectors (Q1995508) (← links)
- Optimum commutative group codes (Q2256103) (← links)
- Bounding basis reduction properties (Q2364641) (← links)
- Post-quantum cryptography: lattice signatures (Q2390954) (← links)
- Application of mixed integer quadratic program to shortest vector problems (Q3121492) (← links)
- PBKZ algorithm and its application in lattice challenge (Q3385805) (← links)
- Explicit Hard Instances of the Shortest Vector Problem (Q3535352) (← links)
- Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients (Q5034517) (← links)