A fast phase-based enumeration algorithm for SVP challenge through \(y\)-sparse representations of short lattice vectors (Q2942829)
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 fast phase-based enumeration algorithm for SVP challenge through y-sparse representations of short lattice vectors |
scientific article; zbMATH DE number 6481211
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast phase-based enumeration algorithm for SVP challenge through \(y\)-sparse representations of short lattice vectors |
scientific article; zbMATH DE number 6481211 |
Statements
A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors (English)
0 references
11 September 2015
0 references
lattice-based cryptography
0 references
shortest vector problem (SVP)
0 references
\(y\)-sparse representation
0 references
phase-based enumeration algorithm
0 references
0 references
0.7550625801086426
0 references
0.7503806352615356
0 references
0.7452011704444885
0 references
0.7437464594841003
0 references
0.741667628288269
0 references
