Thirty years after RSA was first publicized, it remains an active research area. Although
several good surveys exist, they are either slightly outdated or only focus on one type of …

In this paper we revisit Wiener's method (IEEE-IT, 1990) of continued fraction (CF) to find
new weaknesses in RSA. We consider RSA with N= pq, q< p< 2 q, public encryption …

Thus far, partial key exposure attacks on RSA have been intensively studied using lattice
based Coppersmith's methods. In the context, attackers are given partial information of a …

The security on many public key encryption schemes relied on the intractability of finding the
integer factoring problem such as RSA scheme. However, there are great deals of …

In 1999, Boneh and Durfee introduced the small inverse problem, which solves the bivariate
modular equation x (N+y)≡ 1 (mod e. Absolute values of solutions for x and y are bounded …

In this work we re-examine two common modulus attacks on RSA. First, we show that Guo's
continued fraction attack works much better in practice than previously expected. Given …

Let (n= pq, e= n β) be an RSA public key with private exponent d= n δ, where p and q are
large primes of the same bit size. At Eurocrypt 96, Coppersmith presented a polynomial-time …

We address a lattice based method on small secret exponent attack on RSA scheme. Boneh
and Durfee reduced the attack into finding small roots of a bivariate modular equation …

Let N= pq be an RSA modulus with balanced prime factors, that is q< p< 2 q. There exist
infinitely many integers x, y and z such that ex-ϕ (N) y=(p+ q-1) z. We show that if the prime …

The CRT-RSA cryptosystem is the most widely adopted RSA variant in digital applications. It
exploits the properties of the Chinese remainder theorem (CRT) to elegantly reduce the size …