Parallel Gauss sieve algorithm: solving the SVP challenge over a 128-dimensional ideal lattice (Q5402985)
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: Parallel Gauss sieve algorithm: solving the SVP challenge over a 128-dimensional ideal lattice |
scientific article; zbMATH DE number 6273710
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel Gauss sieve algorithm: solving the SVP challenge over a 128-dimensional ideal lattice |
scientific article; zbMATH DE number 6273710 |
Statements
Parallel Gauss Sieve Algorithm: Solving the SVP Challenge over a 128-Dimensional Ideal Lattice (English)
0 references
25 March 2014
0 references
shortest vector problem
0 references
lattice-based cryptography
0 references
ideal lattice
0 references
Gauss sieve algorithm
0 references
parallel algorithm
0 references
0.8994702696800232
0 references
0.859756350517273
0 references
0.8339582085609436
0 references
0.8320290446281433
0 references
0.8230358958244324
0 references
