Abstract
In this paper, an image encryption algorithm based on non-adjacent coupled map lattices is designed. Compared with coupled map lattices, non-adjacent coupled map lattices have few periodic windows in bifurcation, and larger parameter range in chaos dynamics. Combined with the proposed chaotic system, a new alternative encryption structure between permutation, diffusion and substitution is proposed to improve the security and encryption efficiency of the algorithm. In the diffusion process, multiplication operation in GF (257) and addition operation in GF (2 8 ) based on look-up table are adopted, which improves the encryption efficiency and enhances the permutation effect by choosing pixel value in Latin Square during the diffusion process. Moreover, based on the good cryptographic characteristics of the s-box, a dynamic s-box related to plaintext is constructed to substitute plaintext pixels. Experimental results and security analysis show that the proposed encryption scheme can resist all types of typical attacks and has good encryption effect.
Highlights
With the rapid development of Internet communication technology, more and more images are transmitted through the Internet
Special encryption schemes are proposed by combining with different technologies, such as chaotic system [1]–[4], cellular automata [5], DNA operation [6], CS [7], [8]
Zhang et al.: Efficient and Secure Image Encryption Algorithm Based on Non- Adjacent Coupled Maps diffusion effect, permutation and diffusion operations for the same pixel value are usually performed in multiple rounds, which will undoubtedly increase the complexity of the algorithm and reduce the encryption efficiency
Summary
With the rapid development of Internet communication technology, more and more images are transmitted through the Internet. H. Zhang et al.: Efficient and Secure Image Encryption Algorithm Based on Non- Adjacent Coupled Maps diffusion effect, permutation and diffusion operations for the same pixel value are usually performed in multiple rounds, which will undoubtedly increase the complexity of the algorithm and reduce the encryption efficiency. Based on the above problems, some scholars improve the plaintext sensitivity by combining the hash function with the initial value and parameters of the chaotic system [24]–[26], so that the permutation and diffusion operations can only be performed once on the overall image, and achieve efficient and secure encryption.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
