Indifferentiability of the Hash Algorithm BLAKE

Donghoon Chang; Mridul Nandi; Moti Yung

Paper 2011/623 Original: eprint.iacr.org/2011/623 ↗

Indifferentiability of the Hash Algorithm BLAKE

Donghoon Chang

Mridul Nandi

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): PDF
Publication info: Preprint.
History: 2011-11-21: last updated; 2011-11-21: published
Short URL: https://ia.cr/2011/623
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2011/623,
      author = {Donghoon Chang and Mridul Nandi and Moti Yung},
      title = {Indifferentiability of the Hash Algorithm BLAKE},
      howpublished = {Cryptology {ePrint} Archive, Paper 2011/623},
      year = {2011},
      url = {https://eprint.iacr.org/2011/623}
}