Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 56 of the 57 references it cites were found in a registry or an index; 5 of the 19 sources its claims cite were checked for support.

Image adaptive encryption using EfficientNet B3 feature guided multi scroll chaotic map with modulo controlled pseudo parallel processing

Open access
Subathra, S., Thanikaiselvan, V. · 2025 · Scientific Reports

Abstract

A new multistage encryption algorithm is proposed by integrating the deep neural network with a new 4D multi-scroll chaotic map to enhance the efficiency and improve the security of image transmission in the open channel. This combined network expands the key space and maintains the secrecy of the key with the multistage encryption algorithm. Initially, the image adaptive key generation process is implemented by the EfficientNet-B3 network to extract the features from the source image, which are then converted into hash values using SHA 256. The hash values are partitioned into four sections, and each section is normalized to give one distinct initial value for the generation of a multi-scroll chaotic sequence. The pseudo-parallel process routes the split source sub-image blocks (128⨯128) of plain text to branch 1 or branch 2, decided by the seed value of the chaotic sequence, increasing the high robustness against the differential and statistical attacks. Each branch contains row and column-wise permutations, bidirectional selective shuffling, and chaotic intra/inter-pixel diffusion in varying orders. The key image diffusion and dynamic DNA diffusion to the intermediate cypher image exhibit a strong avalanche effect. The simulation evaluation on the natural data set images demonstrates the large key space of 2 to the power of 674, high key sensitivity, uniform histogram with entropy value attains the critical values of 7.9, high NPCR value of 99.9%, UACI values with 33.46%,…

Overview

CoChat Summary

TL;DR

This paper proposes a multistage image encryption scheme that combines EfficientNet-B3 feature extraction with a new 4D multi-scroll chaotic map and pseudo-parallel processing. The authors report strong encryption metrics on natural images, including key space about \(2^{674}\), entropy near 7.9–8, NPCR 99.9%, and UACI 33.46%.

Key findings

  • The proposed 4D multi-scroll chaotic map is reported to have positive Lyapunov exponents, with \(LE_1=2.0440\), \(LE_2=0.6940\), \(LE_3=0.6933\), and \(LE_4=-7.8454\), and Kaplan-Yorke dimension \(D_{KY}=3.4374\), which the paper interprets as hyperchaotic.
  • The paper reports an average Kolmogorov entropy of 3.5403 for the chaotic map, and NIST SP 800-22 tests were passed with all sequence p-values greater than 0.01.
  • For image security, the authors report entropy values near the critical value of 8; specifically, the abstract says entropy attains 7.9, and the text reports initial-condition entropies of 7.970, 7.975, 7.971, and 7.974 bits.
  • The conclusion reports NPCR of 99.9% and UACI of 33.46%, plus near-zero horizontal, vertical, and diagonal correlation; the results section also states NPCR values were greater than 99.6% and UACI values were close to 33%.

Methods

  • Design: a multistage image encryption framework with EfficientNet-B3-based adaptive key generation, SHA-256 hashing of extracted features, a new 4D multi-scroll chaotic map, pseudo-parallel branch selection, confusion-diffusion blocks, key-image diffusion, and dynamic DNA encoding.
  • Data/sample: experiments were run on the Natural Image dataset (6,899 images from 8 classes), with 120 sample images used for result and performance analysis; an additional tree color image from the USC-SIPI database is mentioned.
  • Analysis: the paper evaluates chaotic properties (Lyapunov exponents, Kaplan-Yorke dimension, Kolmogorov entropy, NIST tests), and encryption quality using entropy, histograms, correlation coefficients, chi-square, deviation from ideality, key space, key sensitivity, MSE/PSNR, and robustness to cropping, noise, chosen-plaintext, and chosen-ciphertext attacks.

Limitations

  • The paper states that some existing methods suffer from small key space or efficiency limitations, but it does not clearly state a limitation of the proposed method itself.
  • Evident from the text: some reported parameter values are inconsistent across sections (for example, \(d\) is given as 0.0019, 0.0001, and 0.0011 in different places), and the exposition is fragmented with repeated or inconsistent algorithm notation; this is evident in the provided text.
  • Evident from the text: the main evaluation is on 120 sampled images from a natural-image dataset, so generalization beyond those samples is not demonstrated here.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1038/s41598-025-27080-z

