Skip to main content
SpringerLink
Log in

One-time pad, complexity of verification of keys, and practical security of quantum cryptography

  • Atoms, Molecules, Optics
  • Published:
Journal of Experimental and Theoretical Physics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Yu. I. Manin, Computable and Incomputable (Sov. Radio, Moscow, 1980) [in Russian].

    Google Scholar 

  2. R. P. Feynman, Int. J. Theor. Phys. 21, 467 (1982).

    Article  MathSciNet  Google Scholar 

  3. P. W. Shor, in Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994, p. 124.

    Book  Google Scholar 

  4. L. K. Grover, Phys. Rev. Lett. 79, 325 (1997).

    Article  ADS  Google Scholar 

  5. Y. Ozhigov, Chaos Solitons Fractals 10, 1707 (1999).

    Article  MathSciNet  Google Scholar 

  6. C. Zalka, arXiv:quant-ph/9603026.

  7. Quantum Algorithm Zoo. math.nist.gov/quantum/zoo/.

  8. C. H. Bennett and G. Brassard, in Proceedings of the IEEE International Conference on Computers, Systems and Signal Processing, Bangalore, India, 1984, p. 175.

    Google Scholar 

  9. G. S. Vernam, J. IEEE 55, 109 (1926).

    Google Scholar 

  10. V. A. Kotel’nikov, Report (June 19, 1941).

    Google Scholar 

  11. C. Shannon, Bell System Tech. J. 28, 656 (1949).

    Article  MathSciNet  Google Scholar 

  12. R. Renner, PhD Thesis (ETH Zürich, 2005).

    Google Scholar 

  13. C. Portmann and R. Renner, arXiv:1409.3525[quantph].

  14. H. P. Yuen, Phys. Rev. A 82, 062304 (2010); H. P. Yuen, arXiv:1109.1051 [quant-ph]; H. P. Yuen, arXiv:1109.2675 [quant-ph]; H. P. Yuen, arXiv:1109.1066 [quant-ph]; R. Renner, arXiv: 1209.2423 [quant-ph].

    Article  ADS  Google Scholar 

  15. J. L. Massey, in Proceedings of the IEEE International Symposium on Information Theory, Guessing and Entropy, 1994, p. 204.

    Google Scholar 

  16. J. O. Pliam, PhD Thesis (Minnesota Univ., 1999).

    Google Scholar 

  17. T. M. Cover and J. A. Thomas, Elements of Information Theory (Wiley, Hoboken, NJ, 1991).

    Book  MATH  Google Scholar 

  18. M. Nielsen and I. Chuang, Quantum Computation and Quantum Information (Cambridge Univ. Press, Cambridge, 2000).

    MATH  Google Scholar 

  19. A. de Santis, A. G. Gaggia, and U. Vaccaro, IEEE Trans. Inf. Theory 47, 468 (2001).

    Article  Google Scholar 

  20. A. S. Holevo, Russ. Math. Surv. 53, 1295 (1998).

    Article  Google Scholar 

  21. C. E. Shannon, Bell System Tech. J. 27, 379 (1948).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Solid State Physics, Russian Academy of Sciences, Chernogolovka, Moscow oblast, 142432, Russia

    S. N. Molotkov

  2. Academy of Cryptography of the Russian Federation, Moscow, 121552, Russia

    S. N. Molotkov

  3. Faculty of Computational Mathematics and Cybernetics, Moscow State University, Moscow, 119899, Russia

    S. N. Molotkov

Authors
  1. S. N. Molotkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. N. Molotkov.

Additional information

Original Russian Text © S.N. Molotkov, 2016, published in Zhurnal Eksperimental’noi i Teoreticheskoi Fiziki, 2016, Vol. 150, No. 5, pp. 903–916.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Molotkov, S.N. One-time pad, complexity of verification of keys, and practical security of quantum cryptography. J. Exp. Theor. Phys. 123, 784–795 (2016). https://doi.org/10.1134/S1063776116110169

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1063776116110169

Search

Navigation