Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
PCM '01 Proceedings of the Second IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
A New Source Coding Scheme with Small Expected Length and Its Application to Simple Data Encryption
IEEE Transactions on Computers
Overview on selective encryption of image and video: challenges and perspectives
EURASIP Journal on Information Security
Joint compression and data protection
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Reducing the length of Shannon-Fano-Elias codes and Shannon-Fano codes
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Securing multi-media transmission over mobile communication channels
International Journal of Intelligent Engineering Informatics
| Hi-index | 754.84 |
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