Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

$N=p*q$ is a product of two distinct primes. Show that if $\phi(N)$ and 2N are known, then it is possible to compute p and q in polynomial time.

so, I know that $\phi(N)=(p-1)(q-1)$

Given this, if $\phi(N)=C$ where $C$ is a known constant,



So, I know it is possible to compute p and q. How would I prove that it is possible to compute them in polynomial time?

share|cite|improve this question
All you need is to plug the $p$ you got into $2N=2pq$. Then you get a quadratic in $q$. – N. S. Dec 5 '12 at 20:33
up vote 4 down vote accepted

$\phi(N)=(p-1)(q-1)=pq-(p+q)+1=N+1-(p+q)$, thus: $$p+q=N+1-\phi(N)$$ $$pq=N$$ You have two equations that will enable you to solve for p,q using the quadratic formula

share|cite|improve this answer
So to me, this reduces to $p=\frac{1-2q}{2}$, thus $N=q\bigg(\frac{1-2q}{2}\bigg)$... How would I put this in quadratic form? All I can reduce this to is $N=\frac{-2q^2+q}{2}$ – gfppaste Dec 5 '12 at 22:31
You can use the quadratic formula to solve this equation – Amr Dec 5 '12 at 22:34

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.