Indifferentiability of the Hash Algorithm BLAKE

BLAKE, designed by Aumasson, Henzen, Meier, and Phan, is the one of the five SHA-3 finalists. Indifferentiability is one of well known security notions of hash functions, because it shows how close a hash function behave as a random oracle, under the assumption that its underlying function such as a permutation, a compression function, or a block cipher is ideal, where 'Ideal' informally means that the underlying function is chosen randomly and any attacker is allowed only to know input-output pairs of the function by making queries without knowing the internal structure of the function.

Provided by: National Institute of Standards and Technology Topic: Security Date Added: Nov 2011 Format: PDF

Find By Topic