Abstract

Since the current general image encryption algorithms based on chaotic systems and classical permutation diffusion structures typically suffer from stochastic degradation, simple algorithm structures, and reduced execution efficiency when dealing with images with large data, this paper proposes a new multiprocess image encryption algorithm based on a new hyperchaotic coupled sine map. To begin with, by performing dynamic analyses of the map, including equilibrium points, bifurcation diagrams, Lyapunov exponent diagrams, and phase diagrams, associated performance analyses show high spectral entropy (SE) values and permutation entropy (PE) values. Meanwhile, sequences generated by the proposed map are able to pass the NIST randomness test, which shows its suitability for the design of encryption algorithms. Then, a chaos-based image encryption algorithm is proposed in this paper: In the preprocessing stage, the images are sparsely sampled using a compressed-sensing method; in the permutation stage, the image is decomposed into eight bit-plane images containing only 0s and 1s and a clockwise cyclic shift operation based on a chaotic sequence is applied in each bit-plane image to achieve a bit-level permutation effect; in the diffusion stage, the block DNA random computing is applied to the permuted image to modify the pixel values and the final cipher image is obtained. In addition, the initial value of the map is determined by the preset initial value, user-defined strings, and the Hash value of the plain image, where the Hash value of the plain image is calculated by the SHA-256 algorithm. Finally, the analysis of the algorithm demonstrates that the algorithm exhibits extremely strong plaintext correlation externally and excellent encryption performance in terms of attack resistance and execution efficiency.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.