A Novel Double-Image Encryption Algorithm Based on Rossler Hyperchaotic System and Compressive Sensing

Huang, Wei; Jiang, Donghua; An, Yisheng; Liu, Lidong; Wang, Xingyuan

doi:10.1109/access.2021.3065453

Cited by 43 publications

(24 citation statements)

References 50 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to the characteristics of the scrambling method, the above algorithms can be divided into two categories: one is that the size of the original image remains unchanged [1,[4][5][6][7][8][9][10][11][12][13][14]19,23,28,29], and the other is that the plaintext image is decomposed into another size for scrambling [15][16][17][18][20][21][22][24][25][26][27].…”

Section: Introduction 1research Backgroundmentioning

confidence: 99%

“…However, this exposed some problems, such as a fixed step length and a too-long scrambling time. In recent years, many improved Josephus rings have been developed and used to pursue higher confusion effects [18,21,22]. In [18], Niu et al developed an improved Josephus ring scrambling algorithm with a dynamic step size, related to the pixel value of the plaintext.…”

Section: Introduction 1research Backgroundmentioning

confidence: 99%

See 1 more Smart Citation

A Novel and Fast Encryption System Based on Improved Josephus Scrambling and Chaotic Mapping

Guan

Huang

et al. 2022

Entropy

View full text Add to dashboard Cite

To address the shortcomings of weak confusion and high time complexity of the existing permutation algorithms, including the traditional Josephus ring permutation (TJRP), an improved Josephus ring-based permutation (IJRBP) algorithm is developed. The proposed IJRBP replaces the remove operation used in TJRP with the position exchange operation and employs random permutation steps instead of fixed steps, which can offer a better scrambling effect and a higher permutation efficiency, compared with various scrambling methods. Then, a new encryption algorithm based on the IJRBP and chaotic system is developed. In our scheme, the plaintext feature parameter, which is related to the plaintext and a random sequence generated by a chaotic system, is used as the shift step of the circular shift operation to generate the diffusion matrix, which means that a minor change in the source image will generate a totally different encrypted image. Such a strategy strikes a balance between plaintext sensitivity and ciphertext sensitivity to obtain the ability to resist chosen-plaintext attacks (CPAs) and the high robustness of resisting noise attacks and data loss. Simulation results demonstrate that the proposed image cryptosystem has the advantages of great encryption efficiency and the ability to resist various common attacks.

show abstract

Section: Introduction 1research Backgroundmentioning

confidence: 99%

Section: Introduction 1research Backgroundmentioning

confidence: 99%

A Novel and Fast Encryption System Based on Improved Josephus Scrambling and Chaotic Mapping

Guan

Huang

et al. 2022

Entropy

View full text Add to dashboard Cite

show abstract

“…In Ref. [24], [25], Huang et al, and Lidong et al, proposed double-image encryption and triple-image compression encryption algorithms based on chaotic system, S-boxes, compression, and interpolation. In Ref.…”

Section: Introductionmentioning

confidence: 99%

Multi-Images Encryption Scheme Based on 3D Chaotic Map and Substitution Box

et al. 2021

View full text Add to dashboard Cite

The protection of digital content is increasingly becoming a significant issue for researchers and engineers. In this context, nonlinear dynamic systems play a vital role in information security through their chaotic behavior and susceptibility to initial conditions. This research presents a 3D chaotic map-based symmetric algorithm for multiple images to improve encryption efficiency and encourage secure transmission. The proposed scheme comprises the following four modules: the combination (the images are combined into a single image by merging their color channels); the permutation (using the suggested 3D chaotic map); the S-box generation; and the substitution through the AES substitution method. The proposed algorithm's encryption strength was determined through Entropy, Correlation coefficient, NPCR, and UACI analyses, which were then compared to the past techniques. Furthermore, the proposed method is assessed in terms of its computation time. Results demonstrate that it is highly efficient and secure for real-time communication.

show abstract

“…This not only protects the security of information but saves bandwidth, time, and storage space. There are both one-dimensional (1D) [33][34][35][36] and two-dimensional (2D) compressed sensing [37], and encryption schemes for both single [33,38] and multiple images [39,40]. Chai et al [39] proposed a scheme to compress and encrypt two color images at the same time through parallel operations on their RGB components, which improves efficiency and enhances security.…”

Section: Introductionmentioning

confidence: 99%

“…Important data are extracted by a VQ compression algorithm, and the secondary data are compressed by a CS algorithm, so as to achieve higher compression efficiency. However, many encryption schemes are generated based on traditional compressed sensing theory, using one sampling rate for the whole image and a single measurement matrix to measure it, which is neither efficient nor safe enough [33][34][35][36]38,42]. Also, when the compression ratio is low, the reconstructed image after decryption has a poor visual effect.…”

Section: Introductionmentioning

confidence: 99%

Image Encryption Scheme Based on Multiscale Block Compressed Sensing and Markov Model

Shi

Wang

2021

Entropy

View full text Add to dashboard Cite

Many image encryption schemes based on compressed sensing have the problem of poor quality of decrypted images. To deal with this problem, this paper develops an image encryption scheme by multiscale block compressed sensing. The image is decomposed by a three-level wavelet transform, and the sampling rates of coefficient matrices at all levels are calculated according to multiscale block compressed sensing theory and the given compression ratio. The first round of permutation is performed on the internal elements of the coefficient matrices at all levels. Then the coefficient matrix is compressed and combined. The second round of permutation is performed on the combined matrix based on the state transition matrix. Independent diffusion and forward-backward diffusion between pixels are used to obtain the final cipher image. Different sampling rates are set by considering the difference of information between an image’s low- and high-frequency parts. So, the reconstruction quality of the decrypted image is better than that of other schemes, which set one sampling rate on an entire image. The proposed scheme takes full advantage of the randomness of the Markov model and shows an excellent encryption effect to resist various attacks.

show abstract

A Novel Double-Image Encryption Algorithm Based on Rossler Hyperchaotic System and Compressive Sensing

Cited by 43 publications

References 50 publications

A Novel and Fast Encryption System Based on Improved Josephus Scrambling and Chaotic Mapping

A Novel and Fast Encryption System Based on Improved Josephus Scrambling and Chaotic Mapping

Multi-Images Encryption Scheme Based on 3D Chaotic Map and Substitution Box

Image Encryption Scheme Based on Multiscale Block Compressed Sensing and Markov Model

Contact Info

Product

Resources

About