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
