.png){kind=icon}
返回
Cracking a hierarchical chaotic image encryption algorithm based on permutation
.png){kind=icon}
OA
AI
DOI：10.1016/j.sigpro.2015.07.008.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In year 2000, an efficient hierarchical chaotic image encryption (HCIE) algorithm was proposed, which divides a plain-image of size M x N with T possible value levels into K blocks of the same size and then operates position permutation on two levels: intra-block and inter-block. As a typical position permutation-only encryption algorithm, it has received intensive attention. The present paper analyzes specific security performance of HCIE against ciphertext-only attack and known/chosen-plaintext attack. It is found that only O(inverted right perpendicularlog(T)(M center dot N/K)inverted left perpendicular) known/chosen plain-images are sufficient to achieve a good performance, and the computational complexity is O(M center dot N center dot inverted right perpendicularlog(T)(M center dot N/K)inverted left perpendicular), which effectively demonstrates that hierarchical permutation-only image encryption algorithms are less secure than normal (i.e., non-hierarchical) ones. Detailed experiment results are given to verify the feasibility of the known-plaintext attack. In addition, it is pointed out that the security of HCIE against ciphertext-only attack was much overestimated. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Chosen-plaintext attack
Chaotic cryptanalysis
Known-plaintext attack
Permutation
Histogram
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
暂无机构信息
引用论文
分享收藏Solving a Special Type of Jigsaw Puzzles: Banknote Reconstruction From a Large Number of Fragments
PREAI
分享收藏
Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks.png)
SIGNAL PROCESSINGOAAI
SIGNAL PROCESSINGIF3.6
OAAI分享收藏
查看更多内容