<?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"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments for root labs rdist</title>
	<atom:link href="http://rdist.root.org/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://rdist.root.org</link>
	<description>Embedded security, crypto, software protection</description>
	<lastBuildDate>Sun, 05 Feb 2012 20:24:33 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>Comment on On the evolving security of password schemes by Nate Lawson</title>
		<link>http://rdist.root.org/2012/01/10/on-the-evolving-security-of-password-schemes/comment-page-1/#comment-7221</link>
		<dc:creator><![CDATA[Nate Lawson]]></dc:creator>
		<pubDate>Sun, 05 Feb 2012 20:24:33 +0000</pubDate>
		<guid isPermaLink="false">http://rdist.root.org/?p=587#comment-7221</guid>
		<description><![CDATA[Yes, that falls under option 3 in the above list (responses).

However, your particular strategy requires users to keep changing their username if your site encounters a persistent DoS attack. Since usernames should not have to be secret, it seems poor.]]></description>
		<content:encoded><![CDATA[<p>Yes, that falls under option 3 in the above list (responses).</p>
<p>However, your particular strategy requires users to keep changing their username if your site encounters a persistent DoS attack. Since usernames should not have to be secret, it seems poor.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on On the evolving security of password schemes by Francisco Corella</title>
		<link>http://rdist.root.org/2012/01/10/on-the-evolving-security-of-password-schemes/comment-page-1/#comment-7217</link>
		<dc:creator><![CDATA[Francisco Corella]]></dc:creator>
		<pubDate>Sat, 04 Feb 2012 05:31:56 +0000</pubDate>
		<guid isPermaLink="false">http://rdist.root.org/?p=587#comment-7217</guid>
		<description><![CDATA[To protect against online password guessing it is possible to limit the total number of guesses that an attacker can make against a password, rather than the guess rate.  That can be done by using two counters: a counter of consecutive bad guesses, which is reset after a good guess; and a cumulative counter of bad guesses, which is NOT reset after a good guess.  After the first counter reaches, say, 5 guesses, the password is disabled and must be reset.  After the second counter reaches, say, 30 guesses, the user is asked to change the password.  The username associated with the password can be changed to counter a denial-of-service attack by submitting bad guesses.  For more details, see &lt;a href=&quot;http://pomcor.com/whitepapers/protecting_against_password_guessing_attacks.pdf&quot; rel=&quot;nofollow&quot;&gt;http://pomcor.com/whitepapers/protecting_against_password_guessing_attacks.pdf&lt;/a&gt;.]]></description>
		<content:encoded><![CDATA[<p>To protect against online password guessing it is possible to limit the total number of guesses that an attacker can make against a password, rather than the guess rate.  That can be done by using two counters: a counter of consecutive bad guesses, which is reset after a good guess; and a cumulative counter of bad guesses, which is NOT reset after a good guess.  After the first counter reaches, say, 5 guesses, the password is disabled and must be reset.  After the second counter reaches, say, 30 guesses, the user is asked to change the password.  The username associated with the password can be changed to counter a denial-of-service attack by submitting bad guesses.  For more details, see <a href="http://pomcor.com/whitepapers/protecting_against_password_guessing_attacks.pdf" rel="nofollow">http://pomcor.com/whitepapers/protecting_against_password_guessing_attacks.pdf</a>.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Why stream ciphers shouldn&#8217;t be used for hashing by Nate Lawson</title>
		<link>http://rdist.root.org/2012/01/31/why-stream-ciphers-shouldnt-be-used-for-hashing/comment-page-1/#comment-7209</link>
		<dc:creator><![CDATA[Nate Lawson]]></dc:creator>
		<pubDate>Thu, 02 Feb 2012 19:56:04 +0000</pubDate>
		<guid isPermaLink="false">http://rdist.root.org/?p=377#comment-7209</guid>
		<description><![CDATA[Absolutely.

Chosen key resistance is much harder than related key resistance, and to use a cipher (stream or block) as a hash function, it needs to be strong against both. That&#039;s the summary of this article.]]></description>
		<content:encoded><![CDATA[<p>Absolutely.</p>
<p>Chosen key resistance is much harder than related key resistance, and to use a cipher (stream or block) as a hash function, it needs to be strong against both. That&#8217;s the summary of this article.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Why stream ciphers shouldn&#8217;t be used for hashing by Eloi Vanderbeken</title>
		<link>http://rdist.root.org/2012/01/31/why-stream-ciphers-shouldnt-be-used-for-hashing/comment-page-1/#comment-7200</link>
		<dc:creator><![CDATA[Eloi Vanderbeken]]></dc:creator>
		<pubDate>Wed, 01 Feb 2012 09:11:44 +0000</pubDate>
		<guid isPermaLink="false">http://rdist.root.org/?p=377#comment-7200</guid>
		<description><![CDATA[An other big problem is that RC4 is not resistant to first and second preimage attacks and absolutely not collision resistant if you use 256 bits key.

It&#039;s really easy to find 2 keys that generate the same first bytes of keystream.
Even for &quot;long&quot; keystreams as an example :

data 1 :
5d8f3b1fd7451db4da66368d48aaeacc19619c4ed23cb32f4eb11a8a0a9a62f94add5f1208adcfb0fccc51ec2e4e40f3bfa819129707804143b8cd68bb029d9f7d64312a9e528a7c1c5113e691c93dca81b05bee42be444bf14d25f0c960356cea1ce1efaf516c77dbbe583fbf1e4ba4bed8b791d14f1fca6f93795db45cf6c50e5afc13de18f25dbb73274e09b50527ad32a5ccf328da5412b436664653ec9463595870e1ab586ceefcbb47ac3db2626ff0bfc17524dbc4289c274cf7da51546b1b508c3386159f5b96626067c2cafb7cc69c69bb3600e8fc82f82aca470ea8a619e657e41ad50e84f00637abd52a0853d21143354b112a56f1354f54807f

and data 2 :
00fffffffafef9f9fdf7f7f3f9f0f3f6eef1f1e1efe4f1ecdff7d8ece1edcfebdbf2d6dee9bee2d5f4c3edb4eddab3e0dfc9cec0d4c5c8ded598e9c0d0abbaedb4b9d6acc59ebcade19fb2c7bd83b0d4bca684e8a38ae27bcfb4926cdda2a68083dd788ab3a7d35e71f081927eb37f9d5cb3708f74c9667a9a9d6ec79d5b79b82ec05f359b6bc25e8f794a9b52958b2cab11d15ca9531dcf3a8b1149e441524f629d561d554351579cfbeddf45d72c5e0596f4d6d0b9d09ed3b8e144c520ef6a5beeb4703fed094c68df335a4790fbd54c52503cf5649db2145d2b2c6db65b68198b578b8ba965325efaf8035cf80ca985a09c71bccce90f99c1378a409527b7

generate the same first 248 bits of keystream :

80dc5f0cbf84ae113ab8dd9bacfb9e9351e95d01e24fed9c18a5722ce69704]]></description>
		<content:encoded><![CDATA[<p>An other big problem is that RC4 is not resistant to first and second preimage attacks and absolutely not collision resistant if you use 256 bits key.</p>
<p>It&#8217;s really easy to find 2 keys that generate the same first bytes of keystream.<br />
Even for &#8220;long&#8221; keystreams as an example :</p>
<p>data 1 :<br />
5d8f3b1fd7451db4da66368d48aaeacc19619c4ed23cb32f4eb11a8a0a9a62f94add5f1208adcfb0fccc51ec2e4e40f3bfa819129707804143b8cd68bb029d9f7d64312a9e528a7c1c5113e691c93dca81b05bee42be444bf14d25f0c960356cea1ce1efaf516c77dbbe583fbf1e4ba4bed8b791d14f1fca6f93795db45cf6c50e5afc13de18f25dbb73274e09b50527ad32a5ccf328da5412b436664653ec9463595870e1ab586ceefcbb47ac3db2626ff0bfc17524dbc4289c274cf7da51546b1b508c3386159f5b96626067c2cafb7cc69c69bb3600e8fc82f82aca470ea8a619e657e41ad50e84f00637abd52a0853d21143354b112a56f1354f54807f</p>
<p>and data 2 :<br />
00fffffffafef9f9fdf7f7f3f9f0f3f6eef1f1e1efe4f1ecdff7d8ece1edcfebdbf2d6dee9bee2d5f4c3edb4eddab3e0dfc9cec0d4c5c8ded598e9c0d0abbaedb4b9d6acc59ebcade19fb2c7bd83b0d4bca684e8a38ae27bcfb4926cdda2a68083dd788ab3a7d35e71f081927eb37f9d5cb3708f74c9667a9a9d6ec79d5b79b82ec05f359b6bc25e8f794a9b52958b2cab11d15ca9531dcf3a8b1149e441524f629d561d554351579cfbeddf45d72c5e0596f4d6d0b9d09ed3b8e144c520ef6a5beeb4703fed094c68df335a4790fbd54c52503cf5649db2145d2b2c6db65b68198b578b8ba965325efaf8035cf80ca985a09c71bccce90f99c1378a409527b7</p>
<p>generate the same first 248 bits of keystream :</p>
<p>80dc5f0cbf84ae113ab8dd9bacfb9e9351e95d01e24fed9c18a5722ce69704</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Why stream ciphers shouldn&#8217;t be used for hashing by Nate Lawson</title>
		<link>http://rdist.root.org/2012/01/31/why-stream-ciphers-shouldnt-be-used-for-hashing/comment-page-1/#comment-7199</link>
		<dc:creator><![CDATA[Nate Lawson]]></dc:creator>
		<pubDate>Wed, 01 Feb 2012 05:56:09 +0000</pubDate>
		<guid isPermaLink="false">http://rdist.root.org/?p=377#comment-7199</guid>
		<description><![CDATA[I&#039;m somewhat allergic to password hashing posts, so you&#039;ll have to make do with this:

http://chargen.matasano.com/chargen/2007/9/7/enough-with-the-rainbow-tables-what-you-need-to-know-about-s.html]]></description>
		<content:encoded><![CDATA[<p>I&#8217;m somewhat allergic to password hashing posts, so you&#8217;ll have to make do with this:</p>
<p><a href="http://chargen.matasano.com/chargen/2007/9/7/enough-with-the-rainbow-tables-what-you-need-to-know-about-s.html" rel="nofollow">http://chargen.matasano.com/chargen/2007/9/7/enough-with-the-rainbow-tables-what-you-need-to-know-about-s.html</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Why stream ciphers shouldn&#8217;t be used for hashing by Andrew Jamieson</title>
		<link>http://rdist.root.org/2012/01/31/why-stream-ciphers-shouldnt-be-used-for-hashing/comment-page-1/#comment-7198</link>
		<dc:creator><![CDATA[Andrew Jamieson]]></dc:creator>
		<pubDate>Wed, 01 Feb 2012 01:01:46 +0000</pubDate>
		<guid isPermaLink="false">http://rdist.root.org/?p=377#comment-7198</guid>
		<description><![CDATA[I think it may be worthwhile having a post on the differences between using hashes for securing passwords, and using hashes for securing data integrity / authenticity (as part of a signature).  I see many people get this wrong, in terms of confusion around the differences between collision and pre-image recovery and how they relate to the two common uses for hashing.]]></description>
		<content:encoded><![CDATA[<p>I think it may be worthwhile having a post on the differences between using hashes for securing passwords, and using hashes for securing data integrity / authenticity (as part of a signature).  I see many people get this wrong, in terms of confusion around the differences between collision and pre-image recovery and how they relate to the two common uses for hashing.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
