On the indifferentiability of Fugue and Luffa

Rishiraj Bhattacharyya*, Avradip Mandal

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)


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. Our technique is quite general and can be applicable to any sponge based design which uses affine function for message insertion. To the best of our knowledge, our result for Luffa is the first indifferentiability analysis of a mode of operation based on variable (more than two) number of small permutations.

Original languageEnglish
Title of host publicationApplied Cryptography and Network Security - 9th International Conference, ACNS 2011, Proceedings
Number of pages19
Publication statusPublished - 2011
Event9th International Conference on Applied Cryptography and Network Security, ACNS 2011 - Nerja, Spain
Duration: 7 Jun 201110 Jun 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6715 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference9th International Conference on Applied Cryptography and Network Security, ACNS 2011


  • Fugue
  • Hash function
  • Indifferentiability
  • Luffa

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'On the indifferentiability of Fugue and Luffa'. Together they form a unique fingerprint.

Cite this