Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\) (Q268457): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5595624 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A single quantum cannot be cloned / rank | |||
Normal rank | |||
Latest revision as of 18:55, 11 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\) |
scientific article |
Statements
Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\) (English)
0 references
15 April 2016
0 references
