.png){kind=icon}
.png){kind=icon}
Return
An efficient chaotic image encryption algorithm based on a generalized Arnold map
.png){kind=icon}
PRE
AI
DOI：10.1007/s11071-012-0409-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An efficient image encryption algorithm using the generalized Arnold map is proposed. The algorithm is composed of two stages, i.e., permutation and diffusion. First, a total circular function, rather than the traditional periodic position permutation, is used in the permutation stage. It can substantially reduce the correlation between adjacent pixels. Then, in the stage of diffusion, double diffusion functions, i.e., positive and opposite module, are utilized with a novel generation of the keystream. As the keystream depends on the processed image, the proposed method can resist known- and chosen-plaintext attacks. Experimental results and theoretical analysis indicate the effectiveness of our method. An extension of the proposed algorithm to other chaotic systems is also discussed.
Keywords:
Image encryption
Diffusion
Generalized Arnold map
Chaos
Journal
IF:
6
Papers:
1.4W
Citations:
4.1W