A Simple, Secure and Time Efficient Multi-way Rotational Permutation and Diffusion Based Image Encryption by Using Multiple 1-D Chaotic Maps

Abstract

Nowadays, the security of transmitting and receiving multimedia data basically digital images through internet has become a challenge to all internet users. This paper proposes a secure, simple and time efficient digital image encryption scheme which takes up a combination of 1-D chaotic maps to perform multi-way rotation based permutation operations and different stages of diffusion operations. The proposed algorithm performs three sectional ways of operations: First the image matrix is divided into blocks of various sizes and then multi- way rotation operations are performed on them. Followed by which the row and column rotation based permutation operations takes place by using multiple 1-D chaotic maps. At the end of operation, row, column and then block diffusion are performed by using multiple 1-D chaotic maps. The proposed algorithm is very much simple and secure because in this algorithm some simple rotation based permutation operations are performed by using 1-D chaotic maps. The proposed algorithm is also time efficient because only 0.208 s is required for implementing the whole program. Apart from that, multi-way rotation based permutation operations and different stages of diffusion operations more confuse the attacker for attacking the proposed cryptosystem. The SHA-256 hashing is used in this algorithm to resist against known-plaintext attack and chosen-plaintext attack. The simulation results and security analysis indicates that the proposed algorithm has good encryption effect, large secret-key space, high key and plaintext sensitivity, and enough resistance against various common attacks.