Journal
COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION
Volume 19, Issue 12, Pages 4094-4104Publisher
ELSEVIER
DOI: 10.1016/j.cnsns.2014.04.012
Keywords
Encryption algorithm; Self-adaptive method; Permutation; Chaotic systems
Categories
Funding
- National Natural Science Foundation of China [11301091]
- Natural Science Foundation of Guangdong Ocean University of China [C13455]
- Foundation for Distinguished Young Talents in Higher Education of Guangdong Province of China [2013LYM0037]
Ask authors/readers for more resources
In this paper, an efficient self-adaptive model for chaotic image encryption algorithm is proposed. With the help of the classical structure of permutation-diffusion and double simple two-dimensional chaotic systems, an efficient and fast encryption algorithm is designed. However, different from most of the existing methods which are found insecure upon chosen-plaintext or known-plaintext attack in the process of permutation or diffusion, the keystream generated in both operations of our method is dependent on the plain-image. Therefore, different plain-images will have different keystreams in both processes even just only a bit is changed in the plain-image. This design can solve the problem of fixed chaotic sequence produced by the same initial conditions but for different images. Moreover, the operation speed is high because complex mathematical methods, such as Runge-Kutta method, of solving the high-dimensional partial differential equations are avoided. Numerical experiments show that the proposed self-adaptive method can well resist against chosen-plaintext and known-plaintext attacks, and has high security and efficiency. (C) 2014 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available