Design of error-free perfect secrecy system by prefix codes and partition codes

We investigate how to design an error-free and perfectly secure crypto-system. In particular, we are interested in the efficiency of an EPS system. A approach based on prefix codes is introduced. Also an optimum partition code is introduced where the key consumption is minimum for fixed number of channel uses. Results obtained in this paper can also be applied to study the tradeoff between the key consumption and the number of channel uses needed to transmit the encrypted message.

[1]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[2]  R. J. McEliece,et al.  Maximal codeword lengths in Huffman codes , 1992 .

[3]  Sergio Verdú,et al.  On the Interplay Between Conditional Entropy and Error Probability , 2010, IEEE Transactions on Information Theory.

[4]  Raymond W. Yeung,et al.  The Interplay Between Entropy and Variational Distance , 2007, IEEE Transactions on Information Theory.

[5]  Siu-Wai Ho,et al.  Error-free perfect-secrecy systems , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[6]  Terence Chan,et al.  Design of an error-free perfect secrecy system for unknown inputs , 2012, 2012 Australian Communications Theory Workshop (AusCTW).

[7]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .