Raad S. Al-Qassas
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
Research Subjects
Raad S. Al-Qassas has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Malik Qasaimeh
Department of Software Engineering, Jordan University of Science and Technology, Irbid 22110, Jordan
10 shared publications Malik Qasaimeh
Jordan University of Science and Technology, Irbid, Jordan
5 shared publicationsM. Ould-Khaoua
University of Glasgow, UK
3 shared publicationsFahd AlDosari
2 shared publicationsL.M. Mackenzie
University of Glasgow, UK
2 shared publicationsNour S. Darwazeh
2 shared publications
Latest Publications
- Open Access
Randomness-Driven Evaluation of SPN-Based Lightweight Ciphers for IoT Applications
Lightweight devices are becoming a crucial part of networked systems, including Internet of Things environments. These devices usually have constraints, such as limited computational power, which have directed researchers to develop lightweight crypto algorithms to secure the data generated by these devices. Therefore, an efficient but secure crypto algorithm for these devices is required. In this paper, we thoroughly evaluate well-known SPN-based algorithms, namely AES, LED, PRESENT, ASCON-128, and ASCON-128a, based on the success rates of statistical randomness tests, including the Frequency, Runs, Discrete Fourier Transform, and Cumulative Sum tests. With these tests, the assessment measures the algorithms’ ability to produce unpredictable text. To ensure thorough evaluation, the experiments included approximately 19,000 image files of varying sizes up to 2560 KB. The extensive experimental results show that the ASCON family achieved high success rates above 98% in all tests, particularly for small file sizes, while AES achieved higher success rates for larger file sizes, and LED showed limited performance for the varied file sizes. The results confirm that ASCON-128 and ASCON-128a offer the needed trade-off between computation and randomness validation. Based on this evaluation, we propose an adaptive encryption framework based on file size, data classification, and device computational power.
Open AccessRandomness-Driven Evaluation of SPN-Based Lightweight Ciphers for IoT Applications
Lightweight devices are becoming a crucial part of networked systems, including Internet of Things environments. These devices usually have constraints, such as limited computational power, which have directed researchers to develop lightweight crypto algorithms to secure the data generated by these devices. Therefore, an efficient but secure crypto algorithm for these devices is required. In this paper, we thoroughly evaluate well-known SPN-based algorithms, namely AES, LED, PRESENT, ASCON-128, and ASCON-128a, based on the success rates of statistical randomness tests, including the Frequency, Runs, Discrete Fourier Transform, and Cumulative Sum tests. With these tests, the assessment measures the algorithms’ ability to produce unpredictable text. To ensure thorough evaluation, the experiments included approximately 19,000 image files of varying sizes up to 2560 KB. The extensive experimental results show that the ASCON family achieved high success rates above 98% in all tests, particularly for small file sizes, while AES achieved higher success rates for larger file sizes, and LED showed limited performance for the varied file sizes. The results confirm that ASCON-128 and ASCON-128a offer the needed trade-off between computation and randomness validation. Based on this evaluation, we propose an adaptive encryption framework based on file size, data classification, and device computational power.
- Open Access
- 20 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 34769-34789
Adaptive and Secure Three-Level Steganography Scheme With Random Distribution and Parity Coding
Data hiding has become crucial for ensuring information confidentiality in response to the increasing capabilities of modern decryption tools. This paper presents a novel steganographic approach based on Least Significant Bit manipulation to counter visual and statistical attacks. The proposed approach introduces a three-level steganography scheme that employs binary cover generation, Quick Response codes, and data embedding into Red, Green, and Blue image channels using parity coding and smoothing functions. Its key features include random data distribution across levels, adaptive pixel capacity, and the elimination of repetitive encryption processes. The approach achieves a maximum data hiding capacity of 9 bits per pixel while maintaining flexibility for varying secret message sizes. Experimental results examining standard test images demonstrate high robustness and imperceptibility, assessed through Peak Signal-to-Noise Ratio, Structural Similarity Index Measure, and Mean Squared Error metrics. These findings emphasize the efficacy of the proposed approach for secure data hiding in digital images.
- 20 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 34769-34789
Open AccessAdaptive and Secure Three-Level Steganography Scheme With Random Distribution and Parity Coding
Data hiding has become crucial for ensuring information confidentiality in response to the increasing capabilities of modern decryption tools. This paper presents a novel steganographic approach based on Least Significant Bit manipulation to counter visual and statistical attacks. The proposed approach introduces a three-level steganography scheme that employs binary cover generation, Quick Response codes, and data embedding into Red, Green, and Blue image channels using parity coding and smoothing functions. Its key features include random data distribution across levels, adaptive pixel capacity, and the elimination of repetitive encryption processes. The approach achieves a maximum data hiding capacity of 9 bits per pixel while maintaining flexibility for varying secret message sizes. Experimental results examining standard test images demonstrate high robustness and imperceptibility, assessed through Peak Signal-to-Noise Ratio, Structural Similarity Index Measure, and Mean Squared Error metrics. These findings emphasize the efficacy of the proposed approach for secure data hiding in digital images.
- Open Access
- 6 September 2024
- Published by PeerJ in PeerJ Computer Science
- Vol. 10, e2259
An empirical evaluation of link quality utilization in ETX routing for VANETs
Routing in vehicular ad hoc networks (VANETs) enables vehicles to communicate for safety and non-safety applications. However, there are limitations in wireless communication that can degrade VANET performance, so it is crucial to optimize the operation of routing protocols to address this. Various routing protocols employed the expected transmission count (ETX) in their operation as one way to achieve the required efficiency and robustness. ETX is used to estimate link quality for improved route selection. While some studies have evaluated the utilization of ETX in specific protocols, they lack a comprehensive analysis across protocols under varied network conditions. This research provides a comprehensive comparative evaluation of ETX-based routing protocols for VANETs using the nomadic community mobility model. It covers a foundational routing protocol, ad hoc on-demand distance vector (AODV), as well as newer variants that utilize ETX, lightweight ETX (LETX), and power-based light reverse ETX (PLR-ETX), which are referred to herein as AODV-ETX, AODV-LETX, and AODV-PLR, respectively. The protocols are thoroughly analyzed via ns-3 simulations under different traffic and mobility scenarios. Our evaluation model considers five performance parameters including throughput, routing overhead, end-to-end delay, packet loss, and underutilization ratio. The analysis provides insight into designing robust and adaptive ETX routing for VANET to better serve emerging intelligent transportation system applications through a better understanding of protocol performance under different network conditions. The key findings show that ETX-optimized routing can provide significant performance enhancements in terms of end-to-end delay, throughput, routing overhead, packet loss and underutilization ratio. The extensive simulations demonstrated that AODV-PLR outperforms its counterparts AODV-ETX and AODV-LETX and the foundational AODV routing protocol across the performance metrics.
- 6 September 2024
- Published by PeerJ in PeerJ Computer Science
- Vol. 10, e2259
Open AccessAn empirical evaluation of link quality utilization in ETX routing for VANETs
Routing in vehicular ad hoc networks (VANETs) enables vehicles to communicate for safety and non-safety applications. However, there are limitations in wireless communication that can degrade VANET performance, so it is crucial to optimize the operation of routing protocols to address this. Various routing protocols employed the expected transmission count (ETX) in their operation as one way to achieve the required efficiency and robustness. ETX is used to estimate link quality for improved route selection. While some studies have evaluated the utilization of ETX in specific protocols, they lack a comprehensive analysis across protocols under varied network conditions. This research provides a comprehensive comparative evaluation of ETX-based routing protocols for VANETs using the nomadic community mobility model. It covers a foundational routing protocol, ad hoc on-demand distance vector (AODV), as well as newer variants that utilize ETX, lightweight ETX (LETX), and power-based light reverse ETX (PLR-ETX), which are referred to herein as AODV-ETX, AODV-LETX, and AODV-PLR, respectively. The protocols are thoroughly analyzed via ns-3 simulations under different traffic and mobility scenarios. Our evaluation model considers five performance parameters including throughput, routing overhead, end-to-end delay, packet loss, and underutilization ratio. The analysis provides insight into designing robust and adaptive ETX routing for VANET to better serve emerging intelligent transportation system applications through a better understanding of protocol performance under different network conditions. The key findings show that ETX-optimized routing can provide significant performance enhancements in terms of end-to-end delay, throughput, routing overhead, packet loss and underutilization ratio. The extensive simulations demonstrated that AODV-PLR outperforms its counterparts AODV-ETX and AODV-LETX and the foundational AODV routing protocol across the performance metrics.
- 16 March 2024
- Published by Springer Nature in International Journal of Information Security
- Vol. 23 (3) , 2099-2121
A new approach for detecting process injection attacks using memory analysis
- 16 March 2024
- Published by Springer Nature in International Journal of Information Security
- Vol. 23 (3) , 2099-2121
A new approach for detecting process injection attacks using memory analysis
- Open Access
- 1 March 2022
- Published by Walter de Gruyter GmbH in Cybernetics and Information Technologies
- Vol. 22 (1) , 77-94
Data Fusion and the Impact of Group Mobility on Load Distribution on MRHOF and OF0
Many routing algorithms proposed for IoT are based on modifications on RPL objective functions and trickle algorithms. However, there is a lack of an in-depth study to examine the impact of mobility on routing protocols based on MRHOF and OF0 algorithms. This paper examines the impact of group mobility on these algorithms, also examines their ability in distributing the load and the impact of varying traffic with the aid of simulations using the well-known Cooja simulator. The two algorithms exhibit similar performance for various metrics for low traffic rates and low mobility speed. However, when the traffic rate becomes relatively high, OF0 performance merits appear, in terms of throughput, packet load deviation, power deviation, and CPU power deviation. The mobility with higher speeds helps MRHOF to enhance its throughput and load deviation. The mobility allowed MRHOF to demonstrate better packets load deviation.
- 1 March 2022
- Published by Walter de Gruyter GmbH in Cybernetics and Information Technologies
- Vol. 22 (1) , 77-94
Open AccessData Fusion and the Impact of Group Mobility on Load Distribution on MRHOF and OF0
Many routing algorithms proposed for IoT are based on modifications on RPL objective functions and trickle algorithms. However, there is a lack of an in-depth study to examine the impact of mobility on routing protocols based on MRHOF and OF0 algorithms. This paper examines the impact of group mobility on these algorithms, also examines their ability in distributing the load and the impact of varying traffic with the aid of simulations using the well-known Cooja simulator. The two algorithms exhibit similar performance for various metrics for low traffic rates and low mobility speed. However, when the traffic rate becomes relatively high, OF0 performance merits appear, in terms of throughput, packet load deviation, power deviation, and CPU power deviation. The mobility with higher speeds helps MRHOF to enhance its throughput and load deviation. The mobility allowed MRHOF to demonstrate better packets load deviation.
- 30 December 2021
- Published by Bentham Science Publishers Ltd. in Recent Advances in Computer Science and Communications
- Vol. 14 (9) , 1-13
The Impact of Varying Sinks on Load Distribution in IoT Routing Under Static and Mobile Scenarios
: The majority of routing algorithms proposed for IoT can be categorized under modifications in routing protocols designated for IoT such as RPL objective functions enhancements, while others are enhancements in routing algorithms derived from those which were designed for ad hoc networks. We have thoroughly investigated the literature on these modifications or enhancements. However, there is a lack of an in-depth study to examine the impact of mobility and the varying number of sinks on routing algorithms based on MRHOF and OF0. In this study, we examine their ability in distributing the load with the impact of the varying number of sink nodes under static and mobile scenarios. This study has been conducted using various metrics including regular metrics such as throughput and power consumption, and newly derived metrics including packets load deviation and power deviation which are derived for the purpose of measuring load distribution.
- 30 December 2021
- Published by Bentham Science Publishers Ltd. in Recent Advances in Computer Science and Communications
- Vol. 14 (9) , 1-13
The Impact of Varying Sinks on Load Distribution in IoT Routing Under Static and Mobile Scenarios
: The majority of routing algorithms proposed for IoT can be categorized under modifications in routing protocols designated for IoT such as RPL objective functions enhancements, while others are enhancements in routing algorithms derived from those which were designed for ad hoc networks. We have thoroughly investigated the literature on these modifications or enhancements. However, there is a lack of an in-depth study to examine the impact of mobility and the varying number of sinks on routing algorithms based on MRHOF and OF0. In this study, we examine their ability in distributing the load with the impact of the varying number of sink nodes under static and mobile scenarios. This study has been conducted using various metrics including regular metrics such as throughput and power consumption, and newly derived metrics including packets load deviation and power deviation which are derived for the purpose of measuring load distribution.
- Open Access
- 27 October 2021
- Published by MDPI AG in Future Internet
- Vol. 13 (11) , 273
Software Design and Experimental Evaluation of a Reduced AES for IoT Applications
IoT devices include RFID tags, microprocessors, sensors, readers, and actuators. Their main characteristics are their limited resources and computing capabilities, which pose critical challenges to the reliability and security of their applications. Encryption is necessary for security when using these limited-resource devices, but conventional cryptographic algorithms are too heavyweight and resource-demanding to run on IoT infrastructures. This paper presents a lightweight version of AES (called LAES), which provides competitive results in terms of randomness levels and processing time, operating on GF(24). Detailed mathematical operations and proofs are presented concerning LAES rounds design fundamentals. The proposed LAES algorithm is evaluated based on its randomness, performance, and power consumption; it is then compared to other cryptographic algorithm variants, namely Present, Clefia, and AES. The design of the randomness and performance analysis is based on six measures developed with the help of the NIST test statistical suite of cryptographic applications. The performance and power consumption of LAES on a low-power, 8-bit microcontroller unit were evaluated using an Arduino Uno board. LAES was found to have competitive randomness levels, processing times, and power consumption compared to Present, Clefia, and AES.
- 27 October 2021
- Published by MDPI AG in Future Internet
- Vol. 13 (11) , 273
Open AccessSoftware Design and Experimental Evaluation of a Reduced AES for IoT Applications
IoT devices include RFID tags, microprocessors, sensors, readers, and actuators. Their main characteristics are their limited resources and computing capabilities, which pose critical challenges to the reliability and security of their applications. Encryption is necessary for security when using these limited-resource devices, but conventional cryptographic algorithms are too heavyweight and resource-demanding to run on IoT infrastructures. This paper presents a lightweight version of AES (called LAES), which provides competitive results in terms of randomness levels and processing time, operating on GF(24). Detailed mathematical operations and proofs are presented concerning LAES rounds design fundamentals. The proposed LAES algorithm is evaluated based on its randomness, performance, and power consumption; it is then compared to other cryptographic algorithm variants, namely Present, Clefia, and AES. The design of the randomness and performance analysis is based on six measures developed with the help of the NIST test statistical suite of cryptographic applications. The performance and power consumption of LAES on a low-power, 8-bit microcontroller unit were evaluated using an Arduino Uno board. LAES was found to have competitive randomness levels, processing times, and power consumption compared to Present, Clefia, and AES.
- 30 August 2021
- Published by Bentham Science Publishers Ltd. in Recent Advances in Computer Science and Communications
- Vol. 14 (5) , 1370-1380
Email Fraud Attack Detection Using Hybrid Machine Learning Approach
Background: E-mail is an efficient way to communicate. It is one of the most commonly used communication methods, and it can be used for achieving legitimate and illegitimate activities. Many features that can be effective in detecting email fraud attacks, are still under investigation. Method: This paper proposes an improved classification accuracy for fraudulent emails that is implemented through feature extraction and hybrid Machine Learning (ML) classifier that combines Adaboost and Majority Voting. Eleven ML classifiers are evaluated experimentally within the hybrid classifier, and the performance of the email fraud filtering is evaluated by using WEKA and R tool on a data set of 9298 email messages. Results: The performance evaluation shows that the hybrid model of Voting using Adaboost outperforms all other classifiers, with the lowest Error Rate of 0.6991%, highest f1-measure of 99.30%, and highest Area Under the Curve (AUC) of 99.9%. Conclusion: The utilized proposed email features with the combination of Adaboost and Voting algorithms prove the efficiency of fraud email detection.
- 30 August 2021
- Published by Bentham Science Publishers Ltd. in Recent Advances in Computer Science and Communications
- Vol. 14 (5) , 1370-1380
Email Fraud Attack Detection Using Hybrid Machine Learning Approach
Background: E-mail is an efficient way to communicate. It is one of the most commonly used communication methods, and it can be used for achieving legitimate and illegitimate activities. Many features that can be effective in detecting email fraud attacks, are still under investigation. Method: This paper proposes an improved classification accuracy for fraudulent emails that is implemented through feature extraction and hybrid Machine Learning (ML) classifier that combines Adaboost and Majority Voting. Eleven ML classifiers are evaluated experimentally within the hybrid classifier, and the performance of the email fraud filtering is evaluated by using WEKA and R tool on a data set of 9298 email messages. Results: The performance evaluation shows that the hybrid model of Voting using Adaboost outperforms all other classifiers, with the lowest Error Rate of 0.6991%, highest f1-measure of 99.30%, and highest Area Under the Curve (AUC) of 99.9%. Conclusion: The utilized proposed email features with the combination of Adaboost and Voting algorithms prove the efficiency of fraud email detection.
- 12 August 2020
- Published by Bentham Science Publishers Ltd. in Recent Advances in Computer Science and Communications
- Vol. 13 (3) , 435-445
A Novel Simplified AES Algorithm for Lightweight Real-Time Applications: Testing and Discussion
Background: Lightweight cryptographic algorithms have been the focus of many researchers in the past few years. This has been inspired by the potential developments of lightweight constrained devices and their applications. These algorithms are intended to overcome the limitations of traditional cryptographic algorithms in terms of exaction time, complex computation and energy requirements. Methods: This paper proposes LAES, a lightweight and simplified cryptographic algorithm for constricted environments. It operates on GF(24), with a block size of 64 bits and a key size of 80-bit. While this simplified AES algorithm is impressive in terms of processing time and randomness levels. The fundamental architecture of LAES is expounded using mathematical proofs to compare and contrast it with a variant lightweight algorithm, PRESENT, in terms of efficiency and randomness level. Results: Three metrics were used for evaluating LAES according to the NIST cryptographic applications statistical test suite. The testing indicated competitive processing time and randomness level of LAES compared to PRESENT. Conclusion: The study demonstrates that LAES achieves comparable results to PRESENT in terms of randomness levels and generally outperform PRESENT in terms of processing time.
- 12 August 2020
- Published by Bentham Science Publishers Ltd. in Recent Advances in Computer Science and Communications
- Vol. 13 (3) , 435-445
A Novel Simplified AES Algorithm for Lightweight Real-Time Applications: Testing and Discussion
Background: Lightweight cryptographic algorithms have been the focus of many researchers in the past few years. This has been inspired by the potential developments of lightweight constrained devices and their applications. These algorithms are intended to overcome the limitations of traditional cryptographic algorithms in terms of exaction time, complex computation and energy requirements. Methods: This paper proposes LAES, a lightweight and simplified cryptographic algorithm for constricted environments. It operates on GF(24), with a block size of 64 bits and a key size of 80-bit. While this simplified AES algorithm is impressive in terms of processing time and randomness levels. The fundamental architecture of LAES is expounded using mathematical proofs to compare and contrast it with a variant lightweight algorithm, PRESENT, in terms of efficiency and randomness level. Results: Three metrics were used for evaluating LAES according to the NIST cryptographic applications statistical test suite. The testing indicated competitive processing time and randomness level of LAES compared to PRESENT. Conclusion: The study demonstrates that LAES achieves comparable results to PRESENT in terms of randomness levels and generally outperform PRESENT in terms of processing time.
- Open Access
- 1 June 2019
- Published by Universitas Ahmad Dahlan in TELKOMNIKA (Telecommunication Computing Electronics and Control)
- Vol. 17 (3) , 1584-1594
Authentication techniques in smart grid: a systematic review
Authentication techniques in smart grid: a systematic review
- 1 June 2019
- Published by Universitas Ahmad Dahlan in TELKOMNIKA (Telecommunication Computing Electronics and Control)
- Vol. 17 (3) , 1584-1594
Open AccessAuthentication techniques in smart grid: a systematic review
Authentication techniques in smart grid: a systematic review