电邮这篇文章 One-time pad, complexity of verification of keys, and practical security of quantum cryptography
- 作者: Molotkov S.N.1,2,3
-
隶属关系:
- Institute of Solid State Physics
- Academy of Cryptography of the Russian Federation
- Faculty of Computational Mathematics and Cybernetics
- 期: 卷 123, 编号 5 (2016)
- 页面: 784-795
- 栏目: Atoms, Molecules, Optics
- URL: https://journals.rcsi.science/1063-7761/article/view/190952
- DOI: https://doi.org/10.1134/S1063776116110169
- ID: 190952
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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.
作者简介
S. Molotkov
Institute of Solid State Physics; Academy of Cryptography of the Russian Federation; Faculty of Computational Mathematics and Cybernetics
编辑信件的主要联系方式.
Email: sergei.molotkov@gmail.com
俄罗斯联邦, Chernogolovka, Moscow oblast, 142432; Moscow, 121552; Moscow, 119899
补充文件
