On the Indifferentiability of Fugue and Luffa

Published: 01 Jan 2011, Last Modified: 09 Mar 2025ACNS 2011EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Indifferentiability is currently considered to be an important security notion for a cryptographic hash function to instantiate Random Oracles in different security proofs. In this paper, we prove indifferentiability of Fugue and Luffa, two SHA3 second round candidates. We also analyze the indifferentiability of a modified Luffa mode replacing multiple small permutations by a single large permutation.
Loading