Hyperchaotic Maps and the Single Neuron Model: A Novel Framework for Chaos-Based Image Encryption
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
With the explosion of the generation, transmission and sharing of image data over the Internet and other unsecured networks, the need for and significance of the development of novel image encryption algorithms are unprecedented. In this research work, we propose a novel framework for image encryption that is based on two hyperchaotic maps utilized in conjunction with the single neuron model (SNM). The framework entails three successive stages, where in every stage a substitution box (S-box) is applied, then XORing with an encryption key is carried out. The S-boxes and the encryption keys are generated from the numerical solutions of the hyperchaotic maps and the SNM. The performance of the proposed framework is gauged through a number of metrics, reflecting superior performance and complete asymmetry between the plain images and their encrypted versions. The main advantages of this work are (1) vast key space and (2) high encryption efficiency. The superior key space of 22551 is the result of employing the two hyperchaotic maps, while the improved efficiency, resulting in an average encryption rate of 8.54 Mbps, is the result of using the SNM as well as the employment of optimized parallel processing techniques. In addition, the proposed encryption framework is shown to output encrypted images that pass the NIST SP 800 suite. Average achieved values for the metrics include MSE of 9626, PSNR of 8.3 dB, MAE of 80.99, entropy of 7.999, NPCR of 99.6% and UACI of 31.49%.
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 1×
“One of the main advantages of using SPNs in image encryption is their ability to provide a high degree of confusion and diffusion, satisfying Shannon’s theory of secure communication [9].”
Bassham, L. E., Rukhin, A. L., Soto, J., Nechvatal, J. R., Smid, M. E., Barker, E. B., Leigh, S. D., Levenson, M., Vangel, M., Banks, D. L., et al. (2010) · NIST Special Publication 800-22 Revision 1a · doi:10.6028/nist.sp.800-22r1a · Cited by 3,617
SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
ALVAREZ, G., & LI, S. (2006) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127406015970 · Cited by 2,119 · cited 1×
“This computed value far surpasses the threshold suggested earlier in the literature [45], of 2 100 , for successful resistance to brute-force attacks.”
Image encryption based on a combination of multiple chaotic maps
Elkandoz, M. T., & Alexan, W. (2022) · Multimedia Tools and Applications · doi:10.1007/s11042-022-12595-8 · Cited by 172 · cited 4×
“Proposed 0.00180128 − 0.000991502 − 0.000186079 [6] 0.002287 − 0.00132 − 0.00160 [7] 0.003265 − 0.00413 0.002451 [12] 0.0064113 − 0.0015143 0.000568333 [17] 0.00144 − 0.00151 0.00795 [19] − 0.0061 − 0.0018 0.0067 [22] 0.000199 0.003705 − 0.000924 [38] 0.0054 0.0054 0.0016”
InfluentialSelf-citationAlexan, W., Alexan, N., & Gabr, M. (2023) · Fractal and Fractional · doi:10.3390/fractalfract7040287 · Cited by 144 · cited 10×
“Algorithm 1 Generate an S-box given a bitstream b PRNG , the number of S-box trials n , target performance evaluation values M = { NL , SAC , BIC , LAP , DAP } and a bitstream b PRNG (an adaptation from that proposed in [12]) 1.”
InfluentialSelf-citationColor image encryption and authentication using dynamic DNA encoding and hyper chaotic system
Jasra, B., & Hassan Moon, A. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.117861 · Cited by 132 · cited 1×
“Encryption can help prevent unauthorized modifications of the image data by providing a way to verify the authenticity of the image [4].”
A Novel Construction of Efficient Substitution-Boxes Using Cubic Fractional Transformation
Zahid, A. H., Arshad, M. J., & Ahmad, M. (2019) · Entropy · doi:10.3390/e21030245 · Cited by 122
A novel chaotic image cryptosystem based on DNA sequence operations and single neuron model
Ben Slimane, N., Aouf, N., Bouallegue, K., & Machhout, M. (2018) · Multimedia Tools and Applications · doi:10.1007/s11042-018-6145-8 · Cited by 51
Cited by
A new multiple image encryption algorithm using hyperchaotic systems, SVD, and modified RC5
Alexan, W., Youssef, M., Hussein, H. H., Ahmed, K. K., Hosny, K. M., Fathy, A., & Mansour, M. B. M. (2025) · Scientific Reports · doi:10.1038/s41598-025-92065-x · Cited by 91
Self-citationGabr, M., Korayem, Y., Chen, Y.-L., Yee, P. L., Ku, C. S., & Alexan, W. (2023) · IEEE Access · doi:10.1109/access.2023.3326848 · Cited by 79
“The literature review also underscores the importance of S-boxes in image encryption algorithms [13], [16], [17], [18], [19], and [20].”
BackgroundSelf-citationYoussef, M., Gabr, M., Alexan, W., Mansour, M. B. M., Kamal, K., Hosny, H., & El-Damak, D. (2024) · IEEE Access · doi:10.1109/access.2024.3454512 · Cited by 74
Self-citationAlexan, W., Elabyad, N., Khaled, M., Osama, R., El-Damak, D., Abd El Ghany, M. A., Korayem, Y., Mamdouh, E., & Gabr, M. (2024) · IEEE Access · doi:10.1109/access.2024.3446733 · Cited by 53
“To benefit from the large key space offered by the use of hyperchaotic functions, but still maintain a manageable complexity, the authors of [40] employ two hyperchaotic functions, with an SNM in between, for the purposes of image encryption.”
BackgroundSelf-citationBelete, B. A., Gelmecha, D. J., & Singh, R. S. (2025) · The Imaging Science Journal · doi:10.1080/13682199.2025.2454055 · Cited by 9
“Gabr et al. [25,26], and Alexan et al. [27] explored chaos-based encryption using memristive neural networks, the R 3 framework, and hyperchaotic maps, enhancing image security.”
Metadata
- Authors
- Alexan, W., Chen, Y.-L., Por, L. Y., & Gabr, M.
- Venue
- Symmetry
- Publisher
- MDPI AG
- Published
- 2023-05-14
- Volume
- 15
- Issue
- 5
- Pages
- 1081
- ISSN
- 2073-8994 (ISSN-L)
- OpenAlex
- W4381837311
- Cited by
- 97
- References
- 8
- FWCI
- 8.82
- 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.