.png){kind=icon}
返回
Joint compression and encryption using chaotically mutated Huffman trees
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cnsns.2009.11.022.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Joint compression and encryption
Huffman tree
Chaotic encryption
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
9.2K
被引数:
1.8W
机构
引用论文
Reliability and construct validity of the Automated Neuropsychological Assessment Metrics (ANAM) mood scale自动神经心理学评估指标 (ANAM) 情绪量表的信度和结构效度
OAAI
.png){kind=icon}
OAAI分享收藏
分享收藏 没有更多内容
没有更多内容