NANabil Abdoun

Nabil Abdoun

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Nabil Abdoun has a total of 12 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Design, implementation and analysis of keyed hash functions based on chaotic maps and neural networks

    by Nabil Abdoun

    Conception et mise en oeuvre efficace de fonctions de hachage à sens unique basées sur des cartes chaotiques et réseaux neuronaux.: Les fonctions de hachage sont des primitives les plus utiles en cryptographie. En effet, elles jouent un rôle important dans l’intégrité des données, l’authentification des messages, la signature numérique et le chiffrement authentifié. Ainsi, la conception de fonctions de hachage sécurisées est cruciale. Dans cette thèse, nous avons conçu, implanté et analysé les performances de deux architectures comprenant chacune deux structures de fonctions de hachage avec clé basées sur des cartes chaotiques et des réseaux neuronaux (KCNN). La première architecture s’appuie sur la construction Merkle-Dåmgard, tandis que la seconde utilise la fonction Éponge. La première structure de la première architecture est formée de deux couches KCNN avec trois schémas de sortie différents (CNN-Matyas-Meyer-Oseas, CNN-Matyas-Meyer-Oseas Modifié et CNN-Miyaguchi-Preneel), tandis que la seconde structure est composée d’une couche KCNN suivie d'une couche de combinaison de fonctions non linéaires. La première structure de la deuxième architecture est formée de deux couches KCNN avec deux longueurs de hachage 256 et 512 bits. La seconde structure est comparable à celle utilisée dans la première architecture. Le système chaotique est utilisé pour générer les paramètres du KCNN. Les résultats obtenus par les tests statistiques, ainsi que l'analyse cryptanalytique, démontrent la sécurité des fonctions de hachage KCNN proposées. Enfin, nous travaillons actuellement sur la structure KCNNDUPLEX intégrant les fonctions de hachage KCNN proposées (basées Éponge) pour leur utilisation dans une application de chiffrement authentifiée.

  • Open Access

    Enhancing LoRaWAN Security: An Advanced AES-Based Cryptographic Approach

    by Samira Abboud, Nabil Abdoun

    The unique set of LoRaWAN design prerequisites, which include low power consumption, cost-effectiveness, and high scalability, requires its security protocols to be equally robust and enduring, especially since devices are often deployed for extended durations in the field. This research paper elucidates a novel cryptographic method for LoRaWAN, hinged on the Advanced Encryption Standard (AES) employing a 256-bit key. The efficacy and efficiency of the proposed cryptographic solution are analyzed through a comprehensive performance evaluation. Key performance indicators include the security metric, network throughput, and energy utilization of end-devices. It was observed that augmenting the key size from 128 to 256 bits notably bolsters the resilience of LoRaWAN against various cyber attacks. The results also indicate a marginal disparity between the proposed AES256-based method and the existing AES128-based method with regards to network throughput and energy consumption. However, the enhanced security provided by the AES256 standard underscores its potential as a viable cryptographic method for LoRaWAN, providing a favorable balance between improved security and operational performance.


  • Open Access

    Authenticated Encryption Based on Chaotic Neural Networks and Duplex Construction

    by Nabil Abdoun, Safwan El Assad, Thang Manh Hoang, Olivier Deforges, Rima Assaf, Mohamad Khalil

    In this paper, we propose, implement and analyze an Authenticated Encryption with Associated Data Scheme (AEADS) based on the Modified Duplex Construction (MDC) that contains a chaotic compression function (CCF) based on our chaotic neural network revised (CNNR). Unlike the standard duplex construction (SDC), in the MDC there are two phases: the initialization phase and the duplexing phase, each contain a CNNR formed by a neural network with single layer, and followed by a set of non-linear functions. The MDC is implemented with two variants of width, i.e., 512 and 1024 bits. We tested our proposed scheme against the different cryptanalytic attacks. In fact, we evaluated the key and the message sensitivity, the collision resistance analysis and the diffusion effect. Additionally, we tested our proposed AEADS using the different statistical tests such as NIST, Histogram, chi-square, entropy, and correlation analysis. The experimental results obtained on the security performance of the proposed AEADS system are notable and the proposed system can then be used to protect data and authenticate their sources.


  • Open Access

    Designing Two Secure Keyed Hash Functions Based on Sponge Construction and the Chaotic Neural Network

    by Nabil Abdoun, Safwan El Assad, Thang Manh Hoang, Olivier Deforges, Rima Assaf, Mohamad Khalil

    In this paper, we propose, implement, and analyze the structures of two keyed hash functions using the Chaotic Neural Network (CNN). These structures are based on Sponge construction, and they produce two variants of hash value lengths, i.e., 256 and 512 bits. The first structure is composed of two-layered CNN, while the second one is formed by one-layered CNN and a combination of nonlinear functions. Indeed, the proposed structures employ two strong nonlinear systems, precisely a chaotic system and a neural network system. In addition, the proposed study is a new methodology of combining chaotic neural networks and Sponge construction that is proved secure against known attacks. The performance of the two proposed structures is analyzed in terms of security and speed. For the security measures, the number of hits of the two proposed structures doesn’t exceed 2 for 256-bit hash values and does not exceed 3 for 512-bit hash values. In terms of speed, the average number of cycles to hash one data byte (NCpB) is equal to 50.30 for Structure 1, and 21.21 and 24.56 for Structure 2 with 8 and 24 rounds, respectively. In addition, the performance of the two proposed structures is compared with that of the standard hash functions SHA-3, SHA-2, and with other classical chaos-based hash functions in the literature. The results of cryptanalytic analysis and the statistical tests highlight the robustness of the proposed keyed hash functions. It also shows the suitability of the proposed hash functions for the application such as Message Authentication, Data Integrity, Digital Signature, and Authenticated Encryption with Associated Data.


  • New keyed chaotic neural network hash function based on sponge construction

    by Nabil Abdoun, Safwan El Assad, Khodor Hammoud, Rima Assaf, Mohamad Khalil, Olivier Deforges


  • Secure Hash Algorithm based on Efficient Chaotic Neural Network

    by Nabil Abdoun, Safwan El Assad, Mohammad Abu Taha, Rima Assaf, Olivier Deforges, Mohamad Khalil

    Secure Hash Algorithm (SHA) is the most popular standard of Cryptographic Hash functions. Several security protocols use SHA to provide message integrity, authentication and digital signature. Nowadays, a new technology based on Chaotic Neural Networks is used to design Hash functions due to the following important properties of Chaos and Neural Networks: non-linearity, compression, confusion and diffusion. Compared to existing Hash functions based on Chaotic Neural Networks, the proposed structure integrates a strong Chaotic generator into neurons instead of using simple Chaotic maps. In fact, simple chaotic maps are not very robust, even against some statistical attacks (Uniformity and NIST). To also reduce the complexity of hash function proposed in ICITST conference (2015), while maintaining strength, we present in this paper a new structure of Hash function. The theoretical analysis and the obtained experimental performances demonstrate the efficiency o f the implemented structure in terms of strong Collision Resistance and High Message Sensitivity compared to SHA-2 and some Chaos-based Hash functions.


  • Hash function based on efficient Chaotic Neural Network

    by Nabil Abdoun, Safwan El Assad, Mohammad Abu Taha, Rima Assaf, Olivier Deforges, Mohamad Khalil

    This paper presents an efficient algorithm for constructing a secure Hash function based on Chaotic Neural Network structure. The proposed Hash function includes two main operations: Generation of Neural Network parameters using fast and efficient Chaotic Generator and Iteration of the message through the Chaotic Neural Network. Our theoretical analysis and experimental simulations showed that the implemented Hash function has good statistical properties, strong Collision Resistance and High Message Sensitivity.