How to re-use a one-time pad safely and almost optimally even if \(\mathrm P=\mathrm{NP}\) (Q268461)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: How to re-use a one-time pad safely and almost optimally even if P=NP |
scientific article; zbMATH DE number 6569225
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How to re-use a one-time pad safely and almost optimally even if \(\mathrm P=\mathrm{NP}\) |
scientific article; zbMATH DE number 6569225 |
Statements
How to re-use a one-time pad safely and almost optimally even if \(\mathrm P=\mathrm{NP}\) (English)
0 references
15 April 2016
0 references
key-recycling
0 references
private-key encryption
0 references
quantum cryptography
0 references
unconditional security
0 references
0 references
0 references
0.8895503282546997
0 references
0.8786355257034302
0 references
0.8621319532394409
0 references
0.7941545844078064
0 references
0.7875918745994568
0 references
