Re: Iterative Password Hashing vs Strong Salt
- From: "Blind Anagram" <nobody@xxxxxxxxxxx>
- Date: Tue, 5 May 2009 07:48:13 +0100
"Kai" <kaisellgren@xxxxxxxxx> wrote in message news:7c22471c-4243-49a9-a9af-025d87e387ed@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
You are combining secret client data (user password) and secret server data
(unique to each user?) to form an encryption key which is then used to
encrypt and store some data on the server. Your worry then appears to be
that another user, or an attacker, can obtain this encrypted data in some
'illegal' way and then discover the key needed to decrypt it. Is this your
concern?
Actually, it is all pretty much clear to me right now, but there is
one thing I would like to discuss about. Forget dictionary attacks,
rainbow tables and such, and only think about brute forcing for now.
Okay? We are still in the subject Password Hashing. So, if I have a
preimage of 512-bits (randomly generated from urandom), for instance,
it would take 2^256 iterations to crack it on average, isn't that so?
So, if my preimage is 512-bits strong and if I use a 512-bit hash,
then it is pretty much useless to iteratively hash the preimage.
[snip]
As you suggest, if a key strengtening step doesn't increase the key space it isn't doing its job.
But even in this case an attacker may not be able to mount an attack using this smaller key if the system is such that the process in which this key is used is better protected than the one in which the original key is used.
For example, if an attacker can only mount an attack by masquerading as a legitimate user, they will need a user key (password) even if the internal 'strengthened' key is actually shorter.
__________ Information from ESET NOD32 Antivirus, version of virus signature database 4052 (20090504) __________
The message was checked by ESET NOD32 Antivirus.
http://www.eset.com
.
- References:
- Iterative Password Hashing vs Strong Salt
- From: exesteam
- Re: Iterative Password Hashing vs Strong Salt
- From: exesteam
- Re: Iterative Password Hashing vs Strong Salt
- From: exesteam
- Re: Iterative Password Hashing vs Strong Salt
- From: Blind Anagram
- Re: Iterative Password Hashing vs Strong Salt
- From: exesteam
- Re: Iterative Password Hashing vs Strong Salt
- From: Blind Anagram
- Re: Iterative Password Hashing vs Strong Salt
- From: Kai
- Iterative Password Hashing vs Strong Salt
- Prev by Date: Re: FEAL implementation
- Next by Date: Re: Iterative Permutations
- Previous by thread: Re: Iterative Password Hashing vs Strong Salt
- Next by thread: Re: Iterative Password Hashing vs Strong Salt
- Index(es):
Relevant Pages
|