<?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 doBoard</title>
	<atom:link href="http://doboard.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://doboard.com</link>
	<description>do... Web Application Security and Development</description>
	<pubDate>Wed, 20 Aug 2008 14:33:32 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6</generator>
		<item>
		<title>Comment on Q &#038; A:  Risk of Duplicates When Using MD5? by Barry</title>
		<link>http://doboard.com/2007/11/12/q-a-risk-of-duplicates-when-using-md5/#comment-1549</link>
		<dc:creator>Barry</dc:creator>
		<pubDate>Fri, 09 May 2008 14:24:21 +0000</pubDate>
		<guid isPermaLink="false">http://doboard.com/2007/11/12/q-a-risk-of-duplicates-when-using-md5/#comment-1549</guid>
		<description>Vladimir,

More detailed discussions are available at http://eprint.iacr.org/2005/425.pdf and http://en.wikipedia.org/wiki/MD5</description>
		<content:encoded><![CDATA[<p>Vladimir,</p>
<p>More detailed discussions are available at <a href="http://eprint.iacr.org/2005/425.pdf" rel="nofollow">http://eprint.iacr.org/2005/425.pdf</a> and <a href="http://en.wikipedia.org/wiki/MD5" rel="nofollow">http://en.wikipedia.org/wiki/MD5</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Q &#038; A:  Risk of Duplicates When Using MD5? by Vladimir</title>
		<link>http://doboard.com/2007/11/12/q-a-risk-of-duplicates-when-using-md5/#comment-1548</link>
		<dc:creator>Vladimir</dc:creator>
		<pubDate>Fri, 09 May 2008 13:16:38 +0000</pubDate>
		<guid isPermaLink="false">http://doboard.com/2007/11/12/q-a-risk-of-duplicates-when-using-md5/#comment-1548</guid>
		<description>thanks for mentioning this, I wonder if there's a way to compute the chances of duplication in the md5 algorithm though.

Vladimir</description>
		<content:encoded><![CDATA[<p>thanks for mentioning this, I wonder if there&#8217;s a way to compute the chances of duplication in the md5 algorithm though.</p>
<p>Vladimir</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on ShmooCon Memories by Barry</title>
		<link>http://doboard.com/2008/03/26/shmoocon-memories/#comment-349</link>
		<dc:creator>Barry</dc:creator>
		<pubDate>Thu, 27 Mar 2008 03:07:04 +0000</pubDate>
		<guid isPermaLink="false">http://doboard.com/2008/03/26/shmoocon-memories/#comment-349</guid>
		<description>GSM presentation here: http://blog.washingtonpost.com/securityfix/shmoocon-Feb08-gsm.pdf</description>
		<content:encoded><![CDATA[<p>GSM presentation here: <a href="http://blog.washingtonpost.com/securityfix/shmoocon-Feb08-gsm.pdf" rel="nofollow">http://blog.washingtonpost.com/securityfix/shmoocon-Feb08-gsm.pdf</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on 20 Hacker Tricks for Attacking Web Apps by Steve Goodman</title>
		<link>http://doboard.com/2008/01/21/20-hacker-tricks-for-attacking-web-apps/#comment-2</link>
		<dc:creator>Steve Goodman</dc:creator>
		<pubDate>Tue, 22 Jan 2008 02:59:43 +0000</pubDate>
		<guid isPermaLink="false">http://doboard.com/2008/01/21/20-hacker-tricks-for-attacking-web-apps/#comment-2</guid>
		<description>thanks for the great slides! The presentation is a great starting point for learning more security techniques and following the community more closely.</description>
		<content:encoded><![CDATA[<p>thanks for the great slides! The presentation is a great starting point for learning more security techniques and following the community more closely.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
