ArticleScientific reports2026
An efficient image encryption scheme based on Lorenz system and quantum-inspired walks.
Article in Scientific reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
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.
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.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Securing visual information against sophisticated cyber threats remains a core challenge in modern cryptography because many existing chaos-based image encryption schemes suffer from low key sensitivity and static substitution. To overcome these intrinsic limitations, this study develops a multistage image encryption framework by synergistically fusing the Lorenz chaotic system, Secure Hash Algorithm 256 (SHA-256), and Discrete Time Quantum-inspired Walks (DTQWs). The chaotic Lorenz system yields highly sensitive diffusion sequences via bitwise modular operations, whereas the DTQW dynamically constructs plaintext-dependent Substitution Boxes (S-Boxes) and thereby reinforces confusion to minimize statistical predictability. The SHA-256 hash introduces a session-dependent quantum coin rotation parameter to ensure dynamic evolution with intrinsic plaintext sensitivity during the encryption process. Extensive simulations demonstrate outstanding security performance of the proposed scheme: near ideal entropy value of 7.9999, the Number of Pixels Change Rate (NPCR) and the Unified Average Intensity Value (UACI) rates of [Formula: see text] and [Formula: see text], correlation coefficients close to zero, and high decryption reconstruction fidelity with Peak Signal to Noise Ratio (PSNR = ∞) and Normalized Correlation Coefficient (NCC [Formula: see text]) for lossless recovery in our python based-evaluations. Compared with other state-of-the-art chaotic and quantum-inspired encryption techniques, the proposed framework offers superior randomness, a good diffusion-confusion balance, and robustness against statistical and differential attacks. Thus, it is a promising candidate for secure image communication and high-assurance data protection in next-generation multimedia systems.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.