Related Question 4
Which algorithm allows quantum computers to factor large numbers efficiently, threatening RSA encryption?
-
A.
Shor's algorithm
-
B.
Dijkstra's algorithm
-
C.
FFT algorithm
-
D.
Quicksort
Correct Answer: A
Explanation:
Shor's algorithm can factor integers in polynomial time, which could break RSA keys.