Unverified50% confidenceFactExact time
The security of ECC is based on the elliptic curve discrete logarithm problem, while RSA relies on the large integer factorization problem.
1
Sources
50%
Confidence
Long-term
Relevance
9/29/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedEd25519算法基于椭圆曲线Edwards25519，在同等安全强度下比RSA密钥更短、计算更快62% similarUnverified安全分类器判定阈值的调整会影响误判率与漏判率之间的权衡，即ROC曲线上的工作点移动61% similarVerifiedShor's algorithm can theoretically factor large integers in polynomial time, posing a threat to public key infrastructure such as RSA.61% similarUnverifiedThe computational complexity of EKF-SLAM is O(n²) because the dimensions of the covariance matrix grow linearly with the number of landmarks60% similarUnverifiedThe time required to factor RSA numbers grows sub-exponentially with bit length rather than linearly, and the difficulty of factoring RSA-896 far exceeds that of RSA-768.59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/959058API
curl https://kongchang.com/api/v1/knowledge/claims/959058MCP
get_claim(id=959058)