Unverified50% confidenceFactExact time
Claude Shannon在1949年证明，若密钥的熵大于或等于消息的熵且密钥只使用一次，则方案具有完美保密性
1
Sources
50%
Confidence
Long-term
Relevance
7/17/2026
First Seen
Sources
Related Claims
UnverifiedClaude Shannon proposed the concept of perfect secrecy in 1949.71% similarUnverifiedClaude Shannon 在1948年论文《通信的数学理论》中证明无损压缩算法无法将数据压缩至其信息熵以下71% similarVerifiedClaude Shannon published 'A Mathematical Theory of Communication' in 1948, proposing the concept of information entropy, whereby low-probability events carry higher information content, with the formula I(x) = -log₂P(x).65% similarUnverifiedIn 1951, Shannon published the paper "Prediction and Entropy of Printed English," estimating the entropy of English to be approximately 1.0–1.5 bits per character through experiments in which human subjects predicted the next character.61% similarUnverifiedSAC was proposed by Haarnoja et al. at UC Berkeley, introducing a maximum entropy framework that simultaneously maximizes the entropy of the policy while optimizing the expected cumulative reward60% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/538997API
curl https://kongchang.com/api/v1/knowledge/claims/538997MCP
get_claim(id=538997)