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. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Biryukov, A., Nikolić, I., & Roy, A. (2011). Boomerang attacks on BLAKE-32. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6733 LNCS, pp. 218–237). Springer Verlag. https://doi.org/10.1007/978-3-642-21702-9_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
