A New Quantum Encryption Scheme

Mihail-Iulian Plesa; Togan Mihai

doi:10.21467/ajgr.4.1.59-67

Authors

Mihail-Iulian Plesa Technical Military Academy of Bucharest https://orcid.org/0000-0001-5954-7199
Togan Mihai Department of Computer Science, Technical Military Academy of Bucharest

DOI:

https://doi.org/10.21467/ajgr.4.1.59-67

Abstract

The model of quantum computation has advanced very quickly in the last years. This model brings with it an efficient algorithm for factoring, namely the Shor algorithm. This means that the public key infrastructure will soon be obsolete. In this paper we propose a new quantum cryptographic scheme which aims to replace the RSA algorithm from current public key infrastructures. We analyze the security of our scheme and also, we describe the implementation of the scheme using IBM Q SDK, qiskit. We run a number of experiments in order to build a proof of concept application that uses the proposed scheme.

Keywords:

factoring, IBM Q, PKI, qiskit, quantum cryptography, RSA, Shor

Downloads

Download data is not yet available.

References

R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Commun. ACM, vol. 21, no. 2, pp. 120–126, Feb. 1978.

M. Ramadan, G. Du, F. Li, and C. Xu, “A survey of public key infrastructure-based security for mobile communication systems,” Symmetry, vol. 8, no. 9. 2016.

B. Crowe, “Proposed AeroMACS PKI specification is a model for global and National Aeronautical PKI Deployments,” in ICNS 2016: Securing an Integrated CNS System to Meet Future Challenges, 2016.

C. L. Duta, L. Gheorghe, and N. Tapus, “Framework for evaluation and comparison of integer factorization algorithms,” in Proceedings of 2016 SAI Computing Conference, SAI 2016, 2016, pp. 1047–1053.

Gowers Timothy, Ed., “The P versus NP Problem,” in The Princeton Companion to Mathematics, Princeton University Press, 2008, p. 713.

P. W. Shor, “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer,” SIAM Rev., vol. 41, no. 2, pp. 303–332, Jan. 1999.

N. Johansson and J.-Å. Larsson, “Realization of Shor’s Algorithm at Room Temperature,” Jun. 2017.

“Quantum Computing - IBM Q - US,” The future is quantum. [Online]. Available: https://www.research.ibm.com/ibm-q/. [Accessed: 22-Jun-2018].

“Quantum computing | Microsoft,” Empowering the quantum revolution. [Online]. Available: https://www.microsoft.com/en-us/quantum. [Accessed: 22-Jun-2018].

Z.-Y. Han et al., “Efficient Quantum Tomography with Fidelity Estimation,” Dec. 2017.

H. Sak, A. Senior, and F. Beaufays, “Long Short-Term Memory Based Recurrent Neural Network Architectures for Large Vocabulary Speech Recognition,” Interspeech, no. Cd, pp. 338–342, 2014.

E. Diamanti, H.-K. Lo, B. Qi, and Z. Yuan, “Practical challenges in quantum key distribution,” npj Quantum Inf., vol. 2, no. 1, p. 16025, Nov. 2016.

N. Ltkenhaus, “Theory of Quantum Key Distribution (QKD),” in Lectures on Quantum Information, Weinheim, Germany: Wiley-VCH Verlag GmbH, pp. 271–284.

C. H. Bennett and G. Brassard, “Quantum cryptography: Public key distribution and coin tossing,” Theor. Comput. Sci., vol. 560, pp. 7–11, Dec. 2014.

J. Ortigoso, “Twelve years before the quantum no-cloning theorem,” Jul. 2017.

L. A. Lizama-Pï-rez, J. M. Lï-pez, and E. D. C. Lï-pez, “Quantum key distribution in the presence of the intercept-resend with faked states attack,” Entropy, vol. 19, no. 1, 2017.

D. S. Naik, C. G. Peterson, A. G. White, A. J. Berglund, and P. G. Kwiat, “Entangled state quantum cryptography: Eavesdropping on the ekert protocol,” Phys. Rev. Lett., vol. 84, no. 20, pp. 4733–4736, 2000.

N. Rosen, “Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?,” in Albert Einstein, Wiesbaden: Vieweg+Teubner Verlag, 1979, pp. 57–67.

M.-I. Plesa, “Hybrid scheme for secure communications using quantum and classical mechanisms,” in 2017 9th International Conference on Electronics, Computers and Artificial Intelligence (ECAI), 2017, pp. 1–6.

A. Barenco et al., “Elementary gates for quantum computation,” Phys. Rev. A, vol. 52, no. 5, pp. 3457–3467, Nov. 1995.

R. Reynard, Secret code breaker III : a cryptanalyst’s handbook. Smith & Daniel Marketing, 1999.