Current Quantum Cryptography Algorithm Is Optimal: A Proof

Authors

Oscar Galindo, The University of Texas at El PasoFollow
Vladik Kreinovich, The University of Texas at El PasoFollow
Olga Kosheleva, The University of Texas at El PasoFollow

Publication Date

9-2018

Comments

Technical Report: UTEP-CS-18-50a

To appear in Proceedings of the IEEE Symposium on Computational Intelligence for Engineering Solutions CIES'2018, Bengaluru, India, November 18-21, 2018.

Abstract

One of the main reasons for the current interest in quantum computing is that, in principle, quantum algorithms can break the RSA encoding, the encoding that is used for the majority secure communications -- in particular, the majority of e-commerce transactions are based on this encoding. This does not mean, of course, that with the emergence of quantum computers, there will no more ways to secretly communicate: while the existing non-quantum schemes will be compromised, there exist a quantum cryptographic scheme that will enables us to secretly exchange information. In this scheme, however, there is a certain probability that an eavesdropper will not be detected. A natural question is: can we decrease this probability by an appropriate modification of the current quantum cryptography algorithm? In this paper, we show that such a decrease is not possible: the current quantum cryptography algorithm is, in some reasonable sense, optimal.