A Secure and Fast Image Encryption Scheme Based on Double Chaotic S-Boxes

Abstract

In order to improve the security and efficiency of image encryption systems comprehensively, a novel chaotic S-box based image encryption scheme is proposed. Firstly, a new compound chaotic system, Sine-Tent map, is proposed to widen the chaotic range and improve the chaotic performance of 1D discrete chaotic maps. As a result, the new compound chaotic system is more suitable for cryptosystem. Secondly, an efficient and simple method for generating S-boxes is proposed, which can greatly improve the efficiency of S-box production. Thirdly, a novel double S-box based image encryption algorithm is proposed. By introducing equivalent key sequences {r, t} related with image ciphertext, the proposed cryptosystem can resist the four classical types of attacks, which is an advantage over other S-box based encryption schemes. Furthermore, it enhanced the resistance of the system to differential analysis attack by two rounds of forward and backward confusion-diffusion operation with double S-boxes. The simulation results and security analysis verify the effectiveness of the proposed scheme. The new scheme has obvious efficiency advantages, which means that it has better application potential in real-time image encryption.Entropy 2019, 21, 790 2 of 20 (or shuffling, scrambling) process plays a role in confusing the relationship between the cipher image and plain image. The function of the diffusion process is to spread the change of one pixel value in the plain image to the whole range of the cipher image. Based on the basic confusion-diffusion architecture, researchers have proposed many novel concrete encryption strategies. In Ref. [18][19][20][21][22][23][24], authors proposed some different permutation strategies for image scrambling aiming at the confusion process. In Ref. [22,[25][26][27][28][29], authors put forward some novel image diffusion algorithm. In Ref. [30][31][32][33][34][35][36], authors adopt new chaotic systems to improve the complexity and randomness of chaotic key streams. Some other cryptographic methods have also been tried by many researchers. For example, some cryptographic algorithms are based on bit-level permutation and diffusion [30], and some algorithms introduce the DNA coding mechanism [37], and some algorithms mainly use S-box to encrypt images [38][39][40]. However, some image encryption schemes exist as obvious security vulnerabilities. Thus, these image encryption schemes cannot resist some attacks, such as the chosen/known plaintext. In addition, some image encryption algorithms are inefficient, such as using bit-level image scrambling, DNA encoding mechanism, key related to plaintext Hash value [41,42], and the high-dimensional chaotic system [43,44]. Encryption algorithms with low efficiency are not suitable for some resource-constrained environments, such as mobile social network [45], sensor network communication environment [46] and searchable encryption [47]. Compared with high-dimensional continuous-time chaotic systems, low-dimensional discrete chaotic systems can generate chaot...

A Multidimensional Hyperjerk Oscillator: Dynamics Analysis, Analogue and Embedded Systems Implementation, and Its Application as a Cryptosystem

“…An image histogram is the representation of each pixel in the image with respect to its intensity value [55][56][57]. This analysis is very useful in deciding the statistical strength of an encryption algorithm.…”

“…An efficient and robust encryption algorithm must show sensitivity to even the slightest changes in the composition of its secret key [38][39][40][41][55][56][57]. This is especially important in resisting brute force attacks.…”

“…Further, Table 8 provides the time analysis for our scheme based on the specs outlined in comparison with results from similar techniques as reported. In addition to encryption time tests, we also undertook a complexity analysis [56] as outlined here. For uniformity and level playing ground, this analysis is done in terms of CPU operations required to execute the different methods.…”

“…A well-designed image encryption approach should have a sufficiently large key-space which is known as the several keys that can be used in brute-force attacks [38][39][40][41][55][56][57]. For our proposed technique, the image encryption algorithm utilizes the key parameters (a,b,y,x1,x2,x3,x4,x5) to generate the encryption key K. For context, suppose that the calculation precision (floating point operations) for each key is 10 16 , then the total key space of whole system is 10 128 , which is within thresholds expected from state-of-the-art encryption algorithms.…”

A Novel S-Box Design Algorithm Based on a New Compound Chaotic System

“…S boxes that are 8 × 8 are the most commonly used type of S-Box, especially widely used in An n × n S-Box is a number set of {0, 1, 2, ..., 2 n − 1}, which is represented by a 2 n/2 × 2 n/2 matrix Sb. S boxes that are 8 × 8 are the most commonly used type of S-Box, especially widely used in digital image encryption system [42]. In this paper, we focused on the design algorithm of an 8 × 8 S-Box.…”