Evaluating the Efficacy of Quantum Algorithms in Cryptographic Security
DOI:
https://doi.org/10.62951/ijcts.v1i1.65Keywords:
Quantum computing, cryptographic security, Shor’s algorithm, Grover’s algorithm, encryptionAbstract
With quantum computing’s rise, traditional cryptographic methods face new security challenges. This paper evaluates the effectiveness of various quantum algorithms, such as Shor’s and Grover’s algorithms, on current encryption standards. Our findings highlight the vulnerabilities in conventional cryptography and suggest new standards and protocols to maintain data security in a quantum-driven era.
References
Bennett, C. H., & Brassard, G. (1984). Quantum cryptography: Public key distribution and coin tossing. Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, 175-179.
Grover, L. K. (1996). A Fast Quantum Mechanical Algorithm for Database Search. Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 212-219.
Katz, J., & Lindell, Y. (2020). Introduction to Modern Cryptography: Principles and Protocols. CRC Press.
Kelley, J., et al. (2019). Quantum Computers and the Future of Cryptography. University of Michigan.
Nielsen, M. A., & Chuang, I. L. (2010). Quantum Computation and Quantum Information. Cambridge University Press.
NIST. (2020). Post-Quantum Cryptography Standardization. Retrieved from [NIST website](https://csrc.nist.gov/projects/post-quantum-cryptography).
Shor, P. W. (1994). Algorithms for Quantum Computation: Discrete Logarithms and Factoring. Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 124-134.
IACR. (2021). Survey on the Impact of Quantum Computing on Cryptography. International Association for Cryptologic Research.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 International Journal of Computer Technology and Science

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