[Resource Topic] 2011/623: Indifferentiability of the Hash Algorithm BLAKE

Welcome to the resource topic for 2011/623

Indifferentiability of the Hash Algorithm BLAKE

Authors: Donghoon Chang, Mridul Nandi, Moti Yung


The hash algorithm BLAKE, one of the SHA-3 finalists, was designed by Aumasson, Henzen, Meier, and Phan. Unlike other SHA-3 finalists, there is no known indifferentiable security proof on BLAKE. In this paper, we provide the indifferentiable security proof on BLAKE with the bound O(\delta^2/2^{n-3}), where \delta is the total number of blocks of queries, and n is the hash output size.

ePrint: https://eprint.iacr.org/2011/623

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .