@article {Semmouni2021768,
	title = {A New Electronic Voting System Based on Elliptic Curve in a Cloud Computing Environment},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {1383 AISC},
	year = {2021},
	note = {cited By 0},
	pages = {768-778},
	abstract = {The process of democratization is developing and promoting due to electronic voting. However, the increase of frauds and the increasing amount of attacks launched by hackers, gave birth to privacy and authentication problems. Cryptography offers multiple solutions to overcome the sensitive data protection issues in e-voting. In this paper, we study the application of elliptic curve cryptography, and use the homomorphic encryption properties to present a new electronic voting system. Our new scheme is based on the homomorphic cryptosystem EC-ELGAMAL~[7], and zero knowledge algorithm of Schnorr algorithm for identification and authentication. {\textcopyright} 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	keywords = {Authentication, Cloud computing environments, Electronic voting, Electronic voting systems, Elliptic curve cryptography, Geometry, Ho-momorphic encryptions, Homomorphic cryptosystem, Multiple solutions, Pattern recognition, Personal computing, Privacy by design, Public key cryptography, Schnorr algorithm, Sensitive data protections, Soft computing, Voting machines},
	doi = {10.1007/978-3-030-73689-7_73},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85105859364\&doi=10.1007\%2f978-3-030-73689-7_73\&partnerID=40\&md5=8bb3fcc911f5436bbd6e39378e1aec4a},
	author = {Semmouni, M.C. and Azougaghe, A. and Nitaj, A. and Belkasmi, M.}
}
@article {Rkizat2019168,
	title = {A New Quasi-Cyclic Majority Logic Codes Constructed from Disjoint Difference Sets by Genetic Algorithm},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {756},
	year = {2019},
	note = {cited By 0},
	pages = {168-177},
	doi = {10.1007/978-3-319-91337-7_16},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85047321606\&doi=10.1007\%2f978-3-319-91337-7_16\&partnerID=40\&md5=c0583078d7ef801071c2f7c605348789},
	author = {Rkizat, K. and Nouh, S. and Lahmer, M. and Belkasmi, M.}
}
@conference {Boualame20181,
	title = {New efficient decoding algorithm of the (17, 9, 5) quadratic residue code},
	booktitle = {Proceedings - 2018 International Conference on Advanced Communication Technologies and Networking, CommNet 2018},
	year = {2018},
	pages = {1-6},
	doi = {10.1109/COMMNET.2018.8360258},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048326657\&doi=10.1109\%2fCOMMNET.2018.8360258\&partnerID=40\&md5=198217e84a8461108632edc7190041a6},
	author = {Boualame, H. and Chana, I. and Belkasmi, M.}
}
@conference {Tahiri20181,
	title = {A novel detector based on the compact genetic algorithm for MIMO systems},
	booktitle = {Proceedings - 2018 International Conference on Advanced Communication Technologies and Networking, CommNet 2018},
	year = {2018},
	pages = {1-6},
	doi = {10.1109/COMMNET.2018.8360279},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048346101\&doi=10.1109\%2fCOMMNET.2018.8360279\&partnerID=40\&md5=80e5367fed32603ca01e87c38d0b8d75},
	author = {Tahiri, N. and Azouaoui, A. and Belkasmi, M.}
}
@conference {Farchane2017,
	title = {New decoder for linear block codes},
	booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings},
	year = {2017},
	note = {cited By 0},
	abstract = {This paper exposes a new decoder for linear bloc codes. The proposed decoder is based on the resolution of the parity equations system. Elsewhere, to reduce its complexity we have developed a criteria for early terminating the decoding, on the one hand. On the other hand, we introduced a fast method for generating test error patterns. Our decoder is suitable for linear bloc code of medium and high code rate. Because, it presents a reduced complexity compared to similar decoders presented in literature. Simulation results show that the basic decoder, Dual-R-0 out performs the Berlikamp-massey{\textquoteright}s one for the decoding of the BCH(63, 51) code with BPSk modulation over an AWGN channel. The performance of the decoder Dual-R-2 for the code BCH(2047, 2014) is about 0.9 dB away from the Shannon{\textquoteright}s limit at the bit error rate (BER) 10-5. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ACOSIS.2016.7843939},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015196984\&doi=10.1109\%2fACOSIS.2016.7843939\&partnerID=40\&md5=e2078d92b0c8571a77d2222866cf5358},
	author = {Farchane, A. and Belkasmi, M.}
}
@conference {Addi2017,
	title = {New hard decision decoder of LDPC codes using single bit flipping algorithm},
	booktitle = {Proceedings - 2017 International Conference on Wireless Networks and Mobile Communications, WINCOM 2017},
	year = {2017},
	note = {cited By 0},
	abstract = {The Bit-Flipping (BF) algorithm is considered as a hard decoding method for LDPC codes. It is much simpler than the probabilistic methods like Sum Product Algorithm (SPA), and can be efficiently implemented by electronic circuits. In this paper, we propose a new Bit Flipping algorithm for Low-Density Parity- Check codes (LDPC) called Single Bit-Flipping (SBF). Compared to the Gallager Bit-Flipping algorithm, the proposed algorithm employs criteria of flipping single bit chosen carefully. This method eliminates the risk for flipping more than one bit at a time that can induce additional error bits and propagate the errors to the later iterations. We present some results obtained by applying this new method that provides a gain in performance in comparison to the standard Gallager Bit-Flipping with low complexity. {\textcopyright}2017 IEEE.},
	doi = {10.1109/WINCOM.2017.8238191},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041431498\&doi=10.1109\%2fWINCOM.2017.8238191\&partnerID=40\&md5=51139715da4295938142bee17d106a96},
	author = {Addi, S. and Berkani, A. and Azouaoui, A. and Belkasmi, M.}
}
@conference {Yatribi2017,
	title = {Non-binary cyclic majority-logic decodable codes: An algebraic construction by using Genetic Algorithms},
	booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings},
	year = {2017},
	note = {cited By 0},
	abstract = {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. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ACOSIS.2016.7843935},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015215915\&doi=10.1109\%2fACOSIS.2016.7843935\&partnerID=40\&md5=4e462ad826ef141669b51bb0bf07198c},
	author = {Yatribi, A. and Belkasmi, M. and Ayoub, F. and M{\textquoteright}rabet, Z.}
}
@conference {Labbi2017,
	title = {A novel efficient ultralightweight authentication algorithm for RFID systems},
	booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings},
	year = {2017},
	note = {cited By 0},
	abstract = {The security and privacy of RFID (Radio Frequency Identification) systems becomes an important subject especially for low cost RFID tags. A lot of authentication protocols were proposed to insure the security and in the same time meet the resource limitations. In this paper, we proposed an ultralight weight authentication approach based on permutation, XOR and rotation functions. As a result, the computational complexity and communication cost will be reduced as well as increase performance. Finally, our approach proves that the protocol is a lightweight, resistant to known attacks and has an effective security mechanism based on an analytical method. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ACOSIS.2016.7843920},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015208818\&doi=10.1109\%2fACOSIS.2016.7843920\&partnerID=40\&md5=4252c34bda296ca38939e93620bb3164},
	author = {Labbi, Z. and Senhadji, M. and Maarof, A. and Belkasmi, M.}
}
@conference {Maarof2016240,
	title = {A novel mutual authentication scheme for low-cost RFID systems},
	booktitle = {Proceedings - 2016 International Conference on Wireless Networks and Mobile Communications, WINCOM 2016: Green Communications and Networking},
	year = {2016},
	note = {cited By 0},
	pages = {240-245},
	abstract = {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. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/WINCOM.2016.7777221},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010332933\&doi=10.1109\%2fWINCOM.2016.7777221\&partnerID=40\&md5=1fff563fec3d60d322be588205c273c3},
	author = {Maarof, A. and Labbi, Z. and Senhadji, M. and Belkasmi, M.}
}
@conference {Azouaoui20121176,
	title = {A new genetic decoding of Linear Block Codes},
	booktitle = {Proceedings of 2012 International Conference on Multimedia Computing and Systems, ICMCS 2012},
	year = {2012},
	note = {cited By 2},
	pages = {1176-1182},
	doi = {10.1109/ICMCS.2012.6320254},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84869797472\&doi=10.1109\%2fICMCS.2012.6320254\&partnerID=40\&md5=61049c5a211ceb9447427a9468114bf1},
	author = {Azouaoui, A. and Belkasmi, M.}
}
@article {Bouanani2012,
	title = {New results for Shannon capacity over generalized multipath fading channels with MRC diversity},
	journal = {Eurasip Journal on Wireless Communications and Networking},
	volume = {2012},
	number = {1},
	year = {2012},
	note = {cited By 7},
	doi = {10.1186/1687-1499-2012-336},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84975257524\&doi=10.1186\%2f1687-1499-2012-336\&partnerID=40\&md5=e634e3e8c1f8c11dd0447fbfa16245ef},
	author = {Bouanani, F.E. and Ben-Azza, H. and Belkasmi, M.}
}
