Yash Deore

The advancement of quantum computing presents both unprecedented opportunities and significant threats to contemporary cryptographic systems. This research explores the potential of quantum algorithms, specifically Shor's algorithm and Grover's algorithm, in decrypting widely used cryptographic standards, including AES, Triple DES, RSA, and ECC, which are integral to the Federal Information Processing Standards (FIPS) 140-3. Shor's algorithm, known for its polynomial-time factorization capabilities, poses a direct threat to RSA and ECC by efficiently solving the underlying mathematical problems that ensure their security. Meanwhile, Grover's algorithm, which offers quadratic speedup for unstructured search problems, can effectively reduce the security margins of symmetric key algorithms such as AES and Triple DES. This paper provides a comprehensive analysis of the vulnerabilities exposed by these quantum algorithms, evaluates the current cryptographic landscape, and discusses the implications for information security. Additionally, we explore potential quantum-resistant cryptographic approaches to mitigate these threats, ensuring robust security in the advent of practical quantum computing.