Ismail Mohammed Bahkali

Dr. Ismail Mohammed Bahkali

King Abdulaziz University, Jeddah, Makkah al Mukarramah, Saudi Arabia
orcid

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
16 May 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
ASArslan Shafique
Arslan Shafique
KKKashif Hesham Khan
Kashif Hesham Khan
Mohammad Mazyad HazzaziMohammad Mazyad Hazzazi
Mohammad Mazyad Hazzazi
Ismail Mohammed BahkaliIsmail Mohammed Bahkali
Ismail Mohammed Bahkali
ZBZAID BASSFAR
ZAID BASSFAR
MRMujeeb Ur Rehman
Mujeeb Ur Rehman
Substitution boxes are the key factor in symmetric-key cryptosystems that determines their ability to resist various cryptanalytic attacks. Creating strong substitution boxes that have multiple strong cryptographic properties at the same time is a challenging task for cryptographers. A significant amount of research has been conducted on S-boxes in the past few decades, but the resulting S-boxes have been found to be vulnerable to various cyberattacks. This paper proposes a new method for creating robust S-boxes that exhibit superior performance and possess high scores in multiple cryptographic properties. The hybrid S-box method presented in this paper is based on Chua’s circuit chaotic map, two-dimensional cellular automata, and an algebraic permutation group structure. The proposed 16×16 S-box has an excellent performance in terms of security parameters, including a minimum nonlinearity of 102, the absence of fixed points, the satisfaction of bit independence and strict avalanche criteria, a low differential uniformity of 5, a low linear approximation probability of 0.0603, and an auto-correlation function of 28. The analysis of the performance comparison indicates that the proposed S-box outperforms other state-of-the-art S-box techniques in several aspects. It possesses better attributes, such as a higher degree of inherent security and resilience, which make it more secure and less vulnerable to potential attacks.

18 April 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Muhammad RashidMuhammad Rashid
Muhammad Rashid
HKHarish Kumar
Harish Kumar
SKSikandar Muhammad Zulqarnain Khan
Sikandar Muhammad Zulqarnain Khan
Ismail Mohammed BahkaliIsmail Mohammed Bahkali
Ismail Mohammed Bahkali
AAAhmed Alhomoud
Ahmed Alhomoud
ZMZahid Mehmood
Zahid Mehmood
This paper presents a high-speed and low-area accelerator architecture for shared key generation using an elliptic-curve Diffie-Hellman protocol over GF(2233). Concerning the high speed, the proposed architecture employs a two-stage pipelining and a Karatsuba finite field multiplier. The use of pipelining shortens the critical path which ultimately improves the clock frequency. Similarly, the employment of a Karatsuba multiplier decreases the required number of clock cycles. Moreover, an efficient rescheduling of point addition and doubling operations avoids data hazards that appear due to pipelining. Regarding the low area, the proposed architecture computes finite field squaring and inversion operations using the hardware resources of the Karatsuba multiplier. Furthermore, two dedicated controllers are used for efficient control functionalities. The implementation results after place-and-route are provided on Virtex-7, Spartan-7, Artix-7 and Kintex-7 FPGA (field-programmable gate arrays) devices. The utilized FPGA slices are 5102 (on Virtex-7), 5634 (on Spartan-7), 5957 (on Artix-7) and 6102 (on Kintex-7). In addition to this, the time required for one shared-key generation is 31.08 (on Virtex-7), 31.68 (on Spartan-7), 31.28 (on Artix-7) and 32.51 (on Kintex-7). For performance comparison, a figure-of-merit in terms of throughputarea is utilized which shows that the proposed architecture is 963.3 and 2.76 times faster as compared to the related architectures. In terms of latency, the proposed architecture is 302.7 and 132.88 times faster when compared to the most relevant state-of-the-art approaches. The achieved results and performance comparison prove the significance of presented architecture in all those shared key generation applications which require high speed with a low area.

27 April 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
CMChandrashekhar Meshram
Chandrashekhar Meshram
Cheng-Chi LeeCheng-Chi Lee
Cheng-Chi Lee
Ismail Mohammed BahkaliIsmail Mohammed Bahkali
Ismail Mohammed Bahkali
Agbotiname Lucky ImoizeAgbotiname Lucky Imoize
Agbotiname Lucky Imoize
One of the most frequently used signaling techniques for initiating, sustaining, and dismissing sessions on the internet is a session initiation protocol (SIP). Currently, SIPs are gaining widespread applications in the human-centered Internet of Things (HC-IoT) domain. In HC-IoT environments, sensitive user data are transmitted over open communication channels that require secure authentication to protect sensitive user information from unlawful exploitation. In order to provide robust authentication for critical user data, SIP-based authentication mechanisms have been proposed; however, these authentication schemes have not provided perfect authentication and effective security for users. Additionally, the existing schemes are computationally intensive and cost-prohibitive in design and implementation. In order to address this problem, especially in the human-centered IoT context, this work introduces a provably secure, lightweight, three-factor SIP-based scheme to tackle the shortcomings of traditional schemes. The presented scheme is based on an extended fractional Chebyshev chaotic map. A formal security verification of the session key in the real-or-random (ROR) model is conducted to evaluate the projected scheme. The investigation results indicate that the new scheme is SIP compatible and achieves secure mutual authentication with robust security features compared to the existing schemes. Therefore, the proposed SIP-enabled scheme can be deployed in the human-centered Internet of Things to secure critical user information.

20 May 2022 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
MKMuhammad Fahad Khan
Muhammad Fahad Khan
KSKhalid Saleem
Khalid Saleem
TSTariq Shah
Tariq Shah
Mohammad Mazyad HazzaziMohammad Mazyad Hazzazi
Mohammad Mazyad Hazzazi
Ismail Mohammed BahkaliIsmail Mohammed Bahkali
Ismail Mohammed Bahkali
PSPiyush Kumar Shukla
Piyush Kumar Shukla
The protection of confidential information is a global issue, and block encryption algorithms are the most reliable option for securing data. The famous information theorist, Claude Shannon, has given two desirable characteristics that should exist in a strong cipher which are substitution and permutation in their fundamental research on “Communication Theory of Secrecy Systems.” block ciphers strictly follow the substitution and permutation principle in an iterative manner to generate a ciphertext. The actual strength of the block ciphers against several attacks is entirely based on its substitution characteristic, which is gained by using the substitution box (S-box). In the current literature, algebraic structure-based and chaos-based techniques are highly used for the construction of S-boxes because both these techniques have favourable features for S-box construction but also various attacks of these techniques have been identified including SAT solver, linear and differential attacks, Gröbner-based attacks, XSL attacks, interpolation attacks, XL-based attacks, finite precision effect, chaotic systems degradation, predictability, weak randomness, chaotic discontinuity, and limited control parameters. The main objective of this research is to design a novel technique for the dynamic generation of S-boxes that are safe against the cryptanalysis techniques of algebraic structure-based and chaos-based approaches. True randomness has been universally recognized as the ideal method for cipher primitives design because true random numbers are unpredictable, irreversible, and unreproducible. The biggest challenge we faced during this research was how can we generate the true random numbers and how can true random numbers utilized for strengthening the S-box construction technique. The basic concept of the proposed technique is the extraction of true random bits from underwater acoustic waves and to design a novel technique for the dynamic generation of S-boxes using the chain of knight’s tour. Rather than algebraic structure- and chaos-based techniques, our proposed technique depends on inevitable high-quality randomness which exists in underwater acoustics waves. The proposed method satisfies all standard evaluation tests of S-boxes construction and true random numbers generation. Two million bits have been analyzed using the NIST randomness test suite, and the results show that underwater sound waves are an impeccable entropy source for true randomness. Additionally, our dynamically generated S-boxes have better or equal strength, over the latest published S-boxes (2020 to 2021). According to our knowledge first time, this type of research has been conducted, in which natural randomness of underwater acoustic waves has been used for the construction of block cipher’s substitution box.

24 April 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
HKHarish Kumar
Harish Kumar
Muhammad RashidMuhammad Rashid
Muhammad Rashid
AAAhmed Alhomoud
Ahmed Alhomoud
SKSikandar Muhammad Zulqarnain Khan
Sikandar Muhammad Zulqarnain Khan
Ismail Mohammed BahkaliIsmail Mohammed Bahkali
Ismail Mohammed Bahkali
SASaud Alotaibi
Saud Alotaibi
This work presents a scalable digit-parallel finite field polynomial multiplier architecture with a digit size of 32 bits for NIST-standardized binary elliptic fields. First, a dedicated digit-parallel architecture is proposed for each binary field recommended by NIST, i.e., 163, 233, 283, 409 and 571. Then, a scalable architecture having support for all variants of binary fields of elliptic curves is proposed. For performance investigation, we have compared dedicated multiplier architectures with scalable design. After this, the dedicated and scalable architectures are compared with the most relevant state-of-the-art multipliers. All multiplier architectures are implemented in Verilog HDL using the Vivado IDE tool. The implementation results are reported on a 28 nm Virtex-7 FPGA technology. The dedicated multipliers utilize slices of 1182 (for m=163), 1451 (for m=233), 1589 (for m=283), 2093 (for m=409) and 3451 (for m=571). Moreover, our dedicated designs can operate at a maximum frequency of 500, 476, 465, 451 and 443 MHz. Similarly, for all supported binary fields, our scalable architecture (i) utilizes 3753 slices, (ii) achieves 305 MHz clock frequency, (iii) takes 0.013 μs for one finite field multiplication and (iv) consumes 3.905 W power. The proposed scalable digit-parallel architecture is more area-efficient than most recent state-of-the-art multipliers. Consequently, the reported results and comparison to the state of the art reveal that the proposed architectures are well suited for cryptographic applications.

4 May 2023 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
CMChandrashekhar Meshram
Chandrashekhar Meshram
Rabha W. IbrahimRabha W. Ibrahim
Rabha W. Ibrahim
PYPreecha Yupapin
Preecha Yupapin
Ismail Mohammed BahkaliIsmail Mohammed Bahkali
Ismail Mohammed Bahkali
Agbotiname Lucky ImoizeAgbotiname Lucky Imoize
Agbotiname Lucky Imoize
SMSarita Gajbhiye Meshram
Sarita Gajbhiye Meshram