<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Karima Djebaili</style></author><author><style face="normal" font="default" size="100%">Lamine Melkemi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Different Encryption System Based on the Integer Factorization Problem</style></title><secondary-title><style face="normal" font="default" size="100%">Malaysian Journal of Computing and Applied Mathematics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.sciencegate.app/document/10.37231/myjcam.2020.3.1.43</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">3</style></volume><pages><style face="normal" font="default" size="100%">50-54</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	We present a new computational problem in this paper, namely the order of a group element problem which is based on the factorization problem, and we analyze its applications in cryptography. We present a new one-way function and from this function we propose a homomorphic probabilistic scheme for encryption. Our scheme, provably secure under the new computational problem in the standard model.
&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">1</style></issue></record></records></xml>