You are looking at a specific version 20111121:182813 of this paper.
See the latest version.
Paper 2011/623
Indifferentiability of the Hash Algorithm BLAKE
Donghoon Chang and Mridul Nandi and Moti Yung
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(\delta^2/2^{n-3}), where \delta is the total number of blocks of queries, and n is the hash output size.
Metadata
- Available format(s)
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- hash function
- Contact author(s)
- pointchang @ gmail com
- History
- 2011-11-21: received
- Short URL
- https://ia.cr/2011/623
- License
-
CC BY