On breaking a Huffman code
David W. Gillman, M. Mohtashemi, Ronald L. Rivest · IEEE Transactions on Information Theory · 1996
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.