CAJ | 학술논문

　　作为信息安全的重要领域，图像加密算法一直是人们研究的热点。针对经典分形集合Julia集的特点，提出一种图像加密算法。将Julia集作为一种随机元素生成密钥，采用模运算方法对图像进行加密，对生成的密文进行两次扩散，得到最终密文。由于Julia集密钥仅需几个参数就可以表示，大大减小了存储空间。并且Julia集的无限性以及混沌特性使得任意参数的极其微小的变动都将导致密钥剧烈变化，无法正常解密。该算法较Rozouvan提出的以Mandelbrot分形集为密钥的转换方法，密钥空间更大，密钥敏感性显著提高，尤其能够有效抵御选择明文攻击。
　　작위신식안전적중요영역，도상가밀산법일직시인문연구적열점。침대경전분형집합Julia집적특점，제출일충도상가밀산법。장Julia집작위일충수궤원소생성밀약，채용모운산방법대도상진행가밀，대생성적밀문진행량차확산，득도최종밀문。유우Julia집밀약부수궤개삼수취가이표시，대대감소료존저공간。병차Julia집적무한성이급혼돈특성사득임의삼수적겁기미소적변동도장도치밀약극렬변화，무법정상해밀。해산법교Rozouvan제출적이Mandelbrot분형집위밀약적전환방법，밀약공간경대，밀약민감성현저제고，우기능구유효저어선택명문공격。
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.