TY - JOUR
T1 - On the security analysis of an image scrambling encryption of pixel bit and its improved scheme based on self-correlation encryption
AU - Zhao, Liang
AU - Adhikari, Avishek
AU - Xiao, Di
AU - Sakurai, Kouichi
N1 - Funding Information:
The authors thank the anonymous reviwer and the Editor Professor Yueheng Lan for their very constructive and helpful comments. This research, including the visit of Dr. Avishek Adhikari to Kyushu University, is supported by Strategic International Research Cooperative Programme on Multidisciplinary Research Field, which combines Information and Communications Technology with Other Fields Supported by Japan Science and Technology Agency (JST) and Department of Science and Technology of the Government of India. Moreover, this research is partially supported by the Postgraduate Technology Innovation Foundation of Chongqing University, China (Grant No. 200903A1B0010303 ), the Program for New Century Excellent Talents in University of China (Grant No. NCET-08-0603 ), and the first author of this research is supported by the governmental scholarship from China Scholarship Council.
PY - 2012/8
Y1 - 2012/8
N2 - An image scrambling encryption scheme for pixel bits was presented by Ye [Ye GD. Image scrambling encryption algorithm of pixel bit based on chaos map. Pattern Recognit Lett 2010;31:347-54], which can be seen as one kind of typical binary image scrambling encryption considering from the bit-plain of size M×(8N). However, recently, some defects existing in the original image encryption scheme, i.e., Ye's scheme, have been observed by Li and Lo [Li CQ, Lo KT. Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks. Signal Process 2011;91:949-54]. In the attack proposed by Li and Lo at least 3+⌈log 2(MN)⌉ plain images of size M×N are used to reveal the permutation matrix W=[w(i,k)] (i∈{1, 2,...,M};k∈{1,2,...,8N}) which can be applied to recover the exact plain image. In the current paper, at first, one type of special plain image/cipher image is used to analyze the security weakness of the original image scrambling scheme under study. The final encryption vectors TM and TN or the decryption vectors TM' and TN' are revealed completely according to our attack. To demonstrate the performance of our attack, a quantified comparison is drawn between our attack and the attack proposed by Li and Lo. Compared with Li and Lo's attack, our attack is more efficient in the general conditions. In particular, when the sizes of images satisfy the condition M=N or M≤8N, the number of the used plain images/cipher images is at most 9, which is sharply less than 3+⌈log 2(MN)⌉ when M and N are of large size. To overcome the weaknesses of the original scheme, in this paper, an improved image scrambling encryption scheme is proposed. In the improved scheme, the idea of the "self-correlation" method is used to resist the chosen-plaintext attack/known-plaintext attack. The corresponding simulations and analyses illustrate that the improved encryption method has good cryptographic properties, and can overcome the weakness of the original image encryption scheme. Finally, farther improvement is briefly presented for the future work.
AB - An image scrambling encryption scheme for pixel bits was presented by Ye [Ye GD. Image scrambling encryption algorithm of pixel bit based on chaos map. Pattern Recognit Lett 2010;31:347-54], which can be seen as one kind of typical binary image scrambling encryption considering from the bit-plain of size M×(8N). However, recently, some defects existing in the original image encryption scheme, i.e., Ye's scheme, have been observed by Li and Lo [Li CQ, Lo KT. Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks. Signal Process 2011;91:949-54]. In the attack proposed by Li and Lo at least 3+⌈log 2(MN)⌉ plain images of size M×N are used to reveal the permutation matrix W=[w(i,k)] (i∈{1, 2,...,M};k∈{1,2,...,8N}) which can be applied to recover the exact plain image. In the current paper, at first, one type of special plain image/cipher image is used to analyze the security weakness of the original image scrambling scheme under study. The final encryption vectors TM and TN or the decryption vectors TM' and TN' are revealed completely according to our attack. To demonstrate the performance of our attack, a quantified comparison is drawn between our attack and the attack proposed by Li and Lo. Compared with Li and Lo's attack, our attack is more efficient in the general conditions. In particular, when the sizes of images satisfy the condition M=N or M≤8N, the number of the used plain images/cipher images is at most 9, which is sharply less than 3+⌈log 2(MN)⌉ when M and N are of large size. To overcome the weaknesses of the original scheme, in this paper, an improved image scrambling encryption scheme is proposed. In the improved scheme, the idea of the "self-correlation" method is used to resist the chosen-plaintext attack/known-plaintext attack. The corresponding simulations and analyses illustrate that the improved encryption method has good cryptographic properties, and can overcome the weakness of the original image encryption scheme. Finally, farther improvement is briefly presented for the future work.
UR - http://www.scopus.com/inward/record.url?scp=84863392976&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84863392976&partnerID=8YFLogxK
U2 - 10.1016/j.cnsns.2011.12.015
DO - 10.1016/j.cnsns.2011.12.015
M3 - Article
AN - SCOPUS:84863392976
SN - 1007-5704
VL - 17
SP - 3303
EP - 3327
JO - Communications in Nonlinear Science and Numerical Simulation
JF - Communications in Nonlinear Science and Numerical Simulation
IS - 8
ER -