Cryptanalysis of the multi-power RSA cryptosystem variant (Q6164403)

The authors study the multi-power variant of the RSA cryptosystem where the modulus is of the form $N=p^rq^s$ with $\gcd(r, s)=1$. They present a method to solve the linear equation $a_1x_1+a_2x_2\equiv 0\pmod{p^u q^v}$ where $u<r$, $v<s$, and $a_1$, $a_2$ are two integers satisfying $\gcd(a_1 a_2, N)=1$. They apply the new method to the cryptanalysis of two instances of the Multi-Power RSA. They define a generalization of the CRT-RSA variant of the standard RSA to the Multi-Power RSA, and apply the new method to study its security. The new method is based on \textit{D. Coppersmith}'s method [J. Cryptology 10, No. 4, 233--260 (1997; Zbl 0912.11056)] and lattice reduction techniques. For the entire collection see [Zbl 1515.68028].