Verified65% confidenceFactExact time
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.
3
Sources
65%
Confidence
Long-term
Relevance
7/7/2026
First Seen
Sources
后量子密码学Python实战：ML-KEM密钥封装机制详解
hackernewshackernews7/4/2026
Related Claims
UnverifiedPeter Shor在1994年提出了Shor算法，理论上能让足够强大的量子计算机在多项式时间内破解RSA和ECC加密75% similarUnverified对于二维中由n个离散点构成的两组点集，Lo和Steiger于1990年给出了O(n log n)时间复杂度的确定性算法63% similarUnverifiedMost modern diff tools are based on the difference algorithm proposed by Eugene Myers in 1986, which has a time complexity of O(ND).62% similarUnverifiedBitap算法由Ricardo Baeza-Yates和Gaston Gonnet于1992年提出，时间复杂度为O(mn/w)59% similarUnverifiedThe Mersenne Twister algorithm was proposed by Makoto Matsumoto and Takuji Nishimura in 1997.59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/126832API
curl https://kongchang.com/api/v1/knowledge/claims/126832MCP
get_claim(id=126832)