> Or having two bad keys sharing one same prime - then you can use Euclidean algorithm (greates common divisor).

I wrote a puzzle in 2012 to help people understand this issue:

http://www.loyalty.org/~schoen/rsa/