We examine the problem of deciphering a file that has been Huffman coded, but not otherwise encrypted. We find that a Huffman code can be surprisingly difficult to cryptanalyze. We present a detailed analysis of the situation for a three-symbol source alphabet and present some results for general finite alphabets.
['David W. Gillman', 'Mojdeh Mohtashemi', 'Ronald L. Rivest']
On breaking a Huffman code