Unverified50% confidenceFactExact time
If P=NP, RSA public-key encryption, SHA-256, HMAC, pseudorandom number generators, and even blockchain security would all be broken by polynomial-time algorithms.
1
Sources
50%
Confidence
Long-term
Relevance
10/28/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedPKI依赖非对称加密算法如RSA、ECDSA，其安全性建立在大整数分解或椭圆曲线离散对数等数学难题上78% similarUnverified现代公钥加密体系（如RSA）的安全性本质上依赖于P≠NP的假设，若P=NP被证明则现有加密体系将面临根本性崩塌78% similarVerifiedShor's algorithm can theoretically break RSA and ECC encryption in polynomial time.73% similarVerifiedRSA 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.71% similarUnverified行业标准要求使用bcrypt、Argon2或PBKDF2等慢哈希算法对密码进行加盐哈希处理，MD5/SHA1等快速哈希可在数秒内被彩虹表攻击破解70% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1109886API
curl https://kongchang.com/api/v1/knowledge/claims/1109886MCP
get_claim(id=1109886)