@article {Semmouni2022353,
	title = {Bitcoin security with a twisted Edwards curve},
	journal = {Journal of Discrete Mathematical Sciences and Cryptography},
	volume = {25},
	number = {2},
	year = {2022},
	note = {cited By 2},
	pages = {353-371},
	abstract = {The security of the Bitcoin cryptocurrency system depends on the Koblitz curve secp256k1 combined with the digital signature ECDSA and the hash function SHA-256. In this paper, we show that the security of Bitcoin with ECDSA and secp256k1 is not optimal and present a detailed study of the efficiency of Bitcoin with the digital signature algorithm Ed25519 combined with the twisted Edwards curve CurveEd25519 and the hash function SHA-512. We show that Bitcoin is more secure and more efficient with the digital signature algorithm Ed25519 and the twisted Edwards curve CurveEd25519. {\textcopyright} 2022 Taru Publications.},
	doi = {10.1080/09720529.2019.1681673},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85080957680\&doi=10.1080\%2f09720529.2019.1681673\&partnerID=40\&md5=1701fb22e429664ce981464ba5838610},
	author = {Semmouni, M.C. and Nitaj, A. and Belkasmi, M.}
}
@article {Cherkaoui-Semmouni202142,
	title = {Cryptanalysis of RSA Variants with Primes Sharing Most Significant Bits},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {13118 LNCS},
	year = {2021},
	note = {cited By 0},
	pages = {42-53},
	abstract = {We consider four variants of the RSA cryptosystem with an RSA modulus N= pq where the public exponent e and the private exponent d satisfy an equation of the form ed- k(p2- 1 ) (q2- 1 ) = 1. We show that, if the prime numbers p and q share most significant bits, that is, if the prime difference | p- q| is sufficiently small, then one can solve the equation for larger values of d, and factor the RSA modulus, which makes the systems insecure. {\textcopyright} 2021, Springer Nature Switzerland AG.},
	keywords = {Artificial intelligence, Computers, Continued fraction, Coppersmith{\textquoteright}s method, Cryptography, Lattice reduction, Most significant bit, Prime differences, Prime number, RSA cryptosystems, RSA moduli, RSA variant, S-method, Security of data},
	doi = {10.1007/978-3-030-91356-4_3},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85121867699\&doi=10.1007\%2f978-3-030-91356-4_3\&partnerID=40\&md5=c9be6e3c3f4c8ed53f31b0bad5cba512},
	author = {Cherkaoui-Semmouni, M. and Nitaj, A. and Susilo, W. and Tonien, J.}
}
@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.}
}