Cites

56 of 57 references verified0 citation errors · 1 not checkable

Statistics

Nothing to recompute.

Figures

Fig. 1 3D attractor diagram for new multi-scroll chaotic map.
Fig. 1 3D attractor diagram for new multi-scroll chaotic map.CC BY · PubMed Central
Fig. 2 2D attractor diagram for new multi-scroll chaotic map.
Fig. 2 2D attractor diagram for new multi-scroll chaotic map.CC BY · PubMed Central
Fig. 3 Time series diagram for new multi-scroll chaotic map.
Fig. 3 Time series diagram for new multi-scroll chaotic map.CC BY · PubMed Central
Fig. 4 (a) Time evolution of Lyapunov exponents (b) Lyapunov exponent for varying ‘d’.
Fig. 4 (a) Time evolution of Lyapunov exponents (b) Lyapunov exponent for varying ‘d’.CC BY · PubMed Central
Fig. 5 Kolmogorov entropy of multi scroll chaotic map.
Fig. 5 Kolmogorov entropy of multi scroll chaotic map.CC BY · PubMed Central
Fig. 6 Architecture of EfficientNet-B3.
Fig. 6 Architecture of EfficientNet-B3.CC BY · PubMed Central
Fig. 7 Histogram of initial conditions.
Fig. 7 Histogram of initial conditions.CC BY · PubMed Central
Fig. 8 PCA analysis of initial conditions.
Fig. 8 PCA analysis of initial conditions.CC BY · PubMed Central
Fig. 9 Block diagram for the proposed image adaptive encryption algorithm.
Fig. 9 Block diagram for the proposed image adaptive encryption algorithm.CC BY · PubMed Central
Fig. 10 A Encryption analysis of proposed algorithm. (a–e) Sample input images (f–j) Histogram of sample images, (k–o) Encrypted images. (p–t) Histogram of encrypted images (u–y) Decrypted images. B Encryption analysis for RGB image. (a) RGB input image (b) Histogram of RGB input images, (c) Encrypted images. (d) Histogram of encrypted images (e) Decrypted images.
Fig. 10 A Encryption analysis of proposed algorithm. (a–e) Sample input images (f–j) Histogram of sample images, (k–o) Encrypted images. (p–t) Histogram of encrypted images (u–y) Decrypted images. B Encryption analysis for RGB image. (a) RGB input image (b) Histogram of RGB input images, (c) Encrypted images. (d) Histogram of encrypted images (e) Decrypted images.CC BY · PubMed Central
Fig. 11 Entropy analysis of 120 sample images.
Fig. 11 Entropy analysis of 120 sample images.CC BY · PubMed Central
Fig. 12 Correlation analysis. (a–e) Correlation coefficient of sample input images (f–j) Correlation coefficient of encrypted images.
Fig. 12 Correlation analysis. (a–e) Correlation coefficient of sample input images (f–j) Correlation coefficient of encrypted images.CC BY · PubMed Central
Fig. 13 Chi square analysis for 120 sample images.
Fig. 13 Chi square analysis for 120 sample images.CC BY · PubMed Central
Fig. 14 Deviation from ideality analysis.
Fig. 14 Deviation from ideality analysis.CC BY · PubMed Central
Fig. 15 Differential attack analysis. (a) NPCR (b) UACI.
Fig. 15 Differential attack analysis. (a) NPCR (b) UACI.CC BY · PubMed Central
Fig. 16 key sensitivity analysis (a) original data image (b) Decrypted image with wrong key k1 (c) Decrypted image with wrong key k2 (d) Decrypted image with wrong key k3 (e) Decrypted image with wrong key k4 (f) Decrypted image with correct key k.
Fig. 16 key sensitivity analysis (a) original data image (b) Decrypted image with wrong key k1 (c) Decrypted image with wrong key k2 (d) Decrypted image with wrong key k3 (e) Decrypted image with wrong key k4 (f) Decrypted image with correct key k.CC BY · PubMed Central
Fig. 17 (a) MSE (b) PSNR analysis of 120 sample Images.
Fig. 17 (a) MSE (b) PSNR analysis of 120 sample Images.CC BY · PubMed Central
Fig. 18 Cropping attack analysis (a) 5% cropped vertical cipher (b) 5% cropped horizontal cipher (c) cropped diagonal stripe (d) decrypted image of—‘a’ (e) decrypted image of—‘b’(f) decrypted image of–‘c’ (g) 25% horizontal cropping (h) 50% vertical cropping (i) check board cropping (j) decrypted image—‘g’ (k) decrypted image—‘h’ (l) decrypted image—‘i’.
Fig. 18 Cropping attack analysis (a) 5% cropped vertical cipher (b) 5% cropped horizontal cipher (c) cropped diagonal stripe (d) decrypted image of—‘a’ (e) decrypted image of—‘b’(f) decrypted image of–‘c’ (g) 25% horizontal cropping (h) 50% vertical cropping (i) check board cropping (j) decrypted image—‘g’ (k) decrypted image—‘h’ (l) decrypted image—‘i’.CC BY · PubMed Central
Fig. 19 Noise Attack analysis (a–e) Encrypted image added with salt and pepper noise at the intensity level of 2%,3%,5%, 10% and 25%, (f–j) Decrypted image of salt and pepper noise added cipher image with an intensity level of 2%,3%,5%, 10% and 25%, (k–o) Encrypted image added with speckle noise at the intensity level of 2%,3%,5%, 10% and 25%, (p–t) Decrypted image of speckle noise added cipher image at the intensity level of 2%,3%,5%, 10% and 25%.
Fig. 19 Noise Attack analysis (a–e) Encrypted image added with salt and pepper noise at the intensity level of 2%,3%,5%, 10% and 25%, (f–j) Decrypted image of salt and pepper noise added cipher image with an intensity level of 2%,3%,5%, 10% and 25%, (k–o) Encrypted image added with speckle noise at the intensity level of 2%,3%,5%, 10% and 25%, (p–t) Decrypted image of speckle noise added cipher image at the intensity level of 2%,3%,5%, 10% and 25%.CC BY · PubMed Central
Fig. 20 Chosen plain text and chosen cipher text attack. (a) All white image (b) Encrypted white image (c) Histogram of encrypted white image (d) Decrypted image with wrong key (e) All black image (f) Encrypted black image (g) Histogram of encrypted black image. (h) Decrypted image with wrong key for chosen cipher text.
Fig. 20 Chosen plain text and chosen cipher text attack. (a) All white image (b) Encrypted white image (c) Histogram of encrypted white image (d) Decrypted image with wrong key (e) All black image (f) Encrypted black image (g) Histogram of encrypted black image. (h) Decrypted image with wrong key for chosen cipher text.CC BY · PubMed Central

