@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.}
}
