Article Sidebar

Submitted
25 August 2025
Accepted
25 October 2025
Published
31 December 2025
Download
PDF
Statistic
Read Counter : 147

Main Article Content

Abstract

Motivated by Shor’s algorithm and its attractive features, the milestone results in quantum cryptanalysis were the discovery of quantum differential and linear cryptanalysis. In quantum cryptanalysis, quantum distinguishers imitate the classical setting. Details differ; however, as the distinguisher in the quantum setting can take maximum coset superposition of all possible subsets of plaintext pairs. Using quantum measurements, the winning gap of the game is exploited so that a distinguisher can still guess the secret key perfectly with a constant probability. Symmetric primitives also suffer reduced ideal security in the quantum world, but this security reduction is less drastic than for most asymmetric primitives. Stream ciphers, block ciphers, and cryptographic hash functions are primitives that are believed to resist quantum attacks. Analogs to Shor’s algorithm may say how hard it is to build a quantum computer, but devising quantum algorithms to outperform the best classical attacks for widely-used cryptographic primitives is probably outside the reach of current even if exponentially growing noisy intermediate-scale quantum (NISQ) computers.

Keywords

Grover’s algorithms Quantum cryptanalysis Shor’s Modern encryption

Article Details

License

Copyright (c) 2025 Mithal Hadi Jebur, Sumar Mohamed Khaleel (Author)

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite
[1]
M. H. Jebur and S. . Khaleel, “Quantum Cryptanalysis: Evaluating the Impact of Shor’s and Grover’s Algorithms on Modern Encryption Standards”, Cybersys. J, vol. 2, no. 2, pp. 41–55, Dec. 2025, doi: 10.57238/csj.2025.1012.
Download Citation
Endnote/Zotero/Mendeley (RIS)
BibTeX

How to Cite

[1]
M. H. Jebur and S. . Khaleel, “Quantum Cryptanalysis: Evaluating the Impact of Shor’s and Grover’s Algorithms on Modern Encryption Standards”, Cybersys. J, vol. 2, no. 2, pp. 41–55, Dec. 2025, doi: 10.57238/csj.2025.1012.
Crossref
Scopus
Google Scholar
Europe PMC

References

  1. V. Vedral and M. B. Plenio, "Basics of quantum computation," Progress in Quantum Electronics, vol. 22, no. 1, pp. 1-39, 1998, doi: https://doi.org/10.1016/S0079-6727(98)00004-4.
  2. L. K. Grover, "A framework for fast quantum mechanical algorithms," in Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, Dallas, Texas, USA, 1998: ACM, pp. 53-62, doi: https://doi.org/10.1145/276698.276712.
  3. M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information. Cambridge University Press, 2010.
  4. N. Koblitz and A. Menezes, "A Survey of Public-Key Cryptosystems," Cryptology ePrint Archive, 2015.
  5. U. Mmaduekwe and E. Mmaduekwe, "Cybersecurity and cryptography: The new era of quantum computing," Current Journal of Applied Science and Technology, vol. 43, no. 5, pp. 41-51, 2024, doi: https://doi.org/10.9734/cjast/2024/v43i54377.
  6. NIST, "Post-Quantum Cryptography," National Institute of Standards and Technology, Gaithersburg, MD 20899, 2025. [Online]. Available: https://csrc.nist.gov/projects/post-quantum-cryptography/post-quantum-cryptography-standardization.
  7. D. J. Bernstein, N. Heninger, P. Lou, and L. Valenta, "Post-quantum RSA," in International Workshop on Post-Quantum Cryptography, 2017: Springer, pp. 311-329, doi: 10.1007/978-3-319-59879-6_18.
  8. L. K. Chen and L. Zhang, "Quantum Computing and Cryptography: The Impact of Shor's Algorithm," Quantum Information Processing, vol. 18, no. 4, pp. 1-15, 2019.
  9. L. K. Grover, "A fast quantum mechanical algorithm for database search," in Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, 1996: ACM, pp. 212-219, doi: 10.1145/237814.237866.
  10. G. Kuperberg, "A subexponential-time quantum algorithm for the dihedral hidden subgroup problem," SIAM Journal on Computing, vol. 35, no. 1, pp. 170-188, 2005, doi: 10.1137/S0097539703436345.
  11. P. W. Shor, "Algorithms for quantum computation: discrete logarithms and factoring," in Proceedings 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA, 1994: IEEE, pp. 124-134, doi: 10.1109/SFCS.1994.365700.
  12. X. Wang and Y. Zhang, "Quantum Computing and Its Impact on Cryptography," Journal of Computer Science and Technology, vol. 35, no. 3, pp. 453–467, 2020.
  13. C. Zalka, "Grover’s quantum searching algorithm is optimal," Physical Review A, vol. 60, p. 2746, 1999, doi: 10.1103/PhysRevA.60.2746.
  14. S. Aaronson, Quantum computing since Democritus. Cambridge University Press, 2013.
  15. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, "Quantum Computation by Adiabatic Evolution," in Proceedings of the 35th Annual ACM Symposium on the Theory of Computing, 2001: ACM, pp. 48-53.
  16. M. Mosca, "Cybersecurity in an era with quantum computers: Will we be ready?," IEEE Security & Privacy, vol. 16, no. 5, pp. 38-41, 2018, doi: 10.1109/MSP.2018.3761723.
  17. P. W. Shor, "Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer," SIAM Review, vol. 41, no. 2, pp. 303-332, 1999, doi: 10.1137/S0036144598347011.
  18. A. M. Childs and W. van Dam, "Quantum Algorithms for Fixed Point Finding," in Proceedings of the 45th Annual ACM Symposium on Theory of Computing, 2010: ACM, pp. 473–482.
  19. G. Brassard, P. Hoyer, M. Mosca, and A. Tapp, "Quantum amplitude amplification and estimation," arXiv quant-ph/0005055, p. 32, 2000, doi: 10.48550/arXiv.quant-ph/0005055.
  20. J. Larkin and M. McKague, "Quantum Algorithms for Solving Linear Systems," in Proceedings of the 2018 IEEE European Symposium on Security and Privacy, 2018: IEEE, pp. 1-6.
  21. A. Montanaro, "Quantum algorithms: an overview," npj Quantum Information, vol. 2, pp. 1-8, 2016, doi: 10.1038/npjqi.2015.23.
  22. Y. Wang, "Quantum computation and quantum information," Statistical Science, vol. 27, no. 3, pp. 373-394, 2012, doi: https://doi.org/10.1214/11-STS378.
  23. P. W. Shor and J. Preskill, "Simple proof of security of the BB84 quantum key distribution protocol," Physical Review Letters, vol. 85, p. 441, 2000, doi: 10.1103/PhysRevLett.85.441.
  24. A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman, "Exponential algorithmic speedup by a quantum walk," in Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, San Diego, CA, USA, 2003: ACM, pp. 59-68, doi: 10.1145/780542.780552.
  25. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, "Quantum computation by adiabatic evolution," arXiv:quant-ph/0001106, p. 24, 2000, doi: 10.48550/arXiv.quant-ph/0001106.
  26. M. H. Jebur, F. A. Joda, and M. A. Naser, "Building a Statistical Model to Detect Foreground Objects and using it in Video Steganography," Baghdad Science Journal, vol. 20, no. 6, p. 22, 2023, doi: https://doi.org/10.21123/bsj.2023.7926