With rapid development and wide applications in digital technology, the security of digital images has attracted increasing attention. Applying the merits of chaos to protect image security is a promising research field. In order to achieve significant confusion and diffusion, a chaotic image encryption scheme typically includes two stages: the first stage is to permute all the pixels of an image as a whole by using a 344two-dimensional (2D) chaotic map, and the second stage is to change the entire pixel values of the permutated image sequentially. To the best of our knowledge, this scheme was first proposed by Fridrich (1998). Since then, a series of variants have been developed. For example, Guan et al. (2005) used a 2D Cat map in the substitution stage and a chaotic system in the diffusion stage. Lian et al. (2005) used a chaotic standard map for pixel position permutation and a quantized logistic map for pixel value masking. Chen et al. (2004) employed a three-dimensional Cat map for permuting the pixel position. Compared with the chaotic image encryption scheme, a novel scheme was developed by Huang and Nien (2009). Its novelty lies in the fact that the encrypted image is obtained only by vertical and horizontal pixel shuffling, while the shuffling parameters are generated by iterating four chaotic systems and sorting the chaotic sequences. However, Solak et al. (2010) pointed out a security problem of this scheme and attacked it using the chosen-plaintext/known-plaintext method.
|Original language||English (US)|
|Title of host publication||Multimedia Security|
|Subtitle of host publication||Watermarking, Steganography, and Forensics|
|Number of pages||13|
|State||Published - Jan 1 2017|
All Science Journal Classification (ASJC) codes
- Computer Science(all)