Verified75% confidenceFactExact time
RSA 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.
5
Sources
75%
Confidence
Long-term
Relevance
7/6/2026
First Seen
Sources
Greedy Algorithms and the Knapsack Problem: Core Notes from MIT 6.0002 Lecture 1
bilibiliAI从零开始学7/3/2026
Related Claims
UnverifiedPKI依赖非对称加密算法如RSA、ECDSA，其安全性建立在大整数分解或椭圆曲线离散对数等数学难题上78% similarUnverifiedLarge integer multiplication is a fundamental operation in public-key cryptography such as RSA and ECC.78% similarUnverifiedThe security of modern cryptographic systems is built on the assumption that certain mathematical problems are 'computationally infeasible,' such as large integer factorization and discrete logarithm solving.77% similarVerifiedWidely deployed encryption algorithms such as AES, RSA, and elliptic curve cryptography are completely public, and their security is built on mathematically hard problems.76% similarUnverified现代公钥加密体系（如RSA）的安全性本质上依赖于P≠NP的假设，若P=NP被证明则现有加密体系将面临根本性崩塌75% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/115513API
curl https://kongchang.com/api/v1/knowledge/claims/115513MCP
get_claim(id=115513)