Vulnerabilities of \(ex^2\) - \(y^2\)\(\phi\) (N)= z Using Modulus of the Form N= \(p^r\)\(q^s\)
Sadiq Shehu, Buhari Auwalu Ibrahim, A. A. Ibrahim, Ahmad Rufai · Journal of Advances in Mathematics and Computer Science · 2023
The technical details of RSA works on the idea that it is easy to generate the modulus by multiplying two sufficiently large prime numbers together, but factorizing that number back into the original prime numbers is extremely difficult. Suppose that \(N=p^r q^s\) are RSA modulus, where \(p\) and \(q\) are product of two large unknown of unbalance primes for \(2 \leq s