The following paper interests me very much:
D. W. Gillman, M. Mohtashemi, R. I. Rivest, On breaking a Huffman code. IEEE Trans. Inf. Th. Vol.42 (1996), pp 972-976.
However, unfortunately due to my poor knowledge, my understanding of it can only be partial. Hence I should appreciate help of the experts:
(1) As far I could understand, i.e. if I don't err in reading, the conclusion/claim of the paper is that substitution with random prefix codes is highly secure (though no sentence exactly like this is to be found in the paper). I like to know whether this is indeed the claim of the authors. (In case the answer is no or not quite, what is the real conclusion/claim?)
(2) [Deleted corresponding to a suggestion of rath.]
[Addendum] (1) has been answered by D. W. Corresponding to a suggestion of him, I have posted a new question entitled "Any good means to enhance the security of encryption processing with random prefix codes?"
Thanks in advance.