Speed-ups and time-memory trade-offs for tuple lattice sieving (Q1749293)
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: Speed-ups and time-memory trade-offs for tuple lattice sieving |
scientific article; zbMATH DE number 6869056
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Speed-ups and time-memory trade-offs for tuple lattice sieving |
scientific article; zbMATH DE number 6869056 |
Statements
Speed-ups and time-memory trade-offs for tuple lattice sieving (English)
0 references
16 May 2018
0 references
lattice-based cryptography
0 references
Shortest Vector problem (SVP)
0 references
nearest neighbor algorithms
0 references
lattice sieving
0 references
0.934301733970642
0 references
0.831764280796051
0 references
0.8157005310058594
0 references
0.8050414323806763
0 references
0.8041516542434692
0 references
