Evidence map›Paper›PMID 41294995›Full record

ArticleEntropy (Basel, Switzerland)2025

Research on Image Encryption with Multi-Level Keys Based on a Six-Dimensional Memristive Chaotic System.

Xiaobin Zhang, Yaxuan Chai, Shitao Xiang, Shaozhen Li

Abstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Xiaobin ZhangSchool of Electrical and Electronic Engineering, Wuhan Polytechnic University, Wuhan 430048, China.ORCID 0009-0008-5615-3782
Yaxuan ChaiSchool of Electrical and Electronic Engineering, Wuhan Polytechnic University, Wuhan 430048, China.
Shitao XiangSchool of Electrical and Electronic Engineering, Wuhan Polytechnic University, Wuhan 430048, China.ORCID 0009-0009-1686-1984
Shaozhen LiSchool of Electrical and Electronic Engineering, Wuhan Polytechnic University, Wuhan 430048, China.

Funding

Doctoral Startup Fund of China No. 2025RZ081
6 · The paper itself

Abstract

To address the security of digital images, this paper proposes a novel image encryption algorithm based on a six-dimensional memristive chaotic system. First, the algorithm uses the Secure Hash Algorithm 256 (SHA-256) to generate a hash value, from which the initial dynamic key is derived. Next, it integrates Zigzag scrambling, chaotic index scrambling, and diffusion operations to form an encryption scheme with multiple rounds of scrambling and diffusion. In this framework, after each encryption operation, a part of the dynamic key is changed according to the input parameters, and the six-dimensional memristive chaotic system continues iterating to generate the pseudo-random sequence for the next operation. Finally, the proposed algorithm is evaluated using indicators including information entropy, histograms, the Number of Pixels Change Rate (NPCR) and Unified Average Changing Intensity (UACI), encryption time, and so on. The results show that the information entropy of the encrypted image reaches 7.9979; its Chi-square statistic is 186.6875; the average NPCR and UACI are 99.6111% and 33.4643%, respectively; and the encryption time is 0.342 s for the 256 × 256 Cameraman image. These indicate that image encryption is not only effective in encrypting images but also resistant to many conventional attacks.

Indexed as

chaotic index scramblingkeysix-dimensional memristive chaotic systemZigzag scrambling

Identifiers

PMID41294995
PMCPMC12651412

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.