2
I've seen this a few times, so I want to point out something that is a general misconception. People often think that for key derivation, it's really important that I don't get repetition, since that is a break. However, this is actually very not true, and the opposite is true. I will explain.
The "ideal situation" is to just choose keys, truly at ...
1
The present answer is made for the sake of answering an answerable question, and the cases where collisions actually matter: like, they are observed and we want to rule out it's by chance; or some authority specified that each smurf must have a unique key, and lack of a convincing argument for that separates the rubber stamp from the paperwork. See Yehuda ...
Only top voted, non community-wiki answers of a minimum length are eligible
Related Tags
hkdf × 87key-derivation × 46
hmac × 18
pbkdf-2 × 11
hash × 8
tls × 8
diffie-hellman × 7
encryption × 6
aes × 6
keys × 6
scrypt × 5
salt × 4
public-key × 3
random-number-generator × 3
symmetric × 3
sha-256 × 3
pseudo-random-function × 3
entropy × 3
aes-gcm × 3
protocol-design × 2
pseudo-random-generator × 2
nonce × 2
chacha × 2
information-theory × 2
test-vectors × 2