Keccak

From The ECRYPT Hash Function Website

Jump to: navigation, search

Contents

1 The algorithm


G. Bertoni, J. Daemen, M. Peeters, G. Van Assche - Keccak specifications
Submission to NIST (Round 2), 2009
[Electronic Edition] [Bibtex]
Author : G. Bertoni, J. Daemen, M. Peeters, G. Van Assche
Title : Keccak specifications
In : Submission to NIST (Round 2) -

G. Bertoni, J. Daemen, M. Peeters, G. Van Assche - Keccak sponge function family main document
Submission to NIST (Round 2), 2009
[Electronic Edition] [Bibtex]
Author : G. Bertoni, J. Daemen, M. Peeters, G. Van Assche
Title : Keccak sponge function family main document
In : Submission to NIST (Round 2) -

G. Bertoni, J. Daemen, M. Peeters, G. Van Assche - Keccak specifications
Submission to NIST (Round 1), 2008
[Electronic Edition] [Bibtex]
Author : G. Bertoni, J. Daemen, M. Peeters, G. Van Assche
Title : Keccak specifications
In : Submission to NIST (Round 1) -

G. Bertoni, J. Daemen, M. Peeters, G. Van Assche - Keccak sponge function family main document
Submission to NIST (Round 1), 2008
[Electronic Edition] [Bibtex]
Author : G. Bertoni, J. Daemen, M. Peeters, G. Van Assche
Title : Keccak sponge function family main document
In : Submission to NIST (Round 1) -


2 Cryptanalysis

We distinguish between two cases: results on the complete hash function, and results on underlying building blocks.

A description of the tables is given here.


2.1 Hash function

Here we list results on the hash function according to the NIST requirements. The only allowed modification is to change the security parameter.

Recommended security parameter: 24 rounds (Keccak-f [1600])

Type of Analysis Hash Size (n) Parameters Compression Function Calls Memory Requirements Reference

2.2 Building blocks

Here we list results on underlying building blocks, and the hash function modified by other means than the security parameter.

Note that these results assume more direct control or access over some internal variables (aka. free-start, pseudo, compression function, block cipher, or permutation attacks).

Recommended security parameter: 24 rounds (Keccak-f [1600])

Type of Analysis Hash Function Part Hash Size (n) Parameters/Variants Compression Function Calls Memory Requirements Reference
distinguisher(1) permutation all 18 rounds 21370 Boura,Canteaut
distinguisher(1) permutation all 16 rounds 21023.88 Aumasson,Meier
key recovery secret-prefix MAC 224 4 rounds 219  ? Joel,Lathrop
observations permutation all Aumasson,Khovratovich

(1)The Keccak team commented on these distinguishers and provide generic constructions in this note.


G. Bertoni, J. Daemen, M. Peeters, G. Van Assche - Note on zero-sum distinguishers of Keccak-f
NIST mailing list, 2010
[Electronic Edition] [Bibtex]
Author : G. Bertoni, J. Daemen, M. Peeters, G. Van Assche
Title : Note on zero-sum distinguishers of Keccak-f
In : NIST mailing list -

Christina Boura, Anne Canteaut - A Zero-Sum property for the Keccak-f Permutation with 18 Rounds
NIST mailing list, 2010
[Electronic Edition] [Bibtex]
Author : Christina Boura, Anne Canteaut
Title : A Zero-Sum property for the Keccak-f Permutation with 18 Rounds
In : NIST mailing list -
[Abstract]

Jean-Philippe Aumasson, Willi Meier - Zero-sum distinguishers for reduced Keccak-f and for the core functions of Luffa and Hamsi
NIST mailing list, 2009
[Electronic Edition] [Bibtex]
Author : Jean-Philippe Aumasson, Willi Meier
Title : Zero-sum distinguishers for reduced Keccak-f and for the core functions of Luffa and Hamsi
In : NIST mailing list -
[Abstract]

Joel Lathrop - Cube Attacks on Cryptographic Hash Functions
Available online, 2009
[Electronic Edition] [Bibtex]
Author : Joel Lathrop
Title : Cube Attacks on Cryptographic Hash Functions
In : Available online -
[Abstract]

Jean-Philippe Aumasson, Dmitry Khovratovich - First Analysis of Keccak
Available online, 2009
[Electronic Edition] [Bibtex]
Author : Jean-Philippe Aumasson, Dmitry Khovratovich
Title : First Analysis of Keccak
In : Available online -
[Abstract]
Personal tools