On the Security Analysis of Weak Cryptographic Primitive Based Key Derivation Function

Abstract

A key derivation function is a function that generate one or more cryptographic keys from a private string together with some public information. The generated cryptographic key(s) must be indistinguishable from random binary strings of the same length. To date, there are designed of key derivation function proposals using cryptographic primitives such as hash functions, block ciphers and stream ciphers. The security of key derivation functions are based on the assumption that the underlying cryptographic primitives are secure from attacks. Unfortunately, the current works do not investigate the consequences for key derivation functions if the cryptographic primitives that are used to build the key derivation functions are broken. In this paper, we are confirmed by results of having the cryptographic primitives that are used to build the key derivation functions are broken, it allows the adversaries to distinguish the cryptographic key from the random binary string of the same length.