Joint compression and encryption using chaotically mutated Huffman trees
Joint compression and encryption using chaotically mutated Huffman trees
复制标题
DOI：
10.1016/j.cnsns.2009.11.022
复制
发表时间：
2010-10-01
影响因子：
3.9
通讯作者：
Belghith, Safya
中科院分区：
文献类型：
--
作者：
Hermassi, Houcemeddine;Rhouma, Rhouma;Belghith, Safya
介绍了一种利用哈夫曼编解码器进行联合压缩和加密的新方案。首先为给定消息生成基本树，然后基于从混沌映射生成的密钥流并根据输入消息，在不改变统计模型的情况下变异基本树。因此，码元可以由具有相同长度的多于一个码字来编码。针对已知的明文攻击和暴力破解两种攻击，对该方案的安全性进行了测试。给出了性能分析，包括加解密速度、额外计算复杂度和压缩比。(C)2009爱思唯尔B.V.保留所有权利。
This paper introduces a new scheme for joint compression and encryption using the Huffman codec. A basic tree is first generated for a given message and then based on a key-stream generated from a chaotic map and depending from the input message, the basic tree is mutated without changing the statistical model. Hence a symbol can be coded by more than one codeword having the same length. The security of the scheme is tested against the known plaintext attack and the brute force attack. Performance analysis including encryption/decryption speed, additional computational complexity and compression ratio are given. (C) 2009 Elsevier B.V. All rights reserved.