<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>
<channel>
	<title>Comments for Paolo Ardoino - ideas, programming, web and more...</title>
	<atom:link href="http://ardoino.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://ardoino.com</link>
	<description>Homo quisque faber ipse fortunae suae</description>
	<pubDate>Fri, 04 Jul 2008 18:30:17 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5.1</generator>
		<item>
		<title>Comment on PHP and Wget sitemap generator for search engines by Fredi</title>
		<link>http://ardoino.com/15-google-php-wget-sitemap-generator/#comment-3532</link>
		<dc:creator>Fredi</dc:creator>
		<pubDate>Fri, 04 Jul 2008 13:25:56 +0000</pubDate>
		<guid isPermaLink="false">http://ardoino.com/15-google-php-wget-sitemap-generator/#comment-3532</guid>
		<description>I completely agree with all that here is told  PHP and Wget sitemap generator for search engines

&lt;a href="http://www.smokescigarette.com" rel="nofollow"&gt;Fredi&lt;/a&gt;</description>
		<content:encoded><![CDATA[<p>I completely agree with all that here is told  PHP and Wget sitemap generator for search engines</p>
<p><a href="http://www.smokescigarette.com" rel="nofollow">Fredi</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on About Me by Axel</title>
		<link>http://ardoino.com/about/#comment-3515</link>
		<dc:creator>Axel</dc:creator>
		<pubDate>Fri, 04 Jul 2008 06:45:17 +0000</pubDate>
		<guid isPermaLink="false">#comment-3515</guid>
		<description>Bel sito... sono giomarco ( ti ho mandato un paio di mail)

ho visto da qualche parte sul sito "Teorema di Fermat" anche a me piace molto. Sto leggendo il libro</description>
		<content:encoded><![CDATA[<p>Bel sito&#8230; sono giomarco ( ti ho mandato un paio di mail)</p>
<p>ho visto da qualche parte sul sito &#8220;Teorema di Fermat&#8221; anche a me piace molto. Sto leggendo il libro</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Javascript online massive social password cracking ? by Zishan</title>
		<link>http://ardoino.com/32-javascript-online-password-cracking/#comment-3477</link>
		<dc:creator>Zishan</dc:creator>
		<pubDate>Thu, 03 Jul 2008 14:24:16 +0000</pubDate>
		<guid isPermaLink="false">http://ardoino.com/32-javascript-online-password-cracking/#comment-3477</guid>
		<description>Can anyone compile " john the ripper " for my windows xp service pack 2. Because i unable to do that. My email is zishanzin@yahoo.com</description>
		<content:encoded><![CDATA[<p>Can anyone compile &#8221; john the ripper &#8221; for my windows xp service pack 2. Because i unable to do that. My email is <a href="mailto:zishanzin@yahoo.com">zishanzin@yahoo.com</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Javascript online massive social password cracking ? by Sim1</title>
		<link>http://ardoino.com/32-javascript-online-password-cracking/#comment-2525</link>
		<dc:creator>Sim1</dc:creator>
		<pubDate>Wed, 11 Jun 2008 21:35:03 +0000</pubDate>
		<guid isPermaLink="false">http://ardoino.com/32-javascript-online-password-cracking/#comment-2525</guid>
		<description>as you see opera rulez ^_^</description>
		<content:encoded><![CDATA[<p>as you see opera rulez ^_^</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Factoring large integers: pollard p-1 method by Paolo Ardoino</title>
		<link>http://ardoino.com/9-maths-factoring-pollard/#comment-2458</link>
		<dc:creator>Paolo Ardoino</dc:creator>
		<pubDate>Tue, 10 Jun 2008 07:27:43 +0000</pubDate>
		<guid isPermaLink="false">http://ardoino.com/maths-factoring-pollard/#comment-2458</guid>
		<description>Hello,
if a twenty digits length integer takes 22 seconds for its factorization 
I suppose that you could test it in on a 24, 26, 28, 30 digits to see if it is useful for your needs.

Note that hardware has been improved from 3 years ago :)</description>
		<content:encoded><![CDATA[<p>Hello,<br />
if a twenty digits length integer takes 22 seconds for its factorization<br />
I suppose that you could test it in on a 24, 26, 28, 30 digits to see if it is useful for your needs.</p>
<p>Note that hardware has been improved from 3 years ago :)</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Simple file encrypter/decrypter ( DES / Blowfish / IDEA / MD5 / RSA algorithms ) by hackercoolio</title>
		<link>http://ardoino.com/10-openssl-file-encrypter-decrypter/#comment-2375</link>
		<dc:creator>hackercoolio</dc:creator>
		<pubDate>Sun, 08 Jun 2008 11:46:51 +0000</pubDate>
		<guid isPermaLink="false">http://ardoino.com/crypt-openssl-file-encrypter-decrypter/#comment-2375</guid>
		<description>Thanx.. looks useful.. if it works with one of the .des from GameGuard it will be so useful.</description>
		<content:encoded><![CDATA[<p>Thanx.. looks useful.. if it works with one of the .des from GameGuard it will be so useful.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Factoring large integers: pollard p-1 method by kittu</title>
		<link>http://ardoino.com/9-maths-factoring-pollard/#comment-2345</link>
		<dc:creator>kittu</dc:creator>
		<pubDate>Sat, 07 Jun 2008 18:23:01 +0000</pubDate>
		<guid isPermaLink="false">http://ardoino.com/maths-factoring-pollard/#comment-2345</guid>
		<description>hi , very thank ful to u ,for providing source code in detail

may i know what is the maximum capacity of this code 

upto how many digits we can find factors using this method

please reply me</description>
		<content:encoded><![CDATA[<p>hi , very thank ful to u ,for providing source code in detail</p>
<p>may i know what is the maximum capacity of this code </p>
<p>upto how many digits we can find factors using this method</p>
<p>please reply me</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Javascript online massive social password cracking ? by me</title>
		<link>http://ardoino.com/32-javascript-online-password-cracking/#comment-2315</link>
		<dc:creator>me</dc:creator>
		<pubDate>Sat, 07 Jun 2008 02:15:34 +0000</pubDate>
		<guid isPermaLink="false">http://ardoino.com/32-javascript-online-password-cracking/#comment-2315</guid>
		<description>i've got 1182 cracks per secund with MOzilla firefox 3 Beta 5 ;)</description>
		<content:encoded><![CDATA[<p>i&#8217;ve got 1182 cracks per secund with MOzilla firefox 3 Beta 5 ;)</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Increase website traffic with Google language tools by Alfie</title>
		<link>http://ardoino.com/11-seo-increase-website-traffic-google-translations/#comment-2196</link>
		<dc:creator>Alfie</dc:creator>
		<pubDate>Wed, 04 Jun 2008 07:43:19 +0000</pubDate>
		<guid isPermaLink="false">http://ardoino.com/web-seo-increase-traffic-google-translations/#comment-2196</guid>
		<description>You don't need to trick Google (or other search engine). Just make a translation of your site, and poop! you got more traffic.</description>
		<content:encoded><![CDATA[<p>You don&#8217;t need to trick Google (or other search engine). Just make a translation of your site, and poop! you got more traffic.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on PHP and Wget sitemap generator for search engines by TechJammer</title>
		<link>http://ardoino.com/15-google-php-wget-sitemap-generator/#comment-1816</link>
		<dc:creator>TechJammer</dc:creator>
		<pubDate>Tue, 27 May 2008 22:12:55 +0000</pubDate>
		<guid isPermaLink="false">http://ardoino.com/15-google-php-wget-sitemap-generator/#comment-1816</guid>
		<description>Ok, New question for Paolo,

Is it possible to disable 'mirror' functionality?  I have a VERY large site, and apparently the mirror function completely exhausted my 1G of disk space.</description>
		<content:encoded><![CDATA[<p>Ok, New question for Paolo,</p>
<p>Is it possible to disable &#8216;mirror&#8217; functionality?  I have a VERY large site, and apparently the mirror function completely exhausted my 1G of disk space.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
