Abstract RSA (Rivest-Shamir-Adleman) cryptosystem is the most popular asymmetric key
cryptographic algorithm used in computer science and information security. Recently, an …

We consider four variants of the RSA cryptosystem with an RSA modulus N= pq N= pq
where the public exponent e and the private exponent d satisfy an equation of the form ed …

Let N= pq be an RSA modulus where p and q are primes not necessarily of the same bit
size. Previous cryptanalysis results on the difficulty of factoring the public modulus N= pq …

Let N= pq be the product of two balanced prime numbers p and q. In Elkamchouchi et
al.(Extended RSA cryptosystem and digital signature schemes in the domain of Gaussian …

Some variants of the RSA cryptosystem use a modulus of the form N= pq, a public exponent
e, and a private exponent d satisfying a key equation of the form ed− k (p 2− 1)(q 2− 1)= 1. In …

Partial key exposure attacks on RSA have been intensively studied by using lattice-based
Coppersmith's methods. Ernst et al.(Eurocrypt'05) studied the problem by considering three …

Let N= pq be the product of two balanced prime numbers p and q. In 2002, Elkamchouchi,
Elshenawy, and Shaban introduced an interesting RSA-like cryptosystem that, unlike the …

Let N= pq be an RSA modulus with unknown factorization. The RSA cryptosystem can be
attacked by using the key equation ed-k (p-1)(q-1)= 1. Similarly, some variants of RSA, such …

Let $ N= pq $ be the product of two balanced prime numbers $ p $ and $ q $. Elkamchouchi,
Elshenawy and Shaban presented in 2002 an interesting RSA-like cryptosystem that uses …

To enhance the security or the efficiency of the standard RSA cryptosystem, some variants
have been proposed based on elliptic curves, Gaussian integers or Lucas sequences. A …