We present some improved analytical results as part of the ongoing work on the analysis of Fugue-256 hash function, a second round candidate in the NIST's SHA3 competition. First we improve Aumasson and Phans' integral distinguisher on the 5.5 rounds of the final transformation of Fugue-256 to 16.5 rounds. Next we improve the designers' meet-in-the-middle preimage attack on Fugue-256 from 2480 time and memory to 2416. Finally, we comment on possible methods to obtain free-start distinguishers and free-start collisions for Fugue-256. © 2011 Springer-Verlag.
|Book series||Lecture Notes in Computer Science|
|Publication status||Published - 2011|
|Event||16th Australasian Conference on Information Security and Privacy - Melbourne, Australia|
Duration: 11 Jul 2011 → 13 Jul 2011
Conference number: 16
|Conference||16th Australasian Conference on Information Security and Privacy|
|Period||11/07/2011 → 13/07/2011|