基于Julia分形集的模运算图像加密算法研究-计算机工程与应用.PDFVIP

Computer Engineering and Applications 计算机工程与应用 2013 ，49 （15） 75 基于Julia 分形集的模运算图像加密算法研究 孙媛媛，陈丽娜，朱书敬 SUN Yuanyuan, CHEN Lina, ZHU Shujing 大连理工大学 计算机学院，辽宁 大连 116024 College of Computer Science and Technology, Dalian University of Technology, Dalian, Liaoning 116024, China SUN Yuanyuan, CHEN Lina, ZHU Shujing. Research on modulo image encryption algorithm utilizing Julia sets. Com- puter Engineering and Applications, 2013, 49 （15）：75-79. Abstract ：As an important field in information security, image encryption algorithm has been a research focus. A novel image encryption algorithm combining with features of the classic fractal Julia sets is proposed. This algorithm utilizes Julia set to gen- erate the random key and modulo operation method is used for image encryption, and then diffusion process is used twice to gen- erate the encrypted image. Since Julia sets can be generated with only a few parameters, it can reduce the storage space greatly. In addition, Julia sets have infinite structures and chaotic properties. Even the slight disturbance of the parameters can change the key dramatically, which will lead to the wrong decryption of the image. The experimental results show that the algorithm has lager key space and more sensitivity for the key compared to the algorithm proposed by Rozouvan utilizing the Mandelbrot sets as the key. In particular, it can resist chosen-plaintext attack more efficiently. Key words ：Julia sets; modulo operation; diffusion; image encryption 摘 要：作为信息安全的重要领域，图像加密算法一直是人们研究的热点。针对经典分形集合Julia 集的特点，提出一种图 像加密算法。将Julia 集作为一种随机元素生成密钥，采用模运算方法对图像进行加密，对生成的密文进行两次扩散，得到 最终密文。由于Julia 集密钥仅需几个参数就可以表示，大大减小了存储空间。并且Julia 集的无限性以及混沌特性使得任 意参数的极其微小的变动都将导致密钥剧烈变化，无法正常解密。该算法较Rozouvan 提出的以Mandelbrot 分形集为密钥 的转换方法，密钥空间更大，密钥敏感性显著提高，尤其能够有效抵御选择明文攻击。 关键词：Julia 集；模运算；扩散；图像加密 文献标志码：A 中图分类号：TP751 doi ：10.3778/j.issn. 1002-8331.1203-0071 1 引言