<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>DreamMX Weblogs &#187; Fun</title>
	<atom:link href="http://blog.dreammx.com/category/general/fun/feed" rel="self" type="application/rss+xml" />
	<link>http://blog.dreammx.com</link>
	<description>Team Blog</description>
	<lastBuildDate>Sun, 22 Mar 2009 19:07:39 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>An attack on RSA</title>
		<link>http://blog.dreammx.com/general/fun/an-attack-on-rsa.html</link>
		<comments>http://blog.dreammx.com/general/fun/an-attack-on-rsa.html#comments</comments>
		<pubDate>Tue, 17 Mar 2009 02:05:12 +0000</pubDate>
		<dc:creator>fox</dc:creator>
				<category><![CDATA[Fun]]></category>

		<guid isPermaLink="false">http://blog.dreammx.com/fox/general/fun/an-attack-on-rsa/</guid>
		<description><![CDATA[A simple concept on cracking RSA
The security of RSA is based on a math problem. For 2 huge(1000 bits) prime numbers p and q. We have n = p * q. Agreement on that: knowing n, calculating p and q is impossible right now.
But if p and q are close together (close means &#124;p-q&#124; &#60; [...]]]></description>
			<content:encoded><![CDATA[<p>A simple concept on cracking RSA</p>
<p>The security of RSA is based on a math problem. For 2 huge(1000 bits) prime numbers p and q. We have n = p * q. Agreement on that: knowing n, calculating p and q is impossible right now.</p>
<p>But if p and q are close together (close means |p-q| &lt; 1,000,000,000), the we&#8217;ve got a change</p>
<p>n = p*q = (p+q / 2)^2 &#8211; (p-q / 2)^2</p>
<p>Denotes T = √(p+q / 2)^2 and S = √(p-q/ 2)^2</p>
<p>if p and q are close</p>
<p>then S is close to 0</p>
<p>and T is close to √n</p>
<p>now start look at the following numbers</p>
<p>⌈√n⌉,⌈√n⌉+1,⌈√n⌉+2,⌈√n⌉+3,&#8230;</p>
<p>stop when we find a n that make t^2 &#8211; n is a perfect square number</p>
<p>and we&#8217;ve got the value of p and q.</p>
]]></content:encoded>
			<wfw:commentRss>http://blog.dreammx.com/general/fun/an-attack-on-rsa.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
