This question already has an answer here:
- RSA find $q$ given only $e$ and $p$ 1 answer
Suppose someone forgot the value of $n$ and you only knew the values for $e$ and $p$. How could one go about limiting down the possible values for $n,q$, and $d$?
I'm thinking to try and solve $\gcd(e, (p-1)(q-1)) = 1$ first for possible values of q and work backward from there but I don't really know/