n, e and modulus of RSA are given and n is very large. p and q are primes generated by pow(7, random_seed, modulus), and the seed that p and q used is very close. How can I get p and q, or is there any other way to decrypt this RSA?

  • $\begingroup$ $n$ is calculated using $p$ and $q$. How is the modulus set in the given algorithm? How did you make sure that the result is indeed prime? Is this some kind of riddle, assignment, CTF or homework? $\endgroup$
    – Maarten Bodewes
    Aug 19 at 22:04


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Browse other questions tagged or ask your own question.