Hazem M. Bahig

Hazem M. Bahig

Imam Mohammad ibn Saud Islamic University
See Latest Publications
See Most Cited Publications
SciProfiles
ORCID Profile
Google Scholar

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Hazem M. Bahig has a total of 54 co-authors. Here are the top co-authors by number of shared publications:

Latest Publications

  • Website
    Google Scholar
    Open Access

    Enhanced Integer Factorization Method: Sequential and Parallel Approaches

    by Ehab T. Alnfrawy, Hazem M. Bahig, Hatem M. Bahig, Reda Elbarougy

    Integer factorization plays a foundational role in asymmetric cryptography systems, notably the Rivest, Shamir, and Adleman (RSA) cryptosystem. This paper presents an improvement of the integer factorization from both sequential and parallel computational perspectives. The algorithm is based on polynomial evaluation and the greatest common divisor. The objectives of these improvements are to decrease the execution time and memory consumption associated with the process of finding prime factors. Experimentally, we use different values of parameters (1) the number of bits n, (2) the difference between two factors, and (3) the number of processors in the parallel model. The experimental results indicate that both proposed methods, sequential and parallel, yield significant improvements regarding running time and memory usage when the difference between the two factors is n1/3 and n1/4. The average improvement observed is 99% in running time, with memory consumption reduced to a constant. This characteristic is important for limited hardware devices. Furthermore, the proposed parallel method demonstrates scalability and achieves sublinear speedup.

  • Website
    Google Scholar
    Open Access

    RSA Cryptanalysis: A Novel Acceleration for Euler-Based Fermat Factorization Algorithm

    by Ibrahim M. Alseadoon, Khaled A. Fathy, Mohamed A.G. Hazber, Yasser Kotb, Hazem M. Bahig

    The Rivest-Shamir-Adleman (RSA) cryptosystem is an efficient and secure method for transmitting data over the Internet. Breaking this system primarily relies on the integer factorization problem, which involves factoring a composite odd number, n, into two prime factors, p and q. Euler-based Fermat Factorization (EFF) is one of the factoring methods based on the modular multiplication operation and is efficient when δ = p − q ≤ n0.25. However, the execution times of the EFF algorithm increase significantly with large values of n and δ > n0.25. In this paper, we propose a novel technique for optimizing the number of modular multiplication operations required to find the two factors. The method can factor a large odd number in a fast time, even when δ > n0.25. For different values of the length of the primes and δ, the experimental results indicate that the proposed algorithm is, on average, 85.5% faster than the previous improvements on the Fermat factorization method.

  • Website
    Google Scholar
    Open Access

    Quantum informative analysis for weather of San Francisco

    by Yasser Kotb, Amr A. Youssef, Dieaa I. Nassr, Hatem M. Bahig

    We present a novel weather analysis of San Francisco from 2009 to 2019 using concepts from quantum information theory. We describe how to transform a classical weather dataset into a quantum-inspired analytical framework by treating it as a quantum information system embedded in a quantum-like representation, with data encoded as density matrices in Hilbert space. Transforming classical weather data into quantum states is a mathematical abstraction, whereas a quantum-inspired system is not a quantum-physical system. We study a quantum-inspired analytical framework using quantum information-theoretic metrics, including fidelity, classical information, quantum information, decoherent information, Shannon and von Neumann entropies, and the quantum stability index, to represent and analyze the dataset. Furthermore, we give predictions for each quantum information metric for 2020 and 2021. We fit Fourier-series models to the metrics to explore temporal patterns and structural properties in the data.

  • Website
    Google Scholar

    Performance enhancement of Fermat factorization algorithm on multicore systems

    by Yasser Kotb, Khaled A. Fathy, Ibrahim M. Alseadoon, Mohamed A. G. Hazber, Hazem M. Bahig

  • Website
    Google Scholar
    Open Access

    Addition-multiplication chains with one small step

    by S. Tarek, Hatem M. Bahig, M. Anwar

    An addition-multiplication chain of length $ l $ for a positive integer $ n $ is a monotonic increasing sequence $ 1 = a_0 < a_1 < \ldots < a_l = n $ of positive integers, such that for each $ 1\leq i \leq l, $ we have $ a_i = {a_j} + {a_k} \ \text{or} \ a_i = {a_j} \times {a_k}, $ where $ 0 \leq k \leq j \leq i-1. $ In this paper, we establish upper bounds for each element in any AM-chain based on the number of squaring steps and the distribution of non-squaring steps preceding the given element. Moreover, we get additional upper bounds independent of the distribution of non-squaring steps. These bounds yield a new upper bound for the number of non-squaring steps in any AM-chain. Finally, we determine all AM-chains that include exactly one small step and, as a consequence, compute the shortest lengths $ \ell_{AM}(.) $ of certain integers.

  • Website
    Google Scholar
    Open Access

    Cryptanalysis of Augmented Hill Cipher

    by Rania Saeed, Hatem M. Bahig, Dieaa I. Nassr

    The Augmented Hill Cipher (AHC) is a modified Hill Cipher that uses three secret keys and semi-cipher block chaining as its mode of operation. AHC is claimed to be secure. Recently, it has been used to obtain secure, fast, and loss-tolerant communication. In this paper, we present the first cryptanalysis of AHC. We show that AHC is vulnerable to two attacks: known-plaintext and chosen-plaintext attacks. The attacks are performed by introducing a new method to solve non-linear equations obtained by analyzing AHC. The attacks take place in polynomial time.

    Cited by 1
  • Website
    Google Scholar
    Open Access

    A fast semiring-based public-key encryption

    by Dieaa I. Nassr, Mohamed A. G. Hazber, Ibrahim M. Alseadoon, Hazem M. Bahig

    This paper presents a new public-key encryption with security based on the two-sided digital circulant matrix action problem defined over the semiring proposed by Huang et al. [14]. The performance evaluation of the proposed encryption scheme shows its robustness and efficiency compared to state-of-art encryption schema. We also provide a security analysis of the proposed encryption. It is suitable for post-quantum cryptography and IoT platforms.

  • Website
    Google Scholar

    A recent approach based on inspired crows behavior in steganography

    by Taha E. Rashad, Soheir M. Khamis, Hatem M. Bahig, Dieaa I. Nassr

    Cited by 2
  • Website
    Google Scholar
    Open Access

    Optimized RNA structure alignment algorithm based on longest arc-preserving common subsequence

    by Hazem M. Bahig, Mohamed A.G. Hazber, Tarek G. Kenawy

    Ribonucleic acid (RNA) structure alignment is an important problem in computational biology to identify structural similarity of RNAs. Obtaining an efficient method for this problem is challenging due to the high computational time for the optimal solution and the low accuracy of a heuristic solution. In this paper, an efficient algorithm is proposed based on a mathematical model called longest arc-preserving common subsequence. The proposed algorithm uses a heuristic technique and high-performance computing to optimize the solution of RNA structure alignment, both in terms of the running time and the accuracy of the output. Extensive experimental studies on a multicore system are conducted to show the effectiveness of the proposed algorithm on two types of data. The first is simulated data that consists of 450 comparisons of RNA structures, while the second is real biological data that consists of 357 comparisons of RNA structures. The results show that the proposed algorithm outperforms the best-known heuristic algorithm in terms of execution time, with a percentage improvement of 71% and increasing the length of the output, i.e., accuracy, by approximately 45% in all studied cases. Finally, future approaches are discussed.

  • Website
    Google Scholar
    Open Access

    An efficient simulated annealing algorithm for short addition sequences

    by Mohamed A.G. Hazber, Hatem M. Bahig

    Let $ N = \left\{{n}_{1}, {n}_{2}, \;\dots , {n}_{k}\right\} $ be a finite set of positive numbers. The problem of finding the minimal number of additions required to compute all elements of N starting from 1 (called the addition sequence problem) is NP-complete. It is equivalent to finding the minimum number of multiplications needed to compute a group exponentiation $ {g}^{{n}_{1}}, {g}^{{n}_{2}}, \;\dots , {g}^{{n}_{k}} $, where g is an element in a group. This paper aims to propose a new metaheuristic algorithm using a simulated annealing strategy to generate a short addition sequence. The performance of the proposed algorithm is measured by considering two parameters: The size of N and the domain of $ {n}_{\mathrm{i}}, 1\le i\le k $. The proposed algorithm is a new trade-off between the length of the generated addition sequence and the average running time of generating addition sequences. It sometimes produces longer addition sequences than exact algorithms that are slower, and it is slower than suboptimal algorithms that produce longer addition sequences.

    Cited by 5
Show all