Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
Encrypting Huffman-Encoded Data by Substituting Pairs of Code Words without Changing the Bit Count of a Pair
verfasst von : Marek Parfieniuk, Piotr Jankowski
Erschienen in: Cryptography and Security Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This paper presents a method for combining the Huffman coding with encryption. The encryption is based on replacing Huffman code words, or symbols, pair-by-pair, in such a way that the sums of the code word lengths of an original pair and its substitute are equal. Thus our method preserves structures and lengths of bit streams that result from the Huffman encoding. This is advantageous if such a bit stream is embedded in a higher-level data container, like a multimedia file. The algorithm has been evaluated using text data and static Huffman dictionaries.