Abstract
The history of cryptology shows that most secret-key cipher systems that have been broken were broken by exploiting the departure of the plaintext statistics from those of a completely random sequence. The technique of “homophonic substitution” is an old technique for converting an actual plaintext sequence into a (more) random sequence. At EUROCRYPT ’88, Günther [1] introduced an important generalization of homophonic substitution, which we will call “variable-length homophonic substitution”. The purpose of this paper is to give an information-theoretic treatment of Günther’s type of homophonic substitution.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ch.G. Günther, “A Universal Algorithm for Homophonic Coding”, pp. 405–414 in Advances in Cryptology-Eurocrypt’ 88, Lect. Notes in Comp. Sci. No. 330. New York and Heidelberg: Springer 1988.
R.G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
C.E. Shannon, “Communication Theory of Secrecy Systems”, Bell Sys. Tech. J., vol. 28, pp. 656–715, Oct. 1949.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jendal, H.N., Kuhn, Y.J.B., Massey, J.L. (1990). An Information-Theoretic Treatment of Homophonic Substitution. In: Quisquater, JJ., Vandewalle, J. (eds) Advances in Cryptology — EUROCRYPT ’89. EUROCRYPT 1989. Lecture Notes in Computer Science, vol 434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46885-4_38
Download citation
DOI: https://doi.org/10.1007/3-540-46885-4_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53433-4
Online ISBN: 978-3-540-46885-1
eBook Packages: Springer Book Archive