Title :
On breaking a Huffman code
Author :
Mohtashemi, M. ; Rivest, Ronald L.
fDate :
5/1/1996 12:00:00 AM
Abstract :
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
Keywords :
Huffman codes; cryptography; decoding; Huffman code breaking; cryptoanalysis; cryptography; file deciphering; finite alphabets; three-symbol source alphabet; Binary codes; Binary trees; Computer science; Cryptography; Data compression; Decoding; Encoding; Joining processes; Laboratories; Probability distribution;
Journal_Title :
Information Theory, IEEE Transactions on
