Cryptanalysis of common prime RSA with two decryption exponents: Jochemsz and May approach

RSA is a well-known public key cryptosystem in modern-day cryptography. Common prime RSA (CP-RSA) is a variant of RSA which is introduced by Wiener to avoid the small secret exponent attack on RSA. Lattice-based reduction algorithms were successfully used for cryptanalysis for RSA and its variants. In this paper, we mount an attack on CP-RSA by following the Jochemsz and May approach. Jochemsz and May approach is the standard way to construct the lattices for the attacks on RSA and its variants. Our attack improves the bounds of attacks on standard RSA and CP-RSA.