Abstract

As an essential part of an encryption system, the performance of a chaotic map is critical for system security. However, there are many defects for the existing chaotic maps. The low-dimension (LD) ones are easily predicted and are vulnerable to be attacked, while high-dimension (HD) ones have a low iteration speed. In this paper, a 2D multiple collapse chaotic map (2D-MCCM) was designed, which had a wide chaos interval, a high complexity, and a high iteration speed. Then, a new chaotic S-box was constructed based on 2D-MCCM, and a diffusion method was designed based on the S-box, which improved security and efficiency. Based on these, a new image encryption algorithm was proposed. Performance analysis showed that the encryption algorithm had high security to resist all kinds of attacks easily.

Highlights

  • IntroductionWith the rapid development of the network, image transmission through network has become more and more popular, contributing to higher risk of information leakage [1]

  • S-Box Design Based on 2D MultipleWith the rapid development of the network, image transmission through network has become more and more popular, contributing to higher risk of information leakage [1].the security of image transmission has become a research hotspot

  • To select the value in X according to Y and check whether the value already exists in the substitution box (S-box)

Read more

Summary

Introduction

With the rapid development of the network, image transmission through network has become more and more popular, contributing to higher risk of information leakage [1]. The security of image transmission has become a research hotspot. As a large amount of information can be carried by images, higher speed of encryption algorithm is required. The research of image encryption algorithm based on chaotic maps is mainly focused on the optimization algorithm structure and optimization of chaotic map. For the former one, common encryption algorithms consist of two steps: scrambling and diffusion

Methods
Results
Conclusion
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