Unverified50% confidenceFactExact time
In Minicrypt, primitives based on one-way functions such as symmetric encryption, pseudorandom number generators, and message authentication codes can still be constructed, but primitives based on trapdoor functions such as public key encryption, key exchange, and digital signatures are mathematically impossible to realize.
1
Sources
50%
Confidence
Long-term
Relevance
10/12/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedHomomorphic encryption can perform computations directly on encrypted data without first decrypting it, and the results are also encrypted and can only be decrypted by those who hold the key.75% similarUnverified在Gentry之前，密码学界只实现了部分同态加密，例如RSA算法天然支持乘法同态，Paillier加密支持加法同态，但没有方案能同时支持加法和乘法的无限次组合73% similarUnverifiedWWI handcrafted ciphers have an extremely limited keyspace and ciphertext carries statistical regularities such as letter frequency distribution, making them weak encryption at the information-theoretic level.72% similarUnverifiedThe ciphertext output by an excellent encryption algorithm is statistically almost indistinguishable from true random noise; therefore, the patterns that LLMs rely on to operate do not exist in ciphertext, making it impossible for them to break symmetric encryption.71% similarUnverifiedCryptographer Matthew Green believes there is a 1% probability that we live in a Minicrypt world, that is, a world in which public key encryption is mathematically impossible.71% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1009738API
curl https://kongchang.com/api/v1/knowledge/claims/1009738MCP
get_claim(id=1009738)