Abstract
Security of image communication is more and more important in many applications such as the transmission of military and medical images. To meet the requirement, a new color image encryption algorithm using a new one-dimension (1D) chaotic map was proposed recently, which can resist various attacks because the range of the new chaotic map is larger than that of the previous ones. In our study, the security of the new original method is analyzed and a novel attack method is proposed. It is demonstrated that the scheme is not secure under chosen-plaintext attack, by which the encrypted image can be successfully converted into the corresponding plaintext image without any error.
Highlights
Encryption of color image is a critical issue for confidentiality and security
Some cryptanalysis articles in [9,10,11,12,13,14] have verified the vulnerability of common chaotic encryption methods based on the permutation-diffusion structure
Cryptanalysis works have been correspondingly proposed in [17,18] to evaluate the security of image cryptosystems, which can improve the security of the existing cryptosystems
Summary
Encryption of color image is a critical issue for confidentiality and security. Lots of encryption methods [1,2,3,4,5,6,7,8] using chaotic maps have been proposed for the excellent properties such as ergodicity and sensitivity to initial condition and control parameters. Li et al attacked the chaotic image encryption algorithm based on information entropy in [18]. Ge et al in [23] found out the defect of the feedback image encryption algorithm with compound chaotic stream cipher based on perturbation and attacked the algorithm. In [32], an improved chaotic image encryption method using Latin square based on two rounds of permutation–diffusion. A bifurcation property of the chaotic map and the Lyapunov exponent,ofinthe addition to information and attacked its equivalent cryptographic scheme by chosen plaintext attack. A novel attack method to directly and attacked its equivalent cryptographic scheme by chosen plaintext attack. Xor and attacks permutation with attack a new method scheme which has in [39,40] using whichthe have high computation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have