Mojdeh Mohtashemi  Home/Search
Context
Related
| mit.edu/~cis/these...tashemimasters.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/~cis/cistheses (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Data-compression techniques such as Huffman coding are often used in conjunction with cryptographic schemes. By removing redundancy in the source document, they can significantly increase the difficulty of cryptanalysis. In this thesis we consider the question: "what is the difficulty of breaking a data-compression scheme by itself ?" We examine most closely the problem of deciphering a file that has been Huffman-coded, but for which the Huffman code used is unavailable. We find that a... (Update)
Active bibliography (related documents): More All
0.1: Automatic Synthesis of Compression Techniques for Heterogeneous.. - Hsu (1995) (Correct)
0.1: High-Resolution Still Picture Compression - Wickerhauser (1992) (Correct)
0.1: Efficiently Supporting Ad Hoc Queries in Large Datasets.. - Korn, Jagadish.. (1997) (Correct)
Similar documents based on text: More All
0.6: Optimal Maximal Prefix Coding and Huffman Coding - Long, Jia (2001) (Correct)
0.6: On the Optimal Coding - Long, Jia (Correct)
0.5: On the Maximum Length of Huffman Codes - Buro (1993) (Correct)
BibTeX entry: (Update)
@techreport{ mohtashemi92cryptanalysis,
author = "M. Mohtashemi",
title = "On the Cryptanalysis of Huffman Codes",
number = "MIT-LCS//MIT/LCS/TR-617",
pages = "35",
year = "1992",
url = "citeseer.ist.psu.edu/mohtashemi92cryptanalysis.html" }
Citations (may not include all citations):338 A method for the construction of minimum-redundancy codes (context) - Huffman - 1952
157 The Art of Computer Programming: Sorting and Searching (context) - Knuth - 1973
95 Coding and Information Theory (context) - Hamming - 1980
78 New York (context) - Kahn, Macmillian - 1967
45 Dynamic Huffman coding (context) - Knuth - 1985
20 Applications of splay trees to data compression (context) - Jones - 1988
9 Computer Science Press (context) - Storer, Methods - 1988
Documents on the same site (http://theory.lcs.mit.edu/~cis/cis-theses.html): More
SPKI/SDSI Secure Web Server Project - Maywah (1999) (Correct)
Design and Analysis of an Anonymous Communications Channel for.. - Freedman (2000) (Correct)
Pseudonym Systems - Lysyanskaya, Rivest, Sahai (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC