CoChat

An image encryption algorithm based on a novel 4D hyperchaotic system and improved Knight’s Tour scrambling algorithm

Deng, Xuan, Chen, Zhong, Long, Bofeng, Liu, Tongzhe, Wu, Ximei, Zheng, Zhiwen, Zou, Shuanglong, Cao, Can · 2025 · Physica Scripta

The DOI matches its Crossref record; 44 of the 47 references it cites were found in a registry or an index.

Abstract

In this paper, we propose an advanced image encryption algorithm that integrates a novel 4D hyperchaotic system and an improved Knight’s Tour algorithm for enhanced security. The 4D hyperchaotic system, characterized by its complex dynamics and multiple positive Lyapunov exponents, generates pseudo-random sequences with high sensitivity to initial conditions. These sequences are utilized in both pixel-level scrambling and bit-level diffusion processes, ensuring robust encryption. The Knight’s Tour, a classical pathfinding algorithm, is enhanced through chaotic sequence-based randomization, improving path randomness and addressing traditional limitations like deadlock issues. Additionally, a nonlinear diffusion process, inspired by the Josephus ring algorithm, further strengthens the encryption scheme by introducing dynamic scrambling of pixel values. Security analysis and experimental results demonstrate that the proposed algorithm offers a large key space, excellent resistance to cryptanalysis, and robustness against various attacks such as noise and cropping. Especially in image encryption, resistance to differential attacks is a crucial performance metric, typically evaluated using NPCR and UACI. The expected values are NPCR E = 99.6094% and UACI E = 33.4635%. The NPCR and UACI values obtained from the experimental images encrypted by the proposed algorithm are close to these expected values. This work highlights the potential of integrating hyperchaotic systems in image encryption for applications requiring high levels of security, such as military communications, cloud storage, and digital healthcare systems.

Overview

Integrity signals

Registry

Crossref · 10.1088/1402-4896/adb918

Cites

44 of 44 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 44 references

Cited by

See all 16

Metadata

Authors
Deng, X., Chen, Z., Long, B., Liu, T., Wu, X., Zheng, Z., Zou, S., & Cao, C.
Affiliations
Hengyang Normal University (CN)
Venue
Physica Scripta
Published
2025-03-05
Volume
100
Issue
4
Pages
045208
ISSN
  • 0031-8949 (ISSN-L)
  • 1402-4896
OpenAlex
W4407822305
Cited by
16
References
47
Citations by year
2026: 13 · 2025: 3
FWCI
5.64
Type
journal article
Language
en
Open access
closed
Licence
Locations
Physica Scripta (publishedVersion)
Funders
Scientific Research Foundation of Hunan Provincial Education Department (19A066)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
  • Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Steganography and Watermarking Techniques
Keywords
image encryption, pixel scrambling, chaotic sequences, Lyapunov exponents, NPCR, UACI, differential attack resistance, key space

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: An image encryption algorithm based on a novel 4D hyperchaotic system and improved Knight’s Tour scrambling algorithm. https://app.cochat.ai/papers/10.1088/1402-4896/adb918
The paper
Deng, X., Chen, Z., Long, B., Liu, T., Wu, X., Zheng, Z., Zou, S., & Cao, C. (2025). An image encryption algorithm based on a novel 4D hyperchaotic system and improved Knight’s Tour scrambling algorithm. Physica Scripta. https://doi.org/10.1088/1402-4896/adb918

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.