ArticleScientific reports2025
RGB image encryption using SPN with a novel block cipher over simple graph adjacency matrices and Galois fields.
Article in Scientific reports, 2025. 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
2 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
This paper presents a construction of a secure image encryption scheme with graph theory, Galois field, and substitution-permutation network (SPN) for enhanced multimedia data security. First of all, the authors begin by constructing a complete graph with 8 vertices to understand the structure of the graph [Formula: see text] and then draw the adjacency matrix [Formula: see text] of the graph [Formula: see text]. An elementary finite field [Formula: see text] by the use of the irreducible polynomial and give representation of the elements of [Formula: see text] in a form of a binary. An affine mapping is defined using an adjacency matrix A whose entries lie in [Formula: see text]; each entry is transformed by computing its multiplicative inverse in [Formula: see text] and then augmented with a parameter from [Formula: see text]. This mapping is used to construct [Formula: see text] S-boxes, which together with other components constitute the nonlinear portion of the SPN structure. This encryption method is applied to RGB images with three transformations proposed as below. Substitution in replacement of all the pixel’s R, G, and B channel values works with the help of S-box, which is [Formula: see text]. Permutation is done with the help of the second S-box ([Formula: see text]) the function of permutation is to shift the position of pixels in order to support both diffusion and confusion. Lastly, the third S-box [Formula: see text] is utilized for the purpose of the XOR operation on the permuted pixel values, adding one more layer of confusion to the transformation. Finally, red, green, and blue channels are used to generate an encrypted RGB image. Test results and evaluations of the proposed scheme reveal that the encrypted images achieve entropy values in the range of 7.9971–7.9994, which are very close to the ideal value of 8, and exhibit minimal pixel correlation (close to zero). Moreover, the images are resistant to differential image cryptanalysis and linear image cryptanalysis. This demonstrates that the proposed approach provides strong randomness and ensures the secure protection of multimedia information, which is of critical importance in today’s applications.
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.