Image encryption algorithm based on factorial decomposition
The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
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?
In the citing paper
“On the one hand, CCS has strong nonlinearity and higher Lyapunov exponent, which can generate highly complex trajectories in the complex domain, making it suitable for improving the unpredictability of key streams28.”
From Big data information security encryption scheme based on complex chaotic systems in the Internet of Things (2026) · cites this paper as [28]
Citations
Cites
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270 · cited 1×
“Classical discrete Hopfield neural networks were introduced by physicist Hopfield in 1982 [36].”
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 1×
“In his paper [26], Shannon established that a perfect password can be represented by a Latin square.”
Hopfield, J. J. (1984) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.81.10.3088 · Cited by 6,918 · cited 1×
“Two years later, Hopfield planned a circuit to execute a constant Hopfield neural network by modelling the networks between neurons through electronic circuits [37].”
Advanced Encryption Standard (AES)
Heron, S. (2009) · Network Security · doi:10.1016/s1353-4858(10)70006-4 · Cited by 1,216
Aihara, K., Takabe, T., & Toyoda, M. (1990) · Physics Letters A · doi:10.1016/0375-9601(90)90136-c · Cited by 1,175
Baptista, M. S. (1998) · Physics Letters A · doi:10.1016/s0375-9601(98)00086-3 · Cited by 885 · cited 1×
“…redundancy, and correlation, traditional techniques such as AES [1], DES, MD5 [2], and RSA [3] are not appropriate to modern image encryption approaches which are focusing on more light, less complexity and redundancy, and high correlation approaches such as Chaos-based encryption techniques [4–6].”
Color image encryption based on one-time keys and robust chaotic maps
Liu, H., & Wang, X. (2010) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2010.03.017 · Cited by 548 · cited 1×
“This problem is also obtained with Latin square algorithms in another research [17, 22, 27, 28].”
A fast image encryption algorithm based on chaotic map
Liu, W., Sun, K., & Zhu, C. (2016) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2016.03.019 · Cited by 487 · cited 1×
“To decrease the robust association of adjoining pixels, some researchers suggested a quantity of image encryption approaches using a 2D Arnold cat map [29–31].”
A novel image encryption scheme based on substitution-permutation network and chaos
Belazi, A., Abd El-Latif, A. A., & Belghith, S. (2016) · Signal Processing · doi:10.1016/j.sigpro.2016.03.021 · Cited by 486 · cited 2×
“Proposed approach 0.0019 7.9865 [14] 0.0422 7.7970 [15] 0.0032 7.9220 [5] 0.0583 7.7395 [47] 0.0254 7.8495 A ciphertext image C 1 = C 1 i , j and a ciphertext image C 2 = C 2 i , j have only one difference between their plaintext images.”
InfluentialColor image encryption using orthogonal Latin squares and a new 2D chaotic system
Hua, Z., Zhu, Z., Chen, Y., & Li, Y. (2021) · Nonlinear Dynamics · doi:10.1007/s11071-021-06472-6 · Cited by 289
Research works printed but not linked: 2
- El-Khamyl S, Abou El-Nasr M, and El-Zein A (2009) An encryption scheme for images based on the DWT and a chaotic cipher. 2009 National Radio Science Conference. IEEE
- Wang X et al (2022) A new image encryption algorithm based on Latin square matrix. Nonlinear Dynam 107(1):1277–1293 · DOI
Cited by
A password-based authentication approach for edge computing architectures
Kenioua, L., Lejdel, B., Alamri, S., & Ramadan, Q. (2024) · Egyptian Informatics Journal · doi:10.1016/j.eij.2024.100543 · Cited by 12
Self-citationIntelligent Acting Digital Twins (IADT)
Bounceur, A., & Kara, M. (2025) · IEEE Access · doi:10.1109/access.2025.3532545 · Cited by 10
Self-citationLightweight and Efficient Post Quantum Key Encapsulation Mechanism Based on Q-Problem
Kara, M., Κarampidis, K., Panagiotakis, S., Hammoudeh, M. A. A., Felemban, M., & Papadourakis, G. M. (2025) · Electronics · doi:10.3390/electronics14040728 · Cited by 9
Self-citationImproved Resilience of Image Encryption Based on Hybrid TEA and RSA Techniques
AlShaikh, M., Alkhalifah, A. M., & Alamri, S. (2025) · Computer Systems Science and Engineering · doi:10.32604/csse.2025.062433 · Cited by 3
Self-citationA Post-Quantum Public-Key Signcryption Scheme over Scalar Integers Based on a Modified LWE Structure
Kara, M., Hammoudeh, M. A. A., Alamri, A., & Alamri, S. (2025) · Sensors · doi:10.3390/s25154728 · Cited by 3
“Specifically, quantum algorithms can break encryption systems based on integer factorization and discrete logarithms in polynomial time, rendering many conventional public-key infrastructures vulnerable [3–5].”
Self-citation
Metadata
- Authors
- AlShaikh, M., Alzaqebah, M., Gmati, N., Alrefai, N., Alsmadi, M. K., Almarashdeh, I., Mohammad, R. M. A., Alamri, S., & Kara, M.
- Affiliations
- Saudi Electronic University (SA)
- Imam Abdulrahman Bin Faisal University (SA)
- National Higher School of Mathematics (DZ)
- Corresponding author
- AlShaikh, Muath
- ORCID
- Venue
- Multimedia Tools and Applications
- Published
- 2024-01-03
- Volume
- 83
- Issue
- 40
- Pages
- 88447-88467
- ISSN
- 1380-7501 (ISSN-L)
- 1573-7721
- OpenAlex
- W4390541587
- Cited by
- 21
- References
- 47
- Citations by year
- 2026: 3 · 2025: 12 · 2024: 6
- FWCI
- 2.68
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- 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 › Artificial Intelligence › Cryptographic Implementations and Security
- Keywords
- image encryption, permutation-based encryption, key generation, pixel permutation, matrix permutation, NPCR, UACI, sensitivity analysis, computational complexity
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: Image encryption algorithm based on factorial decomposition. https://app.cochat.ai/papers/10.1007/s11042-023-17663-1
- The paper
- AlShaikh, M., Alzaqebah, M., Gmati, N., Alrefai, N., Alsmadi, M. K., Almarashdeh, I., Mohammad, R. M. A., Alamri, S., & Kara, M. (2024). Image encryption algorithm based on factorial decomposition. Multimedia Tools and Applications. https://doi.org/10.1007/s11042-023-17663-1
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.