A New Approach for Image Encryption Based on Cyclic Rotations and Multiple Blockwise Diffusions Using Pomeau-Manneville and Sin Maps

Abstract

In this paper an efficient image encryption scheme based on cyclic rotations and multiple blockwise diffusions with two chaotic maps is proposed. A Sin map is used to generate round keys for the encryption/decryption process. A Pomeau-Manneville map is used to generate chaotic values for permutation, pixel value rotation and diffusion operations. The encryption scheme is composed of three stages: permutation, pixel value rotation and diffusion. The permutation stage performs four operations on the image: row shuffling, column shuffling, cyclic rotation of all the rows and cyclic rotation of all the columns. This stage reduces the correlation significantly among neighboring pixels. The second stage performs circular rotation of pixel values twice by scanning the image horizontally and vertically. The amount of rotation is based on M × N chaotic values. The last stage performs the diffusion four times by scanning the image in four different ways: block of 8 × 8 pixels, block of 16 × 16 pixels, principal diagonally, and secondary diagonally. Each of the above four diffusions performs the diffusion in two directions (forwards and backwards) with two previously diffused pixels and two chaotic values. This stage makes the scheme resistant to differential attacks. The security and performance of the proposed method is analyzed systematically by using the key space, entropy, statistical, differential and performance analysis. The experimental results confirm that the proposed method is computationally efficient with high security.

Key Schedule Algorithm using 3-Dimensional Hybrid Cubes for Block Cipher

“…Permutation plays an important role in the development of cryptographic algorithms and it contains the finite set of numbers or symbols that are used to mix up a readable message into ciphertext as shown in transposition cipher [10]. The logic behind any cryptographic algorithm is the number of possible combinations in the key space, and bigger key-space could be achieved from the used of flips and twists of the elements of the cube which ensure every state of the cube is actually permuted [11], [12]. An image permutation algorithm based on the geometrical projection and shuffling in the design of key schedule algorithm is used to increases the security of original image by preventing it from outside attacks [13], [14].…”

A new color image encryption algorithm based on iterative mixing of color channels and chaos

“…Recently, several chaos-based articles have been proffered [4][5]. Unfortunately, the one-dimensional logistic map has been widely used in several cryptosystems based on chaos [6][7]. Nev-ertheless, this map has some disadvantages when it is used in cryptography such as not uniform distribution, small space key, chaotic discontinuous ranges, and periodicity in chaotic ranges [8].…”