On the indifferentiability of Fugue and Luffa

Rishiraj Bhattacharyya; Avradip Mandal

doi:10.1007/978-3-642-21554-4_28

On the indifferentiability of Fugue and Luffa

Rishiraj Bhattacharyya^*, Avradip Mandal

^*Corresponding author for this work

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (Scopus)

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. 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 language	English
Title of host publication	Applied Cryptography and Network Security - 9th International Conference, ACNS 2011, Proceedings
Pages	479-497
Number of pages	19
DOIs	https://doi.org/10.1007/978-3-642-21554-4_28
Publication status	Published - 2011
Event	9th International Conference on Applied Cryptography and Network Security, ACNS 2011 - Nerja, Spain Duration: 7 Jun 2011 → 10 Jun 2011

Publication series

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

Conference

Conference	9th International Conference on Applied Cryptography and Network Security, ACNS 2011
Country/Territory	Spain
City	Nerja
Period	7/06/11 → 10/06/11

Keywords

Fugue
Hash function
Indifferentiability
Luffa

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-21554-4_28

Cite this

Bhattacharyya, R., & Mandal, A. (2011). On the indifferentiability of Fugue and Luffa. In Applied Cryptography and Network Security - 9th International Conference, ACNS 2011, Proceedings (pp. 479-497). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6715 LNCS). https://doi.org/10.1007/978-3-642-21554-4_28

@inproceedings{efc612970c1b420c916dd71312b2ffee,

title = "On the indifferentiability of Fugue and Luffa",

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. 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.",

keywords = "Fugue, Hash function, Indifferentiability, Luffa",

author = "Rishiraj Bhattacharyya and Avradip Mandal",

year = "2011",

doi = "10.1007/978-3-642-21554-4_28",

language = "English",

isbn = "9783642215537",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "479--497",

booktitle = "Applied Cryptography and Network Security - 9th International Conference, ACNS 2011, Proceedings",

note = "9th International Conference on Applied Cryptography and Network Security, ACNS 2011 ; Conference date: 07-06-2011 Through 10-06-2011",

}

Bhattacharyya, R & Mandal, A 2011, On the indifferentiability of Fugue and Luffa. in Applied Cryptography and Network Security - 9th International Conference, ACNS 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6715 LNCS, pp. 479-497, 9th International Conference on Applied Cryptography and Network Security, ACNS 2011, Nerja, Spain, 7/06/11. https://doi.org/10.1007/978-3-642-21554-4_28

On the indifferentiability of Fugue and Luffa. / Bhattacharyya, Rishiraj; Mandal, Avradip.
Applied Cryptography and Network Security - 9th International Conference, ACNS 2011, Proceedings. 2011. p. 479-497 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6715 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - On the indifferentiability of Fugue and Luffa

AU - Bhattacharyya, Rishiraj

AU - Mandal, Avradip

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Fugue

KW - Hash function

KW - Indifferentiability

KW - Luffa

UR - http://www.scopus.com/inward/record.url?scp=79959308010&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-21554-4_28

DO - 10.1007/978-3-642-21554-4_28

M3 - Conference contribution

AN - SCOPUS:79959308010

SN - 9783642215537

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 479

EP - 497

BT - Applied Cryptography and Network Security - 9th International Conference, ACNS 2011, Proceedings

T2 - 9th International Conference on Applied Cryptography and Network Security, ACNS 2011

Y2 - 7 June 2011 through 10 June 2011

ER -

On the indifferentiability of Fugue and Luffa

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this