Hatem M. Bahig

Learn More
Let (n = pq, e) be an RSA public key with private exponent d = n<sup>delta</sup>, where p and q are large primes of the same bit size. Suppose that p<sub>o</sub> ges radicn be an approximation of p with |p - po| les 1/8n<sup>alpha</sup>, alpha les 1/2. Using continued fractions, we show that the system is insecure if delta &lt; 1-alpha/2. Our result is(More)
This paper presents three new attacks on the RSA cryp-tosystem. The first two attacks work when k RSA public keys (Ni, ei) are such that there exist k relations of the shape eix − yiφ(Ni) = zi or of the shape eixi − yφ(Ni) = zi where Ni = piqi, φ(Ni) = (pi − 1)(qi − 1) and the parameters x, xi, y, yi, zi are suitably small in terms of the prime factors of(More)