Cryptanalysis and enhancements of image encryption using combination of the 1D chaotic map

Color image encryption has enticed a lot of attention in recent years. Many authors proposed a chaotic system-based encryption algorithms for that purpose. However, due to the shortcomings of the low dimensional chaotic systems, similar rule structure for RGB channels, and the small keyspace, many of those were cryptanalyzed by chosen-plaintext or other well-known attacks. A Security vulnerability exists because of the same method being applied over the RGB channels. This paper aims to introduce a new three-channel three rules (3C3R) image encryption algorithm along with two novel mathematical models for DNA rule generator and bit inversion. A different rule structure was applied in the different RGB-channels. In the R-channel, a novel Block-based Bit Inversion (BBI) is introduced, in the G-channel Von-Neumann (VN) and Rotated Von-Neumann (RVN)- based 2D-cellular structure is applied. In the B-channel, a novel bidirectional State Machine-based DNA rule generator (SM-DNA) is introduced. Simulations and results show that the proposed 3C3R encryption algorithm is robust against all well-known attacks particularly for the known-plaintext attacks, statistical attacks, brute-force attacks, differential attacks, and occlusion attacks, etc. Also, unlike earlier encryption algorithms, the 3C3R has no security vulnerability.

show abstract

“…[62] and Ref. [49]. This proved that the 3C3R has better security in comparison to those algorithms.…”

Section: Histogram Analysismentioning

confidence: 71%

3C3R, an Image Encryption Algorithm Based on BBI, 2D-CA, and SM-DNA

Khan

Han

Mudassir

et al. 2019

Entropy

View full text Add to dashboard Cite

show abstract

“…Ignoring the fact that permutation and modulo addition are not commutative, Wang et al simplifies Pak's scheme by cascading two non-neighbouring permutations together and break it with a chosen-plaintext attack in [16]. The enhanced version of Pak's scheme suggested in [16] is found still vulnerable against chosenplaintext attack [17]. Assuming a parameter seed is known, the parameter determining the shift permutation of Pak's scheme is disclosed in [18] by its internal properties.…”

Section: Cryptanalysis Of Single Round Ptdwosmentioning

confidence: 99%

“…Then, Pak's scheme is degenerated into the version analyzed in [16]. Based on the preliminary cryptanalysis works given in [16] and [18], both the equivalent secret-key of Pak's scheme and all its unknown parameters are recovered by a little more pairs of chosen plain-image and the corresponding cipher-image in [19]. In [119], Zhu et al propose a chosen-plaintext attack on another one-round PTDWOS, where diffusion is implemented by modulo addition and XOR.…”

Section: Cryptanalysis Of Single Round Ptdwosmentioning

confidence: 99%

“…There are some papers focusing on designing S-box with chaotic maps [9,10,11,12]. In [6,13,14,15,16,17,18,19,20], the analyzed image encryption schemes are fixed to withstand the proposed attacking methods. Due to the seemingly similar properties of a chaotic system and a secure pseudo-random number generator (PRNG), a large number of image encryption schemes use various chaotic maps to generate PRNS, which is used to control combination of some basic encryption operations, e.g.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

When an attacker meets a cipher-image in 2018: A year in review

Zhang

Xie

2019

Journal of Information Security and Applications

148

121

View full text Add to dashboard Cite

This paper aims to review the encountered technical contradictions when an attacker meets the cipher-images encrypted by the image encryption schemes (algorithms) proposed in 2018 from the viewpoint of an image cryptanalyst. The most representative works among them are selected and classified according to their essential structures. Almost all image cryptanalysis works published in 2018 are surveyed due to their small number. The challenging problems on design and analysis of image encryption schemes are summarized to receive the attentions of both designers and attackers (cryptanalysts) of image encryption schemes, which may promote solving scenario-oriented image security problems with new technologies.

show abstract

“…In [32], the security analysis of a Latin square based image chaotic encryption algorithm proposed in [22] is given to find the security vulnerabilities both in the diffusion stage and in the scrambling stage through chosen text attack. In [33], the chosen plaintext attack is adopted for the safety performance assessment of a 1D combinatorial chaotic encryption algorithm proposed in [34]. In addition, in [35], the chosen plaintext attack is also utilized for analyzing the security of a bit cube-based image chaotic encryption algorithm proposed in [36].…”

Section: Introductionmentioning

confidence: 99%

On the Security of a Latin-Bit Cube-Based Image Chaotic Encryption Algorithm

Zhang

2019

Entropy

View full text Add to dashboard Cite

In this paper, the security analysis of an image chaotic encryption algorithm based on Latin cubes and bit cubes is given. The proposed algorithm adopts a first-scrambling-diffusion- second-scrambling three-stage encryption scheme. First, a finite field is constructed using chaotic sequences. Then, the Latin cubes are generated from finite field operation and used for image chaotic encryption. In addition, according to the statistical characteristics of the diffusion image in the diffusion stage, the algorithm also uses different Latin cube combinations to scramble the diffusion image for the second time. However, the generation of Latin cubes in this algorithm is independent of plain image, while, in the diffusion stage, when any one bit in the plain image changes, the corresponding number of bits in the cipher image follows the change with obvious regularity. Thus, the equivalent secret keys can be obtained by chosen plaintext attack. Theoretical analysis and experimental results indicate that only a maximum of 2 . 5 × w × h 3 + 6 plain images are needed to crack the cipher image with w × h resolution. The size of equivalent keys deciphered by the method proposed in this paper are much smaller than other general methods of cryptanalysis for similar encryption schemes.

show abstract

Cryptanalysis and enhancements of image encryption using combination of the 1D chaotic map

Cited by 175 publications

References 38 publications

3C3R, an Image Encryption Algorithm Based on BBI, 2D-CA, and SM-DNA

3C3R, an Image Encryption Algorithm Based on BBI, 2D-CA, and SM-DNA

When an attacker meets a cipher-image in 2018: A year in review

On the Security of a Latin-Bit Cube-Based Image Chaotic Encryption Algorithm

Contact Info

Product

Resources

About