Solving the shortest vector problem in \(2^n\) time using discrete Gaussian sampling (extended abstract) (Q2941568)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6474777
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the shortest vector problem in \(2^n\) time using discrete Gaussian sampling (extended abstract) |
scientific article; zbMATH DE number 6474777 |
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
0 references
0.8805219531059265
0 references
0.8576027154922485
0 references
0.8548190593719482
0 references
0.8465695381164551
0 references
0.8438228368759155
0 references
