Abstract
In order to meet the requirement of secure image communication in a resource-constrained network environment, a novel lightweight chaotic image encryption scheme based on permutation and diffusion has been proposed. It was claimed that this scheme can resist differential attacks, statistical attacks, etc. However, the original encryption scheme is found to be vulnerable and insecure to chosen-plaintext attack (CPA). In this paper, the original encryption scheme is analyzed comprehensively and attacked successfully. Only by choosing a full zero image as the chosen-plaintext of the diffusion phase, the encrypted image can be restored into permutation-only phase, and by applying the other chosen images as the chosen-plaintexts of the permutation phase, the map matrix which is equivalent to the secret key of the permutation phase can be further revealed. Experiments and analysis verify the feasibility of our proposed attack strategy.
Highlights
With the development of Internet and information technology, ever-increasing multimedia data is emerging in our daily lives
In the proposed cryptanalysis structure, the original diffusion phase can be cracked with only one full zero image, and the original permutation phase can be broken by dlog L ( M × N )e chosen-plaintext images
The original cryptosystem is based on permutation–diffusion structure, and its security merely relies on two permutation key matrices—X and Y—and an diffusion key R
Summary
With the development of Internet and information technology, ever-increasing multimedia data is emerging in our daily lives. Digital image carrying information in a visualized manner has become a widely used data format Many of these digital images in networks may be involved in personal privacy, military secrets, trade secrets, and even national security. 1D chaotic maps often have simple structures and low computational complexity; it is efficient and easy to generate pseudorandom sequence during image cryptography. They face some potential drawbacks like vulnerability and limited chaotic ranges [12,13]. We propose a feasible attack strategy that can completely break the original Permutation–Diffusion based image cryptosystem with high security and low computational overhead, which is especially applicable for secure image communication in the resource-constrained modern network environment.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
