A novel image encryption based on row-column, masking and main diffusion processes with hyper chaos

Norouzi, Benyamin; Seyedzadeh, Seyed Mohammad; Mirzakuchaki, Sattar; Mosavi, Mohammad Reza

doi:10.1007/s11042-013-1699-y

Cited by 111 publications

(23 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Over the last decade, a variety of chaotic systems have been developed [9,10] for the construction of image cryptosystems, including and not limited to the 3D baker map [11], the 2D logistic map [12], the 3D cat map [13], the 2D standard map [14], the 3D LCA map [15], and the 2D henon map [16]. Moreover, some chaotic systems have been combined with other approaches for this purpose, such as DNA computing [17,18], one-time keys [19], cellular automata [20], and the perceptron model [21], which have been used for the specific objective of enhancing image cryptosystem security.…”

mentioning

confidence: 99%

Fast and Efficient Image Encryption Algorithm Based on Modular Addition and SPD

Butt

Khan

et al. 2020

Entropy

View full text Add to dashboard Cite

Bit-level and pixel-level methods are two classifications for image encryption, which describe the smallest processing elements manipulated in diffusion and permutation respectively. Most pixel-level permutation methods merely alter the positions of pixels, resulting in similar histograms for the original and permuted images. Bit-level permutation methods, however, have the ability to change the histogram of the image, but are usually not preferred due to their time-consuming nature, which is owed to bit-level computation, unlike that of other permutation techniques. In this paper, we introduce a new image encryption algorithm which uses binary bit-plane scrambling and an SPD diffusion technique for the bit-planes of a plain image, based on a card game trick. Integer values of the hexadecimal key SHA-512 are also used, along with the adaptive block-based modular addition of pixels to encrypt the images. To prove the first-rate encryption performance of our proposed algorithm, security analyses are provided in this paper. Simulations and other results confirmed the robustness of the proposed image encryption algorithm against many well-known attacks; in particular, brute-force attacks, known/chosen plain text attacks, occlusion attacks, differential attacks, and gray value difference attacks, among others.

show abstract

mentioning

confidence: 99%

Fast and Efficient Image Encryption Algorithm Based on Modular Addition and SPD

Butt

Khan

et al. 2020

Entropy

View full text Add to dashboard Cite

show abstract

“…High values is suitable for this evaluation parameter, because it indicates that the average difference between two encrypted images is large and the cryptographic method is resistant to differential attacks [40].…”

Section: Unified Average Changing Intensity (Uaci)mentioning

confidence: 99%

A novel multi-image cryptosystem based on weighted plain images and using combined chaotic maps

et al. 2021

View full text Add to dashboard Cite

This paper introduces a new multi-image cryptosystem based on modified Henon map and nonlinear combination of chaotic seed maps. Based on the degree of correlation between the adjacent pixels of the plain image, a unique weight is assigned to the plain image. First, the coordinates of plain images are disrupted by modified Henon map as confusion phase. In the first step of diffusion phase, the pixels content of images are changed separately by XOR operation between confused images and matrices with suitable nonlinear combination of seed maps sequences. These combination of seed maps are selected depending on the weight of plain images as well as bifurcation properties of mentioned chaotic maps. After concatenating the matrices obtained from the first step of diffusion phase, the bitwise XOR operation is applied between newly developed matrix and the other produced matrix from the chaotic sequences of the Logistic-Tent-Sine hybrid system, as second step of diffusion phase. The encrypted image is obtained after applying shift and exchange operations. The results of the implementation using graphs and histograms show that the proposed scheme, compared to some existing methods, can effectively resist common attacks and can be used as a secure method for encrypting digital images.

show abstract

“…The key space of an image encryption scheme, which can resist brute-force attacks, should be more than 100 2 in [59]. In this paper the secret keys of the proposed encryption algorithm mainly include:…”

Section: E Key Space Analysismentioning

confidence: 99%

An Image Encryption Algorithm Based on Compressive Sensing and M Sequence

Dou

2020

IEEE Access

View full text Add to dashboard Cite

A novel image encryption based on row-column, masking and main diffusion processes with hyper chaos

Cited by 111 publications

References 43 publications

Fast and Efficient Image Encryption Algorithm Based on Modular Addition and SPD

Fast and Efficient Image Encryption Algorithm Based on Modular Addition and SPD

A novel multi-image cryptosystem based on weighted plain images and using combined chaotic maps

An Image Encryption Algorithm Based on Compressive Sensing and M Sequence

Contact Info

Product

Resources

About