研究了基于Arnold变换的图像置乱算法的安全性问题.该算法使用两个不同的Arnold变换矩阵,分别对明文图像进行一次全局置乱和一次分割置乱.结果分析表明,该算法的密钥空间小,不足以抵抗穷举密钥攻击.在选择明文攻击下,导出了两次Arnold变换等效密钥之间的确定性关系.这一关系有效地降低了整个密码系统的密钥空间,从而可以用较小的计算代价获得密钥.理论和实验结果均表明,该密码系统不够安全.
The security of an Arnold transformation-based image scrambling algorithm is analyzed in this paper.One time global scrambling and one time intersected scrambling are carried on plain-images.The key space of the algorithm is too small to against the exhaust attacks based on the ciphertext-only attack.A deterministic relationship among equivalent keys of Arnold transformations is derived by the chosen-plaintext attack.The relationship can effectively decrease the key space of the whole cryptosystem,thereby obtaining the keys with smaller computational expense.The results of the theory and experiment verify that the cryptosystem is not secure enough.