Image encryption based on a combination of multiple chaotic maps
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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 scheme has an encryption time of 0.2817s, significantly faster than 0.7528s in reference 20 and 3.0019s in reference 30.
“The results in Table 16 highlight the superior computational efficiency of the proposed scheme, with an encryption time of 0.2817s, significantly faster than 0.7528s in20 and 3.0019s in30.”
From A chaos-based augmented image encryption scheme for satellite images using Fredkin logic (2025) · cites this paper as [30]
The proposed algorithm has a key space of 2^5102, surpassing most existing methods, including 2^4624 in reference 36 and 2^554 in reference 30.
“With a key space of 2^{5102}, the proposed algorithm surpasses most existing methods, including those with substantial key spaces such as36 2^{4624} and30 (2^{554}).”
From A chaos-based augmented image encryption scheme for satellite images using Fredkin logic (2025) · cites this paper as [30]
Cites
Color image encryption based on hybrid hyper-chaotic system and cellular automata
Yaghouti Niyat, A., Moattar, M. H., & Niazi Torshiz, M. (2017) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2016.10.019 · Cited by 383 · see citing works
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
Self-citationBelete, B. A., Gelmecha, D. J., & Singh, R. S. (2025) · The Imaging Science Journal · doi:10.1080/13682199.2025.2454055 · Cited by 9 · see citing works
Alqahtani, N. (2025) · IEEE Access · doi:10.1109/access.2025.3541833 · Cited by 5 · see citing works
- Authors
- Elkandoz, M. T., & Alexan, W.
- Corresponding author
- Alexan, Wassim
- ORCID
- Alexan, Wassim
- Venue
- Multimedia Tools and Applications
- Published
- 2022-03-23
- Volume
- 81
- Issue
- 18
- Pages
- 25497-25518
- ISSN
- 1380-7501 (ISSN-L)
- 1573-7721
- OpenAlex
- W4289813026
- Cited by
- 172
- References
- 1
- Citations by year
- 2026: 29 · 2025: 40 · 2024: 39 · 2023: 49 · 2022: 15
- FWCI
- 11.70
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Multimedia Tools and Applications (publishedVersion)
- 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
- image encryption, chaotic maps, confusion and diffusion, pixel shuffling, XOR diffusion, secret key generation, differential attack resistance, statistical attack resistance, secure 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
