LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

2D-SCMCI Hyperchaotic Map for Image Encryption Algorithm

Photo by britishlibrary from unsplash

Chaos has unpredictability and initial condition sensitivity, which known as a best candidate for cryptography application. However, there are many defects for the existing chaotic cryptography systems due to the… Click to show full abstract

Chaos has unpredictability and initial condition sensitivity, which known as a best candidate for cryptography application. However, there are many defects for the existing chaotic cryptography systems due to the use of chaotic maps that without complexity dynamic properties. To overcome these weaknesses, this work designed a 2D-SCMCI hyperchaotic map based on Cascade Modulation Couple (CMC) and two 1D-chaotic map. The dynamic characteristics of the 2D-SCMCI hyperchaotic map are analyzed through attractor trajectory, 0–1 test, bifurcation diagram, Lyapunov exponents and spectrum entropy (SE) complexity. The results of analysis indicate that 2D-SCMCI hyperchaotic map has rich dynamic performance and randomness, which illustrates that it is more suitable for image encryption algorithm. Therefore, an image encryption algorithm is proposed by 2D-SCMCI hyperchaotic map. In encryption algorithm, the image is scrambled by row and column, forward and backward diffusion are used to diffuse image pixel values. The security performances analysis results indicate that the introduced algorithm has better security characteristics.

Keywords: scmci hyperchaotic; hyperchaotic map; image; encryption algorithm

Journal Title: IEEE Access
Year Published: 2021

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.