One-time pad, complexity of verification of keys, and practical security of quantum cryptography
Journal Article
·
· Journal of Experimental and Theoretical Physics
- Russian Academy of Sciences, Institute of Solid State Physics (Russian Federation)
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.
- OSTI ID:
- 22617141
- Journal Information:
- Journal of Experimental and Theoretical Physics, Vol. 123, Issue 5; Other Information: Copyright (c) 2016 Pleiades Publishing, Inc.; Country of input: International Atomic Energy Agency (IAEA); ISSN 1063-7761
- Country of Publication:
- United States
- Language:
- English
Similar Records
Distinguishability of quantum states and shannon complexity in quantum cryptography
Cryptographic robustness of practical quantum cryptography: BB84 key distribution protocol
Practical Quantum Cryptography for Secure Free-Space Communications
Journal Article
·
Sat Jul 15 00:00:00 EDT 2017
· Journal of Experimental and Theoretical Physics
·
OSTI ID:22617141
Cryptographic robustness of practical quantum cryptography: BB84 key distribution protocol
Journal Article
·
Tue Jul 15 00:00:00 EDT 2008
· Journal of Experimental and Theoretical Physics
·
OSTI ID:22617141
Practical Quantum Cryptography for Secure Free-Space Communications
Conference
·
Mon Feb 01 00:00:00 EST 1999
·
OSTI ID:22617141
+4 more