A N-Dimensional Discrete Chaotic Map and Its Performance

In order to solve the problems of small key space and simple chaotic behavior of low-dimensional chaotic systems in discrete domain, an N-dimensional discrete chaotic mapping system is proposed. An N-dimensional discrete chaotic system is obtained by coupling Chebyshev mapping with ICMIC mapping. Taking two-dimensional chaotic mapping as an example, the Lyapunov index, bifurcation graph, correlation and other properties of the discrete chaotic system are analyzed and applied to more classical image encryption algorithms. Experimental simulation results show that the N-dimensional discrete chaotic mapping system has larger key space, better chaotic behavior, and better security performance for image encryption algorithms.