Solving the Shortest Vector Problem in 2 <sup>n</sup> Time Using Discrete Gaussian Sampling (Q2941568)

From MaRDI portal
Revision as of 05:43, 5 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57567986, #quickstatements; #temporary_batch_1712286835472)
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
    0 references
    0 references
    0 references
    21 August 2015
    0 references
    discrete Gaussian
    0 references
    lattices
    0 references
    shortest vector problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references