A random decomposition method for chaotic sequences to improve the security of image encryption

Abstract The encryption efficiency of traditional encryption algorithms is relatively low, and they are no longer suitable for encrypting digital image information with large amounts of data and strong correlation. At present, encryption methods based on chaotic sequences can meet the demand for large amounts of image encryption data. However, the randomness of the chaotic sequences used in general chaotic encryption algorithms is strongly correlated with the initial state and parameters of the chaotic system, which may result in low complexity and chaotic degradation of the output sequence of the chaotic system. This paper proposes a sequence random decomposition algorithm that decomposes low complexity sequences into a large number of high complexity random decomposition sequences from the perspective of sequence decomposition. By using the sequence random decomposition algorithm to process the chaotic sequence output by the chaotic system, the random decomposition sequences with higher spectral entropy complexity were obtained. Finally, an image encryption communication system based on random sequence decomposition is constructed by combining random sequence decomposition with chaotic system. The security analysis of the image encryption communication system is carried out, and it is verified that the proposed system has better encryption performance.

Authors

Institutions

Publication Details

Journal
Physica Scripta
Published
2025-02-12
DOI
https://doi.org/10.1088/1402-4896/adb523
Citations
3
Primary Topic
Chaos-based Image/Signal Encryption
Type
article
Field-Weighted Citation Impact
3.83
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A random decomposition method for chaotic sequences to improve the security of image encryption

Wenxin Yu, Q. Xiao
3 citations
Physica Scripta
Chaos-based Image/Signal Encryption
3.83
article

A random decomposition method for chaotic sequences to improve the security of image encryption

Wenxin Yu, Q. Xiao
article en
3 citations

Abstract

Abstract The encryption efficiency of traditional encryption algorithms is relatively low, and they are no longer suitable for encrypting digital image information with large amounts of data and strong correlation. At present, encryption methods based on chaotic sequences can meet the demand for large amounts of image encryption data. However, the randomness of the chaotic sequences used in general chaotic encryption algorithms is strongly correlated with the initial state and parameters of the chaotic system, which may result in low complexity and chaotic degradation of the output sequence of the chaotic system. This paper proposes a sequence random decomposition algorithm that decomposes low complexity sequences into a large number of high complexity random decomposition sequences from the perspective of sequence decomposition. By using the sequence random decomposition algorithm to process the chaotic sequence output by the chaotic system, the random decomposition sequences with higher spectral entropy complexity were obtained. Finally, an image encryption communication system based on random sequence decomposition is constructed by combining random sequence decomposition with chaotic system. The security analysis of the image encryption communication system is carried out, and it is verified that the proposed system has better encryption performance.

Physica ScriptaVol. 100(3)
Hunan University of Science and Technology (CN)
Openalex Percentile: Top 8%
Chaos-based Image/Signal Encryption
3.83
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.