The Need For Quantum - Resistant Cyber Security : A Review

Authors

  • Subhashree K  M.Sc. Department of Mathematics (M.Sc.), Guru Nanak College, Chennai, Tamil Nadu, India
  • Kavitha S  M.Sc. Department of Mathematics (M.Sc.), Guru Nanak College, Chennai, Tamil Nadu, India
  • Sanjay K  M.Sc. Department of Mathematics (M.Sc.), Guru Nanak College, Chennai, Tamil Nadu, India

Keywords:

RSA, Shor’s Algorithm, IFP, DLP, Quantum-resistant cryptography

Abstract

Conventional cyber security, especially public key cryptosystems depend upon the difficulty of solving large integer factorization and discrete log problems. The most straightforward way to solve these problems is to try all possible keys, which would be far too difficult for conventional computers. But the speed in which quantum computing is growing has posed a great threat to the conventional cryptosystems. This paper reviews how conventional public key cryptosystems might crumble under quantum computing and the need for quantum – safe cryptography.

References

  1. Weedbrook, C., Pirandola, S., Lloyd, S. and Ralph, T.C., 2010. Quantum cryptography approaching the classical limit. Physical review letters, 105(11), p.110501.
  2. Gajbhiye, S., Karmakar, S., Sharma, M. and Sharma, S., 2017, December. Paradigm shift from classical cryptography to quantum cryptography. In 2017 International Conference on Intelligent Sustainable Systems (ICISS) (pp. 548-555). IEEE.
  3. Farik, M. and Ali, S., 2016, December. The Need for Quantum-Resistant Cryptography in Classical Computers. In 2016 3rd Asia-Pacific World Congress on Computer Science and Engineering (APWC on CSE) (pp. 98-105). IEEE.
  4. Häner, T., Roetteler, M. and Svore, K.M., 2016. Factoring using 2n+ 2 qubits with Toffoli based modular multiplication. arXiv preprint arXiv:1611.07995..
  5. Buchanan, W. and Woodward, A., 2017. Will quantum computers be the end of public key encryption?. Journal of Cyber Security Technology, 1(1), pp.1-22.
  6. Amico, M., Saleem, Z.H. and Kumph, M., 2019. Experimental study of Shor's factoring algorithm using the IBM Q Experience. Physical Review A, 100(1), p.012305.
  7. Coles, P.J., Eidenbenz, S., Pakin, S., Adedoyin, A., Ambrosiano, J., Anisimov, P., Casper, W., Chennupati, G., Coffrin, C., Djidjev, H. and Gunter, D., 2018. Quantum algorithm implementations for beginners. arXiv preprint arXiv:1804.03719.
  8. Martín-López, E., Laing, A., Lawson, T., Alvarez, R., Zhou, X.Q. and O'brien, J.L., 2012. Experimental realization of Shor's quantum factoring algorithm using qubit recycling. Nature Photonics, 6(11), p.773.
  9. Chen, L., Chen, L., Jordan, S., Liu, Y.K., Moody, D., Peralta, R., Perlner, R. and Smith- Tone, D., 2016. Report on post-quantum cryptography. US Department of Commerce, National Institute of Standards and Technology.
  10. Brands, G., Roellgen, C.B. and Vogel, K.U., 2015. QRKE: Quantum-Resistant Public Key Exchange. arXiv preprint arXiv:1510.07456.
  11. Ioannou, L.M. and Mosca, M., 2011, November. A new spin on quantum cryptography: Avoiding trapdoors and embracing public keys. In International Workshop on Post-Quantum Cryptography (pp. 255-274). Springer, Berlin, Heidelberg.
  12. Chen, L., 2017. Cryptography Standards in Quantum Time: New wine in old wineskin?. IEEE security & privacy, 15(4), p.51.
  13. Mavroeidis, V., Vishi, K., Zych, M.D. and Jøsang, A., 2018. The impact of quantum computing on present cryptography. arXiv preprint arXiv:1804.00200.
  14. Shor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing,26(5),1484-26. doi:http://dx.doi.org/10.1137/S00975397952931 72
  15. Shor, Peter W. “Polynomial-time algorithms for prime factorization and discretelogarithms on a quantum computer.”SIAM journal on computing26.5 (1997):1484-1509.
  16. Ekera, M., 2016. Modifying Shor's algorithm to compute short discrete logarithms. IACR Cryptology ePrint Archive, 2016, p.1128.
  17. Christophe Pittet. Mathematical aspects of Shor’s algorithm. 3rd cycle. Shillong - Inde, 2013, pp.15.

Downloads

Published

2019-10-12

Issue

Section

Research Articles

How to Cite

[1]
Subhashree K, Kavitha S, Sanjay K, " The Need For Quantum - Resistant Cyber Security : A Review, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 4, Issue 7, pp.09-12, September-October-2019.