### Abstract

Recently, an image scrambling encryption algorithm which makes use of one-dimensional chaos system for shuffling the pixel bits was proposed in [G.-D. Ye, Pattern Recognition Lett. 31(2010) 347-354]. Through the scrambling algorithm, the pixel locations and values can be encrypted at the same time. This scheme can be thought of as a typical binary image scrambling encryption considering the bit-plain of size (formula presented). In [Li C.Q., Lo K. T., http://arxiv.org/PS_cache/arxiv/pdf/0912/0912.1918v2.pdf], Li et al. proposed an attack using more than ⌈log _{2}(formula presented)⌉ many known-plaintext images to recover the original plain image with the noise of size M ×N. The same principle is also suitable for the chosen-plaintext attack which can obtain the exact plain image. In the current paper, a simple attack on the original scheme is presented by applying chosen-plaintext images. Using our attack, the encryption vectors (formula presented) and (formula presented) and the decryption vectors TM′ and TN′ can be recovered completely. The experimental simulations on two standard images of size 128 ×128 and 256 ×256 justify our analysis. It is shown that the recovered images are identical with the corresponding original images. For both the original images, the number of chosen-plaintext images required in our scheme is 9, where as to do the same using the scheme proposed in Li et al.’ attack, at least 17 and 19 chosen-plaintext images there will be required respectively. Moreover, the some method can be also used for chosen-ciphertext attack which reveals the decryption vectors TM′ and TN′ directly. Note that our attacks are also successful under iteration system which is remarked in the conclusions.

Original language | English |
---|---|

Title of host publication | Digital Watermarking - 9th International Workshop, IWDW 2010, Revised Selected Papers |

Editors | Hyoung-Joong Kim, Yun Qing Shi, Mauro Barni |

Publisher | Springer Verlag |

Pages | 45-59 |

Number of pages | 15 |

ISBN (Print) | 9783642184048 |

DOIs | |

Publication status | Published - Jan 1 2011 |

Event | 9th International Workshop on Digital Watermarking, IWDW 2010 - Seoul, Korea, Republic of Duration: Oct 1 2010 → Oct 3 2010 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 6526 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 9th International Workshop on Digital Watermarking, IWDW 2010 |
---|---|

Country | Korea, Republic of |

City | Seoul |

Period | 10/1/10 → 10/3/10 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Digital Watermarking - 9th International Workshop, IWDW 2010, Revised Selected Papers*(pp. 45-59). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6526 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-18405-5_5

**Cryptanalysis on an Image Scrambling Encryption Scheme Based on Pixel Bit.** / Zhao, Liang; Adhikari, Avishek; Xiao, Di; Sakurai, Kouichi.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Digital Watermarking - 9th International Workshop, IWDW 2010, Revised Selected Papers.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6526 LNCS, Springer Verlag, pp. 45-59, 9th International Workshop on Digital Watermarking, IWDW 2010, Seoul, Korea, Republic of, 10/1/10. https://doi.org/10.1007/978-3-642-18405-5_5

}

TY - GEN

T1 - Cryptanalysis on an Image Scrambling Encryption Scheme Based on Pixel Bit

AU - Zhao, Liang

AU - Adhikari, Avishek

AU - Xiao, Di

AU - Sakurai, Kouichi

PY - 2011/1/1

Y1 - 2011/1/1

N2 - Recently, an image scrambling encryption algorithm which makes use of one-dimensional chaos system for shuffling the pixel bits was proposed in [G.-D. Ye, Pattern Recognition Lett. 31(2010) 347-354]. Through the scrambling algorithm, the pixel locations and values can be encrypted at the same time. This scheme can be thought of as a typical binary image scrambling encryption considering the bit-plain of size (formula presented). In [Li C.Q., Lo K. T., http://arxiv.org/PS_cache/arxiv/pdf/0912/0912.1918v2.pdf], Li et al. proposed an attack using more than ⌈log 2(formula presented)⌉ many known-plaintext images to recover the original plain image with the noise of size M ×N. The same principle is also suitable for the chosen-plaintext attack which can obtain the exact plain image. In the current paper, a simple attack on the original scheme is presented by applying chosen-plaintext images. Using our attack, the encryption vectors (formula presented) and (formula presented) and the decryption vectors TM′ and TN′ can be recovered completely. The experimental simulations on two standard images of size 128 ×128 and 256 ×256 justify our analysis. It is shown that the recovered images are identical with the corresponding original images. For both the original images, the number of chosen-plaintext images required in our scheme is 9, where as to do the same using the scheme proposed in Li et al.’ attack, at least 17 and 19 chosen-plaintext images there will be required respectively. Moreover, the some method can be also used for chosen-ciphertext attack which reveals the decryption vectors TM′ and TN′ directly. Note that our attacks are also successful under iteration system which is remarked in the conclusions.

AB - Recently, an image scrambling encryption algorithm which makes use of one-dimensional chaos system for shuffling the pixel bits was proposed in [G.-D. Ye, Pattern Recognition Lett. 31(2010) 347-354]. Through the scrambling algorithm, the pixel locations and values can be encrypted at the same time. This scheme can be thought of as a typical binary image scrambling encryption considering the bit-plain of size (formula presented). In [Li C.Q., Lo K. T., http://arxiv.org/PS_cache/arxiv/pdf/0912/0912.1918v2.pdf], Li et al. proposed an attack using more than ⌈log 2(formula presented)⌉ many known-plaintext images to recover the original plain image with the noise of size M ×N. The same principle is also suitable for the chosen-plaintext attack which can obtain the exact plain image. In the current paper, a simple attack on the original scheme is presented by applying chosen-plaintext images. Using our attack, the encryption vectors (formula presented) and (formula presented) and the decryption vectors TM′ and TN′ can be recovered completely. The experimental simulations on two standard images of size 128 ×128 and 256 ×256 justify our analysis. It is shown that the recovered images are identical with the corresponding original images. For both the original images, the number of chosen-plaintext images required in our scheme is 9, where as to do the same using the scheme proposed in Li et al.’ attack, at least 17 and 19 chosen-plaintext images there will be required respectively. Moreover, the some method can be also used for chosen-ciphertext attack which reveals the decryption vectors TM′ and TN′ directly. Note that our attacks are also successful under iteration system which is remarked in the conclusions.

UR - http://www.scopus.com/inward/record.url?scp=85036655885&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85036655885&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-18405-5_5

DO - 10.1007/978-3-642-18405-5_5

M3 - Conference contribution

AN - SCOPUS:85036655885

SN - 9783642184048

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 45

EP - 59

BT - Digital Watermarking - 9th International Workshop, IWDW 2010, Revised Selected Papers

A2 - Kim, Hyoung-Joong

A2 - Shi, Yun Qing

A2 - Barni, Mauro

PB - Springer Verlag

ER -