<p>These two papers could possibly come in useful</p>

<ul>
<li><a href="http://arxiv.org/PS_cache/arxiv/pdf/0811/0811.0063v1.pdf" rel="nofollow">Andrej Dujella - A Variant of Wiener's Attack on RSA</a></li>
<li><a href="http://arxiv.org/PS_cache/cs/pdf/0402/0402052v1.pdf" rel="nofollow">Andrej Dujella - Continued Fractions and RSA with small secret exponent</a></li>
</ul>

<p>Came across them when I was doing some basic research on continued fractions.</p>
Cracking short RSA keys
<p>Given the following RSA keys, how does one go about determining what the values of <em>p</em> and <em>q</em> are?</p>

<pre><code>Public Key: (10142789312725007, 5)
Private Key: (10142789312725007, 8114231289041741)
</code></pre>