Indifferentiability of the Hash Algorithm BLAKE.

Donghoon Chang, Mridul Nandi, Moti Yung

IACR Cryptology ePrint Archive · 2011 · 19 citations · 0 references

Concepts

Abstract

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( σ 2 2n−3 ), where σ is the total number of blocks of queries, and n is the hash output size.