Analyzing the Impact of Quantum Computing Algorithms on Classical Cryptographic Security Protocols in Cloud Environments

Ezequiel Desmond; Marcelo Conrad R

Authors

Ezequiel Desmond Professor in Quantum Cybersecurity, USA. Author
Marcelo Conrad R Quantum Cryptography Researcher, USA. Author

Keywords:

Quantum Computing, Classical Cryptography, Cloud Security, Shor’s Algorithm, Post-Quantum Cryptography

Abstract

Purpose: This study investigates the impact of quantum computing algorithms—particularly Shor’s and Grover’s algorithms—on classical cryptographic protocols widely deployed in cloud computing environments, and evaluates adaptive strategies to maintain long-term security.

Design/methodology/approach: A systematic review of peer-reviewed literature was conducted, followed by an analytical assessment of quantum threat models. The study evaluates the effects of quantum attacks on widely used cryptographic schemes, including RSA, elliptic curve cryptography (ECC), and symmetric-key primitives.

Findings: The analysis reveals that quantum algorithms pose a critical threat to classical asymmetric cryptographic schemes, rendering RSA and ECC insecure under sufficiently powerful quantum adversaries. In contrast, symmetric cryptographic protocols exhibit greater resilience when key sizes are increased. Post-quantum cryptographic algorithms present viable alternatives, though they involve trade-offs in performance, key size, and implementation complexity.

Practical implications: Cloud service providers must proactively transition toward quantum-resistant cryptographic mechanisms, revise key management frameworks, and adopt hybrid security models to ensure data confidentiality and integrity in future cloud infrastructures.

Originality/value: This paper contributes a cloud-centric perspective on quantum cryptographic threats by integrating algorithmic analysis with practical deployment considerations, and proposes a tailored risk model suitable for large-scale cloud service architectures.

References

Shor PR (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science. IEEE, pp 124–134.

Grover LK (1996) A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing. ACM, pp 212–219

Bernstein DJ, Buchmann J, Dahmen E (eds) (2009) Post-Quantum Cryptography. Springer, Berlin

Chen L, Jordan S, Liu YK, Moody D, Peralta R, Perlner R, Smith-Tone D (2016) Report on Post-Quantum Cryptography. National Institute of Standards and Technology, Gaithersburg

Mosca M (2018) Cybersecurity in an era with quantum computers: will we be ready? IEEE Security & Privacy 16(5):38–41

Peikert C (2016) A decade of lattice cryptography. Foundations and Trends® in Theoretical Computer Science 10(4):283–424

Lyubashevsky V, Ducas L, Kiltz E, Lepoint T, Schwabe P, Seiler G, Stehlé D (2013) CRYSTALS–Dilithium: a lattice-based digital signature scheme. In: Advances in Cryptology – CRYPTO. Springer, pp 238–268

Alagic G, Alperin-Sheriff J, Apon D, Cooper D, Dang Q, Liu YK, Miller C, Moody D, Peralta R, Perlner R (2020) Status Report on the Second Round of the NIST Post-Quantum Cryptography Standardization Process. NIST

Bernstein DJ, Lange T (2017) Post-quantum cryptography. Nature 549:188–194

Kaeuffer C, Guilley S, Danger JL (2019) Impact of quantum computing on TLS security. Journal of Cryptographic Engineering 9(3):201–214

Liu Y, Zhang J, Xiong H (2021) A survey on cloud security based on cryptographic protocols. Journal of Cloud Computing 10(1):1–18

National Institute of Standards and Technology (2022) Recommendation for Cryptographic Key Management. NIST Special Publication