Theorem 2.11 (Shannon's theorem) 明文空间为M的加密方案(Gen,Enc,Dec),且|M|=|K|=|C|。方案是完善保密加密的当且仅当: 任意密钥k被选择的概率是1/|K|。 对于任意m∈M和c∈C,存在唯一密钥k∈K,满足:Enck(m)=c。 也就是m和c之间存在双射?(单射加满射) Proof 证明背后的直觉如下。注意到
A short proof for a basic theorem due to Simmons is provided.doi:10.1007/978-1-4612-3352-7_33Andrea SgarroSpringer New YorkA. Sgarro, Three-types of perfection in Shannon-theoretic cryptography , Proceedings of a Workshop on Sequences, Positano, June 6–11, 1988...
Near Shannon limit performance of low density parity check codes
A Theorem on Coloring the Lines of a Network. The Synthesis of Two-Terminal Switching Circuits. (With H.W. Bode) A Simplified Derivation of Linear Least Square Smoothing and Prediction Theory. Programming a Computer for Playing Chess. A Chess-Playing Machine. Memory Requirements in a Telephone ...
Conference on Theory of Quantum Computation, Communication and CryptographyBerta, M., Christandl, M., Renner, R.: A Conceptually Simple Proof of the Quantum Reverse Shannon Theorem. http://arXiv.org/abs/0912.3805v1 [quant-ph], 2009
The residue number system (RNS), initially proposed in 1959, was derived from the third century Chinese remainder theorem [1]. RNS architectures are now applied in many growing fields such as cryptography [2], image-processing systems [3], and error-correction codes [4] due to its convenienc...