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 …

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 …

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 …

The RSA cryptosystem comprises of two important features that are needed for encryption
process known as the public parameter e and the modulus N. In 1999, a cryptanalysis on …

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 …

This paper investigates a novel RSA-like cryptosystem proposed by Murru-Saettone. This
cryptosystem is constructed from a cubic field connected to the cubic Pell equation and …

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 …

Since Wiener pointed out that the RSA can be broken if the private exponent d is relatively
small compared to the modulus N (using the continued fraction technique), it has been a …

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 …

In this paper we present new arithmetical and algebraic results following the work of
Babindamana and al. on hyperbolas and describe in the new results an approach to …