Computational indistinguishability between quantum states and its cryptographic application (Q434349)

From MaRDI portal
Revision as of 11:28, 5 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
Computational indistinguishability between quantum states and its cryptographic application
scientific article

    Statements

    Computational indistinguishability between quantum states and its cryptographic application (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 July 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    quantum cryptography
    0 references
    computational indistinguishably
    0 references
    trapdoor
    0 references
    worst-case/average-case equivalence
    0 references
    graph automorphism problem
    0 references
    quantum public-key cryptosystem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references