Abstract

With the development of network and multimedia technology, multimedia communication has attracted the attention of researchers. Image encryption has become an urgent need for secure multimedia communication. Compared with the traditional encryption system, encryption algorithms based on chaos are easier to implement, which makes them more suitable for large-scale data encryption. The calculation method of image encryption proposed in this paper is a combination of high-dimensional chaotic systems. This algorithm is mainly used for graph mapping and used the Lorenz system to expand and replace them one by one. Studies have shown that this calculation method causes mixed pixel values, good diffusion performance, and strong key performance with strong resistance. The pixel of the encrypted picture is distributed relatively random, and the characteristics of similar loudness are not relevant. It is proved through experiments that the above calculation methods have strong safety performance.

Highlights

  • With the development of science and technology and Internet technology, network digital communication has become more and more frequent, the security of digital image storage and transmission has become more and more important, and multimedia digital products have been widely used in all walks of life

  • In order to ensure that the dissemination and use of multimedia data information gradually expose many security problems, digital pictures are characterized by large data and high correlation between data. e traditional encryption method used for multimedia encryption in the past has the disadvantage of low efficiency [1]. e development of a new type of the chaotic system, which enables multimedia image encryption with high efficiency and high security performance, is a research boom in recent years. e high-dimensional chaotic algorithm is a new image encryption analysis algorithm that has gradually emerged in recent years [2]. is algorithm can be used for the processing and analysis of multimedia image data encryption

  • Many researchers have suggested an image scrambling encryption algorithm for chaotic systems. e previous multimedia image encryption calculation methods cannot solve the problem of key space. e structure of the unified high-dimensional chaotic system is simple, and it has the advantage of shorter time sequence, but the key capacity is smaller, and the resistance to exhaustive attack is weak. erefore, it is necessary to study the encryption calculation method of multimedia pictures on high-dimensional chaotic systems or even super-dimensional chaotic systems. It adopts the advantages of generalized mapping, Lorenz high-dimensional chaotic system, large output, and large key space. e multimedia image encryption method of high-order chaotic computing is studied in this paper

Read more

Summary

Introduction

With the development of science and technology and Internet technology, network digital communication has become more and more frequent, the security of digital image storage and transmission has become more and more important, and multimedia digital products have been widely used in all walks of life. In order to improve its security, high-dimensional chaotic algorithms are widely used in the field of image encryption. E development of a new type of the chaotic system, which enables multimedia image encryption with high efficiency and high security performance, is a research boom in recent years. E high-dimensional chaotic algorithm is a new image encryption analysis algorithm that has gradually emerged in recent years [2]. In literature [5], due to the Advances in Multimedia dispersiveness of the algorithm in the use process, a multimedia image data encryption analysis based on a priori information is proposed. Erefore, it is necessary to study the encryption calculation method of multimedia pictures on high-dimensional chaotic systems or even super-dimensional chaotic systems It adopts the advantages of generalized mapping, Lorenz high-dimensional chaotic system, large output, and large key space. It has strong resistance to exhaustive supply and system analysis attacks, with high computational efficiency and high security performance

Two-Dimensional Generalized Mapping and Image Scrambling
Three-Dimensional Unified Chaotic System and Image Replacement
Experimental Results and Analysis
Conclusions
Full Text
Published version (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