Unverified50% confidenceFactExact time
Shor's algorithm can theoretically break RSA and ECC encryption in polynomial time.
1
Sources
50%
Confidence
Long-term
Relevance
9/7/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedWhat quantum computing truly threatens is asymmetric encryption algorithms, such as RSA and Elliptic Curve Cryptography (ECC).76% similarUnverifiedShor 算法同样适用于离散对数问题，因此基于椭圆曲线密码学的 ECDSA、ECDH 等算法也面临量子威胁74% similarUnverifiedRSA encryption relies on the difficulty of large integer factorization, elliptic curve cryptography relies on the discrete logarithm problem, and cryptographic security is built on the assumption that certain problems are computationally hard to solve.74% similarUnverified极验w值的加密数据经过AES、RSA、自定义XOR变换等组合方式混合而成71% similarUnverifiedPKI依赖非对称加密算法如RSA、ECDSA，其安全性建立在大整数分解或椭圆曲线离散对数等数学难题上71% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/871023API
curl https://kongchang.com/api/v1/knowledge/claims/871023MCP
get_claim(id=871023)