Which quantum algorithm threatens RSA encryption by factoring large integers efficiently?
- Grover's Algorithm
- Shor's Algorithm
- Quantum Fourier Transform
- Variational Quantum Eigensolver
Answer: Shor's Algorithm
Shor's Algorithm factors integers in polynomial time on quantum computers, breaking RSA which relies on factoring difficulty. Requires fault-tolerant quantum computers not yet available.