<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://blogs.msdn.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>Developing for Developers - All Comments</title><link>http://blogs.msdn.com/b/devdev/</link><description>Tools, techniques, and theory for measuring and improving the power and performance of developers and their code</description><dc:language>en-US</dc:language><generator>Telligent Evolution Platform Developer Build (Build: 5.6.50428.7875)</generator><item><title>re: Factoring large numbers with quadratic sieve</title><link>http://blogs.msdn.com/b/devdev/archive/2006/06/19/637332.aspx#9871648</link><pubDate>Sun, 16 Aug 2009 17:34:14 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9871648</guid><dc:creator>Lieven van der Heide</dc:creator><description>&lt;p&gt;Actually, ignore the last sentence in my previous post, as I was confused with something else:)&lt;/p&gt;&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=9871648" width="1" height="1"&gt;</description></item><item><title>re: Factoring large numbers with quadratic sieve</title><link>http://blogs.msdn.com/b/devdev/archive/2006/06/19/637332.aspx#9871302</link><pubDate>Sun, 16 Aug 2009 02:43:05 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9871302</guid><dc:creator>Lieven van der Heide</dc:creator><description>&lt;p&gt;Maybe this was intended to be obvious from the context, but note that raising a number to (p−1)/2 to test if it's a quadratic residue only works if p is prime. For non prime modulus, you have to raise to totient(p) / 2.&lt;/p&gt;&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=9871302" width="1" height="1"&gt;</description></item><item><title> Developing for Developers How does JPEG actually work | storage bench</title><link>http://blogs.msdn.com/b/devdev/archive/2006/04/12/575384.aspx#9782888</link><pubDate>Fri, 19 Jun 2009 11:17:50 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9782888</guid><dc:creator> Developing for Developers How does JPEG actually work | storage bench</dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://thestoragebench.info/story.php?id=10755"&gt;http://thestoragebench.info/story.php?id=10755&lt;/a&gt;&lt;/p&gt;
&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=9782888" width="1" height="1"&gt;</description></item><item><title> Developing for Developers Factoring large numbers with quadratic sieve | storage bench</title><link>http://blogs.msdn.com/b/devdev/archive/2006/06/19/637332.aspx#9782191</link><pubDate>Fri, 19 Jun 2009 10:45:19 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9782191</guid><dc:creator> Developing for Developers Factoring large numbers with quadratic sieve | storage bench</dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://thestoragebench.info/story.php?id=5411"&gt;http://thestoragebench.info/story.php?id=5411&lt;/a&gt;&lt;/p&gt;
&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=9782191" width="1" height="1"&gt;</description></item><item><title> Developing for Developers Literate programming | patio set</title><link>http://blogs.msdn.com/b/devdev/archive/2006/01/23/516431.aspx#9771824</link><pubDate>Thu, 18 Jun 2009 05:23:07 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9771824</guid><dc:creator> Developing for Developers Literate programming | patio set</dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://patiosetsite.info/story.php?id=630"&gt;http://patiosetsite.info/story.php?id=630&lt;/a&gt;&lt;/p&gt;
&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=9771824" width="1" height="1"&gt;</description></item><item><title> Developing for Developers Factoring large numbers with quadratic sieve | patio set</title><link>http://blogs.msdn.com/b/devdev/archive/2006/06/19/637332.aspx#9771647</link><pubDate>Thu, 18 Jun 2009 05:07:37 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9771647</guid><dc:creator> Developing for Developers Factoring large numbers with quadratic sieve | patio set</dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://patiosetsite.info/story.php?id=674"&gt;http://patiosetsite.info/story.php?id=674&lt;/a&gt;&lt;/p&gt;
&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=9771647" width="1" height="1"&gt;</description></item><item><title> Developing for Developers Dependency tracking in builds | alternative dating</title><link>http://blogs.msdn.com/b/devdev/archive/2006/02/14/532262.aspx#9768126</link><pubDate>Wed, 17 Jun 2009 10:39:58 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9768126</guid><dc:creator> Developing for Developers Dependency tracking in builds | alternative dating</dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://topalternativedating.info/story.php?id=774"&gt;http://topalternativedating.info/story.php?id=774&lt;/a&gt;&lt;/p&gt;
&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=9768126" width="1" height="1"&gt;</description></item><item><title> Developing for Developers Modular arithmetic and primality testing | unemployment office</title><link>http://blogs.msdn.com/b/devdev/archive/2005/09/07/462070.aspx#9759772</link><pubDate>Tue, 16 Jun 2009 11:00:04 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9759772</guid><dc:creator> Developing for Developers Modular arithmetic and primality testing | unemployment office</dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://unemploymentofficeresource.info/story.php?id=8432"&gt;http://unemploymentofficeresource.info/story.php?id=8432&lt;/a&gt;&lt;/p&gt;
&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=9759772" width="1" height="1"&gt;</description></item><item><title> Developing for Developers The nature of computing and infeasible machines | debt solutions</title><link>http://blogs.msdn.com/b/devdev/archive/2006/02/06/526252.aspx#9756933</link><pubDate>Tue, 16 Jun 2009 03:38:06 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9756933</guid><dc:creator> Developing for Developers The nature of computing and infeasible machines | debt solutions</dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://debtsolutionsnow.info/story.php?id=10686"&gt;http://debtsolutionsnow.info/story.php?id=10686&lt;/a&gt;&lt;/p&gt;
&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=9756933" width="1" height="1"&gt;</description></item><item><title> Developing for Developers The nature of computing and infeasible machines | bird baths</title><link>http://blogs.msdn.com/b/devdev/archive/2006/02/06/526252.aspx#9750799</link><pubDate>Sun, 14 Jun 2009 17:54:11 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9750799</guid><dc:creator> Developing for Developers The nature of computing and infeasible machines | bird baths</dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://cutebirdbaths.info/story.php?id=3600"&gt;http://cutebirdbaths.info/story.php?id=3600&lt;/a&gt;&lt;/p&gt;
&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=9750799" width="1" height="1"&gt;</description></item></channel></rss>