Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing (Q2946443)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6482940
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing |
scientific article; zbMATH DE number 6482940 |
Statements
Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing (English)
0 references
17 September 2015
0 references
shortest vector problem (SVP)
0 references
sieving algorithms
0 references
nearest neighbor problem
0 references
locality-sensitive hashing (LSH)
0 references
lattice cryptography
0 references
0 references
0 references
0 references
0 references
0 references
0.9536786675453186
0 references
0.884260892868042
0 references
0.8842441439628601
0 references
0.8624635934829712
0 references
0.8569096326828003
0 references
