Abstract

The parameter range of traditional 2D chaotic maps is small, limiting the sequence generation performance. In order to improve security and efficiency, it is necessary to develop a new 2D chaotic map for image encryption. This paper proposes an enhanced version of the Henon Map, called 2D-HHMSC, which has better sequence generation performance than the Henon Map under the same parameters. In addition, 2D-HHMSC has ample parameter space, enhancing the generated sequences’ randomness. The proposed method is a new color image encryption algorithm. To prevent the algorithm from being subjected to brute force attacks, two hash functions are used to generate the parameters and initial values of the Arnold map and 2D-HHMSC. The key space of the algorithm can reach 2̂1024. In the scrambling phase, the three channels of the color image are scrambled using Arnold maps with different parameters and then combined into a grayscale image. In order to fully diffuse the scrambled image, use the key stream generated by 2D-HHMSC to diffuse the grayscale image, starting from the center position of the grayscale image The correlation coefficients of the proposed encryption algorithm are 0.002, 0.0012, and −0.0006, and the information entropy is 7.9993. Experimental results show that the algorithm can resist common attacks, proving its robustness and reliability.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call