Abstract

A novel color image encryption algorithm based on a cross 2D hyperchaotic map is proposed in this paper. The cross 2D hyperchaotic map is constructed using one nonlinear function and two chaotic maps with a cross structure. Chaotic behaviors are illustrated using bifurcation diagrams, Lyapunov exponent spectra, phase portraits, etc. In the color image encryption algorithm, the keys are generated using hash function SHA-512 and the information of the plain color image. First, the color plain image is converted to a combined bit-level matrix and permuted by the chaos-based row and column combined cycle shift scrambling method. Then, the scrambled integer matrix is diffused according to the selecting sequence which depends on the chaotic sequence. Last, decompose the diffusion matrix to get the encrypted color image. Simulation experiments and security evaluations show that the algorithm can encrypt the color image effectively and has good security to resist various kinds of attacks.

Highlights

  • Image encryption is different from text encryption, because image has the characteristics of massive data capacity and high correlation between pixels

  • The scrambled integer matrix is diffused according to the selecting sequence which depends on the chaotic sequence

  • The cipher color image is obtained by decomposed the diffused matrix

Read more

Summary

Cross 2D hyperchaotic map

This model has two inputs and two cross outputs, which is when input is xn the output is yn+1, and when input is yn the output is xn+1. Function f is a nonlinear function, functions F and G are two chaotic maps. The mathematical expression of the model is shown in Formula (1). The chaotic map G is chosen as the Sine map in this paper. Where is a control parameter and it has an interval of The mathematical expression of the modified 2D coupled chaotic map model is set to sin(yi ). It can be seen that the spectrum of Lyapunov exponents spectrums and the bifurcation diagrams are one to one correspondence

Sensitivity analysis of initial value
Experimental results and performance analysis
Key space analysis
Histogram
Correlation of adjacent pixels
Conclusion
Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.