Unverified50% confidenceFactExact time
Peter Shor在1994年提出了Shor算法，理论上能让足够强大的量子计算机在多项式时间内破解RSA和ECC加密
1
Sources
50%
Confidence
Long-term
Relevance
8/4/2026
First Seen
Sources
NIST后量子加密标准解读：应对量子计算威胁的迁移指南
Related Claims
UnverifiedShor'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.75% similarUnverifiedGrover's algorithm was proposed by Lov Grover in 1996 and is a quantum search algorithm capable of finding a target item in an unordered database with O(√N) time complexity.57% similarUnverifiedClaude Shannon在1949年证明，若密钥的熵大于或等于消息的熵且密钥只使用一次，则方案具有完美保密性57% similarUnverified2020年MIP*=RE成果证明了量子交互证明系统的能力，同时解决了Connes嵌入猜想这一纯数学问题57% similarUnverifiedI. J. Good published the paper "Speculations Concerning the First Ultraintelligent Machine" in 1965.56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/680946API
curl https://kongchang.com/api/v1/knowledge/claims/680946MCP
get_claim(id=680946)