Evidence map›Paper›PMID 40269024›Full record

ArticleScientific reports2025

A compressed image encryption algorithm leveraging optimized 3D chaotic maps for secure image communication.

Akshat Tiwari, Prachi Diwan, Tarun Dhar Diwan, Mahdal Miroslav, S P Samal

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 8 papers.

0numbers the graph read from it
0cells of the map it votes in
8citing 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

8 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
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

5 authors.

Akshat TiwariDepartment of Computer Science, Kalinga University, Raipur, India. drakshatt@gmail.com.
Prachi DiwanDepartment of Computer Science, Kalinga University, Raipur, India.
Tarun Dhar DiwanDepartment of Computer Science , Atal Bihari Vajpayee University, Bilaspur, India.
Mahdal MiroslavFaculty of Mechanical Engineering, VSB-Technical University of Ostrava, 70800, Ostrava Poruba, Czech Republic.
S P SamalDepartment of Biosciences, Saveetha School of Engineering, Saveetha Institute of Medical and Technical Sciences, Chennai, 602105, India.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

In today's digital age, sensitive multimedia informations are transmitted over public networks that are vulnerable to unauthorized access and data tampering. This motivates more robust encryption methods to combat such security threats. In this paper, a chaotic map-based encryption technique is presented as a solution to these issues. The proposed algorithm termed as OptiSecure-3D presents optimized parameter-based 3D chaotic maps for image encryption. The method integrates three primary components: stacked autoencoder (SAE), optimized parameter-based chaotic mapping, and encryption/decryption module, to ensure robust and secure encryption of images. The result evaluated the proposed OptiSecure-3D image encryption algorithm with a randomness test, pixel adjacency correlation test, and differential analysis. The mean entropy was approx. 7.9 and the mean number of pixels changing rate (NPCR) was approx. 99.8, unified average changing intensity (UACI) was approx. 33.46. Moreover, the OptiSecure-3D algorithm also investigated the result under noise attacks and shows better cryptanalysis results as compared to comparative state-of-art models. The findings suggest that our chaotic map-based encryption technique not only provides an effective solution to the security vulnerabilities of digital image transmission but also enhances the overall reliability of multimedia communication systems. This paper presents a significant advancement in the field of secure image encryption to meets the increasing demands for data security in modern digital communication networks.

Indexed as

Chaotic mapsCompressed encryptionImage encryptionOptimizationSecure communication

Identifiers

PMID40269024
PMCPMC12019318

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.