On the cryptanalysis of the hash function Fugue: Partitioning and inside-out distinguishers

doi:10.1016/j.ipl.2011.02.012

Information Processing Letters

Volume 111, Issue 11, 15 May 2011, Pages 512-515

https://doi.org/10.1016/j.ipl.2011.02.012 Get rights and content

Abstract

Fugue is an intriguing hash function design with a novel shift-register based compression structure and has formal security proofs e.g. against collision attacks. In this paper, we present an analysis of Fugueʼs structural properties, and describe our strategies to construct distinguishers for Fugue components.

Research highlights

► New cryptanalysis results on Fugue, IBMʼs candidate for the SHA-3 hash standard. ► Our results demonstrate non-randomness properties in some of Fugueʼs components. ► Attacks were experimentally verified, and can be efficiently implemented by anyone.

References (8)

NIST, Cryptographic hash competition, http://www.nist.gov/hash-competition, accessed October...
S. Halevi, W.E. Hall, C.S. Jutla, The hash function Fugue, Algorithm candidate in the NIST hash competition, available...
H. Gilbert et al.
Super-Sbox cryptanalysis: Improved attacks for AES-like permutations
Y. Dodis et al.
On the relation between the ideal cipher and the random oracle models

There are more references available in the full text version of this article.

Cited by (2)

On security arguments of the second round SHA-3 candidates
2012, International Journal of Information Security
Improved security analysis of Fugue-256 (poster)
2011, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

View full text

On the cryptanalysis of the hash function Fugue: Partitioning and inside-out distinguishers

Abstract

Research highlights

Super-Sbox cryptanalysis: Improved attacks for AES-like permutations

On the relation between the ideal cipher and the random oracle models