ArticleEntropy (Basel, Switzerland)2026
Color Image Encryption Based on 3D-SBFCM with Dynamic Rectangular Partitioning and Dynamic S-Box Substitution.
Article in Entropy (Basel, Switzerland), 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
Abstract
Existing chaos-based color image encryption algorithms still face several challenges, including insufficient dynamical complexity of low-dimensional chaotic maps, residual boundary regularity caused by fixed block partitioning, and limited diffusion among RGB channels. To address these issues, this paper proposes a color image encryption algorithm based on a three-dimensional sine-bilinear fully coupled chaotic map (3D-SBFCM). The proposed map integrates sinusoidal modulation, linear coupling, and bilinear cross-coupling within a mod-1 mapping framework, thereby improving the complexity and pseudorandomness of the generated chaotic sequences. In addition, a residual-feasibility-constrained dynamic rectangular partitioning mechanism is developed to generate reversible non-uniform image blocks and reduce the structural regularity associated with fixed-size partitioning. Based on this partitioning structure, inter-block permutation among same-size blocks and intra-block two-dimensional permutation are performed to weaken both global and local spatial correlations. Plaintext-related initialization, dynamic S-box substitution, and forward-backward cross-channel diffusion are further incorporated into the overall permutation-diffusion framework to enhance plaintext sensitivity, nonlinear confusion, and perturbation propagation across RGB channels. Experimental results demonstrate that the proposed algorithm effectively conceals the statistical characteristics of plaintext images, with information entropy values higher than 7.999 for all color channels and NPCR/UACI values close to their theoretical expectations. The algorithm also shows satisfactory robustness against cropping and noise attacks. These results indicate that the proposed method provides an effective and secure solution for color image encryption.
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.