Scholarlink

Image encryption is critical in safeguarding image information during transmission through insecure channels. Consequently, researchers have proposed multiple methods for encrypting simple, secure, and fast images. This chapter introduces two image encryption algorithms designed to enhance the randomness of cipher images. The first algorithm divides the image into two parts: D-matrix and R-matrix. These matrices are utilized in the replacement method, where pixel values are modified using the X-value of the Rossler attractor. Additionally, a shuffling technique is employed to alter pixel locations, considering the Y-plane and Z-plane of the Rossler attractor. The replacement approach is modified in the second algorithm by combining the R and D matrices using the Rossler attractor X-plane. This approach eliminates division and allows for a more streamlined encryption process. Experimental results demonstrate that both image encryption models are effective, resilient, and straightforward in encrypting images while capable of withstanding various attacks. The findings further indicate that establishing a linear independent relationship between the R and D matrices enhances the encryption model’s performance. Algorithm 1 achieved an average entropy value of 7.9828, while Algorithm 2 obtained a slightly higher value of 7.9972. For mean correlation, Algorithm 1 yielded a value of 0.013944, whereas Algorithm 2 had a lower value of 0.010439. Regarding the UACI mean variant, Algorithm 1 scored 34.1429, whereas Algorithm 2 achieved a slightly lower value of 33.4516. The average NPCR for both algorithms exceeded 99%. Overall, the results revealed that the proposed algorithms efficiently encrypt images accurately.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Secure Symmetric Image Encryption Using Chaotic Rossler Attractor: A Linear Independence-Based Approach

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Hazem Al-Najjar,
  • Nadia Al-Rousan,
  • Ali Mohd. Ali,
  • Dana Alnajjar

摘要

Image encryption is critical in safeguarding image information during transmission through insecure channels. Consequently, researchers have proposed multiple methods for encrypting simple, secure, and fast images. This chapter introduces two image encryption algorithms designed to enhance the randomness of cipher images. The first algorithm divides the image into two parts: D-matrix and R-matrix. These matrices are utilized in the replacement method, where pixel values are modified using the X-value of the Rossler attractor. Additionally, a shuffling technique is employed to alter pixel locations, considering the Y-plane and Z-plane of the Rossler attractor. The replacement approach is modified in the second algorithm by combining the R and D matrices using the Rossler attractor X-plane. This approach eliminates division and allows for a more streamlined encryption process. Experimental results demonstrate that both image encryption models are effective, resilient, and straightforward in encrypting images while capable of withstanding various attacks. The findings further indicate that establishing a linear independent relationship between the R and D matrices enhances the encryption model’s performance. Algorithm 1 achieved an average entropy value of 7.9828, while Algorithm 2 obtained a slightly higher value of 7.9972. For mean correlation, Algorithm 1 yielded a value of 0.013944, whereas Algorithm 2 had a lower value of 0.010439. Regarding the UACI mean variant, Algorithm 1 scored 34.1429, whereas Algorithm 2 achieved a slightly lower value of 33.4516. The average NPCR for both algorithms exceeded 99%. Overall, the results revealed that the proposed algorithms efficiently encrypt images accurately.