Let \(N=p^r q^s\) be prime power moduli where \(p\) and \(q\) are unbalance prime numbers for \(2 \leq s<r\). If \(q<p<\lambda q\) and \(q^s<p^r<\lambda q^s\), and \[ \phi(N) \approx \lambda^{\frac{r-s}{2 r}}\left(N^{\frac{r+s}{2 r}+N^{\frac{r+s-2}{2 r}}}\right)-N^...
Open access
Research Article10.9734/jamcs/2023/v38i81788
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...
Open access
Research Article10.9734/jamcs/2023/v38i81790
Cryptography is fundamental to the provision of a wider notion of information security. Electronic information can easily be transmitted and stored in relatively insecure environments. This research was present to factor the prime power modulus \(N = p^r q\) for \(r \geq 2\) usin...
Open access
Research Article10.9734/arjom/2020/v16i1230255