Finding prime factors of non-random key generator
So you have two numbers that:


both have two prime factors, and
you strongly suspect that they share a factor.


So one is $n_{1}=pq_{1}$ the other $n_{2}=pq_{2}$. What is their GCD?


   What happens when you apply Euclid' algorithm?