Risk Analysis of Information Security Breaches and Vulnerabilities in Information Systems: Shor's Algorithm

Abstract Shor’s algorithm represents a landmark advancement in quantum computing, offering an efficient method for integer factorization, a problem that is computationally hard for classical computers. A core component of the algorithm is the Quantum Fourier Transform (QFT), which enables fast Fourier analysis on quantum hardware. This study focuses on the implementation and analysis of Shor’s algorithm on a 5-qubit IBM quantum computer, exploring both the theoretical principles and practical execution on a limited quantum device. By examining this implementation, we highlight the potential impact of quantum computing on classical cryptographic schemes, assess risks to information security, and discuss the algorithm’s efficiency, scalability, and applicability in real-world computational environments.