arrow
Return

Image compression encryption and reversible destruction algorithm based on chaotic sequence or periodic sequence

delete2026-05-30
delete0
delete
OA
AI
亓亮 (Qi Liang)
J
Jia Duan *
X
XinJie Hu
W
Wenxin Yu *
DOI:10.1016/j.asej.2026.104251delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Aiming at the problem that it is difficult to realize the coexistence of encryption and compression for image data, and the potential risk of illegal access and data theft is difficult to detect, this paper proposes an image encryption-compression-encryption and reversible destruction algorithm based on chaotic sequences or periodic sequences. Firstly, a four-dimensional nonlinear system is obtained to generate a chaotic sequence or a periodic sequence as an encryption sequence. Then, the image information is encrypted and compressed using encrypted sequences and Huffman compression encoding based on difference rules, which includes three parts: disorder, difference compression, and diffusion. If the correct key is provided, decryption succeeds. Otherwise, decryption fails, triggering a reversible destruction of the original image. The number of failed attempts is recorded, and the encrypted image is updated accordingly. When the correct key is subsequently entered, the decrypted image corresponds to the corrupted version, reflecting the prior failed attempts.Finally, through the encryption and compression of the image and conducting experimental analysis, the algorithm is verified to have good image information compression effect and security.
Keywords:
Image encryption
Chaotic systems
Hoffman compression
Reversible destruction
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Ain Shams Engineering Journal cover
Ain Shams Engineering Journal
IF:
5.9
Papers:
3.4K
Citations:
1.2W

Organization

H
hunan university of science and technology
Scholars:
1.1K
Papers: 404
Citations: 0