Raad S. Al-Qassas

Dr. Raad S. Al-Qassas

orcid

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2015 in Procedia Computer Science
Verified
Journal Article
Open access
LTLo’aI Tawalbeh
Lo’aI Tawalbeh
NDNour S. Darwazeh
Nour S. Darwazeh
RARaad S. Al-Qassas
Raad S. Al-Qassas
FAFahd AlDosari
Fahd AlDosari
In cloud computing systems, the data is stored on remote servers accessed through the internet. The increasing volume of personal and vital data, brings up more focus on storing the data securely. Data can include financial transactions, important documents, and multimedia contents. Implementing cloud computing services may reduce local storage reliance in addition to reducing operational and maintenance costs. However, users still have major security and privacy concerns about their outsourced data because of possible unauthorized access within the service providers. The existing solutions encrypt all data using the same key size without taking into consideration the confidentiality level of data which in turn will increase the cost and processing time. In this research, we propose a secure cloud computing model based on data classification. The proposed cloud model minimizes the overhead and processing time needed to secure data through using different security mechanisms with variable key sizes to provide the appropriate confidentiality level required for the data. The proposed model was tested with different encryption algorithms, and the simulation results showed the reliability and efficiency of the proposed framework

12 August 2020 in Recent Advances in Computer Science and Communications
Verified
Journal Article
Closed access
PDF file
MQMalik Qasaimeh
Malik Qasaimeh
RARaad S. Al-Qassas
Raad S. Al-Qassas
FMFida Mohammad
Fida Mohammad
SAShadi Aljawarneh
Shadi Aljawarneh
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.

2 February 2018 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
MQMalik Qasaimeh
Malik Qasaimeh
RARaad S. Al-Qassas
Raad S. Al-Qassas
STSara Tedmori
Sara Tedmori

1 June 2019 in TELKOMNIKA (Telecommunication Computing Electronics and Control)
Verified
Journal Article
Open access
PDF file
MQMalik Qasaimeh
Malik Qasaimeh
RTRawan Turab
Rawan Turab
RARaad S. Al-Qassas
Raad S. Al-Qassas
Authentication techniques in smart grid: a systematic review

16 March 2024 in International Journal of Information Security
Verified
Journal Article
Closed access
PDF file
MNMohammed Nasereddin
Mohammed Nasereddin
RARaad S. Al-Qassas
Raad S. Al-Qassas

27 October 2021 in Future Internet
Verified
Journal Article
Open access
PDF file
MQMalik Qasaimeh
Malik Qasaimeh
RARaad S. Al-Qassas
Raad S. Al-Qassas
MAMohammad Ababneh
Mohammad Ababneh
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.