Citation :

Koji Nagata, Do Ngoc Diep, Tadao Nakamura, "Quantum Cryptography Based on An Algorithm of Determining All The Mappings of A Function," International Journal of P2P Network Trends and Technology (IJPTT), vol. 9, no. 6, pp. 1-4, 2019. Crossref, https://doi.org/10.14445/22492615/IJPTT-V9I6P401

Abstract

We propose quantum cryptography based on an algorithm of determining a function.The security of our cryptography is based on the Ekert 1991 protocol, that is, we use anentangled state.Eve must destroy the entangled state.Consider a function.Alice knows all the mappings concerning the function.Bob knows none of them. His aim is of obtaining all of them without Eve`s attack.In classical case, Bob needs some queries.In quantum case, Bob needs just a query.By measuring thesingle entangled state, which is sent by Alice, Bob can obtainall the mappings concerning the function, simultaneously.This is faster than classical cryptography.

Keywords

Quantum cryptography and communication security,Quantum communication, Quantum algorithms, Quantum computation, Formalism

References

[1] E. Bernstein and U. Vazirani,Proceedings of 25th Annual ACM Symposium on Theory of Computing (STOC `93), p. 11 (1993), https://doi.org/10.1145/167088.167097.
[2] E. Bernstein and U. Vazirani,SIAM J. Comput.26, 1411 (1997).
[3] D. Deutsch, Proc. R. Soc. Lond. A 400, 97(1985).
[4] D. Deutsch and R. Jozsa, Proc. R. Soc. Lond. A 439, 553(1992).
[5] R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca, Proc. R. Soc. Lond. A 454, 339(1998).
[6] D. R. Simon, Proceedings of 35th IEEE Annual Symposium on Foundations of Computer Science, p.116 (1994).
[7] P. W. Shor,Proceedings of 35th IEEE Annual Symposium on Foundations of Computer Science, p. 124(1994).
[8] L. K. Grover,Proceedings of 28th Annual ACM Symposium on Theory of Computing,p. 212(1996).
[9] K. Ekert, Phys. Rev. Lett. 67, 661 (1991).