Hamsi

1 The algorithm

Author(s): Özgül Kücük
Website: http://homes.esat.kuleuven.be/~okucuk/hamsi/
NIST submission package:
- round 1/2: Hamsi_Round2.zip (old versions: Hamsi.zip, HamsiUpdate.zip)

Özgül Küçük - The Hash Function Hamsi

,2009

http://www.cosic.esat.kuleuven.be/publications/article-1203.pdf
Bibtex

Author : Özgül Küçük
Title : The Hash Function Hamsi
In : -
Address :
Date : 2009

Özgül Küçük - The Hash Function Hamsi

,2008

http://ehash.iaik.tugraz.at/uploads/9/95/Hamsi.pdf
Bibtex

Author : Özgül Küçük
Title : The Hash Function Hamsi
In : -
Address :
Date : 2008

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.

Recommended security parameters: (3,6) P,P_f rounds (n=224,256); (6,12) P,P_f rounds (n=384,512).

2.1 Hash function

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

Type of Analysis	Hash Function Part	Hash Size (n)	Parameters/Variants	Compression Function Calls	Memory Requirements	Reference
2nd-preimage	hash function	256	(3,6)	2²⁴⁷	?	Dinur,Shamir
2nd-preimage	hash function	256	(3,6)	2^251.3	?	Fuhr

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

Type of Analysis	Hash Function Part	Hash Size (n)	Parameters/Variants	Compression Function Calls	Memory Requirements	Reference
distinguisher	output transformation	256	6 rounds	2¹⁰	-	Boura,Canteaut
semi-free-start near-collisions	compression function	256	2 rounds	example	-	Turan,Uyan
observations	hash function	all				Gligoroski
distinguisher	output transformation	224, 256	6 rounds	2^124.3		Aumasson et al.
distinguisher	permutation	224, 256	6 rounds	2²⁸		Aumasson et al.
free-start near-collision	compression function	224, 256	3 rounds	2²⁶		Aumasson et al.
non-randomness	compression function	224, 256	5 rounds			Aumasson
free-start near-collision	compression function	224, 256	3 rounds	2²¹		Nikolic
distinguisher	compression function	224, 256	6 rounds	2²⁷		Aumasson,Meier
distinguisher	compression function	384, 512	12 rounds	2⁷²⁹		Aumasson,Meier
free-start near-collision	compression function	224, 256	3 rounds	2⁵		Wang,Wang,Jia,Wang
free-start near-collision	compression function	224, 256	4 rounds	2³²		Wang,Wang,Jia,Wang
free-start near-collision	compression function	224, 256	5 rounds	2¹²⁵		Wang,Wang,Jia,Wang
message-recovery	compression function	224, 256	3 rounds	2^10.48		Calik,Turan
pseudo-2nd-preimage	hash function	256	(3,6) rounds	2^254.25		Calik,Turan

Itai Dinur, Adi Shamir - An Improved Algebraic Attack on Hamsi-256

,2010

http://eprint.iacr.org/2010/602.pdf
Bibtex

Author : Itai Dinur, Adi Shamir
Title : An Improved Algebraic Attack on Hamsi-256
In : -
Address :
Date : 2010

Christina Boura, Anne Canteau - Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256

SAC ,2010

http://www-rocq.inria.fr/secret/Christina.Boura/data/sac.pdf
Bibtex

Author : Christina Boura, Anne Canteau
Title : Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256
In : SAC -
Address :
Date : 2010

Meltem Sönmez Turan, Erdener Uyan - Practical Near-Collisions for Reduced Round Blake, Fugue, Hamsi and JH

,2010

http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/Aug2010/documents/papers/TURAN_Paper_Erdener.pdf
Bibtex

Author : Meltem Sönmez Turan, Erdener Uyan
Title : Practical Near-Collisions for Reduced Round Blake, Fugue, Hamsi and JH
In : -
Address :
Date : 2010

Thomas Fuhr - Finding Second Preimages of Short Messages for Hamsi-256

,2010

http://dx.doi.org/10.1007/978-3-642-17373-8_2
Bibtex

Author : Thomas Fuhr
Title : Finding Second Preimages of Short Messages for Hamsi-256
In : -
Address :
Date : 2010

Danilo Gligoroski - Narrow-pipe SHA-3 candidates differ significantly from ideal random functions defined over big domains

,2010

http://people.item.ntnu.no/~danilog/Hash/Non-random-behaviour-narrow-pipe-designs-03.pdf
Bibtex

Author : Danilo Gligoroski
Title : Narrow-pipe SHA-3 candidates differ significantly from ideal random functions defined over big domains
In : -
Address :
Date : 2010

Jean-Philippe Aumasson, Emilia Käsper, Lars Ramkilde Knudsen, Krystian Matusiewicz, Rune Ødegaard, Thomas Peyrin, Martin Schläffer - Distinguishers for the compression function and output transformation of Hamsi-256

ACISP 6168:87-103,2010

http://131002.net/data/papers/AKKMOPS10.pdf
Bibtex

Author : Jean-Philippe Aumasson, Emilia Käsper, Lars Ramkilde Knudsen, Krystian Matusiewicz, Rune Ødegaard, Thomas Peyrin, Martin Schläffer
Title : Distinguishers for the compression function and output transformation of Hamsi-256
In : ACISP -
Address :
Date : 2010

Jean-Philippe Aumasson - On the pseudorandomness of Hamsi

,2009

http://ehash.iaik.tugraz.at/uploads/d/db/Hamsi_nonrandomness.txt
Bibtex

Author : Jean-Philippe Aumasson
Title : On the pseudorandomness of Hamsi
In : -
Address :
Date : 2009

Ivica Nikolic - Near Collisions for the Compression Function of Hamsi-256

,2009

http://rump2009.cr.yp.to/936779b3afb9b48a404b487d6865091d.pdf
Bibtex

Author : Ivica Nikolic
Title : Near Collisions for the Compression Function of Hamsi-256
In : -
Address :
Date : 2009

Jean-Philippe Aumasson, Willi Meier - Zero-sum distinguishers for reduced Keccak-f and for the core functions of Luffa and Hamsi