Yousuf Abdulla Al-Aali

Dr. Yousuf Abdulla Al-Aali

Newcastle University, Newcastle upon Tyne, UK
orcid
PhD Researcher

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
20 July 2020
Verified
Conference Paper
Closed access
Yousuf Abdulla Al-AaliYousuf Abdulla Al-Aali
Yousuf Abdulla Al-Aali
SBSaid Boussakta
Said Boussakta
Lightweight cryptography is a new branch of cryptography focused on providing security to resource-constraint devices such as wireless sensor networks (WSN), Radio-Frequency Identification (RFIDs) and other embedded systems. The factors considered in lightweight cryptography are mainly circuit area, memory requirement, processing time, latency, power, and energy consumption. This paper presents a discussion on common lightweight block ciphers in terms of different performance parameters, strength, design trends, limitations, and applications including the National Institute of Science and Technology (NIST) round 1 and 2 candidates. Analysis of these lightweight algorithms has offered an insight into this newly emerging field of cryptography.

7 September 2022
Verified
Conference Paper
Closed access
Yousuf Abdulla Al-AaliYousuf Abdulla Al-Aali
Yousuf Abdulla Al-Aali
SBSaid Boussakta
Said Boussakta
The family of new Mersenne number transform (NMNT)-based algorithms – namely NMNT, odd new Mersenne number transform (ONMNT) and odd-squared new Mersenne number transform (O 2 NMNT) – have shown promising results in cryptographic applications. Parameterised implementation, strong diffusion performance and simple arithmetic operations are critical advantages of NMNT-based cryptographic ciphers. Lightweight cryptography plays a critical role in offering security for resource-constrained devices, especially in the internet of things(IoT) applications. One of the key challenges of lightweight cryptography is to strike an optimal balance between security and resource requirements. This paper introduces a suite of novel lightweight cryptographic hash functions based on NMNT, ONMNT and O 2 NMNT which offers enough security with limited resources. This research focuses solely on software implementation, and the proposed hash functions will be used with a lightweight cipher to offer a complete crypto package.Among the three lightweight ciphers, O 2 NMNT-Hash showed the best performance in terms of uniform distribution, collision resistance and diffusion percentage with fewer internal components. All three hash functions provided substantial protection against collision attacks, which is the most desirable property.

23 October 2023 in Signals
Verified
Journal Article
Open access
PDF file
Yousuf Abdulla Al-AaliYousuf Abdulla Al-Aali
Yousuf Abdulla Al-Aali
MHMounir Hamood
Mounir Hamood
SBSaid Boussakta
Said Boussakta
This paper introduces a new derivation of the radix-22 fast algorithm for the forward odd new Mersenne number transform (ONMNT) and the inverse odd new Mersenne number transform (IONMNT). This involves introducing new equations and functions in finite fields, bringing particular challenges unlike those in other fields. The radix-22 algorithm combines the benefits of the reduced number of operations of the radix-4 algorithm and the simple butterfly structure of the radix-2 algorithm, making it suitable for various applications such as lightweight ciphers, authenticated encryption, hash functions, signal processing, and convolution calculations. The multidimensional linear index mapping technique is the conventional method used to derive the radix-22 algorithm. However, this method does not provide clear insights into the underlying structure and flexibility of the radix-22 approach. This paper addresses this limitation and proposes a derivation based on bit-unscrambling techniques, which reverse the ordering of the output sequence, resulting in efficient calculations with fewer operations. Butterfly and signal flow diagrams are also presented to illustrate the structure of the fast algorithm for both ONMNT and IONMNT. The proposed method should pave the way for efficient and flexible implementation of ONMNT and IONMNT in applications such as lightweight ciphers and signal processing. The algorithm has been implemented in C and is validated with an example.

10 July 2023
Verified
Conference Paper
Closed access
Yousuf Abdulla Al-AaliYousuf Abdulla Al-Aali
Yousuf Abdulla Al-Aali
SBSaid Boussakta
Said Boussakta
This paper presents a lightweight hash function using the Fermat number transform (FNT). The FNT is one of the most important number-theoretic transforms, with many applications in digital signal processing. It can be implemented using only addition, subtraction and shifting without any multiplication, making it suitable for lightweight hash functions. In this work, the FNT is used as the core of a 128-bit hash function with a simple structure, and some of its key properties are evaluated. FNT-based lightweight hash functions can offer good security with simple structures.