Abstract

We propose a new chaotic map combined with delay and cascade, called tent delay-sine cascade with logistic map (TDSCL). Compared with the original one-dimensional simple map, the proposed map has increased initial value sensitivity and internal randomness and a larger chaotic parameter interval. The chaotic sequence generated by TDSCL has pseudo-randomness and is suitable for image encryption. Based on this chaotic map, we propose an image encryption algorithm with a symmetric structure, which can achieve confusion and diffusion at the same time. Simulation results show that after encryption using the proposed algorithm, the entropy of the cipher is extremely close to the ideal value of eight, and the correlation coefficients between the pixels are lower than 0.01, thus the algorithm can resist statistical attacks. Moreover, the number of pixel change rate (NPCR) and the unified average changing intensity (UACI) of the proposed algorithm are very close to the ideal value, which indicates that it can efficiently resist chosen-plain text attack.

Highlights

  • With the development of information technologies, data security has aroused wide public concern.As an important data format, images occupy a large proportion of network data

  • To verify the feasibility of the encryption algorithm proposed in this paper, some pictures were used for testing

  • We constructed a new chaotic map, named tent delay-sine cascade with logistic map (TDSCL), which combines the delay tent map with the sine map, which is cascaded with the logistic map

Read more

Summary

Introduction

With the development of information technologies, data security has aroused wide public concern. Many chaotic image encryption algorithms have been proposed [1,2,3,4,5,6,7,8,9,10] due to the excellent properties of chaotic maps, such as initial value sensitivity and intrinsic randomness. This paper proposes a new framework that combines the cascade model and delay This framework rationally integrates three chaotic maps to overcome the performance flaws of one-dimensional (1D) chaotic maps [16]. Based on the proposed chaotic map, we constructed a new image encryption algorithm. A new simultaneous confusion and diffusion algorithm is proposed, which is applied in the vertical and horizontal directions based on an XOR operation.

Chaotic Map
The Structure of Chaotic Maps
Chaotic Trajectory
Lyapunov Exponent
Permutation Entropy
Image Encryption Algorithm
Simultaneous Horizontal Confusion and Diffusion
Simultaneous Vertical Confusion and Diffusion
Simulation Results
Secret Key Space
Correlation Coefficient Analysis
Histogram Analysis
Key Sensitivity Test
Resistance Against Chosen-plain Text Attack
Information Entropy
Comparison with Other Methods
Encryption Efficiency Analysis
Conclusions
Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.