Design of an error-free perfect secrecy system for unknown inputs
暂无分享,去创建一个
This paper studies the behaviour of a crypto-system in a situation where an encoder PX'R'|U' is used to encrypt a source U which may be different from the source U' considered to design the encoder. The original crypto-system is designed to achieve perfect secrecy under PU'. The resulting system also achieves perfect secrecy regardless of the source distribution. Finally the mismatch in the system resources are calculated when the actual source distribution is known. The number of channel uses remains unchanged at the value for which the system is designed. Upper and lower bounds for the expected key consumption are derived.
[1] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..
[2] J. L. Massey,et al. An introduction to contemporary cryptology , 1988, Proc. IEEE.
[3] Siu-Wai Ho,et al. Error-free perfect-secrecy systems , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.
[4] G. S. Vernam,et al. Cipher Printing Telegraph Systems For Secret Wire and Radio Telegraphic Communications , 1926, Transactions of the American Institute of Electrical Engineers.