A new lattice sieving algorithm base on angular locality-sensitive hashing (Q1745006)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new lattice sieving algorithm base on angular locality-sensitive hashing |
scientific article; zbMATH DE number 6862390
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new lattice sieving algorithm base on angular locality-sensitive hashing |
scientific article; zbMATH DE number 6862390 |
Statements
A new lattice sieving algorithm base on angular locality-sensitive hashing (English)
0 references
20 April 2018
0 references
filtered triple sieving
0 references
angular locality-sensitive hashing
0 references
shortest vector problem
0 references
closest vector problem
0 references
0.9157436
0 references
0.8834649
0 references
0.87941384
0 references
0.8500955
0 references
0.8481251
0 references
0.82871836
0 references
0.8270327
0 references
0.82397056
0 references
0.81997067
0 references
