Ahmed Azouaoui

Ahmed Azouaoui
Faculty of Sciences, Chouaib Doukkali University, El Jadida, Morocco. · Department of Computer Science

Doctor of Computer Science

About

31
Publications
4,430
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
139
Citations

Publications

Publications (31)
Article
p> Tifinagh handwritten character recognition has been a challenging problem due to the similarity and variability of its alphabets. This paper proposes an optimized convolutional neural network (CNN) architecture for handwritten character recognition. The suggested model of CNN has a multi-layer feed-forward neural network that gets features and p...
Article
Recently, Deep Neural Networks have shown great deal of reliability and applicability as its applications spread in different areas. This paper proposes a cryptanalysis model based on Deep Neural Network, the neural network takes in plaintexts and their corresponding ciphertexts to predict the secret key of the cipher. We proposes two different app...
Article
Full-text available
p class="Abstract"> The Merkle-Hellman (MH) cryptosystem is one of the earliest public key cryptosystems, which is introduced by Ralph Merkle and Martin Hellman in 1978 based on an NP-hard problem, known as the subset-sum problem. Furthermore, ant colony optimization (ACO) is one of the most nature-inspired meta-heuristic optimization, which simula...
Article
Full-text available
Ant colony Optimization is a nature-inspired meta-heuristic optimization algorithm that gained a great interest in resolution of combinatorial and numerical optimization problems in many science and engineering domains. The aim of this work was to investigate the use of Ant Colony Optimization in cryptanalysis of Simplified Advanced Encryption Stan...
Chapter
Ant Colony Optimization is a search meta-heuristic inspired by the foraging behavior of real ant, having a very wide applicability. Especially, it can be applied to different combinatorial optimization problem. In this paper, we present a novel Ant Colony Optimization (ACO) based attack for cryptanalysis of Simplified Data Standard Encryption (S-DE...
Conference Paper
In this paper, we present a novel Ant Colony Optimization (ACO) based attack for cryptanalysis of a simple substitution Cipher. A known only cipher text attack is used to recovering the key based on the letter frequency language, a new algorithm is introduced with a Fitness Function that have a good correlation with the number of key elements recov...
Article
Full-text available
In this study, we introduce a novel soft decoder, the first of its kind, for linear block codes, based on Simulated Annealing algorithm (SA). The main enhancement in our contribution which let our decoder over performs with large gain (about 3 dB at 7 × 10-4) the classical SA approach, is to take the most reliable information set of the received co...
Article
The general problem of soft-decision decoding a linear code is a NP-complete problem. This article introduces a soft-decision decoding algorithm, the first of its kind, based on memetic algorithm. The new approach is applicable to the more general case of linear codes; binary or nonbinary codes and cyclic and noncyclic codes where the only known st...
Article
Optical Character Recognition system goal is to convert handwritten characters input images to an editable text. Many OCR techniques have been developed by researchers for Latin and Arabic languages. Amazigh language still have few works in this area. This paper emphasizes a new methodology to recognize the Tifinagh characters using zoning gradient...
Conference Paper
The compact genetic algorithm cGA is used in this paper to design an efficient soft-decision decoding algorithm, especially for the cyclic codes, because the cGA dramatically reduces the population's size and rapidly converges to the optimal solution compared to classical genetic algorithms. Our main contribution is to exploit the cyclic property o...
Article
Full-text available
The construction of optimal linear block error-correcting codes is not an easy problem, for this, many studies describe methods for generating good error correcting codes in terms of minimum distance. In a previous work, we have presented the multiple impulse method (MIM) to evaluate the minimum distance of linear codes. In this paper we will prese...
Article
Full-text available
This paper proposes a new STBC MIMO detector based on Genetic Algorithms (GA) that can approach the performances of an optimal detector based on the maximum likekihood dtector (MLD). This detector is a hybridization between the GA and a linear detector such as ZF or MMSE detector. The optimization of the parameters of the GA can significantly impro...
Conference Paper
Hybrid ARQ is defined as the joint use of a retransmission protocol ARQ and forward error coding (FEC) at the transmitter and/or receiver. We will focus on the HARQ-type-II protocols, namely type-II-CC (Chase Combining) characterized by a storage and combination of erroneous packets, and the type-II-IR (Incremental Redundancy) which provides an Inc...
Article
Full-text available
In this paper, we study the convergence behaviour of a new SISO decoder that we have proposed recently in [1]. The exchange of extrinsic information is used to trace the decoding trajectory in the extrinsic information transfer Chart. That allows foreseeing the turbo cliff position. The influence of concatenated scheme as well as different constitu...
Article
Full-text available
The evaluation of the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this reason the problem has been solved in the literature with heuristic techniques such as genetic algorithms and local search algorithms. In this paper we propose two appro...
Article
Full-text available
Soft-decision decoding is NP-hard problem of great interest to developers of communication system. We present an efficient soft-decision decoding of linear block codes based on compact genetic algorithm (cGA) and compare its performance with various other decoding algorithms including Shakeel algorithms. The proposed algorithm uses the dual code in...
Conference Paper
In this paper, we present a new hard-decision decoding technique based on Genetic Algorithms, which is applicable to the more general case where the only known structure is given by the parity-check matrix H. The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, thi...
Article
Full-text available
A computationally efficient algorithm for decoding block codes is developed using a genetic algorithm (GA). The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding the codes of high rates. We simulated our algorithm...
Article
Full-text available
In this paper, we present a hard-decision decoding technique based on Genetic Algorithms (HDGA), which is applicable to the general case where the only known structure is given by the generating matrix G. We also present a new soft-decision decoding based on HDGA and the Chase algorithm (SDGA). The simulations, applied on some binary Linear Block C...
Article
Full-text available
In this paper, we describe a hard-decision decoding technique based on Genetic Algorithms (HDGA), which is applica-ble to the general case of error correcting codes where the only known structure is given by the generating matrix G. Then we present a new soft-decision decoding based on HDGA and the Chase algorithm (SDGA). The performance of some bi...
Conference Paper
Full-text available
Genetic algorithms have been used successfully for solving different combinatorial optimization problems. We give here an efficient algorithm for the search of good double-circulant codes. The algorithm presented is intended to generate a double-circulant code with maximum minimum distance for each length. Some results are presented and validated b...
Article
Full-text available
Genetic algorithms have been used successfully for solving different combinatorial optimization problems. We give here an efficient algorithm for the search of good double- circulant codes. The algorithm presented is intended to generate a double-circulant code with maximum minimum distance for each length. Some results are presented and validated...

Network

Cited By

Projects

Projects (4)
Project
Main field of the project is Natural-language processing, especialy the problem of handwriteen character recognition