Publication: Research - peer-review › Conference article – Annual report year: 2011
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.
|Journal||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|State||Published - 2011|
|Conference||16th Australasian Conference on Information Security and Privacy, ACISP 2011|
|Period||01/01/2011 → …|
|Citations||Web of Science® Times Cited: No match on DOI|
Loading map data...