International Workshop on Fast Software Encryption

FSE 2011: Fast Software Encryption pp 218-237

Boomerang Attacks on BLAKE-32

  • Alex Biryukov
  • Ivica Nikolić
  • Arnab Roy
Conference paper

DOI: 10.1007/978-3-642-21702-9_13

Volume 6733 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Biryukov A., Nikolić I., Roy A. (2011) Boomerang Attacks on BLAKE-32. In: Joux A. (eds) Fast Software Encryption. FSE 2011. Lecture Notes in Computer Science, vol 6733. Springer, Berlin, Heidelberg

Abstract

We present high probability differential trails on 2 and 3 rounds of BLAKE-32. Using the trails we are able to launch boomerang attacks on up to 8 round-reduced keyed permutation of BLAKE-32. Also, we show that boomerangs can be used as distinguishers for hash/compression functions and present such distinguishers for the compression function of BLAKE-32 reduced to 7 rounds. Since our distinguishers on up to 6 round-reduced keyed permutation of BLAKE-32 are practical (complexity of only 212 encryptions), we are able to find boomerang quartets on a PC.

Keywords

SHA-3 competitionhash functionBLAKEboomerang attackcryptanalysis
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Alex Biryukov
    • 1
  • Ivica Nikolić
    • 1
  • Arnab Roy
    • 1
  1. 1.University of LuxembourgLuxembourg