On the cryptanalysis of the hash function Fugue: Partitioning and inside-out distinguishers
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...
- et al.
Super-Sbox cryptanalysis: Improved attacks for AES-like permutations
- 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 SecurityImproved security analysis of Fugue-256 (poster)
2011, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 2011 Elsevier B.V. All rights reserved.