<?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/"
		>
<channel>
	<title>Comments on: Web Password Hashing</title>
	<atom:link href="http://www.forevergeek.com/2004/08/web_password_hashing/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.forevergeek.com/2004/08/web_password_hashing/</link>
	<description>Nerds are for Dorks</description>
	<lastBuildDate>Sat, 21 Nov 2009 10:14:48 -0800</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.5</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: mark</title>
		<link>http://www.forevergeek.com/2004/08/web_password_hashing/comment-page-1/#comment-49776</link>
		<dc:creator>mark</dc:creator>
		<pubDate>Sun, 20 Sep 2009 01:41:36 +0000</pubDate>
		<guid isPermaLink="false">http://forevergeek.com/?p=624#comment-49776</guid>
		<description>read a bit more...I am still learning, but some people are confusing a HASH with Encryption.

A hash generates a fixed # of characters, and is a one-way process.  It is different than encryption which is a two way process.

First: there are several different hashing algorithms, the cracker wouldn&#039;t know which was used.  Even if it was known, and while you can say it isn&#039;t &quot;impossible&quot;, the term used is that it is &quot;infeasible&quot;.
Second: the cracker wouldn&#039;t be able to assume the username at one site is the same at another.
Third: you can use more than one &quot;master password&quot;.
Fourth: the convenience of running the Firefox add-ons / extensions is supplemented by the fact that you can run widgets or apps, or even save a website html page with the javascript to run it locally.  And, since there are several of the same sort of projects out there, you have the choice of several open source projects and can verify this stuff yourself.</description>
		<content:encoded><![CDATA[<p>read a bit more&#8230;I am still learning, but some people are confusing a HASH with Encryption.</p>
<p>A hash generates a fixed # of characters, and is a one-way process.  It is different than encryption which is a two way process.</p>
<p>First: there are several different hashing algorithms, the cracker wouldn&#8217;t know which was used.  Even if it was known, and while you can say it isn&#8217;t &#8220;impossible&#8221;, the term used is that it is &#8220;infeasible&#8221;.<br />
Second: the cracker wouldn&#8217;t be able to assume the username at one site is the same at another.<br />
Third: you can use more than one &#8220;master password&#8221;.<br />
Fourth: the convenience of running the Firefox add-ons / extensions is supplemented by the fact that you can run widgets or apps, or even save a website html page with the javascript to run it locally.  And, since there are several of the same sort of projects out there, you have the choice of several open source projects and can verify this stuff yourself.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: GoogleÍÆ¹ã</title>
		<link>http://www.forevergeek.com/2004/08/web_password_hashing/comment-page-1/#comment-3215</link>
		<dc:creator>GoogleÍÆ¹ã</dc:creator>
		<pubDate>Tue, 22 Nov 2005 17:01:05 +0000</pubDate>
		<guid isPermaLink="false">http://forevergeek.com/?p=624#comment-3215</guid>
		<description>google×ó²àÍÆ¹ã×šÀž&#124;googleÍÆ¹ãÍÆŒö·þÎñÉÌ_£¬ÎÒÃÇµÄ·þÎñ£º Äã¿ÉÒÔžùŸÝ×ÔŒºµÄÐèÒªÏòÎÒÃÇÌá¹©Ò»žö»ò¶àžö¹ØŒüŽÊ£¬žùŸÝÄãµÄÒªÇó°Ñ¹ó¹«ËŸ ÅÅÃûÔÚGoogleÍÆ¹ãµÄÇ°10 Î»¡£ ¿Í»§ÎªÊ²ÃŽÑ¡ÔñGoogle×ó²àÍÆ¹ã?</description>
		<content:encoded><![CDATA[<p>google×ó²àÍÆ¹ã×šÀž|googleÍÆ¹ãÍÆŒö·þÎñÉÌ_£¬ÎÒÃÇµÄ·þÎñ£º Äã¿ÉÒÔžùŸÝ×ÔŒºµÄÐèÒªÏòÎÒÃÇÌá¹©Ò»žö»ò¶àžö¹ØŒüŽÊ£¬žùŸÝÄãµÄÒªÇó°Ñ¹ó¹«ËŸ ÅÅÃûÔÚGoogleÍÆ¹ãµÄÇ°10 Î»¡£ ¿Í»§ÎªÊ²ÃŽÑ¡ÔñGoogle×ó²àÍÆ¹ã?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: way three</title>
		<link>http://www.forevergeek.com/2004/08/web_password_hashing/comment-page-1/#comment-3214</link>
		<dc:creator>way three</dc:creator>
		<pubDate>Mon, 14 Nov 2005 12:59:15 +0000</pubDate>
		<guid isPermaLink="false">http://forevergeek.com/?p=624#comment-3214</guid>
		<description>Während die glazial geprägten Landschaften</description>
		<content:encoded><![CDATA[<p>Während die glazial geprägten Landschaften</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: passwords for</title>
		<link>http://www.forevergeek.com/2004/08/web_password_hashing/comment-page-1/#comment-3213</link>
		<dc:creator>passwords for</dc:creator>
		<pubDate>Sat, 12 Nov 2005 22:23:16 +0000</pubDate>
		<guid isPermaLink="false">http://forevergeek.com/?p=624#comment-3213</guid>
		<description>Nice post, where can I email you to ask something in private?</description>
		<content:encoded><![CDATA[<p>Nice post, where can I email you to ask something in private?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: ŒõËÙ»ú</title>
		<link>http://www.forevergeek.com/2004/08/web_password_hashing/comment-page-1/#comment-3211</link>
		<dc:creator>ŒõËÙ»ú</dc:creator>
		<pubDate>Wed, 26 Oct 2005 02:42:57 +0000</pubDate>
		<guid isPermaLink="false">http://forevergeek.com/?p=624#comment-3211</guid>
		<description>ÎÒÃÇÎªÄúÌá¹©ŒõËÙ»úÏµÁÐ²úÆ·¡£</description>
		<content:encoded><![CDATA[<p>ÎÒÃÇÎªÄúÌá¹©ŒõËÙ»úÏµÁÐ²úÆ·¡£</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: JC</title>
		<link>http://www.forevergeek.com/2004/08/web_password_hashing/comment-page-1/#comment-3209</link>
		<dc:creator>JC</dc:creator>
		<pubDate>Mon, 09 Aug 2004 23:59:44 +0000</pubDate>
		<guid isPermaLink="false">http://forevergeek.com/?p=624#comment-3209</guid>
		<description>Not a perfect solution, certainly, but it&#039;s a heck of a lot better than a yellow post-it note.
With a global password, (really just a seed for the hash) that very patient bad guy might have to work years to break a single person&#039;s data, if the encryption was good enough. Or rather than a global password, a half dozen bits of data... SSN, DOB, father&#039;s middle name, childhood street name, etc, which you put in one time when installing the app, and then it can build the hash from that... but you&#039;ll still know those components when you move to a new machine. Hmm. Can it print out all the passwords it&#039;s created in case you need to use one from a machine it&#039;s not installed on? hmm.

I wonder how it handles variable password lengths... does it create a 300+ key password hash and only use the maximum number of characters the site allows, or? 
Perhaps I should RTFA, huh? :-)</description>
		<content:encoded><![CDATA[<p>Not a perfect solution, certainly, but it&#8217;s a heck of a lot better than a yellow post-it note.<br />
With a global password, (really just a seed for the hash) that very patient bad guy might have to work years to break a single person&#8217;s data, if the encryption was good enough. Or rather than a global password, a half dozen bits of data&#8230; SSN, DOB, father&#8217;s middle name, childhood street name, etc, which you put in one time when installing the app, and then it can build the hash from that&#8230; but you&#8217;ll still know those components when you move to a new machine. Hmm. Can it print out all the passwords it&#8217;s created in case you need to use one from a machine it&#8217;s not installed on? hmm.</p>
<p>I wonder how it handles variable password lengths&#8230; does it create a 300+ key password hash and only use the maximum number of characters the site allows, or?<br />
Perhaps I should RTFA, huh? :-)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jonathan Hollin</title>
		<link>http://www.forevergeek.com/2004/08/web_password_hashing/comment-page-1/#comment-3208</link>
		<dc:creator>Jonathan Hollin</dc:creator>
		<pubDate>Mon, 09 Aug 2004 21:40:12 +0000</pubDate>
		<guid isPermaLink="false">http://forevergeek.com/?p=624#comment-3208</guid>
		<description>Great explanation Fyodor. Thank you.</description>
		<content:encoded><![CDATA[<p>Great explanation Fyodor. Thank you.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Fyodor Isakov</title>
		<link>http://www.forevergeek.com/2004/08/web_password_hashing/comment-page-1/#comment-3207</link>
		<dc:creator>Fyodor Isakov</dc:creator>
		<pubDate>Mon, 09 Aug 2004 12:48:11 +0000</pubDate>
		<guid isPermaLink="false">http://forevergeek.com/?p=624#comment-3207</guid>
		<description>In a nutshell: the example.com stores the hash, which is calculated as a function of password and the domain name:

hash (pwd, domain-name)

Now, suppose the bad guy broke through to the example.com and has access to all hashes. All he needs to do now is to apply this function to the domain name (example.com) and the unknown password, and compare the results with stolen hashes. If match is found -- the password is recovered. Needless to say that passwords are substituted from a dictionary or chosen at random from predefined alphabet. And yes, he can use all the computing power at his command, since the hash   algorithm is open.

Apparently, the paper authors do recognize this problem and provide some sort of solution to it, see it on slide 11 of ppt file. I was too lazy to look it up earlier, so my apologies. However, the proposed solution (global pwd to strenthen all hashes) only adds another unknown variable to the hash method:

hash (global-pwd, pwd, domain-name)

Therefore, a very patient bad guy still has a chance to break this.

All I had to say is: no smart technology can protect you if you use weak passwords and/or use same password on different sites. Even worse, an unsavvy user might be tempted by the false sense of security provided by such technology and may become too relaxed. And so he falls an easy victim of bad guys.</description>
		<content:encoded><![CDATA[<p>In a nutshell: the example.com stores the hash, which is calculated as a function of password and the domain name:</p>
<p>hash (pwd, domain-name)</p>
<p>Now, suppose the bad guy broke through to the example.com and has access to all hashes. All he needs to do now is to apply this function to the domain name (example.com) and the unknown password, and compare the results with stolen hashes. If match is found &#8212; the password is recovered. Needless to say that passwords are substituted from a dictionary or chosen at random from predefined alphabet. And yes, he can use all the computing power at his command, since the hash   algorithm is open.</p>
<p>Apparently, the paper authors do recognize this problem and provide some sort of solution to it, see it on slide 11 of ppt file. I was too lazy to look it up earlier, so my apologies. However, the proposed solution (global pwd to strenthen all hashes) only adds another unknown variable to the hash method:</p>
<p>hash (global-pwd, pwd, domain-name)</p>
<p>Therefore, a very patient bad guy still has a chance to break this.</p>
<p>All I had to say is: no smart technology can protect you if you use weak passwords and/or use same password on different sites. Even worse, an unsavvy user might be tempted by the false sense of security provided by such technology and may become too relaxed. And so he falls an easy victim of bad guys.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jonathan Hollin</title>
		<link>http://www.forevergeek.com/2004/08/web_password_hashing/comment-page-1/#comment-3206</link>
		<dc:creator>Jonathan Hollin</dc:creator>
		<pubDate>Sun, 08 Aug 2004 22:42:05 +0000</pubDate>
		<guid isPermaLink="false">http://forevergeek.com/?p=624#comment-3206</guid>
		<description>&quot;what prevents the cracker to run a dictionary/brute force attack and recover the password?&quot;

Over the web? He&#039;d have to have an awful lot of patience.

Please, explain where you think the vulnerability is - it would be interesting to see how the authors of the paper respond.</description>
		<content:encoded><![CDATA[<p>&#8220;what prevents the cracker to run a dictionary/brute force attack and recover the password?&#8221;</p>
<p>Over the web? He&#8217;d have to have an awful lot of patience.</p>
<p>Please, explain where you think the vulnerability is &#8211; it would be interesting to see how the authors of the paper respond.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Fyodor Isakov</title>
		<link>http://www.forevergeek.com/2004/08/web_password_hashing/comment-page-1/#comment-3205</link>
		<dc:creator>Fyodor Isakov</dc:creator>
		<pubDate>Sat, 07 Aug 2004 11:52:42 +0000</pubDate>
		<guid isPermaLink="false">http://forevergeek.com/?p=624#comment-3205</guid>
		<description>Sorry, I don&#039;t get the point. The hashing algorithm is known, right? The hash is calculated from pwd and target domain name, right? So, having acquired the hash from example.com&#039;s users DB, what prevents the cracker to run a dictionary/brute force attack and recover the password?

To have a global username/pwd is actually a really bad idea.</description>
		<content:encoded><![CDATA[<p>Sorry, I don&#8217;t get the point. The hashing algorithm is known, right? The hash is calculated from pwd and target domain name, right? So, having acquired the hash from example.com&#8217;s users DB, what prevents the cracker to run a dictionary/brute force attack and recover the password?</p>
<p>To have a global username/pwd is actually a really bad idea.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Bob Owen</title>
		<link>http://www.forevergeek.com/2004/08/web_password_hashing/comment-page-1/#comment-3204</link>
		<dc:creator>Bob Owen</dc:creator>
		<pubDate>Fri, 06 Aug 2004 13:31:41 +0000</pubDate>
		<guid isPermaLink="false">http://forevergeek.com/?p=624#comment-3204</guid>
		<description>Hmmm, I would guess a similar effect which would be more portable, but possibly less useful would be to have a bookmarlet to handle the hashing. I&#039;ll have to look into this.</description>
		<content:encoded><![CDATA[<p>Hmmm, I would guess a similar effect which would be more portable, but possibly less useful would be to have a bookmarlet to handle the hashing. I&#8217;ll have to look into this.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jeroen Coumans</title>
		<link>http://www.forevergeek.com/2004/08/web_password_hashing/comment-page-1/#comment-3203</link>
		<dc:creator>Jeroen Coumans</dc:creator>
		<pubDate>Fri, 06 Aug 2004 07:24:49 +0000</pubDate>
		<guid isPermaLink="false">http://forevergeek.com/?p=624#comment-3203</guid>
		<description>Is this the same Blake Ross from Mozilla marketing fame? See . If so, I guess we can expect that this will be incorporated into Firefox 2.0: .</description>
		<content:encoded><![CDATA[<p>Is this the same Blake Ross from Mozilla marketing fame? See . If so, I guess we can expect that this will be incorporated into Firefox 2.0: .</p>
]]></content:encoded>
	</item>
</channel>
</rss>
