Cryptanalysis and Improvement of a Chaotic Map-Based Image Encryption System Using Both Plaintext Related Permutation and Diffusion

Lin, Chia–Yi; Wu, Ja-Ling

doi:10.3390/e22050589

Cited by 23 publications

(12 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…But we have used this optimization algorithm on the image, which is more applicable. Method [33] uses a more advanced personal computer (PC) than us that is configured with Intel Core i7, 3.2 GHz processor, and 32 GB RAM. Hence, it takes less time to execute.…”

Section: Comparison With Existing State-of-the-art Methodsmentioning

confidence: 99%

See 1 more Smart Citation

Chaotic Lightweight Cryptosystem for Image Encryption

Ferdush¹,

Begum

Uddin

2021

Advances in Multimedia

View full text Add to dashboard Cite

Data transmission over the Internet and the personal network has been risen day by day due to the advancement of multimedia technology. Hence, it is today’s prime concern to protect the data from unauthorized access and encrypt the multimedia element as they are stored on the web servers and transmitted over the networks. Therefore, multimedia data encryption is essential. But, the multimedia encryption algorithm is complex to implement as it requires more time and memory space. For this reason, the lightweight image encryption algorithm gains popularity that requires less memory and less time along with low power or energy and provides supreme security for limited devices. In this study, we have studied the chaotic-based lightweight image encryption method. At first, we have presented a standard framework and algorithm based on two chaotic maps such as Arnold and logistic for lightweight image encryption and performed some experiments. We have analyzed different groups of images such as miscellaneous, medical, underwater, and texture. Experimentations have provided the largest entropy 7.9920 for medical image (chest X-ray), large key space 2m×m×8, and average encryption and decryption times are 3.9771 s and 3.1447 s, respectively. Besides, we have found an equal distribution of pixels and less correlation coefficients among adjacent pixels of the encrypted image. These criteria indicate an efficient image encryption method. Also, our method is efficient and less complex than the existing state-of-the-art methods.

show abstract

Section: Comparison With Existing State-of-the-art Methodsmentioning

confidence: 99%

“…For resisting KPA and differential attacks, the sensitivity of high key and high plaintext is essential. An improved algorithm was designed by Lin and Wu [33] for analyzing the existing cryptographic methods based on chaotic maps and resisting the CPA. Here, the plaintext image is dependent on image encryption.…”

Section: Literature Studymentioning

confidence: 99%

Chaotic Lightweight Cryptosystem for Image Encryption

Ferdush¹,

Begum

Uddin

2021

Advances in Multimedia

View full text Add to dashboard Cite

show abstract

“…With the improvement of cryptanalysis and design level, it is becoming increasingly difficult to decipher encryption algorithms. However, some algorithms are insecure against various common cryptanalysis methods [ 20 , 21 , 22 , 23 , 24 , 25 , 26 ]. Huang et al [ 20 ] presented a simple color image encryption algorithm, in which the permutation process and diffusion process are all related to plaintext.…”

Section: Introductionmentioning

confidence: 99%

“…The authors claimed that the algorithm could resist chosen- or known-plaintext attacks efficiently. However, in 2020, Lin et al [ 21 ] found that Huang et al’s algorithm [ 20 ] could not resist chosen-plaintext attacks and they proposed an enhanced algorithm to overcome the flaw. Diab and El-semary [ 22 ] broke an image encryption algorithm presented by Chen et al [ 23 ].…”

Section: Introductionmentioning

confidence: 99%

Security Analysis and Improvement of an Image Encryption Cryptosystem Based on Bit Plane Extraction and Multi Chaos

Zhu

2021

Entropy

View full text Add to dashboard Cite

This paper analyzes the security of image encryption systems based on bit plane extraction and multi chaos. It includes a bit-level permutation for high, 4-bit planes and bit-wise XOR diffusion, and finds that the key streams in the permutation and diffusion phases are independent of the plaintext image. Therefore, the equivalent diffusion key and the equivalent permutation key can be recovered by the chosen-plaintext attack method, in which only two special plaintext images and their corresponding cipher images are used. The effectiveness and feasibility of the proposed attack algorithm is verified by a MATLAB 2015b simulation. In the experiment, all the key streams in the original algorithm are cracked through two special plaintext images and their corresponding ciphertext images. In addition, an improved algorithm is proposed. In the improved algorithm, the generation of a random sequence is related to ciphertext, which makes the encryption algorithm have the encryption effect of a “one time pad”. The encryption effect of the improved algorithm is better than that of the original encryption algorithm in the aspects of information entropy, ciphertext correlation analysis and ciphertext sensitivity analysis.

show abstract

“…Chaotic systems have long been a subject of concern in academic and industrial fields [ 1 , 2 ]. Due to the advantages of the ergodicity, unpredictability, pseudo-randomness and initial value sensitivity [ 3 , 4 ], chaotic systems fit well to various chaos-based image encryptions [ 5 , 6 ] and secure communications [ 7 ].…”

Section: Introductionmentioning

confidence: 99%

Coexisting Infinite Orbits in an Area-Preserving Lozi Map

Chen

et al. 2020

Entropy

View full text Add to dashboard Cite

Extreme multistability with coexisting infinite orbits has been reported in many continuous memristor-based dynamical circuits and systems, but rarely in discrete dynamical systems. This paper reports the finding of initial values-related coexisting infinite orbits in an area-preserving Lozi map under specific parameter settings. We use the bifurcation diagram and phase orbit diagram to disclose the coexisting infinite orbits that include period, quasi-period and chaos with different types and topologies, and we employ the spectral entropy and sample entropy to depict the initial values-related complexity. Finally, a microprocessor-based hardware platform is developed to acquire four sets of four-channel voltage sequences by switching the initial values. The results show that the area-preserving Lozi map displays coexisting infinite orbits with complicated complexity distributions, which heavily rely on its initial values.

show abstract

Cryptanalysis and Improvement of a Chaotic Map-Based Image Encryption System Using Both Plaintext Related Permutation and Diffusion

Cited by 23 publications

References 23 publications

Chaotic Lightweight Cryptosystem for Image Encryption

Chaotic Lightweight Cryptosystem for Image Encryption

Security Analysis and Improvement of an Image Encryption Cryptosystem Based on Bit Plane Extraction and Multi Chaos

Coexisting Infinite Orbits in an Area-Preserving Lozi Map

Contact Info

Product

Resources

About