lkml.org 
[lkml]   [2006]   [Mar]   [26]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: eCryptfs Design Document
Phillip Hellewell wrote:
> Again I concur with Mike. Iterative hashing is a very common technique,
> and is very effective against this type of dictionary attack. If you
> hash 1000 times, then an attack that normally could check 1 million
> passwords per second would now only be able to check 1000 passwords per
> second.
>
> Without iterative hashing, as computers get faster, so would dictionary
> attacks, and then people would have to keep using longer and longer
> passwords to be as effective. Iterative hashing "levels the playing
> field" in a way.
>


Except that I believe you can write code to compute the nth hash in O(1)
time rather than O(n) time, so that kind of defeats the purpose, though
I'm no expert so I could be wrong.


-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2006-03-27 04:57    [W:0.081 / U:0.012 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site