Abstract

Digital images can be large in size and contain sensitive information that needs protection. Compression using compressed sensing performs well, but the measurement matrix directly affects the signal compression and reconstruction performance. The good cryptographic characteristics of chaotic systems mean that using one to construct the measurement matrix has obvious advantages. However, existing low-dimensional chaotic systems have low complexity and generate sequences with poor randomness. Hence, a new six-dimensional non-degenerate discrete hyperchaotic system with six positive Lyapunov exponents is proposed in this paper. Using this chaotic system to design the measurement matrix can improve the performance of image compression and reconstruction. Because image encryption using compressed sensing cannot resist known- and chosen-plaintext attacks, the chaotic system proposed in this paper is introduced into the compressed sensing encryption framework. A scrambling algorithm and two-way diffusion algorithm for the plaintext are used to encrypt the measured value matrix. The security of the encryption system is further improved by generating the SHA-256 value of the original image to calculate the initial conditions of the chaotic map. A simulation and performance analysis shows that the proposed image compression-encryption scheme has high compression and reconstruction performance and the ability to resist known- and chosen-plaintext attacks.

Highlights

  • As a main carrier of information transmission and storage, the digital image is widely used in people’s lives and in many fields such as education, medical treatment, national defense, and environmental monitoring [1]

  • It is found that traditional ciphers, such as the data encryption standard (DES), international data encryption algorithm (IDEA) and advanced encryption standard (AES) are unfit for image encryption

  • To achieve higher compression ratio and increase the ability of the Compressed sensing (CS) framework to resist known- and chosen-plaintext attacks, this paper proposes a CS encryption scheme based on the new 6D non-degenerate discrete hyperchaotic system

Read more

Summary

Introduction

As a main carrier of information transmission and storage, the digital image is widely used in people’s lives and in many fields such as education, medical treatment, national defense, and environmental monitoring [1]. These image compression and encryption schemes use the whole measurement matrix as the key, which requires a large amount of storage space and is a serious waste of resources To solve this problem, some researchers use chaotic mapping to design measurement matrices [25,26,27,28,29]. Wang et al [31] proposed a scheme based on tensor CS (TCS) to simultaneously compress and encrypt 3D image sequences This algorithm uses a non-autonomous Lorenz system to control the generation of three measurement matrices of TCS. To achieve higher compression ratio and increase the ability of the CS framework to resist known- and chosen-plaintext attacks, this paper proposes a CS encryption scheme based on the new 6D non-degenerate discrete hyperchaotic system.

Six-Dimensional Non-Degenerate Discrete Hyperchaotic System
Approximate Entropy Analysis
NIST Test
CS and Arnold Scrambling
Arnold Scrambling
Image Encryption and Decryption Schemes
Key Generation
Construction and Optimization of the Chaotic Measurement Matrix
Construct measurement matrix Φ column-by-column using chaotic sequence
Image Sparsification and Sparse Coefficient Matrix Scrambling
Compression Sampling
Measurement Matrix Quantization
Generation of the Cryptographic Matrix
Forward Diffusion
Plaintext-Related Scrambling
Backward Diffusion
Diffuse the last column of matrix B from the bottom up as follows
Image Decompression and Decryption Process
Simulation and Performance Analysis
Simulation
Reconstructed
Correlation Analysis
Histogram Analysis image histogram
Histograms
Information
Key Space Analysis
Key Sensitivity
Key Sensitivity Analysis of Encryption Process
Key Sensitivity Analysis of the Decryption Process
Plaintext
Time Complexity Analysis
Conclusions
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