Cited by 10Chaos-based Image/Signal EncryptionMetaheuristic Optimization Algorithms ResearchComputer Science and Engineering

Enhancing colour image encryption through parameters optimization of memristive hyperchaotic system with CPSO algorithm and LSAIM

Belete, Biniyam Ayele, Gelmecha, Demissie Jobir, Singh, Ram Sewak·2025·The Imaging Science Journal

Abstract

Particle Swarm Optimization (PSO) is a simple and effective algorithm for optimization. However, it often converges too early and depends heavily on proper parameter settings for good results, especially in complex or high-dimensional search spaces. Therefore, this algorithm is inappropriate for parameter optimization of hyperchaotic systems and may not provide sufficient robustness and security of colour images. This study presents a new colour image encryption based on optimizing a four-dimensional Memristor-based hyperchaotic system, in which the fourteen parameters of the hyperchaotic system are optimized by the Chaotic Particle Swarm Optimization (CPSO) method, in combination with DNA code and a new logistic sine adjusted integrated map (LSAIM). Simulation results have shown that the algorithm achieved a key space of up to 21116, providing sufficient protection against brute-force attacks, with entropy values close to the ideal (7.9994), NPCR of 99.6178%, and UACI of 33.965%, indicating robust security.

Integrity signals

Registry

Crossref · 10.1080/13682199.2025.2454055

Cites

72 of 72 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • The proposed method achieves an entropy value of 7.9973, which is very close to the theoretical ideal of 8 and comparable to the best results reported in the literature.

    “As summarized in Table 9, the proposed method achieves an entropy value of 7.9973, which is very close to the theoretical ideal of 8 and comparable to the best results reported in the literature (e.g.,20,29).”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Belete, B. A., Gelmecha, D. J., & Singh, R. S.
Affiliations
Adama Science and Technology University (ET)
Corresponding author
Gelmecha, Demissie Jobir
Venue
The Imaging Science Journal
Published
2025-01-21
Volume
73
Issue
6
Pages
681-701
ISSN
  • 1368-2199 (ISSN-L)
  • 1743-131X
OpenAlex
W4406662105
Cited by
9
References
72
Citations by year
2026: 5 · 2025: 4
FWCI
3.18
Type
journal article
Language
en
Open access
closed
Locations
The Imaging Science Journal (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
  • Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
Keywords
color image encryption, chaotic particle swarm optimization, DNA codes, key space, brute-force attack resistance, NPCR, UACI

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