Skip to Main Content
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.