Finding shortest lattice vectors faster using quantum search (Q887421)

From MaRDI portal
Revision as of 23:36, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding shortest lattice vectors faster using quantum search
scientific article

    Statements

    title
    Finding shortest lattice vectors faster using quantum search (English)
    0 references
    author
    Thijs Laarhoven
    0 references
    Michele Mosca
    0 references
    Joop van de Pol
    0 references
    publication date
    26 October 2015
    0 references
    zbMATH Keywords
    lattices
    0 references
    shortest vector problem
    0 references
    sieving
    0 references
    quantum search
    0 references
    describes a project that uses
    BKZ
    0 references
    BLISS
    0 references
    NTRU
    0 references
    cites work
    Q4542515
    0 references
    Q4819589
    0 references
    Q4783726
    0 references
    Q4228473
    0 references
    Q3522477
    0 references
    Q3840170
    0 references
    Q4194048
    0 references
    Q4718481
    0 references
    Q5417723
    0 references
    Q4314376
    0 references
    Q4418644
    0 references

    Identifiers

    Mathematics Subject Classification ID
    94A60
    0 references
    68Q12
    0 references
    81P68
    0 references
    zbMATH DE Number
    6498055
    0 references
    OpenAlex ID
    W1992938819
    0 references
    Wikidata QID
    Q59410708
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q887421&oldid=36208380"
    Powered by MediaWiki