Quantum Computing For Cryptographic Security With Artificial Intelligence
Rahul Vadisetty, Anand Polamarasetti
Abstract
Quantum computing is one of the shifts in paradigm with the potential to break most cryptographic systems. Quantum computers will run complex problems with superposition and entanglement much faster exponentially than classical computers. This poses a solid threat to cryptographic security by efficiently factoring large integers using quantum algorithms like Shor's algorithm, possibly breaking public-key cryptosystems like RSA and ECC. Moreover, Grover's algorithm speeds up symmetric key algorithms brute-force search. This paper discusses these vulnerabilities, surveys the development and feasibility of quantum-resistant algorithms, and addresses practical challenges from their implementations. Finally, it points out standardization processes underway and computation paths for further research. Our findings underline the need to urgently migrate to quantum-resistant cryptographic solutions for robust security in the presence of quantum computing.