Solving the Shortest Vector Problem in 2 <sup>n</sup> Time Using Discrete Gaussian Sampling (Q2941568): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:15, 3 February 2024
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
