HEHuwaida Tagelsir Elshoush

Huwaida Tagelsir Elshoush

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Huwaida Tagelsir Elshoush has a total of 17 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Text encryption using secure and expeditious multiprocessing SerpentCTR using logistic map

    by Huwaida T. Elshoush, Duaa M. Ahmed, Abdalmajid A. Ishag, Muawia A. Elsadig, Abdelrahman Altigani

    Unarguably performance is a critical factor to the success of any cipher. Al-Beit Serpent is more secure than advanced encryption standard (AES), it faces limitations such as speed and memory requirement. Hence, this paper proffers a text encryption method S that ameliorates the performance by running Serpent in parallel using the counter (CTR) encryption mode and further enhances the security by generating sub-keys for each block using logistic map. The intricate logistic map generated keys adds robustness to the proposed algorithm. Comprehensive experiments using Python 3.9 on commonly used metrics verify the efficacy of the proposed method in terms of execution time, central processing unit (CPU) usage, security analysis including key space, strict avalanche effect and its randomness. The encryption/decryption reduction rate reached up to 80.81%. It is worthy of note that it is effectually resistant to brute force attacks having a large key space in addition to its dependency on the number of blocks besides the randomly generated keys. The enhanced Serpent was examined using the statistical test suite (STS) recommended by the National Institute of Standards and Technology (NIST) and verified its randomness by passing all tests. Furthermore, it efficaciously resisted statistical analysis, particularly histogram and correlation coefficient analysis. Moreover, it prevails over current methods when juxtaposed with them in terms of performance, key space, key sensitivity, avalanche effect, histogram analysis and correlation coefficient, ergo affirming its efficiency.


  • Open Access

    Data Security Utilizing a Memristive Coupled Neural Network in 3D Models

    by Mohamed Gabr, Amr Diab, Huwaida T. Elshoush, Yen-Lin Chen, Lip Yee Por, Chin Soon Ku, Wassim Alexan

    This article proposes a novel double data security algorithm that first encrypts sensitive data using a two-stage encryption method based on numerical solutions from a fractional-order memristive coupled neural network system. Solutions are obtained to generate encryption keys and construct S-boxes, which are then applied along with an initial key to encrypt the data bits through repeated XOR and S-box operations. The encrypted output is then hidden imperceptibly within 3D geometries by slightly modifying model points based on the encrypted data bits. This two-pronged approach provides enhanced protection of confidential information compared to single encryption or data hiding alone. Numerical experiments demonstrate the effectiveness of encryption in obscuring patterns while data extraction from modified 3D models validates recovery with negligible visual impact. Additionally, the proposed encryption scheme is shown to be superior to the standard AES-256 algorithm in terms of both computational efficiency and security against brute-force attacks. Through a synergistic blend of robust encryption and stealthy data hiding within 3D objects, the presented algorithm can reliably ensure privacy for sensitive digital data transmissions and storage applications.


  • Open Access

    Input Validation Vulnerabilities in Web Applications: Systematic Review, Classification, and Analysis of the Current State-of-the-Art

    by Faris Faisal Fadlalla, Huwaida T. Elshoush

    In recent years, huge increase in attacks and data breaches is noticed. Most of the attacks are performed and focused on the vulnerabilities related to web applications. Hence, nowadays the mitigation of application vulnerabilities is an ignited research area. Thus, due to the potential high severity impacts of web application, many different approaches have been proposed in the past decades to mitigate the damages of application vulnerabilities. Static and dynamic analysis are the two main techniques used. In this paper, a new classification for web application input validation vulnerabilities is proffered. In addition, various techniques/tools that are used to detect them are analyzed and evaluated to apprehend their strengths and weaknesses. Thus, this paper provides both technical as well as literature countermeasures to input validation vulnerabilities. Moreover, various statistical distributions of the reviewed techniques were manifested and scrutinize in different aspects to reveal the perception of the prevailing techniques and the gaps in the literature. In addition, the most widespread metrics are also propounded.


  • Open Access

    Ameliorating LSB Using Piecewise Linear Chaotic Map and One-Time Pad for Superlative Capacity, Imperceptibility and Secure Audio Steganography

    by Huwaida T. Elshoush, Mahmoud M. Mahmoud

    Audio steganography hides a secret message into an audio. Existing techniques are lacking in achieving high payload, imperceptibility in addition to robustness at the same time. They also suffer from choosing the samples and even LSBs in an unpredictable fashion. Moreover, few adaptive techniques exist, besides not many embed in higher LSBs. Hence, a novel LSB PWLCM method that ameliorates LSB audio steganography is proposed. It uses piecewise linear chaotic map (PWLCM) to embed a secret message in random samples, besides selecting one of the 4-LSBs in an unsystematic way. It is noteworthy that each time a distinct sample and hence a differed 4-LSB is chosen as per different generated PWLCM. At first, Huffman coding is used to lessen the secret message size. Thereafter, to ameliorate the security of the one-time pad, random numbers are generated using PWLCM as an input key. This gives the proposed method a dual protection by amalgamating steganography with enhanced secure one-time pad. MATLAB is used to implement the proposed LSB PWLCM method and evaluate the imperceptibility between cover and stego audios against standard parameters viz. Perceptual Evaluation of Speech Quality (PESQ) and Perceptual Evaluation of Audio Quality (PEAQ). Furthermore, its imperceptibility was tested using Mean Square Error, Peak Signal to Noise Ratio, Signal-to-Noise Ratio, Percentage Root Mean Square Difference and Audio Fidelity. Exhaustive experiments on vastly used metrics affirm that the proposed method LSB PWLCM excel prevailing methods regarding hiding capacity and imperceptibility. Furthermore, it is resistant to brute force attacks having a large key space besides its dependency on the secret message size. In addition, it effectively withstood statistical analysis, specifically histogram attack and fourth first moments. Albeit it was vigorous towards re-sampling attacks, yet it was not very robust against LSB attacks nor noise. Assuredly, it prevails over existing methods and beyond comparison when juxtaposed with them affirming its efficacy.


  • Open Access

    Breast cancer detection using machine learning approaches: a comparative study

    by Muawia A. Elsadig, Abdelrahman Altigani, Huwaida T. Elshoush

    As the cause of the breast cancer disease has not yet clearly identified and a method to prevent its occurrence has not yet been developed, its early detection has a significant role in enhancing survival rate. In fact, artificial intelligent approaches have been playing an important role to enhance the diagnosis process of breast cancer. This work has selected eight classification models that are mostly used to predict breast cancer to be under investigation. These classifiers include single and ensemble classifiers. A trusted dataset has been enhanced by applying five different feature selection methods to pick up only weighted features and to neglect others. Accordingly, a dataset of only 17 features has been developed. Based on our experimental work, three classifiers, multi-layer perceptron (MLP), support vector machine (SVM) and stack are competing with each other by attaining high classification accuracy compared to others. However, SVM is ranked on the top by obtaining an accuracy of 97.7% with classification errors of 0.029 false negative (FN) and 0.019 false positive (FP). Therefore, it is noteworthy to mention that SVM is the best classifier and it outperforms even the stack classier.


  • Open Access

    Enhancing LSB Using Binary Message Size Encoding for High Capacity, Transparent and Secure Audio Steganography–An Innovative Approach

    by Mahmoud M. Mahmoud, Huwaida T. Elshoush

    We propose a novel LSB-BMSE method that enhances LSB audio steganography. It uses an innovative mechanism, Binaries of Message Size Encoding (BMSE), to embed a secret message after hiding its size in random samples. First, the secret message is compressed using Huffman coding, then encrypted by AES-128. The audio cover is split into number of blocks depending on secret message size. A secure keyBMSE, output from the BMSE mechanism, is used to embed the secret message in random blocks and bytes adaptively according to its size. It is implemented using MATLAB and standard parameters: Perceptual Evaluation of Speech Quality and NIST Statistical Test Suite were used to measure imperceptibility between cover & stego audios and randomness of BMSE mechanism respectively. The fidelity was tested using Mean Square Error, Peak Signal to Noise Ratio and Signal-to-Noise Ratio. Comprehensive experiments on widely used metrics demonstrate that LSB-BMSE significantly surpasses existing methods in terms of hiding capacity and imperceptibility. Moreover, LSB-BMSE shows resistance to brute force attacks and statistical analysis. Although it was robust towards re-sampling attacks, nevertheless was not vigorous towards noise nor LSB attacks. The keyBMSE complies with Kerckhoff’s principle and exhibits avalanche criteria. The tested proposed LSB-BMSE proclaimed its effectiveness.


  • Open Access

    Enhanced Serpent algorithm using Lorenz 96 Chaos-based block key generation and parallel computing for RGB image encryption

    by Huwaida T. Elshoush, Banan M. Al-Tayeb, Khalil T. Obeid

    This paper presents a new approach to enhance the security and performance of the Serpent algorithm. The main concepts of this approach is to generate a sub key for each block using Lorenz 96 chaos and then run the process of encryption and decryption in ECB parallel mode. The proposed method has been implemented in Java, openjdk version "11.0.11"; and for the analysis of the tested RGB images, Python 3.6 was used. Comprehensive experiments on widely used metrics demonstrate the effectiveness of the proposed method against differential attacks, brute force attacks and statistical attacks, while achieving superb results compared to related schemes. Moreover, the encryption quality, Shannon entropy, correlation coefficients, histogram analysis and differential analysis all accomplished affirmative results. Furthermore, the reduction in encryption/decryption time was over 61%. Moreover, the proposed method cipher was tested using the Statistical Test Suite (STS) recommended by the NIST and passed them all ensuring the randomness of the cipher output. Thus, the approach demonstrated the potential of the improved Serpent-ECB algorithm with Lorenz 96 chaos-based block key generation (BKG) and gave favorable results. Specifically, compared to existing encryption schemes, it proclaimed its effectiveness.


  • Open Access

    Reducing the Correlation Processing Time by Using a Novel Intrusion Alert Correlation Model

    by Huwaida Tagelsir, Ibrahim Elshoush

    Alert correlation analyzes the alerts from one or more Collaborative Intrusion Detection Systems (CIDSs) to produce a concise overview of security-related activity on the network. The correlation process consists of multiple components, each responsible for a different aspect of the overall correlation goal. The sequential order of the correlation components affects the correlation process performance. Furthermore, the total time needed for the whole process depends on the number of processed alerts in each component. This paper presents an innovative alert correlation framework that minimizes the number of processed alerts on each component and thus reducing the correlation processing time. By reordering the components, the introduced correlation model reduces the number of processed alerts as early as possible by discarding the irrelevant, unreal and false alerts in the early phases of the correlation process. A new component, shushing the alerts, is added to deal with the unrelated and false positive alerts. A modified algorithm for fusing the alerts is outlined. The intruders’ intention is grouped into attack scenarios and thus used to detect future attacks. DARPA 2000 intrusion detection scenario specific datasets and a testbed network were used to evaluate the innovative alert correlation model. Comparisons with a previous correlation system were performed. The results of processing these datasets and recognizing the attack patterns demonstrated the potential of the improved correlation model and gave favorable results.

  • Intrusion Alert Correlation Framework: An Innovative Approach

    by Huwaida Tagelsir Elshoush, Izzeldin Mohamed Osman