Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing (Q3457102): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: NTRU / rank | |||
Normal rank | |||
Revision as of 08:27, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing |
scientific article |
Statements
Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing (English)
0 references
10 December 2015
0 references
lattices
0 references
shortest vector problem (SVP)
0 references
sieving algorithms
0 references
approximate nearest neighbor problem
0 references
locality-sensitive hashing (LSH)
0 references
