-
1
Cryptanalysis on prime power RSA modulus of the form N=prq
Published 2016“…In the first attack we consider the class of public exponents satisfying an equation \(e X - N Y = u p^r + \frac{q^r}{u} + Z\) for suitably small positive integer \(u\). Using continued fraction we show that \(\frac{Y}{X}\) can be recovered among the convergents of the continued fraction expansion of \(\frac{e}{N}\) and leads to the successful factorization of \(N p^r q\). …”
Get full text
Article -
2
New directions in factoring the prime power RSA modulus N = prq
Published 2016“…In the first attack we consider the class of public key exponents satisfying an equation eX - NY - (apr + bqr + z) = 1 where a, b are suitably small integers with gcd(a, b) = 1. Using the continued fraction algorithm, we show that such exponents yield the factorization of the RSA Prime Power modulus in polynomial time. …”
Get full text
Conference or Workshop Item -
3
New attacks on prime power N = prq using good approximation of φ(N)
Published 2017“…If δ < 1-y/2 we shows that k/d can be recovered among the convergents of the continued fractions expansions of e/N-2N r/r+1 + N r-1/r+1. …”
Get full text
Article