Мақаланы E-mail арқылы жіберу 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
Дәйексөз келтіру
Ашық рұқсат
Рұқсат берілді
Тек жазылушылар үшін
Аннотация
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
Қосымша файлдар
