CoChat

A Lightweight Image Encryption Algorithm Based on Chaotic Map and Random Substitution

Open access

The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.

Abstract

Chaotic-maps-based image encryption methods have been a topic of research interest for a decade. However, most of the proposed methods suffer from slow encryption time or compromise on the security of the encryption to achieve faster encryption. This paper proposes a lightweight, secure, and efficient image encryption algorithm based on logistic map, permutations, and AES S-box. In the proposed algorithm, SHA-2 based on the plaintext image, a pre-shared key, and an initialization vector (IV) are used to generate the initial parameters for the logistic map. The logistic map chaotically generates random numbers, which are then used for the permutations and substitutions. The security, quality, and efficiency of the proposed algorithm are tested and analyzed using a number of metrics, such as correlation coefficient, chi-square, entropy, mean square error, mean absolute error, peak signal-to-noise ratio, maximum deviation, irregular deviation, deviation from uniform histogram, number of pixel change rate, unified average changing intensity, resistance to noise and data loss attacks, homogeneity, contrast, energy, and key space and key sensitivity analysis. Experimental results reveal that the proposed algorithm is up to 15.33× faster compared to other contemporary encryption methods.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3390/e24101344

Cites

35 of 35 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 Proposed image encryption algorithm’s flowchart.
Figure 1 Proposed image encryption algorithm’s flowchart.CC BY · PubMed Central
Figure 2 Logistic map bifurcation diagram.
Figure 2 Logistic map bifurcation diagram.CC BY · PubMed Central
Figure 3 The proposed algorithm applied to a 4×4 sample.
Figure 3 The proposed algorithm applied to a 4×4 sample.CC BY · PubMed Central
Figure 4 Images used to test the proposed algorithm: (a) Baboon, (b) Peppers, (c) Male, (d) Sailboat, and (e) Cameraman.
Figure 4 Images used to test the proposed algorithm: (a) Baboon, (b) Peppers, (c) Male, (d) Sailboat, and (e) Cameraman.CC BY · PubMed Central
Figure 5 Sample images and their respective encrypted ciphers: (a) Baboon, (b) Male, (c) Sailboat, (d) Baboon cipher, (e) Male cipher, (f) Sailboat cipher.
Figure 5 Sample images and their respective encrypted ciphers: (a) Baboon, (b) Male, (c) Sailboat, (d) Baboon cipher, (e) Male cipher, (f) Sailboat cipher.CC BY · PubMed Central
Figure 6 Histograms of images and their respective ciphers: (a) Baboon histogram, (b) Sailboat histogram, (c) Peppers histogram, (d) Baboon cipher histogram, (e) Sailboat cipher histogram, (f) Peppers cipher histogram.
Figure 6 Histograms of images and their respective ciphers: (a) Baboon histogram, (b) Sailboat histogram, (c) Peppers histogram, (d) Baboon cipher histogram, (e) Sailboat cipher histogram, (f) Peppers cipher histogram.CC BY · PubMed Central
Figure 7 Avalanche effect illustrated in two images encrypted from the same plaintext image with a change of 1 bit: (a) Peppers, (b) Peppers cipher, (c) Peppers cipher where plaintext peppers have 1-bit change.
Figure 7 Avalanche effect illustrated in two images encrypted from the same plaintext image with a change of 1 bit: (a) Peppers, (b) Peppers cipher, (c) Peppers cipher where plaintext peppers have 1-bit change.CC BY · PubMed Central
Figure 8 Results of data loss (occlusion) attacks on the color image Baboon (512×512): (a–c) different severities of occlusion attacks, (d–f) corresponding decrypted images.
Figure 8 Results of data loss (occlusion) attacks on the color image Baboon (512×512): (a–c) different severities of occlusion attacks, (d–f) corresponding decrypted images.CC BY · PubMed Central
Figure 9 Results of salt and pepper noise attack on the color image Baboon (512×512): (a–c) different noise densities introduced, (d–f) corresponding decrypted images.
Figure 9 Results of salt and pepper noise attack on the color image Baboon (512×512): (a–c) different noise densities introduced, (d–f) corresponding decrypted images.CC BY · PubMed Central
Figure 10 Results of key sensitivity tests on the color image Sailboat (512×512): (a) plaintext image, (b) C1 encrypted using key K1, (c) C2 encrypted using key K2, (d) difference of images: |(b) − (c)|, (e) C1 decrypted using key K1, (f) C1 decrypted using key K2, (g) C2 decrypted using key K1, (h) difference of images: |(f) − (g)|.
Figure 10 Results of key sensitivity tests on the color image Sailboat (512×512): (a) plaintext image, (b) C1 encrypted using key K1, (c) C2 encrypted using key K2, (d) difference of images: |(b) − (c)|, (e) C1 decrypted using key K1, (f) C1 decrypted using key K2, (g) C2 decrypted using key K1, (h) difference of images: |(f) − (g)|.CC BY · PubMed Central

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

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

The self-check needs the paper’s full text.

Citations

Cites

1 retracted

Show all 35 references

Research works printed but not linked: 2

  1. Mali, 2015, A study on statistical analysis and security evaluation parameters in image encryption, Entropy, 34, 36
  2. Ahmad, 2010, Efficiency analysis and security evaluation of image encryption schemes, Computing, 23, 25

Cited by

See all 108

Metadata

Authors
Alghamdi, Y., Munir, A., & Ahmad, J.
Affiliations
  • Kansas State University (US)
  • Edinburgh Napier University (GB)
Corresponding author
Munir, Arslan
Venue
Entropy
Publisher
MDPI AG
Published
2022-09-23
Volume
24
Issue
10
Pages
1344
ISSN
1099-4300 (ISSN-L)
OpenAlex
W4297235651
Cited by
97
References
35
Citations by year
2026: 21 · 2025: 33 · 2024: 22 · 2023: 21
FWCI
6.21
Type
journal article
Language
en
Open access
Locations
  • Entropy (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Edinburgh Napier Research Repository (Edinburgh Napier University) (submittedVersion, cc-by)
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, logistic map, chaotic maps, random replacement, permutations, AES S-box, SHA-2, lightweight encryption, encryption speed, key sensitivity analysis, key space analysis

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.

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: A Lightweight Image Encryption Algorithm Based on Chaotic Map and Random Substitution. https://app.cochat.ai/papers/10.3390/e24101344
The paper
Alghamdi, Y., Munir, A., & Ahmad, J. (2022). A Lightweight Image Encryption Algorithm Based on Chaotic Map and Random Substitution. Entropy. https://doi.org/10.3390/e24101344

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.