Verification

Claims the paper makes

5 Valid · 1 Not valid · 9 Not checked · 93 Own results and interpretations

56 more claims

Create a free account to see all 108 claims and every source verdict.

See all claims — free account
  • Probably not a substantial claim. 11
  • It may state two separate claims as one. 35
  • The quote only partly states this claim. 6

Create a free account to see these claims.

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

3 of 3

Citations

Cites

Show all 54 references

Cited by

See all 4

Metadata

Authors
Subathra, S., & Thanikaiselvan, V.
Affiliations
Vellore Institute of Technology University (IN)
Corresponding author
Thanikaiselvan, V.
Venue
Scientific Reports
Published
2025-12-06
Volume
15
Issue
1
Pages
43435-43435
ISSN
2045-2322 (ISSN-L)
OpenAlex
W4417078067
Cited by
4
References
54
Citations by year
2026: 4
FWCI
1.40
Type
journal article
Language
en
Open access
Licence
Locations
  • Scientific Reports (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • PubMed Central (publishedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
Vellore Institute of Technology, Vellore
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, EfficientNetB3, SHA-256, row and column permutations, DNA diffusion, avalanche effect, 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.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-09-30, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-09-30 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

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: Image adaptive encryption using EfficientNet B3 feature guided multi scroll chaotic map with modulo controlled pseudo parallel processing. https://app.cochat.ai/papers/10.1038/s41598-025-27080-z
The paper
Subathra, S., & Thanikaiselvan, V. (2025). Image adaptive encryption using EfficientNet B3 feature guided multi scroll chaotic map with modulo controlled pseudo parallel processing. Scientific Reports. https://doi.org/10.1038/s41598-025-27080-z

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.