Abstract
In recent years, experts and scholars in the field of information security have attached great importance to the security of image information. They have proposed many image encryption algorithms with higher security. In order to further improve the security level of image encryption algorithm, this paper proposes a new image encryption algorithm based on two-dimensional Lorenz and Logistic. The encryption test of several classic images proves that the algorithm has high security and strong robustness. This paper also analyzes the security of encryption algorithms, such as analysis of the histogram, entropy process of information, examination of correlation, differential attack, key sensitivity test, secret key space analysis, noise attacks, contrast analysis. By comparing the image encryption algorithm proposed in this paper with some existing image encryption algorithms, the encryption algorithm has the characteristics of large secret key space, sensitivity to the key, small correlation coefficient and high contrast. In addition, the encryption algorithm is used. It can also resist noise attacks.
Highlights
With the increasing demand for multimedia information technology, The security of multimedia is concerned by us
Image multimedia contains a lot of information, and the image is open in the process of communication, The security of image information will be threatened in the process of transmission, especially in the low security channel
The traditional encryption algorithm is less efficient when applied to the system that encrypts a large number of pictures or encrypts video
Summary
With the increasing demand for multimedia information technology, The security of multimedia is concerned by us. In [9], the author proposes a bit-level encryption system based on one-dimensional chaos theory, which converts the pixel values of images into binary, and uses a Logistic map to generate chaotic sequences to scramble and encrypt them. [24] proposed an image encryption algorithm based on DNA random coding and Lorenz chaotic mapping. Step 2: Convert the pixel value of PGray from decimal to binary representation, that is, PGrayBin. Step 3: Use Logistic to generate two sets of chaotic sequences XH and XV, XH = {XH1, XH2, XH3, . E is the encrypted image.Step 2: generating two sets of chaotic sequences using two-dimensional Lorenz, and performing serial XOR with the result of step one; Ei1,j1 Ei1,j2 .
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
