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?
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It only takes a minute to sign up.Sign up to join this community