Abstract

In these years, image encryption systems based on chaotic maps have received considerable attention from researchers. For the security of encryption algorithms, it is important to ensure that chaotic systems can produce high quality pseudo-random sequences. However, when a chaotic system that theoretically has good random performance is deployed in a limited precision platform, its random performance will deteriorate. We prove that even if the precision reaches 256-bit, the piecewise linear chaotic map still fails to achieve the desired random performance. Moreover, in the case of low precision, the cascade structure commonly used in mixed chaotic maps will aggravate the problem of random degeneration. To generate good pseudo-random numbers in low-precision platforms, we propose a positive integer random sequence generator, called 32-bit PL_PWLCM&LM, which comprises two 32-bit PL_PWLCMs and one 32-bit logistic map in parallel. In our proposed image encryption system, we adopt the permutation algorithm with four pixels as a permutation unit and the diffusion algorithm based on rows and columns. The security and performance analyses prove that the proposed scheme is a secure, robust, and fast image encryption algorithm. Source codes are shared on GitHub: https://github.com/cuclihao/Pic_Enc_V3.

Highlights

  • Because of rapid development of multimedia services, more and more images are generated on the Internet

  • Fridrich proposed a permutation–diffusion network (PDN) [3], which has been extensively used in image encryption algorithms based on various chaotic maps

  • PRELIMINARIES we introduce three chaotic maps, logistic map [4], [7], [16], [27], piecewise linear chaotic map (PWLCM) [28]–[31] and skew tent map (STM) [8], [29], [32], [33], all of which are widely used in image encryption

Read more

Summary

INTRODUCTION

Because of rapid development of multimedia services, more and more images are generated on the Internet. To solve the existing problems of insecurity and high consumption, a new sorting algorithm with four adjacent pixels as a permutation unit is proposed This algorithm reduces the number of pseudo-random numbers used for sorting and reduces the positions needed to be permuted; the algorithm can be more suitable for large image encryption. A robust image encryption algorithm is proposed, which uses 32-bit PL_PWLCM&LM as the pseudo-random number generator, four adjacent pixels as the permutation unit, and rows and columns as units of diffusion.

PRELIMINARIES
PROPOSED IMAGE ENCRYPTION SYSTEM
ENCRYPTION The encryption function has three inputs
ENCRYPTION OF COLOR IMAGE
Findings
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