Shor's Algorithm
A quantum computing algorithm proposed by Peter Shor that can theoretically factor integers in polynomial time. It poses a fundamental threat to cryptographic systems based on the hardness of integer factorization, such as RSA, and is a primary motivation for research into post-quantum cryptography.
Core Facts
Shor's algorithm can theoretically factor large integers in polynomial time, posing a threat to public key infrastructure such as RSA.
Shor's algorithm was proposed by Peter Shor in 1994 and can solve the integer factorization problem in O((log N)³) polynomial time complexity using the quantum Fourier transform.
Timeline (last 90 days)
The current physical implementation of quantum computers is not yet sufficient to run Shor's algorithm capable of breaking practical key lengths.
The currently mainstream 2048-bit RSA faces a theoretical risk of being broken by quantum computing's Shor's algorithm.
Shor's algorithm can theoretically break RSA and ECC encryption in polynomial time.
Shor's algorithm has a time complexity of O((log N)^3).
Shor的大数分解算法和Grover的搜索算法利用波函数干涉放大正确答案的概率振幅、抑制错误答案的振幅
All Facts (7)
Shor's algorithm can theoretically factor large integers in polynomial time, posing a threat to public key infrastructure such as RSA.
65%VerifiedShor's algorithm was proposed by Peter Shor in 1994 and can solve the integer factorization problem in O((log N)³) polynomial time complexity using the quantum Fourier transform.
65%UnverifiedThe current physical implementation of quantum computers is not yet sufficient to run Shor's algorithm capable of breaking practical key lengths.
50%UnverifiedThe currently mainstream 2048-bit RSA faces a theoretical risk of being broken by quantum computing's Shor's algorithm.
50%UnverifiedShor's algorithm can theoretically break RSA and ECC encryption in polynomial time.
50%UnverifiedShor's algorithm has a time complexity of O((log N)^3).
50%UnverifiedShor的大数分解算法和Grover的搜索算法利用波函数干涉放大正确答案的概率振幅、抑制错误答案的振幅
50%