Browse > Article
http://dx.doi.org/10.7471/ikeee.2018.22.4.1163

Selective Encryption of Canonical Huffman code  

Park, Sang-ho (Dept. of Information and Communication Engineering, Andong National University)
Publication Information
Journal of IKEEE / v.22, no.4, 2018 , pp. 1163-1167 More about this Journal
Abstract
The selective encryption scheme for canonical Huffman codes using the inversion of bit values is proposed. The symbols are divided into blocks of a certain size, and each symbol in the block is compressed by canonical Huffman coding. Blocks are determined to be sent in the original code or encrypted form. The encryption block inverts the values of the whole bits, and bits of block that do not encrypt are not inverted. Those compressed data are transmitted with the encryption information. It is possible to decrypt the compressed data on the receiving side using the encryption information and compressed data.
Keywords
Entropy coding; Huf man coding; Canonical tree; Selective Encoding; Encryption;
Citations & Related Records
연도 인용수 순위
  • Reference
1 K. Sayood, Introduction to Data Compression, 3rd ed. Morgan Kaufmann, 2006.
2 D. Huffman, "A method for the construction of minimum redundancy codes," Proc. of the IRE, vol.40, no.90, pp.1098-1101, 1952. DOI:10.1109/JRPROC.1952.273898   DOI
3 E. S. Schwartz and B. Kallick, "Generating a canonical prefix encoding," Communications of the ACM, vol.7, no.3, pp.166-169, 1964. DOI:10.1145/363958.363991   DOI
4 S. Park, "Efficient Huffman decoding using canonical Huffman tree," J. of KSCI, vol.12, no.4, pp.111-117, 2007.
5 S. Park, "A study on selective encryption of Huffman codes," J. Information and Security, vol.7, no.2, pp.57-63, 2007.