Let N= pq be an RSA modulus with unknown factorization. Some variants of the RSA
cryptosystem, such as LUC, RSA with Gaussian primes and RSA type schemes based on …

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 …

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 …

In this paper, we apply the continued fraction method to launch an attack on the three RSA-
type cryptosystems when the private exponent d is sufficiently small. The first cryptosystem …

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 …

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. In 2002, Elkamchouchi,
Elshenawy, and Shaban introduced an interesting RSA-like cryptosystem that, unlike the …

The standard RSA scheme provides the key equation ed ≡ 1 φ (N) ed≡ 1 (mod φ (N)) for
N= pq N= pq, where φ (N)=(p-1)(q-1) φ (N)=(p-1)(q-1) is Euler quotient (or Euler's totient …

Since Wiener pointed out that the RSA can be broken if the private exponent d is relatively
small compared to the modulus N, it has been a general belief that the Wiener attack works …