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

The DOI matches its Crossref record; 59 of the 59 references it cites were found in a registry or an index; 1 of the 14 sources its claims cite were checked for support.

A Robust Image Encryption Algorithm Based on a 32-bit Chaotic System

Open access
Li, Hao, Deng, Lianbing, Gu, Zhaoquan·2020·IEEE Access

Abstract

In these years, image encryption systems based on chaotic maps have received considerable attention from researchers. For the security of encryption algorithms, it is important to ensure that chaotic systems can produce high quality pseudo-random sequences. However, when a chaotic system that theoretically has good random performance is deployed in a limited precision platform, its random performance will deteriorate. We prove that even if the precision reaches 256-bit, the piecewise linear chaotic map still fails to achieve the desired random performance. Moreover, in the case of low precision, the cascade structure commonly used in mixed chaotic maps will aggravate the problem of random degeneration. To generate good pseudo-random numbers in low-precision platforms, we propose a positive integer random sequence generator, called 32-bit PL_PWLCM&LM, which comprises two 32-bit PL_PWLCMs and one 32-bit logistic map in parallel. In our proposed image encryption system, we adopt the permutation algorithm with four pixels as a permutation unit and the diffusion algorithm based on rows and columns. The security and performance analyses prove that the proposed scheme is a secure, robust, and fast image encryption algorithm. Source codes are shared on GitHub: https://github.com/cuclihao/Pic_Enc_V3.

Overview

CoChat Summary

TL;DR

The paper proposes a 32-bit integer-domain parallel chaotic PRNG, 32-bit PL_PWLCM&LM, combining two 32-bit PL_PWLCMs and one 32-bit logistic map, and uses it in a two-round permutation-diffusion image encryption scheme. It reports that the PRNG passes all 15 NIST STS tests at 32-bit precision and that the encryption scheme is secure, robust to noise/data loss, and fast in experiments.

Key findings

  • At 32-bit precision, the proposed 32-bit PL_PWLCM&LM passes all 15 NIST STS tests; 32-bit PL_LM passes only 3/15, 32-bit PL_PWLCM passes 12/15, and the cascade model passes only 1/15. The paper also states that even at 256-bit precision, PWLCM cannot pass all 15 NIST tests. In TestU01, 32-bit PL_LM, PL_PWLCM, and PL_STM cannot pass, while the proposed system passes all subtests.
  • Security results include average NPCR of 99.6057% and average UACI of 33.4742%, a key space of 2^312, cipher-image global entropy close to 8, all cipher images passing the local Shannon entropy test, chi-square values below the theoretical 294, histogram variances of 5425.2601, 5463.3017, and 5455.9226 for three cipher images, and adjacent-pixel correlation coefficients close to 0.
  • Robustness and speed results include PSNR >11 dB under 1% noise, PSNR values of 21.3275 dB and 20.3744 dB under 0.1% noise, PSNR of about 13 dB at 1/16 data loss, 16 dB at 1/32 data loss, and >18 dB at 1/64 data loss; average encryption speed is 1.8271 Mbps and average decryption speed is 1.8677 Mbps. For a 255×255 odd-size image, only 511 pixels, or 0.78%, are not involved in permutation.
  • The permutation uses four adjacent pixels as a unit, requiring a pseudo-random sequence only 25% of the plain-image size and one PRNG execution per encryption round; the reported time complexity is WH + 4(W + H).

Methods

  • Design: a parallel chaotic system uses two 32-bit PL_PWLCMs and one 32-bit PL_LM, with output r_n = ((x_n XOR y_n) + z_n) Mod 2^L; each PRNG takes a 156-bit key and uses n = 20 initialization iterations. Encryption uses a two-round permutation-diffusion network: permutation with four adjacent pixels as a unit and diffusion based on rows and columns, with two diffusion rounds per encryption round.
  • Data and experiments: images from the USC-SIPI image database, including grayscale images of different sizes, 512×512 images for local entropy, a 255×255 odd-size image, all-black and all-white images, and color images. Experiments were implemented in Python on an Intel Core i5-8300H CPU @ 2.30GHz, 8GB RAM, Windows 10 64-bit system. Randomness tests used NIST STS with α = 0.01, m = 800, 19 MB sequences, and 100,000-bit blocks, plus TestU01-1.2.3 subtests Rabbit, Alphabit, and BlockAlphabit.
  • Analysis: security analysis covered visual perception, histogram, chi-square, correlation, information entropy, image sensitivity via NPCR/UACI, key space and sensitivity, and classical attacks; robustness analysis covered odd-size images, noise, and data loss via PSNR; speed was assessed by time complexity and encryption/decryption speed comparisons.

Limitations

  • Stated in the paper: when the image size is not a multiple of 4, the last row or column is not permuted; for a 255×255 image, 511 pixels (0.78%) are not involved in permutation, although all pixels are involved in diffusion. The authors also state future work will improve efficiency and extend the approach to video protection.
  • Stated/evident from the text: the reported speed is from a non-parallel implementation, and the authors say higher speed is expected after careful design and parallel processing. Evident from the text: security and robustness claims are based on experiments on selected USC-SIPI images and comparisons, with no formal cryptanalytic proof presented.

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

Integrity signals

Registry

