A new fast multiple color image encryption algorithm
Open accessAbstract
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.
Integrity signals
Registry
Cites
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.
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.”
From A chaos-based augmented image encryption scheme for satellite images using Fredkin logic (2025) · cites this paper as [7]
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
Differential cryptanalysis of DES-like cryptosystems
Biham, E., & Shamir, A. (1991) · Journal of Cryptology · doi:10.1007/bf00630563 · Cited by 2,914 · see citing works
Sun, J., Li, C., Wang, Z., & Wang, Y. (2024) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2023.3312405 · Cited by 172 · cited 1× · see citing works
“The contributions of this research paper are: First, the proposed MIEA is suitable for efficient encryption of several color images simultaneously, which makes it ideal for encrypting large data sets of medical images [41].”
Flagged first, then by citations
Cited by
Sorted by citations
Alexan, W., & Megalli, Y. (2025) · Discover Electronics · doi:10.1007/s44291-025-00116-4 · Cited by 37 · see citing works
Self-citationA chaos-based augmented image encryption scheme for satellite images using Fredkin logic
Alexan, W., Maher, E. A., Mamdouh, E., Youssef, M., & Ehab, N. (2025) · Scientific Reports · doi:10.1038/s41598-025-22008-z · Cited by 20 · see citing works
“This adaptability does not compromise the file size or format, which is essential for large-scale applications such as satellite imagery or streaming services 1,7 .”
Self-citationMeng, F., Wu, G., & Zhang, J. (2025) · Journal of King Saud University Computer and Information Sciences · doi:10.1007/s44443-025-00163-7 · Cited by 14 · see citing works
“Subsequently, they designed a multiple color image encryption algorithm based on the hyperchaotic system (Alexan et al. 2025a, 2025b).”
Hyperchaotic fractional-order image encryption with Knight’s tour scrambling for satellite imagery
Mamdouh, E., Aboshousha, A., & Alexan, W. (2026) · Scientific Reports · doi:10.1038/s41598-026-58982-1 · Cited by 3 · see citing works
Self-citation
- 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
- hybrid
- doi.org
- 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