Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with key-derivation
Search options not deleted
user 4557
In cryptography, a key derivation function (or KDF) derives one or more secret keys from a secret value such as a master key or other known information such as a password or passphrase using a pseudo-random function. Keyed cryptographic hash functions are popular examples of pseudo-random functions used for key derivation.
6
votes
Accepted
Can I dynamically calculate an appropriate number of iterations for PBKDF2 based on the syst...
Of course you can - but as to whether or not it's a practical or advisable idea, I don't think so. It's not really prudent to implement crypto systems/protocols and assume that they'll be fine in 10 …
- 4,007
4
votes
Accepted
repeated use of HKDF-extract on the same PRK
Taken directly from the RFC:
The second stage "expands" the pseudorandom key to the desired
length; the number and lengths of the output keys depend on the
specific cryptographic algorithms for which …
- 4,007
8
votes
3
answers
3k
views
Blake2B as a KDF
How would one go about using vanilla keyed Blake2B as a KDF with high-entropy inputs. Assume I don't have access to more specialized algorithms such blake2XB, HKDF, etc.
Salt - high entropy per-encr …
- 4,007
7
votes
1
answer
3k
views
What information to include is the 'info' input for HKDF?
The RFC states the following:
3.2. The 'info' Input to HKDF
While the 'info' value is optional in the definition of HKDF, it is often of great importance in applications. Its main objective is to b …
- 4,007
9
votes
3
answers
4k
views
Reason(s) for using a KDF for encryption keys
Assuming I already have a 256-key (32 char password) for AES encryption, comprised of random alpha-numeric characters and punctuation (95 possible ascii chars), generated by a decent PRNG, is there an …
- 4,007
1
vote
1
answer
525
views
Scrypt as a KDF with one-time high-entropy input
I'm looking at using Scrypt as a KDF. Assume the following:
the input will always be high-entropy random bytes generated by a CSPRNG
the length of the input can vary from between 8 to 32 bytes
the i …
- 4,007
2
votes
Use of PBKDF2 when no access to HKDF?
If you are going to generate a MasterKey with a CSPRNG, and securely store/retrieve it when encrypting/decrypting, I see no need for a key derivation function of any kind. I suggest you just use the k …
- 4,007
0
votes
Key derivation using the main AES encryption key and some plain text?
I recommend HKDF - it's a key-based key derivation function (as opposed to password-based). It accepts an already-high entropy input (your AES key), a salt (you could use your "plain text"), and optio …
- 4,007
17
votes
How much security is gained from hiding the nonce?
Nonces (and initialization vectors) are generally public. Assuming a sensible implementation (using a hash of the message as the nonce is not sensible), then no meaningful security is gained by making …
- 4,007
4
votes
Encryption and HMAC key derivation
Does input truncation using SHA-256 expose any potential weaknesses?
No, hashing the passphrase with SHA-256 will be no stronger or weaker than feeding it in directly. If you go with Scrypt (whi …
- 4,007