An effective multiple-image encryption algorithm based on 3D cube and hyperchaotic map
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
In accordance with the principle that the cube graph can be obtained by superimposing planes, a multiple-image encryption scheme based on hyperchaotic map and 3D cube is designed in this paper. Multiple images are segmented by columns, and a regular cube is obtained by stacking multiple fixed-size planes. Each stacked plane is considered as a stacked plane of the cube along the z-axis direction. Firstly, each tangent plane is rotated by different angles in the counterclockwise direction and then DNA encoded, followed by face swap, row swap, and column swap in turn. Then, the DNA-encoded image cube is subjected to DNA addition with the chaotic cube. Finally, two DNA sequences are randomly selected for DNA mutation. The mutated cube is decoded into a digital cube by DNA and the multiple-image encryption algorithm is completed. Theoretically, the cube used in the encryption process can be infinitely large, which means that the number and the size of 2D images that can be encrypted can be unrestricted. Experimental simulations and performance tests prove that the proposed image encryption scheme is effective and secure.
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.
Integrity signals
Registry
Cites
Statistics
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.
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
Harnessing Nonlinearity: Predicting Chaotic Systems and Saving Energy in Wireless Communication
Jaeger, H., & Haas, H. (2004) · Science · doi:10.1126/science.1091277 · Cited by 3,811 · cited 1×
“It was widely studied as soon as it was discovered, and after decades of development, chaos theory was gradually refined (Gan et al., 2018; Kadhim et al., 2018; Bao et al., 2019; Herbert and Harald, 2004; Aihara et al., 2009; Pecora and Carroll, 1991; Wang et al., 2020b).”
A color image cryptosystem based on dynamic DNA encryption and chaos
Chai, X., Fu, X., Gan, Z., Lu, Y., & Chen, Y. (2019) · Signal Processing · doi:10.1016/j.sigpro.2018.09.029 · Cited by 573 · cited 1×
“Therefore, SIE algorithms and MIE algorithms using chaotic systems have become a hot point for research in the field of secure communication (Chai et al., 2019a; Chai et al., 2019b; Hua et al., 2021; Wang and Liu, 2021).”
Chen, L.-P., Yin, H., Yuan, L.-G., Lopes, A. M., Machado, J. A. T., & Wu, R.-C. (2020) · Frontiers of Information Technology & Electronic Engineering · doi:10.1631/fitee.1900709 · Cited by 80
Cited by
Yu, F., Xu, S., Xiao, X., Yao, W., Huang, Y., Cai, S., Yin, B., & Li, Y. (2023) · Integration · doi:10.1016/j.vlsi.2023.01.006 · Cited by 86
A new fast multiple color image encryption algorithm
Alexan, W., Hosny, K., & Gabr, M. (2025) · Cluster Computing · doi:10.1007/s10586-024-04919-0 · Cited by 79
“The authors of [20] propose an MIEA that positions images as segments within a 3D cube, utilizing hyperchaotic map sequences for permutations and diffusion.”
He, C., Chen, Z., Wang, L., Wu, X., Liu, T., & Long, B. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad3409 · Cited by 11
5D chaotic map-based image encryption trade-off analysis on various stages of encryption
R, V. R., V, V. K., R, M., & K, Y. (2025) · EURASIP Journal on Advances in Signal Processing · doi:10.1186/s13634-025-01255-2 · Cited by 7
Metadata
- Authors
- Gao, X., Mou, J., Banerjee, S., Cao, Y., Xiong, L., & Chen, X.
- Venue
- Journal of King Saud University - Computer and Information Sciences
- Published
- 2022-04
- Volume
- 34
- Issue
- 4
- Pages
- 1535-1551
- ISSN
- 1319-1578 (ISSN-L)
- OpenAlex
- W4213172197
- Cited by
- 175
- References
- 3
- FWCI
- 12.87
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: An effective multiple-image encryption algorithm based on 3D cube and hyperchaotic map. https://app.cochat.ai/papers/10.1016/j.jksuci.2022.01.017
- The paper
- Gao, X., Mou, J., Banerjee, S., Cao, Y., Xiong, L., & Chen, X. (2022). An effective multiple-image encryption algorithm based on 3D cube and hyperchaotic map. Journal of King Saud University - Computer and Information Sciences. https://doi.org/10.1016/j.jksuci.2022.01.017
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.