Title
An information-theoretic treatment of homophonic substitution
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.
Year
Venue
Keywords
1989
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
homophonic substitution,information-theoretic treatment,random sequence
Field
DocType
Volume
Cipher,Discrete mathematics,Cryptography,Computer science,Random sequence,Plaintext
Conference
434
ISSN
ISBN
Citations 
0302-9743
3-540-53433-4
15
PageRank 
References 
Authors
1.35
3
3
Name
Order
Citations
PageRank
Hakon N. Jendal1151.35
Yves J. B. Kuhn2151.35
James L. Massey31096272.94