Zhi-liang Zhu, Ying Tang, Qiong Liu, Wei Zhang, Hai Yu
{"title":"A Chaos-based Joint Compression and Encryption Scheme Using Mutated Adaptive Huffman Tree","authors":"Zhi-liang Zhu, Ying Tang, Qiong Liu, Wei Zhang, Hai Yu","doi":"10.1109/IWCFTA.2012.52","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":354870,"journal":{"name":"2012 Fifth International Workshop on Chaos-fractals Theories and Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fifth International Workshop on Chaos-fractals Theories and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWCFTA.2012.52","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
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.