Cited by 79Chaos-based Image/Signal EncryptionComputer Science and EngineeringAdvanced Steganography and Watermarking Techniques

A new fast multiple color image encryption algorithm

Open access
Alexan, Wassim, Hosny, Khalid, Gabr, Mohamed·2025·Cluster Computing

Abstract

This article proposes a novel multiple-image encryption algorithm (MIEA) that utilizes parallel processing. The proposed MIEA combines multiple plain images, forming a plain image cube. The proposed MIEA is based on the generation and logical XORing of novel pseudo-random encryption keys from the hyperchaotic 4D Chen system and the Mersenne Twister, as well as the construction of six novel S-boxes from the hyperchaotic 4D Chen system and their application on each of the RGB color channels of the image cube, and each of its axial directions (x, y, z). The proposed MIEA is shown to be highly secure, highly efficient, and robust against a multitude of attacks. Average computed performance evaluation metrics values include an MSE of 10281.1, PSNR of 8.07 dB, MAE of 82.82, information entropy of 7.999, NPCR of $$99.62\%$$ 99.62 % , and UACI of $$33.3\%$$ 33.3 % . Moreover, images are encrypted at a rate of 96.4 Mbps, and a key space $$2^{4624}$$ 2 4624 is achieved. Bit-streams of encrypted images are shown to pass the NIST SP-800 statistical suite of tests successfully. The proposed MIEA is a novel and prime candidate for the real-time secure transmission of batches of images in industrial informatics milieu.

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1007/s10586-024-04919-0

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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?

  • Multiple image encryption schemes combine several images into a single augmented representation before encryption.

    “Unlike traditional approaches that encrypt each image individually in sequence, multiple image encryption schemes combine several images into a single augmented representation before encryption7,8.”

Self-check

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

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

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Alexan, W., Hosny, K., & Gabr, M.
Affiliations
  • German University in Cairo (EG)
  • Zagazig University (EG)
Corresponding author
Hosny, Khalid
Venue
Cluster Computing
Published
2025-04-28
Volume
28
Issue
5
ISSN
  • 1386-7857 (ISSN-L)
  • 1573-7543
OpenAlex
W4409870708
Cited by
79
References
2
Citations by year
2026: 51 · 2025: 28
FWCI
27.93
Type
journal article
Language
en
Open access
Locations
Cluster Computing (publishedVersion, cc-by)
Funders
Zagazig University
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
multi-image encryption, color image encryption, Mersenne Twister, S-box design, parallel computing, RGB color channels, key space, real-time image transmission

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