A new attack on some RSA variants
Theoretical Computer Science
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(p2−1)(q2−1)=1. In this paper, we use Coppersmith's method to solve the key equation when the prime factors p and q share an amount of their least significant bits. Our attack breaks the systems and improves all the former attacks on such variants when d is suitably small and the amount of the shared bits is suitably large.
Open Access Status
This publication is not available as open access