Solving the Shortest Vector Problem in 2 <sup>n</sup> Time Using Discrete Gaussian Sampling (Q2941568): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57567986, #quickstatements; #temporary_batch_1712286835472 |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1412.7994 / rank | |||
Normal rank | |||
Revision as of 10:12, 19 April 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
