Image encryption algorithm using S-box and dynamic Hénon bit level permutation

Idrees, Bazgha; Zafar, Sohail; Rashid, Tabasam; Gao, Wei

doi:10.1007/s11042-019-08282-w

Cited by 54 publications

(28 citation statements)

References 54 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…. , 19), respectively. Moreover, in our numerical simulation experiments, 2D images with the size of 8N × M � 2048 × 256 resolution are adopted to represent 1D sequences B 〈q〉 (ℓ) and L 〈q〉 (ℓ), as shown in Figure 6.…”

Section: Breaking Results For Grayscale Images Using Chosen-plaintextmentioning

confidence: 97%

“…en, based on equations (19) and (20), one gets their corresponding 1D bit-plane decomposition sequences B (0) (ℓ)(ℓ � 1, 2, . .…”

Section: Breaking Results For Rgb Color Imagesmentioning

confidence: 99%

“…Because chaos is pseudo-random, ergodic, and highly sensitive to initial values and control parameters, these characteristics can achieve good confusion and diffusion effects and can meet the basic requirements of cryptography. erefore, many image encryption algorithms have been proposed based on the chaotic map in recent years [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20].…”

Section: Introductionmentioning

confidence: 99%

“…An image encryption algorithm utilizing the principles of the Josephus problem and the filtering technology is developed in [16]. Moreover, some typical image encryption algorithms based on the chaotic S-box are proposed in [17][18][19][20].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

On the Cryptanalysis of a Bit-Level Image Chaotic Encryption Algorithm

Zhang

2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

In this paper, the security analysis of a bit-level image chaotic encryption algorithm based on the 1D chaotic map is proposed. The original image chaotic encryption algorithm includes bit-level permutation encryption, diffusion encryption, and linear transform. Deciphering of it can be divided into two stages. First, bit-level permutation encryption, diffusion encryption, and linear transform can be simplified into bit-level equivalent permutation encryption and equivalent diffusion encryption, which is a key breakthrough point of cryptanalysis. Second, the chaotic sequence generated by this algorithm is independent of the plaintext image. Therefore, the equivalent diffusion key and the equivalent permutation key can be obtained by chosen-plaintext attack, respectively. Theoretical analysis and numerical simulation experiment results verify the effectiveness of the analytical method. Finally, some suggestions are proposed to promote the security of the original image chaotic encryption algorithm.

show abstract

Section: Breaking Results For Grayscale Images Using Chosen-plaintextmentioning

confidence: 97%

“…en, based on equations (19) and (20), one gets their corresponding 1D bit-plane decomposition sequences B (0) (ℓ)(ℓ � 1, 2, . .…”

Section: Breaking Results For Rgb Color Imagesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On the Cryptanalysis of a Bit-Level Image Chaotic Encryption Algorithm

Zhang

2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Similarly, the correlation coefficient of Baboon image using ICA algorithm is tabulated in Table 3. The proposed correlation coefficient of Baboon is 0.0021 which gives better result than the algorithm developed in the studies [27][28][29][30][31]. From Table 2 and Table 3, it is observed that the proposed encryption scheme has desired correlation property.…”

Section: Imagementioning

confidence: 88%

Image Encryption Based on Matrix Factorization

Khalane¹,

Suralkar²,

Bhadade³

2020

IJSSE

View full text Add to dashboard Cite

In this paper, we present a matrix decomposition-based approach for image cryptography. The proposed method consists of decomposing the image into different component and scrambling the components to form the image encryption technique. We use two different type of matrix decomposition techniques to check the efficiency of proposed encryption method. The decomposition techniques used are Independent component analysis (ICA) and Non-Negative Matrix factorization (NMF). The proposed technique has unique user defined parameters (key) such as decomposition method, number of decomposition components and order in which the components are arranged. The unique encryption technique is designed on the basis of these key parameters. The original image can be reconstructed at the decryption end only if the selected parameters are known to the user. The design examples for both decomposition approaches are presented for illustration purpose. We analyze the complexity and encryption time of cryptography system. Results prove that the proposed scheme is more secure as it has less correlation between the input image and the encrypted version of the same as compared to state-of-art methods. The computation time of the proposed approach is found to be comparable.

show abstract