Solving the Shortest Vector Problem in 2 <sup>n</sup> Time Using Discrete Gaussian Sampling (Q2941568)
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: Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the Shortest Vector Problem in 2 <sup>n</sup> Time Using Discrete Gaussian Sampling |
scientific article |
Statements
Solving the Shortest Vector Problem in 2 <sup>n</sup> Time Using Discrete Gaussian Sampling (English)
0 references
21 August 2015
0 references
discrete Gaussian
0 references
lattices
0 references
shortest vector problem
0 references
