Unverified50% confidenceFactExact time
在Gentry之前，密码学界只实现了部分同态加密，例如RSA算法天然支持乘法同态，Paillier加密支持加法同态，但没有方案能同时支持加法和乘法的无限次组合
1
Sources
50%
Confidence
Long-term
Relevance
8/23/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedRSA 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% similarUnverifiedPKI依赖非对称加密算法如RSA、ECDSA，其安全性建立在大整数分解或椭圆曲线离散对数等数学难题上72% similarUnverifiedWhat quantum computing truly threatens is asymmetric encryption algorithms, such as RSA and Elliptic Curve Cryptography (ECC).71% similarUnverifiedWidely deployed encryption algorithms such as AES, RSA, and elliptic curve cryptography are completely public, and their security is built on mathematically hard problems.71% similarUnverifiedHybrid encryption mode runs both classical and post-quantum algorithms simultaneously, ensuring that even if the post-quantum algorithm has unknown weaknesses, the system's security remains at least equivalent to that of the classical algorithm.71% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/791213API
curl https://kongchang.com/api/v1/knowledge/claims/791213MCP
get_claim(id=791213)