Uspekhi Fizicheskikh Nauk
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



UFN:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Uspekhi Fizicheskikh Nauk, 2025, Volume 195, Number 10, Pages 1021–1046
DOI: https://doi.org/10.3367/UFNr.2025.07.039972
(Mi ufn16033)
 

INTERNATIONAL YEAR OF QUANTUM SCIENCE AND TECHNOLOGY. REVIEWS OF TOPICAL PROBLEMS

Vernam's, Kotelnikov's, and Shannon's one-time pad and quantum cryptography

I. M. Arbekova, S. N. Molotkovabcd

a Academy of Cryptography of the Russian Federation, Moscow
b Osipyan Institute of Solid State Physics, Russian Academy of Sciences
c Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics
d Quantum Technology Center, Lomonosov Moscow State University
References:
Abstract: Quantum cryptography—quantum key distribution (QKD)—was one of the first fields of study of quantum information theory. It reached a mature scientific level and has been implemented in commercial systems for secure quantum communications. The key distribution problem is the central issue of symmetric cryptography. Quantum cryptography solves this problem on the basis of the fundamental laws of nature: the principles of quantum mechanics. Quantum key distribution is essentially matching two independent random sequences on the transmitting and receiving sides by exchanging quantum states. Required in addition to the quantum channel is an authentic classical communication channel. Both communication channels are open and vulnerable to a perpetrator's attack. To ensure the authenticity of the classical channel at initial system startup, a seed key is required, which is used to provide information-theoretic authentication. In essence, quantum cryptography systems are mechanisms for expanding this seed key. Subsequent sessions generate a quantum key, part of which is used for authentication, while another part is employed for other cryptographic purposes, such as encryption. An issue fundamental for quantum cryptography is the number of quantum key distribution sessions that can be conducted from the initial system launch until a new system reboot, when the cryptographic properties of the quantum keys reach a critical level, after which they can no longer be used for cryptographic purposes, and a new system reboot is needed. Although a number of reviews on quantum cryptography are currently available, this issue has not been discussed in detail. It is shown that for realistic parameters of quantum cryptography systems that are currently achievable, a QKD system can operate for virtually any length of time before the next reboot. This implies that QKD systems can implement a ‘one-time pad’—a set of one-time keys using only a single seed key. A brief historical overview is also presented, outlining some facts little known to the general public. This review, which is intended for a general audience, is comprehensible to undergraduate and graduate students who have completed university courses on quantum information science. The authors hope that it will provide a deeper understanding of the cryptographic underpinnings of state-of-the-art quantum key distribution systems.
Keywords: quantum cryptography, one-time pad, secure communications, authentication
Received: January 13, 2025
Revised: July 28, 2025
Accepted: July 28, 2025
English version:
Physics–Uspekhi, 2025, Volume 68, Issue 10, Pages 963–986
DOI: https://doi.org/10.3367/UFNe.2025.07.039972
Document Type: Article
PACS: 03.67.Dd, 03.67.Hk, 89.70.-a
Language: Russian
Citation: I. M. Arbekov, S. N. Molotkov, “Vernam's, Kotelnikov's, and Shannon's one-time pad and quantum cryptography”, UFN, 195:10 (2025), 1021–1046; Phys. Usp., 68:10 (2025), 963–986
Citation in format AMSBIB
\Bibitem{ArbMol25}
\by I.~M.~Arbekov, S.~N.~Molotkov
\paper Vernam's, Kotelnikov's, and Shannon's one-time pad and quantum cryptography
\jour UFN
\yr 2025
\vol 195
\issue 10
\pages 1021--1046
\mathnet{http://mi.mathnet.ru/ufn16033}
\crossref{https://doi.org/10.3367/UFNr.2025.07.039972}
\transl
\jour Phys. Usp.
\yr 2025
\vol 68
\issue 10
\pages 963--986
\crossref{https://doi.org/10.3367/UFNe.2025.07.039972}
Linking options:
  • https://www.mathnet.ru/eng/ufn16033
  • https://www.mathnet.ru/eng/ufn/v195/i10/p1021
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Успехи физических наук Physics-Uspekhi
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025