Referenced Items are not available for this document.
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
Published in:
Information Theory, IEEE Transactions on
(Volume:42
,
Issue:
3
)
Date of Publication: May 1996
- Page(s):
- 972 - 976
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 5277058
- Digital Object Identifier :
- 10.1109/18.490558
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- May 1996
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
