Papers by Mostafa Belkasmi
This paper introduces two decoders for binary linear codes based on Metaheuristics. The first one... more This paper introduces two decoders for binary linear codes based on Metaheuristics. The first one uses a genetic algorithm and the second is based on a combination genetic algorithm with a feed forward neural network. The decoder based on the genetic algorithms (DAG) applied to BCH and convolutional codes give good performances compared to Chase-2 and Viterbi algorithm respectively and reach the performances of the OSD-3 for some Residue Quadratic (RQ) codes. This algorithm is less complex for linear block codes of large block length; furthermore their performances can be improved by tuning the decoder-s parameters, in particular the number of individuals by population and the number of generations. In the second algorithm, the search space, in contrast to DAG which was limited to the code word space, now covers the whole binary vector space. It tries to elude a great number of coding operations by using a neural network. This reduces greatly the complexity of the decoder while main...
arXiv (Cornell University), Aug 6, 2012
Because of the revolution and the success of the technique IBE (Identification Based Encryption) ... more Because of the revolution and the success of the technique IBE (Identification Based Encryption) in the recent years. The need is growing to have a standardization to this technology to streamline communication based on it. But this requires a thorough study to extract the strength and weakness of the most recognized cryptosystems. Our first goal in this work is to approach to this standardization, by applying a study which permit to extract the best cryptosystems. As we will see in this work and as Boneh and Boyen said in 2011 (Journal of Cryptology) the BB1 and BB2 are the most efficient schemes in the model selective ID and without random oracle (they are the only schemes traced in this model). This is right as those schemes are secure (under this model), efficient and useful for some applications. Our second goal behind this work is to make an approvement in BB2 to admit a more efficient schemes. We will study the security of our schemes, which is basing on an efficient strong Diffie-Hellman problem compared to BB1 and BB2. More than that our HIBE support s + ID-HIBE compared to BBG (Boneh Boyen Goh). Additionally the ID in our scheme will be in Z p instead of Z p * as with BBG. We will cite more clearly all these statements in in this article.
arXiv (Cornell University), Nov 13, 2012
Iterative decoding techniques have gain popularity due to their performance and their application... more Iterative decoding techniques have gain popularity due to their performance and their application in most communications systems. In this paper, we present a new application of our iterative decoder on the GPCB (Generalized Parallel Concatenated Block codes) which uses cyclic permutations. We introduce a new variant of the component decoder. After extensive simulation; the obtained result is very promising compared with several existing methods. We evaluate the effects of various parameters component codes, interleaver size, block size, and the number of iterations. Three interesting results are obtained; the first one is that the performances in terms of BER (Bit Error Rate) of the new constituent decoder are relatively similar to that of original one. Secondly our turbo decoding outperforms another turbo decoder for some linear block codes. Thirdly the proposed iterative decoding of GPCB-BCH (75, 51) is about 2.1dB from its Shannon limit.
A major problem in telecommunications is to adapt the information to transmit to the propagation ... more A major problem in telecommunications is to adapt the information to transmit to the propagation channel. For frequency selective channels, a technique is to use multi-carrier modulation such as OFDM (Orthogonal Frequency Division Multiplexing) in which an information block is modulated by a Fourier transform. But one of the main disadvantages of OFDM is its high PAPR (Peak to Average Power Ratio). In this paper we propose a method for reducing PAPR using encoding and companding techniques. Companding is used to reduce PAPR while coding is used to reduce the Bit Error Rate (BER). BCH codes and µ-law compander have been used for this purpose. The effects of modulation have been studied too.
Iterative threshold decoding of product and parallel concatenated block codes based on one step m... more Iterative threshold decoding of product and parallel concatenated block codes based on one step majority logic decodable (OSMLD) codes has proven to perform remarkably well on AWGN channels. For these codes to be applicable in wireless environment, their performance on fading channels must be examined. The purpose of this work is to study the performance of our iterative threshold decoding algorithm on the Rayleigh fading channel. Results have shown that the slope of the bit-error rate (BER) curve is as steep as for the Gaussian channel. We also present a comparison between our results and those for convolutional turbo code in terms of BER performance.
International Journal of Information and Computer Security, 2013
This paper rely on the traditional method RSA-OAEP with an identification-based encryption. First... more This paper rely on the traditional method RSA-OAEP with an identification-based encryption. Firstly, we make a little change in the basic idea (Boneh et al., 2002; Ding and Tsudik, 2003) in order to create a scheme with which we can sign and crypt at same time. A simple comparison prove that our signature is equivalent to the signature of Shamir. Then, we propose a new approach, which conserve properly the RSA classic. In this paper we will also respond to the question of Xuhua Ding and Gene Tsudik, to propose a convenient exponent for an RSA-IBE.
The filtered combination of the weighted edit distance and the Jaro-Winkler distance to improve spellchecking Arabic texts
The digital environments for human learning have been much evolving thanks to the incredible prog... more The digital environments for human learning have been much evolving thanks to the incredible progress of information technologies. This is particularly the case for automatic correction of spelling errors requested by a large majority of people nowadays. Almost all of the current spellcheckers are semiautomatic, and they enable users to find the good solution for a committed error. The major shortcoming of the existing metric methods of correction lies in the bad scheduling of the solutions suggested to the spellchecking out of context of a detected error. To overcome this limitation, we have developed several approaches which suggest probability costs estimated from a learning test. It is attributed in various editing operations during calculating measure of similarity, case of the edit distance. The idea developed in this work was to know how to efficiently weigh these editing operations without resorting to a phase of learning. This is based only on the proximity and the similarity between Arabic keyboard keys. Additionally, we have suggested combining this measure with the distance of Jaro-Winkler in order to better filter, refine and weigh certain solutions compared to others. The experimental results stem from tests conducted on errors committed in a learning corpus, trying to validate the choices of conception and to prove the interest of both approaches.
Efficient vertical handover scheme on IMS network and cost analysis
According to the various mobility, the resource allocation, interference, and the characteristics... more According to the various mobility, the resource allocation, interference, and the characteristics of heterogeneity and ubiquity of access network based on the next generation network, namely, the network IMS (IP Multimedia subsystem), have imposed several challenges. In regard to mobility management, handover management, and Quality of Service (QoS) provisioning, this paper proposes an adaptive environment based on IMS, between the heterogeneous access technologies, like WiMAX, WLAN, UMTS and LTE/LTE Advanced interfaces. Nevertheless, especially, the problem of handover decision, as resolving it influence, mainly on the handover performance; ANN(Artificial Neural Network) is proposed to solve the problem of decision and selection of best network access based IMS. The objective of proposed approach algorithms, is to maximize handover performance and reliability, with a new generic mobility management architecture, for system resource utilization by reducing handover latency and achieving load balance between different heterogeneous cells and networks.
Iterative Threshold Decoding of Parallel Concatenated Block Codes
Turbo Codes&Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on, Apr 3, 2006
ABSTRACT
Journal of Computer Science, 2023
Alcoholism is a serious public health issue, and early diagnosis of this brain disease can be per... more Alcoholism is a serious public health issue, and early diagnosis of this brain disease can be performed by analyzing Electroencephalogram (EEG) signals. However, the high dimensionality of EEG datasets requires significant computational time and resources for the automatic processing of EEG signals. This study proposes a novel method to reduce EEG dataset dimensionality using a Discrete to Continuous algorithm (DtC) by selecting optimal EEG channels. The DtC approach compares alcoholic and nonalcoholic EEG signals as two-time series in a two-dimensional space based on a distance measurement between the two-time series. The Dynamic Time Warping (DTW) algorithm is used to compare the performance of the DtC approach. Classification performance metrics were evaluated for both the DtC and DTW algorithms. The optimal selected channels by our approach are the C3, CP5, PO7, and F8 channels with accuracy values of 100, 100, 94 and 81%, respectively. These findings are consistent with previous research on statistical analysis and machine learning methods and with the DTW algorithm results. Our findings are also in line with scientific evidence from clinical research. The DtC approach was efficient in selecting the best channels to reduce the EEG dataset dimensionality, allowing us to select four out of the 64 EEG channels (C3, CP5, PO7, and F8) that retain essential information related to alcoholism, which is useful in reducing computational time and resources during the classification task of alcoholic EEG.
IoT Smart Homes based on RFID Technology
Proceedings of the Fourth International Conference on Engineering & MIS 2018
Internet of Things (IoT) become one of the buzzwords in the Information Technology. It an ecosyst... more Internet of Things (IoT) become one of the buzzwords in the Information Technology. It an ecosystem of technologies monitoring the status of physical objects, capturing significant data, and communicating that information to software applications through IP networks. Today, Indoor localization systems based on underlying technologies like RFID have been designed and used to locate the movement of objects and subjects in the indoor environment. This technology finds its use in various indoor localization applications ranging from healthcare, tracking people and objects in real time to helped living in the smart environment and many more. The technology of RFID is known very convenient due to many benefits of flexibility, automatic identification, its cost effective and its energy efficiency. This paper presents some IoT Smart Homes applications based on RFID technologies. its presents also a number of comparable studies and discusses the techniques, applications, algorithms, and challenges presented during the integration of RFID technologies in IoT smart home systems.
Construction and decoding of OSMLD codes derived from unital and oval designs
2018 International Conference on Advanced Communication Technologies and Networking (CommNet)
A construction of One-Step Majority-Logic Decodable (OSMLD) codes based on the incidence matrices... more A construction of One-Step Majority-Logic Decodable (OSMLD) codes based on the incidence matrices of Balanced Incomplete Block Designs (BIBD) is given. In this paper, we focus on unital and oval designs which are constructed from a Projective Geometry (PG). Thus, we derive from the unital and oval designs new systematic and non-systematic OSMLD codes with rates and lengths not available with existing OSMLD codes. Simulation results show that the derived codes converge well under Iterative Threshold Decoding with an efficient trade-off between complexity and performances.
Many-to-one matching game towards secure virtual machines migration in cloud computing
2016 International Conference on Advanced Communication Systems and Information Security (ACOSIS)
Virtual machine migration represents a new topic of research last years. In this context, we pres... more Virtual machine migration represents a new topic of research last years. In this context, we present a new system based on matching game theory to design efficient and practical migration algorithms that work well with huge numbers of VMs and servers. This strategy solves VM migration, resources managements and load balancing problems in cloud computing environment. The experimental results show that our algorithm not only obtains multi-resource load balancing performance but also improves the cloud security services and gets a gain of resources consummation on all servers.
A novel detector based on the compact genetic algorithm for MIMO systems
2018 International Conference on Advanced Communication Technologies and Networking (CommNet), 2018
Multiple-Input Multiple-Output (MIMO) wireless communication systems have attracted recently a lo... more Multiple-Input Multiple-Output (MIMO) wireless communication systems have attracted recently a lot of research attention due to their potential to increase the communication throughput and capacity. The minimum Bit Error Rate performance (BER) can be achieved using the Maximum Likelihood (ML) search based detection, but it's computationally impractical for large MIMO systems and higher order modulation. The compact Genetic Algorithm (cGA) is a powerful search technique that is used successfully to solve many problems in various disciplines. In this paper, we propose a new MIMO detector based on the compact GA as well as a second version based on the persistent elitist compact GA, we use a hybridization between them and the soft output of the Minimum Mean Square Error (MMSE) at the level of the initialization of the probability vector. Simulation results show that our proposal can achieve the performance of ML detector for MIMO systems with a reduced computing time.
A New Electronic Voting System Based on Elliptic Curve in a Cloud Computing Environment
Authentication Protocol for Securing Internet of Things
Proceedings of the Fourth International Conference on Engineering & MIS 2018, 2018
The Internet of things (IoT) is become an important research topic because it integrates various ... more The Internet of things (IoT) is become an important research topic because it integrates various sensors and objects to communicate directly with one another object without human intervention. Today, Internet of Things has so many applications in our daily life like home automation, healthcare, smart grid, smart car etc.. The requirements for the large-scale deployment of the IoT, it leads to many security concerns like how to secure these devices, data and communication from unauthorized access. As IoT uses minimal capacity "things" and wireless technology for communication which makes it more vulnerable. In this paper we discuss a mutual authentication scheme proposed by Kalra and Sood in 2015, and then we show their weaknesses and propose an improved scheme
Non-binary cyclic majority-logic decodable codes: An algebraic construction by using Genetic Algorithms
2016 International Conference on Advanced Communication Systems and Information Security (ACOSIS), 2016
In this paper, the construction of non binary cyclic One-Step Majority-Logic decoding codes from ... more In this paper, the construction of non binary cyclic One-Step Majority-Logic decoding codes from the dual domain and idempotents is investigated. This had led us to propose a new design algorithm based on Genetic Algorithms, as an extension to previous works on the binary field. With the proposed algorithm, we were able to obtain long new non-binary cyclic OSMLD codes with high coding rates and good correction capacities. In fact, two powerful properties of the algebraic construction are provided, firstly, the designed codes have their minimal distances dmin and dimensions calculated analyticaly, secondly, they can be decoded with a low-complexity majority-voting decoding scheme.
A novel mutual authentication scheme for low-cost RFID systems
2016 International Conference on Wireless Networks and Mobile Communications (WINCOM), 2016
The importance of radio frequency identification (RFID) increases for its powerful capabilities f... more The importance of radio frequency identification (RFID) increases for its powerful capabilities for identifying, locating and automatic access control objects. Electronic Product Code Class 1 Generation 2 (EPC-C1G2) is served as the most popular standard for passive RFID tags. In the last year several schemes were proposed to improve security of EPC-C1G2, most of these schemes still vulnerable and cannot resist some attacks and others schemes exceeds the powerful computing capacity of passive tag. In this paper, we propose a new authentication mutual scheme compliant to EPC-C1G2 standard. The proposed scheme uses only ultra-lightweight operations, Cyclic Redundancy Code (CRC), exclusive OR (XOR) and Pseudo Random Number Generators (PRNG). We have demonstrated that proposed scheme resist against security attacks and more that is better than the previous schemes in terms of the communication and computation cost.
Cryptographic Algorithm Approach for Low Cost RFID Systems
Lecture Notes in Electrical Engineering, 2016
Today the security of RFID systems is a very important issue especially for low cost RFID tags. T... more Today the security of RFID systems is a very important issue especially for low cost RFID tags. Then, it is difficult for several researchers to adopt a strong encryption algorithm due to the extremely limited computational, storage and communication abilities of the tag. So, the priority in RFID systems is to ensure the integrity, confidentiality and authentication of messages using different algorithms (such as encryption and hashing algorithm). In this paper, we propose a lightweight symmetric key encryption approach that includes integrity as part of the encryption process in order to meet the resource limitations of low cost RFID tags. Furthermore we do not need to use separate hash functions to verify message integrity, thus leading to increase the computational efficiency of the system.
Compact Genetic Algorithms with larger tournament size for soft-decision decoding
2015 15th International Conference on Intelligent Systems Design and Applications (ISDA), 2015
The standard compact Genetic Algorithm uses competition between two individuals for which we calc... more The standard compact Genetic Algorithm uses competition between two individuals for which we calculate the objective function and the winner will be the one who gives the best value of this function. This work presents a new approach of compact Genetic Algorithm that uses more than just two vectors of competition; it introduces tournament selection with larger size using mutation. We apply this algorithm to solve dual domain soft-decision decoding problem. A performance study of the new decoder will be done and the results will be compared to another compact genetic decoder that uses higher selection pressure with randomly generated individuals.
Uploads
Papers by Mostafa Belkasmi