Eslam Al Maghayreh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Eslam Al Maghayreh has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Awais Mahmood
College of Applied Computer Science, King Saud University, Riyadh 11451, Saudi Arabia
5 shared publications - Habib Dhahri
College of Applied Computer Science, King Saud University, Riyadh 11451, Saudi Arabia
4 shared publications - Faisal Alkhateeb
Computer Sciences Department, Yarmouk University, Irbid, Jordan
3 shared publications - Mohamad Mahmoud Al Rahhal
King Saud University
3 shared publications - Ayoub Alsarhan
Department of Data Science and Artificial Intelligence, Faculty of Information Technology, Al-Ahliyya Amman University, Amman 19111, Jordan
2 shared publications - Fahad Raddah Albogamy
Computer Sciences Program, Mathematics Department, Turabah University College, Taif University, Taif, Saudi Arabia
2 shared publications
Latest Publications
- Open Access
- 3 September 2026
- Published by MDPI AG in Future Internet
- Vol. 18 (9) , 468
QKD-Secured Industrial Smart-Grid Cyber-Physical Systems: Simulation and Q-MambaKAN Detection of Adaptive Side-Channel Attacks
The increasing interconnection of smart-grid operational technology, industrial-edge services, and utility information systems creates a critical need for resilient and continuously monitored industrial cyber-physical communication. Although quantum key distribution (QKD) can strengthen session-key establishment for advanced metering infrastructure, distributed energy resources, substation automation, supervisory control, and utility-core services, practical QKD deployments remain vulnerable to implementation-level side-channel attacks that can compromise the cryptographic protection layer without directly targeting conventional network packets. This paper presents a QKD-secured industrial smart-grid cyber-physical system framework for simulating and detecting adaptive side-channel attacks. The proposed 36-node industrial communication architecture integrates AMI devices, DER controllers, PMU and substation automation components, industrial-edge gateways, QKD modules, key-management services, SCADA and utility-core servers, security-operation-center components, and adversarial access points. A 100,000-record cyber-quantum dataset is generated across 12 operating conditions comprising normal communication and 11 adaptive QKD side-channel attacks: detector blinding, time shift, wavelength switching, Trojan-horse probing, photon-number splitting, decoy-state spoofing, RNG bias, calibration manipulation, local-oscillator manipulation, synchronization spoofing, and combined adaptive quantum hacking. Each scenario introduces coupled primary and secondary perturbations across optical, detector, timing, synchronization, randomness, calibration, photon-statistical, leakage, key-generation, encryption, and industrial-network-performance features. To support intelligent industrial security monitoring, the proposed Quantum-aware Mamba–Kolmogorov–Arnold Network (Q-MambaKAN) organizes device, network, QKD, side-channel, encryption, and risk evidence into an ordered cyber-quantum representation processed through selective state-space learning, side-channel attention, nonlinear KAN mapping, adaptive fusion, and multi-task prediction heads. Results show that the QBER increases from 0.071 during normal operation to 0.426 under combined adaptive quantum hacking, while encryption success decreases from 98.1% to 0%. Q-MambaKAN achieves a 99.48% binary detection accuracy, a 99.70% binary F1-score, a 97.60% multiclass macro-F1, and a risk RMSE of 0.021.
- 3 September 2026
- Published by MDPI AG in Future Internet
- Vol. 18 (9) , 468
Open AccessQKD-Secured Industrial Smart-Grid Cyber-Physical Systems: Simulation and Q-MambaKAN Detection of Adaptive Side-Channel Attacks
The increasing interconnection of smart-grid operational technology, industrial-edge services, and utility information systems creates a critical need for resilient and continuously monitored industrial cyber-physical communication. Although quantum key distribution (QKD) can strengthen session-key establishment for advanced metering infrastructure, distributed energy resources, substation automation, supervisory control, and utility-core services, practical QKD deployments remain vulnerable to implementation-level side-channel attacks that can compromise the cryptographic protection layer without directly targeting conventional network packets. This paper presents a QKD-secured industrial smart-grid cyber-physical system framework for simulating and detecting adaptive side-channel attacks. The proposed 36-node industrial communication architecture integrates AMI devices, DER controllers, PMU and substation automation components, industrial-edge gateways, QKD modules, key-management services, SCADA and utility-core servers, security-operation-center components, and adversarial access points. A 100,000-record cyber-quantum dataset is generated across 12 operating conditions comprising normal communication and 11 adaptive QKD side-channel attacks: detector blinding, time shift, wavelength switching, Trojan-horse probing, photon-number splitting, decoy-state spoofing, RNG bias, calibration manipulation, local-oscillator manipulation, synchronization spoofing, and combined adaptive quantum hacking. Each scenario introduces coupled primary and secondary perturbations across optical, detector, timing, synchronization, randomness, calibration, photon-statistical, leakage, key-generation, encryption, and industrial-network-performance features. To support intelligent industrial security monitoring, the proposed Quantum-aware Mamba–Kolmogorov–Arnold Network (Q-MambaKAN) organizes device, network, QKD, side-channel, encryption, and risk evidence into an ordered cyber-quantum representation processed through selective state-space learning, side-channel attention, nonlinear KAN mapping, adaptive fusion, and multi-task prediction heads. Results show that the QBER increases from 0.071 during normal operation to 0.426 under combined adaptive quantum hacking, while encryption success decreases from 98.1% to 0%. Q-MambaKAN achieves a 99.48% binary detection accuracy, a 99.70% binary F1-score, a 97.60% multiclass macro-F1, and a risk RMSE of 0.021.
- Open Access
A Novel Binary Hybrid PSO-EO Algorithm for Cryptanalysis of Internal State of RC4 Cipher
Cryptography protects privacy and confidentiality. So, it is necessary to guarantee that the ciphers used are secure and cryptanalysis-resistant. In this paper, a new state recovery attack against the RC4 stream cipher is revealed. A plaintext attack is used in which the attacker has both the plaintext and the ciphertext, so they can calculate the keystream and reveal the cipher’s internal state. To increase the quality of answers to practical and recent real-world global optimization difficulties, researchers are increasingly combining two or more variations. PSO and EO are combined in a hybrid PSOEO in an uncertain environment. We may also convert this method to its binary form to cryptanalyze the internal state of the RC4 cipher. When solving the cryptanalysis issue with HBPSOEO, we discover that it is more accurate and quicker than utilizing both PSO and EO independently. Experiments reveal that our proposed fitness function, in combination with HBPSOEO, requires checking 104 possible internal states; however, brute force attacks require checking 2128 states.
Open AccessA Novel Binary Hybrid PSO-EO Algorithm for Cryptanalysis of Internal State of RC4 Cipher
Cryptography protects privacy and confidentiality. So, it is necessary to guarantee that the ciphers used are secure and cryptanalysis-resistant. In this paper, a new state recovery attack against the RC4 stream cipher is revealed. A plaintext attack is used in which the attacker has both the plaintext and the ciphertext, so they can calculate the keystream and reveal the cipher’s internal state. To increase the quality of answers to practical and recent real-world global optimization difficulties, researchers are increasingly combining two or more variations. PSO and EO are combined in a hybrid PSOEO in an uncertain environment. We may also convert this method to its binary form to cryptanalyze the internal state of the RC4 cipher. When solving the cryptanalysis issue with HBPSOEO, we discover that it is more accurate and quicker than utilizing both PSO and EO independently. Experiments reveal that our proposed fitness function, in combination with HBPSOEO, requires checking 104 possible internal states; however, brute force attacks require checking 2128 states.
- Open Access
- 14 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 105286-105296
Particle Swarm Optimization Algorithm for Detecting Distributed Predicates
Metaheuristic algorithms are widely used to solve NP-complete problems in several domains. Distributed predicates detection is a fundamental distributed systems problem that has many useful applications. The problem of distributed predicates detection, in general, is known to be an NP-complete problem. In this paper, we developed a detection algorithm inspired by the particle swarm optimization algorithm, one of the well-known metaheuristic algorithms applied to solve problems in several domains. The proposed detection algorithm deal with distributed predicates under the possibly modality. We compared the performance of the proposed distributed predicates detection algorithm with several other detection algorithms. The experimental results reveal the effectiveness of the suggested distributed predicates detection algorithm.
- 14 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 105286-105296
Open AccessParticle Swarm Optimization Algorithm for Detecting Distributed Predicates
Metaheuristic algorithms are widely used to solve NP-complete problems in several domains. Distributed predicates detection is a fundamental distributed systems problem that has many useful applications. The problem of distributed predicates detection, in general, is known to be an NP-complete problem. In this paper, we developed a detection algorithm inspired by the particle swarm optimization algorithm, one of the well-known metaheuristic algorithms applied to solve problems in several domains. The proposed detection algorithm deal with distributed predicates under the possibly modality. We compared the performance of the proposed distributed predicates detection algorithm with several other detection algorithms. The experimental results reveal the effectiveness of the suggested distributed predicates detection algorithm.
- Open Access
- 3 March 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (5) , 2238
Detecting Crop Circles in Google Earth Images with Mask R-CNN and YOLOv3
Automatic detection and counting of crop circles in the desert can be of great use for large-scale farming as it enables easy and timely management of the farming land. However, so far, the literature remains short of relevant contributions in this regard. This letter frames the crop circles detection problem within a deep learning framework. In particular, accounting for their outstanding performance in object detection, we investigate the use of Mask R-CNN (Region Based Convolutional Neural Networks) as well as YOLOv3 (You Only Look Once) models for crop circle detection in the desert. In order to quantify the performance, we build a crop circles dataset from images extracted via Google Earth over a desert area in the East Oweinat in the South-Western Desert of Egypt. The dataset totals 2511 crop circle samples. With a small training set and a relatively large test set, plausible detection rates were obtained, scoring a precision of 1 and a recall of about 0.82 for Mask R-CNN and a precision of 0.88 and a recall of 0.94 regarding YOLOv3.
- 3 March 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (5) , 2238
Open AccessDetecting Crop Circles in Google Earth Images with Mask R-CNN and YOLOv3
Automatic detection and counting of crop circles in the desert can be of great use for large-scale farming as it enables easy and timely management of the farming land. However, so far, the literature remains short of relevant contributions in this regard. This letter frames the crop circles detection problem within a deep learning framework. In particular, accounting for their outstanding performance in object detection, we investigate the use of Mask R-CNN (Region Based Convolutional Neural Networks) as well as YOLOv3 (You Only Look Once) models for crop circle detection in the desert. In order to quantify the performance, we build a crop circles dataset from images extracted via Google Earth over a desert area in the East Oweinat in the South-Western Desert of Egypt. The dataset totals 2511 crop circle samples. With a small training set and a relatively large test set, plausible detection rates were obtained, scoring a precision of 1 and a recall of about 0.82 for Mask R-CNN and a precision of 0.88 and a recall of 0.94 regarding YOLOv3.
- Open Access
- 1 January 2020
- Published by Tech Science Press in Computers, Materials & Continua
- Vol. 66 (1) , 315-329
Prediction of COVID-19 Confirmed Cases Using Gradient Boosting Regression Method
The fast spread of coronavirus disease (COVID-19) caused by SARSCoV-2 has become a pandemic and a serious threat to the world. As of May 30, 2020, this disease had infected more than 6 million people globally, with hundreds of thousands of deaths. Therefore, there is an urgent need to predict confirmed cases so as to analyze the impact of COVID-19 and practice readiness in healthcare systems. This study uses gradient boosting regression (GBR) to build a trained model to predict the daily total confirmed cases of COVID-19. The GBR method can minimize the loss function of the training process and create a single strong learner from weak learners. Experiments are conducted on a dataset of daily confirmed COVID-19 cases from January 22, 2020, to May 30, 2020. The results are evaluated on a set of evaluation performance measures using 10-fold cross-validation to demonstrate the effectiveness of the GBR method. The results reveal that the GBR model achieves 0.00686 root mean square error, the lowest among several comparative models.
- 1 January 2020
- Published by Tech Science Press in Computers, Materials & Continua
- Vol. 66 (1) , 315-329
Open AccessPrediction of COVID-19 Confirmed Cases Using Gradient Boosting Regression Method
The fast spread of coronavirus disease (COVID-19) caused by SARSCoV-2 has become a pandemic and a serious threat to the world. As of May 30, 2020, this disease had infected more than 6 million people globally, with hundreds of thousands of deaths. Therefore, there is an urgent need to predict confirmed cases so as to analyze the impact of COVID-19 and practice readiness in healthcare systems. This study uses gradient boosting regression (GBR) to build a trained model to predict the daily total confirmed cases of COVID-19. The GBR method can minimize the loss function of the training process and create a single strong learner from weak learners. Experiments are conducted on a dataset of daily confirmed COVID-19 cases from January 22, 2020, to May 30, 2020. The results are evaluated on a set of evaluation performance measures using 10-fold cross-validation to demonstrate the effectiveness of the GBR method. The results reveal that the GBR model achieves 0.00686 root mean square error, the lowest among several comparative models.
- Open Access
- 1 January 2020
- Published by Wiley in BioMed Research International
- Vol. 2020 (1) , 7638969
Corrigendum to “Tabu Search and Machine‐Learning Classification of Benign and Malignant Proliferative Breast Lesions”
In the article titled “Tabu Search and Machine-Learning Classification of Benign and Malignant Proliferative Breast Lesions” [1], author Dr. Eslam Al Maghayreh was not affiliated to “College of Applied Computer Sciences (CACS), Al-Muzahimiyah Branch, King Saud University, Riyadh, Saudi Arabia” which is incorrect. The corrected list of affiliations is shown in the author information above.
- 1 January 2020
- Published by Wiley in BioMed Research International
- Vol. 2020 (1) , 7638969
Open AccessCorrigendum to “Tabu Search and Machine‐Learning Classification of Benign and Malignant Proliferative Breast Lesions”
In the article titled “Tabu Search and Machine-Learning Classification of Benign and Malignant Proliferative Breast Lesions” [1], author Dr. Eslam Al Maghayreh was not affiliated to “College of Applied Computer Sciences (CACS), Al-Muzahimiyah Branch, King Saud University, Riyadh, Saudi Arabia” which is incorrect. The corrected list of affiliations is shown in the author information above.
- Open Access
- 1 January 2020
- Published by Wiley in BioMed Research International
- Vol. 2020 (1) , 4671349
Tabu Search and Machine‐Learning Classification of Benign and Malignant Proliferative Breast Lesions
Breast cancer is the most diagnosed cancer among women around the world. The development of computer‐aided diagnosis tools is essential to help pathologists to accurately interpret and discriminate between malignant and benign tumors. This paper proposes the development of an automated proliferative breast lesion diagnosis based on machine‐learning algorithms. We used Tabu search to select the most significant features. The evaluation of the feature is based on the dependency degree of each attribute in the rough set. The categorization of reduced features was built using five machine‐learning algorithms. The proposed models were applied to the BIDMC‐MGH and Wisconsin Diagnostic Breast Cancer datasets. The performance measures of the used models were evaluated owing to five criteria. The top performing models were AdaBoost and logistic regression. Comparisons with others works prove the efficiency of the proposed method for superior diagnosis of breast cancer against the reviewed classification techniques.
- 1 January 2020
- Published by Wiley in BioMed Research International
- Vol. 2020 (1) , 4671349
Open AccessTabu Search and Machine‐Learning Classification of Benign and Malignant Proliferative Breast Lesions
Breast cancer is the most diagnosed cancer among women around the world. The development of computer‐aided diagnosis tools is essential to help pathologists to accurately interpret and discriminate between malignant and benign tumors. This paper proposes the development of an automated proliferative breast lesion diagnosis based on machine‐learning algorithms. We used Tabu search to select the most significant features. The evaluation of the feature is based on the dependency degree of each attribute in the rough set. The categorization of reduced features was built using five machine‐learning algorithms. The proposed models were applied to the BIDMC‐MGH and Wisconsin Diagnostic Breast Cancer datasets. The performance measures of the used models were evaluated owing to five criteria. The top performing models were AdaBoost and logistic regression. Comparisons with others works prove the efficiency of the proposed method for superior diagnosis of breast cancer against the reviewed classification techniques.
- Open Access
- 4 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 161584-161593
An Adaptive Image Contrast Enhancement Technique for Low-Contrast Images
- 4 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 161584-161593
Open AccessAn Adaptive Image Contrast Enhancement Technique for Low-Contrast Images
- 11 August 2014
- Published by IGI Global Scientific Publishing
- p. 142-157
Searching and Generating Authoring Information
In this paper, the authors propose a novel approach to search and retrieve authoring information from online authoring databases. The proposed approach combines keywords and semantic-based methods. In this approach, the user can retrieve such information considering some specified keywords and ignore how the internal semantic search is being processed. The keywords entered by the user are internally converted by the system to a semantic query that will be used to search the requested information. The authors then use (X)HTML-based templates for the automatic construction of BibTeX elements from the query results.
- 11 August 2014
- Published by IGI Global Scientific Publishing
- p. 142-157
Searching and Generating Authoring Information
In this paper, the authors propose a novel approach to search and retrieve authoring information from online authoring databases. The proposed approach combines keywords and semantic-based methods. In this approach, the user can retrieve such information considering some specified keywords and ignore how the internal semantic search is being processed. The keywords entered by the user are internally converted by the system to a semantic query that will be used to search the requested information. The authors then use (X)HTML-based templates for the automatic construction of BibTeX elements from the query results.