Email this article One-time pad, complexity of verification of keys, and practical security of quantum cryptography
- Authors: Molotkov S.N.1,2,3
-
Affiliations:
- Institute of Solid State Physics
- Academy of Cryptography of the Russian Federation
- Faculty of Computational Mathematics and Cybernetics
- Issue: Vol 123, No 5 (2016)
- Pages: 784-795
- Section: Atoms, Molecules, Optics
- URL: https://journals.rcsi.science/1063-7761/article/view/190952
- DOI: https://doi.org/10.1134/S1063776116110169
- ID: 190952
Cite item
Open Access
Access granted
Subscription Access
Abstract
A direct relation between the complexity of the complete verification of keys, which is one of the main criteria of security in classical systems, and a trace distance used in quantum cryptography is demonstrated. Bounds for the minimum and maximum numbers of verification steps required to determine the actual key are obtained.
About the authors
S. N. Molotkov
Institute of Solid State Physics; Academy of Cryptography of the Russian Federation; Faculty of Computational Mathematics and Cybernetics
Author for correspondence.
Email: sergei.molotkov@gmail.com
Russian Federation, Chernogolovka, Moscow oblast, 142432; Moscow, 121552; Moscow, 119899
Supplementary files
