By Topic

A Chaos-based Joint Compression and Encryption Scheme Using Mutated Adaptive Huffman Tree

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Zhi-Liang Zhu ; Software Coll., Northeastern Univ., Shenyang, China ; Ying Tang ; Qiong Liu ; Wei Zhang
more authors

In this paper, a new joint compression and encryption scheme based on adaptive Huffman tree using chaotic maps is proposed. Due to the intrinsic feature of adaptive Huffman coding, it permits building the code as the symbols are being transmitted and can be applied in real time applications. In proposed scheme, the adaptive Huffman tree is mutated by a key-stream generated by two chaotic maps, and the probabilistic model is not changed after encryption. The security of the scheme is tested against the brute force attack and Shannon entropy analysis. In addition, performance analysis such as encryption-decryption efficiency and compression ratio are given.

Published in:

Chaos-Fractals Theories and Applications (IWCFTA), 2012 Fifth International Workshop on

Date of Conference:

18-21 Oct. 2012