A new compound mode of confusion and diffusion for block encryption of image based on chaos

“…In image encryption, differential attack can be mainly analyzed by two common measures known as NPCR and UACI [39,40]. Let C(i, j) and C 0 ði; jÞ represents ciphertext image prior and after one pixel change in plaintext image, respectively.…”

Section: Differential Attack Analysismentioning

confidence: 99%

A compression sensing and noise-tolerant image encryption scheme based on chaotic maps and orthogonal matrices

Ahmad

Khan

Hwang

et al. 2016

Neural Comput & Applic

View full text Add to dashboard Cite

With the evolution of technologies, the size of an image data has been significantly increased. However, traditional image encryption schemes cannot handle the emerging problems in big data such as noise toleration and compression. In order to meet today's challenges, we propose a new image encryption scheme based on chaotic maps and orthogonal matrices. The main core of the proposed scheme is based on the interesting properties of an orthogonal matrix. To obtain a random orthogonal matrix via the Gram Schmidt algorithm, a well-known nonlinear chaotic map is used in the proposed scheme to diffuse pixels values of a plaintext image. In the process of blockwise random permutation, the logistic map is employed followed by the diffusion process. The experimental results and security analyses such as key space, differential and statistical attacks show that the proposed scheme is secure enough and robust against channel noise and JPEG compression. In addition to complete encryption for higher security, it also supports partial encryption for faster processing as well.

show abstract

“…From the second row until the last row of matrix P h i,j , do the same column transformation in the same way as the second step, thus a new image total shuffling matrix P hl i,j is given, and if N and M are not very big, the algorithm has lower time complexity, which can be summarized in Table 1. In the proposed encryption scheme, the Lorenz chaotic system is one that is employed in key scheming, which is modeled by Beldhouche and Qidwai [19].…”

Section: Generation Of Image Total Shuffling Matrixmentioning

confidence: 99%

A new image encryption method: parallel sub-image encryption with hyper chaos

2011

View full text Add to dashboard Cite

A new image encryption scheme, based on a total shuffling and parallel encryption algorithm is proposed in this paper. Two chaotic systems have been used in the encryption algorithm to confuse the relationship between the plain-image and the cipherimage. To make the encryption procedure more confusing and complex, the plain-image is first divided into 4 sub-images and then the position of each subimage is changed pseudo-randomly according to a logistic map. Next, a total shuffling matrix is used to shuffle the position of pixels in the whole image and then sub-images are encrypted simultaneously in a parallel manner. The experimental results on USC data base demonstrate that the proposed encryption algorithm has a low time complexity and has the advantages of large key space and high security. Moreover, the robustness of this locally encryption method is much more in contrast with other encryption schemes and the distribution of gray values has a random-like behavior in the encrypted image.

show abstract

A new compound mode of confusion and diffusion for block encryption of image based on chaos

Cited by 92 publications

References 5 publications

A new color image encryption scheme based on DNA sequences and multiple improved 1D chaotic maps

A new color image encryption scheme based on DNA sequences and multiple improved 1D chaotic maps

A compression sensing and noise-tolerant image encryption scheme based on chaotic maps and orthogonal matrices

A new image encryption method: parallel sub-image encryption with hyper chaos

Contact Info

Product

Resources

About