A Generalized Attack on the Multi-prime Power RSA

Some variants of the RSA cryptosystem use a modulus of the form N = p q, a public exponent e, and a private exponent d satisfying a key equation of the form e d − k ( p 2 − 1 ) ( q 2 − 1 ) = 1. In this paper, we use Coppersmith's ...

We study the Multi-Power variant of the RSA cryptosystem where the modulus is of the form $N=p^r{q}^s$ with $gcd(r,s)=1$. We present a method to solve the linear equation $a_1{x}_1+a_2{x}_2\equiv 0(mod{p}^u{q}^v)$ where $u<r$, $v<s$, and $a_1$, $a_2$ are two integers satisfying $gcd(a_1{a}_2,...\mathrm{}$

The multi-power RSA cryptosystem is a variant of RSA where the modulus is in the form $N=p^r{q}^s$ with $max(r,s)\ge 2$. In the multi-power RSA variant, the decryption phase is much faster than the standard RSA. While RSA has been intensively studied, the ...