Crossref · 10.1109/access.2020.2972296

Cites

59 of 59 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Figures

FIGURE 1 Chaotic characteristics of logistic map and 32-bit PL_LM.
FIGURE 1 Chaotic characteristics of logistic map and 32-bit PL_LM.CC-BY · From the PDF
Image 2
CC-BY · From the PDF
FIGURE 3 Proposed parallel chaotic system structure.
FIGURE 3 Proposed parallel chaotic system structure.CC-BY · From the PDF
FIGURE 4 Proposed chaotic system.
FIGURE 4 Proposed chaotic system.CC-BY · From the PDF
FIGURE 5 Initial state sensitivity tests.
FIGURE 5 Initial state sensitivity tests.CC-BY · From the PDF
FIGURE 6 Distributions of R(n) with different initial values.
FIGURE 6 Distributions of R(n) with different initial values.CC-BY · From the PDF
FIGURE 7 Information entropy analysis.
FIGURE 7 Information entropy analysis.CC-BY · From the PDF
(b). Information entropy of 32-bit PL_PWL&LCM (y0∈(1,2^31),p1∈(1,2^31))
(b). Information entropy of 32-bit PL_PWL&LCM (y0∈(1,2^31),p1∈(1,2^31))CC-BY · From the PDF
(d). Information entropy of 32-bit PL_PWL&LCM (u=4,x0∈(1,2^32))
(d). Information entropy of 32-bit PL_PWL&LCM (u=4,x0∈(1,2^32))CC-BY · From the PDF
Image 10
CC-BY · From the PDF
FIGURE 8 Permutation-diffusion network used in our system.
FIGURE 8 Permutation-diffusion network used in our system.CC-BY · From the PDF
Image 12
CC-BY · From the PDF
FIGURE 10 Generation of diffusion matrix S d .
FIGURE 10 Generation of diffusion matrix S d .CC-BY · From the PDF
Image 14
CC-BY · From the PDF
FIGURE 11 Image encryption and decryption.
FIGURE 11 Image encryption and decryption.CC-BY · From the PDF
FIGURE 13 Correlation distribution of the original images and the corresponding cipher images in three directions.
FIGURE 13 Correlation distribution of the original images and the corresponding cipher images in three directions.CC-BY · From the PDF
FIGURE 14 Key sensitivity test.
FIGURE 14 Key sensitivity test.CC-BY · From the PDF
FIGURE 15 Histograms of all black and all white image encrypted by the proposed system.
FIGURE 15 Histograms of all black and all white image encrypted by the proposed system.CC-BY · From the PDF
FIGURE 16 Permutation units in odd size image.
FIGURE 16 Permutation units in odd size image.CC-BY · From the PDF
FIGURE 17 Encryption and decryption of odd size image.
FIGURE 17 Encryption and decryption of odd size image.CC-BY · From the PDF
FIGURE 18 Robustness against noise tests.
FIGURE 18 Robustness against noise tests.CC-BY · From the PDF
FIGURE 19 Robustness against data loss tests.
FIGURE 19 Robustness against data loss tests.CC-BY · From the PDF
FIGURE 20 Encryption process of a color image.
FIGURE 20 Encryption process of a color image.CC-BY · From the PDF
FIGURE 21 Color image encryption and decryption.
FIGURE 21 Color image encryption and decryption.CC-BY · From the PDF
Image 25
CC-BY · From the PDF
Image 26
CC-BY · From the PDF
Image 27
CC-BY · From the PDF

Verification

Claims the paper makes

0 Valid · 5 Not valid · 9 Not checked · 91 Own results and interpretations

63 more claims

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

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

Create a free account to see these claims.

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.

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

1 of 1

Citations

Cites

Show all 59 references

Research works printed but not linked: 1

  1. 2020, GMP The GNU Multiple Precision Arithmetic Library

Cited by

See all 51

Metadata

Authors
Li, H., Deng, L., & Gu, Z.
Affiliations
Guangzhou University (CN)
Venue
IEEE Access
Published
2020
Volume
8
Pages
30127-30151
ISSN
2169-3536 (ISSN-L)
OpenAlex
W3005163853
Cited by
51
References
59
Citations by year
2026: 7 · 2025: 6 · 2024: 6 · 2023: 5 · 2022: 6 · 2021: 14 · 2020: 7
FWCI
3.11
Type
journal article
Language
en
Open access
Locations
  • IEEE Access (publishedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
  • National Key R&D Program of China (2019YFB1706003)
  • China Postdoctoral Science Foundation (2019M663358)
  • National Natural Science Foundation of China (61902082)
  • China (U1636215)
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 › Mathematics › Mathematical Physics › Mathematical Dynamics and Fractals
Keywords
image encryption, chaotic maps, piecewise linear chaotic map, pseudorandom number generation, low-precision arithmetic, logistic map, permutation-diffusion

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-29, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-09-29 (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: A Robust Image Encryption Algorithm Based on a 32-bit Chaotic System. https://app.cochat.ai/papers/10.1109/access.2020.2972296
The paper
Li, H., Deng, L., & Gu, Z. (2020). A Robust Image Encryption Algorithm Based on a 32-bit Chaotic System. IEEE Access. https://doi.org/10.1109/access.2020.2972296

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.