A New Permutation-Substitution Scheme Based on Henon Chaotic Map for Image Encryption

In this paper, a new permutation-substitution scheme based on Henon chaotic map is introduced to generate a set of secret keys equivalent to query image size (m x n). The random floating values produced by Henon map have been invested to achieve the permutation and substitution processes of the query image. The performance evaluation of the running time for encryption processes significantly guarantees that the proposed cryptographic system reduces the running time compared to the state of art chaotic based image encryption schemes. Based on the experiments, the robustness of the proposed substitution and permutation approaches based encryption scheme has been evidenced against brute force and statistical attacks. The proposed encryption scheme exhibits efficient results which have a promotion in statistical analysis parameters such as; histogram distribution, key space analysis, initial key sensitivity, entropy benchmark, correlation coefficients and peak signal to noise ratio.