Cryptography is crucial to communication security. In 1984, a well-known QKD (quantum key distribution) protocol, BB84, was published by Bennett and Brassard. The BB84 Protocol was followed by the QKD protocols published by Ekert (1991) (E91) and Bennett (1992) (B92). Some authors proved security of the theoretical QKD protocols in different theoretical frameworks by defining security of QKD protocols differently. My argument is that the previous proofs of security are neither unique nor exhaustive for each theoretical QKD protocol, which means that proof of security of the theoretical QKD protocols has not been completed or achieved. The non-uniqueness and the non-exhaustiveness of the proofs will lead to more proofs. However, a coming “proof” of security of the theoretical QKD protocols is possible to be a disproof. The research by quantum mechanics in this paper disproves security of the theoretical QKD protocols, by establishing the theoretical framework of quantum mechanical proof, defining security of QKD protocols, establishing the quantum state of the final key of the theoretical protocols from their information leakages, and applying Grover’s fast quantum mechanical algorithm for database search to the quantum state of the final key to result in the Insecurity Theorem. This result is opposite to those of the previous proofs where the theoretical QKD protocols were secure. It is impossible for Alice and Bob to protect their communications from information leakage by stopping or canceling the protocols. The theoretical QKD keys are conventional and basically insecure. Disproof of security of the theoretical QKD protocols is logical.
References
[1]
Bennett, C.H. and Brassard, G. (1984) Quantum Cryptography: Public Key Distribution and Coin Tossing. Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, Bangalore, 10-12 December 1984, 175-179.
[2]
Ekert, A.K. (1991) Quantum Cryptography Based on Bell’s Theorem. Physical Review Letters, 67, 661-663. https://doi.org/10.1103/PhysRevLett.67.661
[3]
Bennett, C.H. (1992) Quantum Cryptography Using Any Two Nonorthogonal States. Physical Review Letters, 68, 3121-3124.
https://doi.org/10.1103/PhysRevLett.68.3121
[4]
Biham, E., Boyer, M., Boykin, P.O., Mor, T. and Roychowdhury, V. (2000) A Proof of the Security of Quantum Key Distribution. Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, Portland, 21-23 May 2000, 715-724. https://doi.org/10.1145/335305.335406
[5]
Shor, P.W. and Preskill, J. (2000) Simple Proof of Security of the BB84 Quantum Key Distribution Protocol. Physical Review Letters, 85, 441-444.
https://doi.org/10.1103/PhysRevLett.85.441
[6]
Mayers, D. (2001) Unconditional Security in Quantum Cryptography. Journal of the ACM, 48, 351-406. https://doi.org/10.1145/382780.382781
[7]
Mayers, D. (2002) Shor and Preskill’s and Mayers’s Security Proof for the BB84 Quantum Key Distribution Protocol. The European Physical Journal D, 18, 161-170.
https://doi.org/10.1140/epjd/e20020020
[8]
Gottesman, D. and Lo, H.-K. (2003) Proof of Security of Quantum Key Distribution with Two-Way Classical Communications. IEEE Transactions on Information Theory, 49, 457-475. https://doi.org/10.1109/TIT.2002.807289
[9]
Lo, H.-K., Chau, H.F. and Ardehali, M. (2005) Efficient Quantum Key Distribution Scheme and a Proof of Its Unconditional Security. Journal of Cryptology, 18, 133-165.
https://doi.org/10.1007/s00145-004-0142-y
[10]
Renner, R., Gisin, N. and Kraus, B. (2005) Information-Theoretic Security Proof for Quantum-Key-Distribution Protocols. Physical Review A, 72, Article ID: 12332.
https://doi.org/10.1103/PhysRevA.72.012332
[11]
Boyer, M., Liss, R. and Mor, T. (2020) Composable Security against Collective Attacks of a Modified BB84 QKD Protocol with Information Only in One Basis. Theoretical Computer Science, 801, 96-109.
https://doi.org/10.1016/j.tcs.2019.08.014
[12]
Su, H.-Y. (2020) Simple Analysis of Security of the BB84 Quantum Key Distribution Protocol. Quantum Information Processing, 19, 169.
https://doi.org/10.1007/s11128-020-02663-z
[13]
Tsurumaru, T. (2020) Leftover Hashing From Quantum Error Correction: Unifying the Two Approaches to the Security Proof of Quantum Key Distribution. IEEE Transactions on Information Theory, 66, 3465-3484.
https://doi.org/10.1109/TIT.2020.2969656
[14]
Zhang, Q. and Tang, C.-J. (2002) Simple Proof of the Unconditional Security of the Bennett 1992 Quantum Key Distribution Protocol. Physical Review A, 65, Article ID: 062301. https://doi.org/10.1103/PhysRevA.65.062301
[15]
Tamaki, K., Koashi, M. and Imoto, N. (2003) Unconditionally Secure Key Distribution Based on Two Nonorthogonal States. Physical Review Letters, 90, Article ID: 167904. https://doi.org/10.1103/PhysRevLett.90.167904
[16]
Tamaki, K. and Lütkenhaus, N. (2004) Unconditional Security of the Bennett 1992 Quantum Key Distribution Protocol over Lossy and Noisy Channel. Physical Review A, 69, Article ID: 032316. https://doi.org/10.1103/PhysRevA.69.032316
[17]
Tamaki, K., Lütkenhaus, N., Koashi, M. and Batuwantudawe, J. (2009) Unconditional Security of the Bennett 1992 Quantum-Key-Distribution Scheme with a Strong Reference Pulse. Physical Review A, 80, Article ID: 032302.
https://doi.org/10.1103/PhysRevA.80.032302
[18]
Lucamarini, M., Giuseppe, G. and Tamaki, K. (2009) Robust Unconditionally Secure Quantum Key Distribution with Two Nonorthogonal and Uninformative States. Physical Review A, 80, Article ID: 032327.
https://doi.org/10.1103/PhysRevA.80.032327
[19]
Ali, N., Radzi, N.A.N., Aljunid, S.A. and Endut, R. (2020) Security of B92 Protocol with Uninformative States in Asymptotic Limit with Composable Security. AIP Conference Proceedings, 2203, Article ID: 020049. https://doi.org/10.1063/1.5142141
[20]
Olszewski, S. (2020) Ehrenfest Approach to the Adiabatic Invariants and Calculation of the Intervals of Time Entering the Energy Emission Process in Simple Quantum Systems. Journal of Quantum Information Science, 10, 1-9.
https://doi.org/10.4236/jqis.2020.101001
[21]
Ishikawa, S. (2020) Wittgenstein’s Picture Theory in the Quantum Mechanical Worldview. Journal of Quantum Information Science, 10, 104-125.
https://doi.org/10.4236/jqis.2020.104007
[22]
Shor, P.W. (1994) Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In: Proc. 35th Annual Symposium on Foundations of Computer Science, IEEE Press, Los Alamitos, 124-134. https://doi.org/10.1109/SFCS.1994.365700
[23]
Rivest, R.L., Shamir, A. and Adleman, L. (1978) A Method for Obtaining Digital Sig Natures and Public-Key Cryptosystems. Communications of the ACM, 21, 120-126.
https://doi.org/10.1145/359340.359342
[24]
Nielsen, M.A. and Chuang, I.L. (2000) Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, 11, 38-39, 232-233, 248-276.
[25]
Mavroeidis, V., Vishi, K., Zych, M. and Jøsang, A. (2018) The Impact of Quantum Computing on Present Cryptography. International Journal of Advanced Computer Science and Applications, 9, 405-414. https://doi.org/10.14569/IJACSA.2018.090354
[26]
Grover, L.K. (1996) A Fast Quantum Mechanical Algorithm for Database Search. In: Proceedings 28th ACM Symposium on the Theory of Computation, ACM Press, New York, 212-219. https://doi.org/10.1145/237814.237866
[27]
Grover, L.K. (1997) Quantum Mechanics Helps in Searching for a Needle in a Haystack. Physical Review Letters, 79, 325-328.
https://doi.org/10.1103/PhysRevLett.79.325
[28]
Akihiro, Y. and Hirokazu, I. (2000) Quantum Cryptanalysis of Block Ciphers. Algebraic Systems, Formal Languages and Computations. RIMS Kokyuroku, 1166, 235-243.
[29]
Almazrooie, M., Samsudin, A., Abdullah, R. and Mutter, K.N. (2016) Quantum Exhaustive Key Search with Simplified-DES as a Case Study. SpringerPlus, 5, Article No. 1494. https://doi.org/10.1186/s40064-016-3159-4
[30]
Coppersmith, D., Holloway, C., Matyas, S.M. and Zunic, N. (1997) The Data Encryption Standard. Information Security Tech. Rep. No. 2, 22-24.
https://doi.org/10.1016/S1363-4127(97)81325-8
[31]
Shannon, C.E. (1949) Communication Theory of Secrecy Systems. The Bell System Technical Journal, 28, 656-715. https://doi.org/10.1002/j.1538-7305.1949.tb00928.x
[32]
Zalka, C. (1999) Grover’s Quantum Searching Algorithm Is Optimal. Physical Review A: Atomic, Molecular and Optical Physics, 60, 2746-2751.
https://doi.org/10.1103/PhysRevA.60.2746
[33]
Patil, S. and Kumar, A. (2010) Implemented Encryption Scheme (One Time Pad) Using 9’s Complement. International Journal of Advanced Research in Computer Science, 1, 49-51.
