Image Encryption Through Aperiodic Josephus Permutation And Novel Cyclic Shift Operation

In recent years, chaos based cryptography has become a prevalent and efficient way to secure digital images because of the similarities between chaotic properties and the traits needed for encryption. This paper proposes an image encryption algorithm combining a chaotic map, Josephus problem, cyclic shift operation, and XOR operation. The proposed encryption procedure follows the traditional permutation-substitution or confusion-diffusion structure. Here, the Henon map and the novel key generation phase generate image-sensitive chaotic streams, which are used for permutation and diffusion. The aperiodic Josephus permutation and bit-level chaotic cycle shift method accomplish the permutation stage by altering the position and value of each pixel. And this proposed permutation thwarts statistical cryptanalysis by dropping the correlation between neighboring pixels to approximately equal zero. The substitution stage is achieved with modulus and XOR operations on the scrambled image and the chaotic matrix. We compare the proposed method with other recent image encryption algorithms in the simulation experiment and security analysis, and the results confirm that the proposed method has better performance and higher security.