Key derivation function
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
. The output of one KDF function is the input to the next KDF function in the chain. In cryptography, a key derivation function (KDF) is an algorithm that derives one or more secret keys from a secret value, such as a master key, a password, or a passphrase using a pseudorandom function (which typically uses a cryptographic hash function or block cipher). KDFs can be used to stretch keys into longer keys or to obtain keys of a required format, such as converting a group element that is the result of a Diffie–Hellman key exchange into a symmetric key for use with AES. Keyed cryptographic hash functions are popular examples of pseudorandom functions used for key derivation.
. The output of one KDF function is the input to the next KDF function in the chain. In cryptography, a key derivation function (KDF) is an algorithm that derives one or more secret keys from a secret value, such as a master key, a password, or a passphrase using a pseudorandom function (which typically uses a cryptographic hash function or block cipher). KDFs can be used to stretch keys into longer keys or to obtain keys of a required format, such as converting a group element that is the result of a Diffie–Hellman key exchange into a symmetric key for use with AES. Keyed cryptographic hash functions are popular examples of pseudorandom functions used for key derivation.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1376335581 under CC BY-SA 4.0; modifications have been made.