@article {Kartit2016141,
	title = {Applying encryption algorithm for data security in cloud storage},
	journal = {Lecture Notes in Electrical Engineering},
	volume = {366},
	year = {2016},
	note = {cited By 0},
	pages = {141-154},
	abstract = {This paper proposes a simple, secure, and privacy-preserving architecture for inter-Cloud data sharing based on an encryption/decryption algorithm which aims to protect the data stored in the cloud from the unauthorized access. {\textcopyright} Springer Science+Business Media Singapore 2016.},
	doi = {10.1007/978-981-287-990-5_12},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959117395\&doi=10.1007\%2f978-981-287-990-5_12\&partnerID=40\&md5=5e4a7f778a62fb9bb090db998cc47f86},
	author = {Kartit, Z.a and Azougaghe, A.b and Idrissi, H.K.a and Marraki, M.E.a and Hedabou, M.c and Belkasmi, M.b and Kartit, A.d}
}
@conference {Aylaj2016557,
	title = {Degeneration simulated annealing algorithm for combinatorial optimization problems},
	booktitle = {International Conference on Intelligent Systems Design and Applications, ISDA},
	volume = {2016-June},
	year = {2016},
	note = {cited By 0},
	pages = {557-562},
	abstract = {In this paper, we use the physical aspect of the simulated annealing method in order to propose a modified simulated annealing algorithm. The main idea of the algorithm is based to find the optimal solution of a combinatorial optimization problem by switching between two different subsystems of treatment; using so called degeneration of atoms energy. This new algorithm is named Degeneration Simulated Annealing (DSA) algorithm. To illustrate the effectiveness of DSA, it is applied to solve the problems of the minimum distance and the decoding, in coding theory. The computational experiment results obtained by DSA are very interesting. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/ISDA.2015.7489177},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84978430456\&doi=10.1109\%2fISDA.2015.7489177\&partnerID=40\&md5=0471da6bb951204df77f8f7a184b034d},
	author = {Aylaj, B.a and Belkasmi, M.b and Zouaki, H.a and Berkani, A.b}
}
@article {Aylaj2016175,
	title = {Simulated annealing decoding of linear block codes},
	journal = {Lecture Notes in Electrical Engineering},
	volume = {380},
	year = {2016},
	note = {cited By 0},
	pages = {175-183},
	abstract = {In this paper, we present a hard-decision decoding algorithm using Simulated Annealing (SA) technique. The main idea is to find the optimal solution of the transmitted codeword by a process hopping between two different tasks. The simulations, applied on some binary linear block codes over the AWGN channel, show that the Simulated Annealing decoder has the same performance as the Berlekamp-Massey Algorithm (BM). Furthermore SA Decoder is more efficient compared to other Decoder based on Genetic algorithms in terms of performance and run time. {\textcopyright} Springer International Publishing Switzerland 2016.},
	doi = {10.1007/978-3-319-30301-7_19},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84964495058\&doi=10.1007\%2f978-3-319-30301-7_19\&partnerID=40\&md5=d6baed6c15bb3a2d4e616c03caff9e9f},
	author = {Aylaj, B.a and Belkasmi, M.b}
}
@article {Aouinatou20158,
	title = {A dynamic study with side channel against an identification based encryption},
	journal = {International Journal of Communication Networks and Information Security},
	volume = {7},
	number = {1},
	year = {2015},
	note = {cited By 1},
	pages = {8-19},
	abstract = {Recently, the side channel keeps the attention of researchers in theory of pairing, since, several studies have been done in this subject and all they have the aim in order to attack the cryptosystems of Identification Based Encryption (IBE) which are integrated into Smart Cards (more than 80\% of those cryptosystems are based on a pairing). The great success and the remarkable development of the cryptography IBE in the recent years and the direct connection of this success to the ability of resistance against any kind of attack, especially the DPA (Differential Power Analysis) and DFA (Differential Fault Analysis) attacks, leave us to browse saying all the studies of the DPA and DFA attacks applied to a pairing and we have observed that they have no great effect to attack the cryptosystems of IBE. That is what we will see in this paper. In this work we will illuminate the effect of the DPA attack on a cryptosystems of IBE and we would see on what level we can arrive. Thus in the case where this attack can influence on those cryptosystems, we can present an appropriate counter-measures to resist such attack. In the other part, we will also propose a convenient counter-measure to defend against the DFA attack when the embedding degree is even.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84929307912\&partnerID=40\&md5=01269c358b3d93b26c9cc87bd33fc777},
	author = {Aouinatou, R.a and Belkasmi, M.b and Askali, M.b}
}
@article {Kartit201537403,
	title = {Towards a secure electronic voting in cloud computing environment using homomorphic encryption algorithm},
	journal = {International Journal of Applied Engineering Research},
	volume = {10},
	number = {16},
	year = {2015},
	note = {cited By 0},
	pages = {37403-37408},
	abstract = {Cloud computing is the most envisioned paradigm shift in the computing world. In this context, it becomes necessary to properly protect the data from different risks and dangers that are born with cloud computing. In recent years, Storage in Cloud gained popularity among both companies and private users. However, data privacy, security, reliability and interoperability issues still have to be adequately faced and solved. But the most important between them is security and how cloud provider assures it. In this paper we present an electronic voting system based on Homomorphic encryption. Our proposal offers all the advantages of the additively homomorphic encryption scheme. {\textcopyright} Research India Publications.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942041969\&partnerID=40\&md5=d7c7f2b6010ffb0011789f148b1fb2ed},
	author = {Kartit, Z.a and El Marraki, M.a and Azougaghe, A.b and Belkasmi, M.b}
}
@article {Aouinatou2013171,
	title = {On the conventional public key in identification-based encryption: The case of RSA},
	journal = {International Journal of Information and Computer Security},
	volume = {5},
	number = {3},
	year = {2013},
	note = {cited By 1},
	pages = {171-201},
	abstract = {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. {\textcopyright} 2013 Inderscience Enterprises Ltd.},
	doi = {10.1504/IJICS.2013.055837},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84882653997\&doi=10.1504\%2fIJICS.2013.055837\&partnerID=40\&md5=9f48d3394236ca7149104e451bdb8230},
	author = {Aouinatou, R.a and Belkasmi, M.b}
}
