An efficient approach for encrypting double color images into a visually meaningful cipher image using 2D compressive sensing

Chai, Xiuli; Wu, Haiyang; Gan, Zhihua; Han, Daojun; Zhang, Yushu; Chen, Yiran

doi:10.1016/j.ins.2020.10.007

Cited by 141 publications

(64 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, it is necessary to analyze the decrypted image quality. In this sub-section, the peak signal-to-noise ratio (PSNR) [50][51] will be used to quantitatively measure the quality of the decrypted image. Its mathematical expression is shown in Eq.…”

Section: G Decryption Quality Analysismentioning

confidence: 99%

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

Huang¹,

Jiang²,

An³

et al. 2021

IEEE Access

View full text Add to dashboard Cite

In this paper, a novel double-image compression-encryption algorithm is proposed by combining Rossler hyperchaos and compressive sensing. In the proposed scheme, the sparse matrixes obtained by performing two-dimensional discrete wavelet transform on two plain images are first scrambled and compressed by index confusion and compressive sensing. Next, the compressed matrixes are linearly quantized, and then variable step length Josephus confusion and bitwise exclusive-OR operation are performed on them. The final noise-like cipher image is generated by hiding half of the encrypted image into the alpha channel of the other half of encrypted image. In order to realize "One cipher image corresponds to one key", a novel key generation mechanism is designed. Finally, the simulation analyses indicate that the proposed double-image encryption scheme has high transmission efficiency. Meanwhile, the average local information entropy of the cipher image is about 0.902 and the decryption quality is as high as 30 dB.

show abstract

Section: G Decryption Quality Analysismentioning

confidence: 99%

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

Huang¹,

Jiang²,

An³

et al. 2021

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Among them, the E(x) and D(x) to represent the expectation and variance of the variable x respectively, cov(x, y) represents the covariance, and ρxy is the correlation coefficient of adjacent pixels. Randomly select 2000 pairs of pixels, and then use equation (16) to calculate the correlation of the original image and the cipher image of Lena adjacent pixels respectively. It can be seen from Table 6 that after encryption, the cipher image effectively reduces the correlation between adjacent pixels.From Figure 6 shows that the distribution of adjacent pixels in the original Lena image is highly concentrated, indicating that the original image of Lena is highly correlated.…”

Section: E Correlation Analysismentioning

confidence: 99%

“…CS theory can be regarded as a symmetric cryptosystem. Some scholars combine this theory with chaotic system and propose image encryption algorithm based on CS theory [16], [17]. Chai [18] proposed a color image compression and encryption scheme based on compressed sensing and double random encryption strategy.…”

Section: Introductionmentioning

confidence: 99%

Image Encryption Algorithm Based on Block Scrambling and Finite State Machine

Geng

Shida

et al. 2020

IEEE Access

View full text Add to dashboard Cite

“…In [4], the authors presented a color image algorithm based on an enhanced evolutionary algorithm and the matrix semitensor product. A double color image encryption algorithm is suggested via combining 2D compressive sensing with an embedding technique [5]. In [6], the authors presented an image encryption algorithm using 2-D compressive sensing with a multi-embedding strategy.…”

Section: Introductionmentioning

confidence: 99%

New Encryption Algorithm Using Bit-Level Permutation and Non-Invertible Chaotic Map

Karawia

Elmasry

2021

IEEE Access

View full text Add to dashboard Cite

The authors extend their appreciation to Deanship of scientific research at king khalid university for funding this work through general research project under grant number GRP/189/42.ABSTRACT Recently, a little research into image encryption has been used on chaotic economic maps. The current paper suggests a bit-level permutation and a non-invertible chaotic economic map to encrypt an image. Firstly, the secret key generation is linked to the plain image. So, the suggested algorithm may resist both known-plaintext and chosen-plaintext attacks. Then a bit-level permutation is performed for all the binary bits of the plain image's pixels, using the logistic map (permutation stage). It is used to improve the algorithm's security. Then pixel diffusion is applied using the 2D non-invertible chaotic economic map and bit-wise XOR operations. It is used to change the pixels' values and make them highly random. The results of the experiments and the security analyses show that the given image encryption algorithm is efficient with higher security. Some comparisons showed that the proposed algorithm outperformed many recent algorithms. Finally, the proposed algorithm may be able to withstand a variety of attacks.

show abstract

An efficient approach for encrypting double color images into a visually meaningful cipher image using 2D compressive sensing

Cited by 141 publications

References 39 publications

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

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

Image Encryption Algorithm Based on Block Scrambling and Finite State Machine

New Encryption Algorithm Using Bit-Level Permutation and Non-Invertible Chaotic Map

Contact Info

Product

Resources

About