Problem
My application (which I will be writing in C#) uses a key derivation method (Rfc2898DeriveBytes, 4000 iterations) along with a salt to generate a "hash" of a password. This hash is then sent to a database so that the user can use that password in the future to authenticate to their account.
So far that should be secure, but after that, I want to use Rfc2898DeriveBytes on the same password to generate a key which can then be used for encryption. Now the way I was going to do that was to use 5000 iterations of the same method to get a different key, but I am concerned that if the hash stored in the database was compromised (or I was forced to reveal it) it would be possible to derive the second key somehow. Is that possible?
Potential Solutions
I would appreciate any advice on how best to improve this process. I would post code but I haven't written it yet.
The way to most securely calculate a key is by using a secure "key derivation function" (KDF); the output of such a KDF is a "derived key." Derived keys are just as secure as random keys, but they have some significant practical advantages.
A Key Derivation Function, or KDF, is a cryptographic algorithm that derives one or more secret keys from a secret value. If you've ever needed to store a password in a database or create a private key from a password, you may have used a KDF. Some examples of popular KDFs are Argon2, Scrypt, and PBKDF2.
Key derivation functions take a password, a salt, and a cost factor as inputs then generate a password hash. Their purpose is to make each password guessing trial by an attacker who has obtained a password hash file expensive and therefore the cost of a guessing attack high or prohibitive."
BCrypt is not a key derivation function, it is a password hashing algorithm. If you needed to derive a key from a password, bcrypt has no capability to generate a 256-bit key. On the other hand, people do use actual key derivation functions, e.g.: pbkdf2.
For easy reference, I'm compiling the advice I was given into one answer.
Iteration Count
Although this wasn't part of my question erickson pointed out that 5,000 iterations for Rfc2898DeriveBytes (a PBKDF2 method for C#) is far too few and recommended at least 50,000.
After looking elsewhere for more information, it seems that between 50,000 and 1,000,000 is a good number of iterations, but keep in mind there is an inverse relation between speed and security here: As the number of iterations increases so does security, and the amount of time it takes to derive the key (which is why it's more secure).
Solutions
Although according to erickson the first key could not be used to determine the second, it does make a brute-force attack easier. Therefore, any of the following solutions could be used to address the issue:
Rejected Solutions
Conclusion
Thank you everyone for your help, if you have any further insight please comment and I'll do my best to add it.
You can derive multiple keys from one password.
Whether you use different salts for different purposes, or generate a longer key and use parts of it for different purposes, depends on whether you need the different keys at the same time. For example, suppose a user logs in, and then expects to be able to encrypt and decrypt content without re-entering their password. In that case, it would be more efficient to generate a double-length key, and use the first half of the derived key for authentication, and the second half for encryption. Generating two keys with different salts would take about twice as long.
On the other hand, if the user is expected to enter the password for authentication, and then some other time for encryption, you might as well select two salts.
With your proposal, revealing the authentication hash stored in the database wouldn't lead immediately to a compromise. That is, you couldn't simply iterate the hash function; each iteration of PBKDF2 uses the password as input. But it does mean that only 1000 iterations are required to test a password as an encryption key, and that provides almost no protection from a dictionary attack.
By the way, 5000 iterations is not nearly enough. 50000 iterations would be a good start.
Using a different salt between the two calls of Rfc2898DeriveBytes
solves your problem.
Think of it this way, two different users use the same password, will knowing the hash of one compromise the other? Only if the two users use the same salt!
What you are doing is no different, just use two good salts for both uses of Rfc2898DeriveBytes
and you will be fine. No need to change the number of iterations for the two methods, just change the salt.
There is no reason you need to re-use the salt, the salt is not secret information. Most implementations of file encryption puts the salt (also known as the IV
) at the front of the encrypted blob.
For your other solution "What about using SHA for the database hash and Rfc for the encryption key?" This is a VERY bad idea. Just using SHA for the database means it will be much easier for them to get the original password, then they can use that easier task to do the harder task of decrypting the Rfc based one.
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With