A Novel Chaotic Permutation-Substitution Image Encryption Scheme Based on Logistic Map and Random Substitution
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Privacy is a serious concern related to sharing videos or images among people over the Internet. As a method to preserve images’ privacy, chaos-based image encryption algorithms have been used widely to fulfil such a requirement. However, these algorithms suffer from a low key-space, significant computational overhead, and a lag in resistance against differential attacks. This paper presents a novel chaos-based image encryption method based on permutation and substitution using a single Substitution Box (S-Box) to address issues in contemporary image encryption algorithms. The proposed encryption technique’s efficiency is validated through extensive experiments as compared to the state-of-the-art encryption algorithms using different measures and benchmarks. Precisely, the collected results demonstrate that the proposed technique is more resilient against well-known statistical attacks and performs well under plaintext attacks. Indeed, the proposed scheme exhibits very high sensitivity concerning the plaintext attack. A minor change in the encryption key or the plain text would result in a completely different encrypted image.
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
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 2×
“Particularly in this context, an encryption method is considered more efficient if altering a bit in the key results in a different encrypted image [8].”
BackgroundMethodA Survey of Lightweight-Cryptography Implementations
Eisenbarth, T., Kumar, S., Paar, C., Poschmann, A., & Uhsadel, L. (2007) · IEEE Design & Test of Computers · doi:10.1109/mdt.2007.178 · Cited by 479 · cited 1×
“AES S-Box is comparatively better than other S-Boxes in cryptographic systems in terms of global avalanche criterion, non-linearity, and better resistance against external attacks [25], [26].”
BackgroundLogistic map: A possible random-number generator
Phatak, S. C., & Rao, S. S. (1995) · Physical Review E · doi:10.1103/physreve.51.3670 · Cited by 233
Sanap, S. D., & More, V. (2021) · 2021 3rd International Conference on Signal Processing and Communication (ICPSC) · doi:10.1109/icspc51351.2021.9451784 · Cited by 27
Cited by
A Lightweight Image Encryption Algorithm Based on Chaotic Map and Random Substitution
Alghamdi, Y., Munir, A., & Ahmad, J. (2022) · Entropy · doi:10.3390/e24101344 · Cited by 97
“[7] is better than the proposed algorithm for some encrypted images, the average of the proposed method is still generally better.”
BackgroundSelf-citationImage encryption algorithm based on factorial decomposition
AlShaikh, M., Alzaqebah, M., Gmati, N., Alrefai, N., Alsmadi, M. K., Almarashdeh, I., Mohammad, R. M. A., Alamri, S., & Kara, M. (2024) · Multimedia Tools and Applications · doi:10.1007/s11042-023-17663-1 · Cited by 21
“[ 13 ] “ A nov e l c h a o ti c p e r m u t a ti on - s ub - s tit u ti on i m a g e e n c r yp ti on s c h e m e b a s e d on l og i s ti c m a p a nd r a ndo m s ub s tit u ti on ” P r opo s e s a nov e l i m a g e e n c r yp ti on s c h e m e c o m b i n i ng c h a o ti c p e r-m u t a ti on a…”
Mallick, B., Parida, P., Nayak, C., Ali, N., Panda, M. K., Prasad, B., Sahu, G., & Palai, G. (2025) · Alexandria Engineering Journal · doi:10.1016/j.aej.2025.02.113 · Cited by 20
Verification of a Multi-Stage Chaotic Image Encryption Architecture Using MATLAB and VIVADO
Bupaal.S, H., Raja, A., Maran, P., & Mathivanan, P. (2026) · 2026 International Conference on Wireless Communications Signal Processing and Networking (WiSPNET) · doi:10.1109/wispnet69615.2026.11489439
Metadata
- Authors
- Arif, J., Khan, M. A., Ghaleb, B., Ahmad, J., Munir, A., Rashid, U., & Al-Dubai, A. Y.
- Venue
- IEEE Access
- Published
- 2022
- Volume
- 10
- Pages
- 12966-12982
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W4210663935
- Cited by
- 122
- References
- 4
- FWCI
- 8.74
- Type
- journal article
- Language
- en
- Open access
- gold
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
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.