Cryptanalysis of the multi-power RSA cryptosystem variant
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].
- Cryptanalysis of variants of RSA with multiple small secret exponents
- Cryptanalysis of RSA with more than one decryption exponent
- Further cryptanalysis of a type of RSA variants
- Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
- Cryptanalysis of RSA with multiple small secret exponents
- A generalized attack on the multi-prime power RSA
- Cryptanalysis of RSA and its variants.
- Cryptanalysis of RSA variants with modified Euler quotient
- Cryptanalysis of RSA with two decryption exponents
- A generalized attack on the multi-prime power RSA
- A method for obtaining digital signatures and public-key cryptosystems
- A new Rabin-type trapdoor permutation equivalent to factoring
- Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
- Cryptanalysis of RSA and its variants.
- Cryptanalysis of short RSA secret exponents
- Factoring integers with elliptic curves
- Factoring polynomials with rational coefficients
- scientific article; zbMATH DE number 1583953 (Why is no real title available?)
- scientific article; zbMATH DE number 1258344 (Why is no real title available?)
- scientific article; zbMATH DE number 1302856 (Why is no real title available?)
- scientific article; zbMATH DE number 1303131 (Why is no real title available?)
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- Improved factorization of \(N=p^rq^s\)
- Public Key Cryptography – PKC 2004
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Solving linear equations modulo unknown divisors: revisited
This page was built for publication: Cryptanalysis of the multi-power RSA cryptosystem variant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164403)
