期刊
COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION
卷 15, 期 10, 页码 2987-2999出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.cnsns.2009.11.022
关键词
Joint compression and encryption; Huffman tree; Chaotic encryption
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据