Reference : Boomerang Attacks on BLAKE-32
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/17513
Boomerang Attacks on BLAKE-32
English
Biryukov, Alex mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Nikolic, Ivica [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Roy, Arnab mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC)]
2011
Fast Software Encryption - 18th International Workshop
Springer
218-237
Yes
International
978-3-642-21701-2
Fast Software Encryption - 18th International Workshop
February 13-16
Lyngby
Denmark
[en] SHA-3 competition ; hash function ; BLAKE ; boomerang attack ; cryptanalysis
[en] 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.
http://hdl.handle.net/10993/17513
6733
Lecture Notes in Computer Science
Lect Notes Comput Sci
1611-3349
0302-9743

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
biryukov-blake.pdfNo commentaryAuthor postprint286.9 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.