QUANTUM THREAT TO CLASSICAL CRYPTOGRAPHY: A FOCUS ON RSA

Cryptography is crucial for protecting private information. However, the emergence of quantum computing poses a significant threat to the security of classical cryptographic systems. Traditional algorithms such as RSA can be vulnerable to quantum attacks. Shor's quantum algorithm can break RSA encryption in polynomial time. This article examines the RSA cryptosystem, the impact of quantum computing on cryptography, the challenges of quantum computing, and its applications in various fields. The article also presents an experiment comparing traditional and Shor factorization methods for semi-prime numbers. Although the experiment does not involve factoring extremely large numbers, it demonstrates the simplicity of implementing algorithms. By conducting experiments and analysing the results, computer science students can better understand the principles of quantum computing, its capabilities, and limitations, and develop practical skills.