Abstract

The paper proposes a lossless quantum image encryption scheme based on substitution tables (S-box) scrambling, mutation operation and general Arnold transform with keys. First, the key generator builds upon the foundation of SHA-256 hash with plain-image and a random sequence. Its output value is used to yield initial conditions and parameters of the proposed image encryption scheme. Second, the permutation and gray-level encryption architecture is built by discrete Arnold map and quantum chaotic map. Before the permutation of Arnold transform, the pixel value is modified by quantum chaos sequence. In order to get high scrambling and randomness, S-box and mutation operation are exploited in gray-level encryption stage. The combination of linear transformation and nonlinear transformation ensures the complexity of the proposed scheme and avoids harmful periodicity. The simulation shows the cipher-image has a fairly uniform histogram, low correlation coefficients closed to 0, high information entropy closed to 8. The proposed cryptosystem provides 2256 key space and performs fast computational efficiency (speed = 11.920875 Mbit/s). Theoretical analyses and experimental results prove that the proposed scheme has strong resistance to various existing attacks and high level of security.

Highlights

  • With the widespread application of a digital image, the security of private image information is of great concern

  • The results prove that it can decrease the relationship of adjacent pixels in multiple directions

  • In order to discover the precision of the encryption scheme, root mean squared error (RMSE) is i, j) −its

Read more

Summary

Introduction

With the widespread application of a digital image, the security of private image information is of great concern. Liu [21] proposes folding algorithm to XOR each part of the image with quantum chaotic numbers from eight directions and obtains high diffusivity and randomness. The plain-image is added into a random sequence for a flexible value and SHA-256 hash computes it to yield security key in the paper. Before the execution of Arnold transform for each pixel, the gray-level encryption is performed by means of S-box substitution [30,31], mutation operation and linear transformation with a quantum chaotic sequence. Before the permutation of the Arnold transform, the gray-level encryption has executed by means of S-box substitution and linear transformation with quantum chaos sequence. The architecture combines permutation and gray-level encryption and eliminates the periodicity brought by the Arnold transform.

General Arnold Transform with Keys
Quantum Chaotic Map
Mutation Operation
Cryptosystem
Key Generator
Encryption Approach
Decryption Approach
Security Analysis
Histogram Analysis
Correlation Coefficients
Information Entropy
Differential Analysis
Security Key Analysis
Encrypt
Root Mean
Mean Absolute Error
Key Space Analysis
Running Performance
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