2024-06-21T08:19:24Z

Administrator:

The eHash Main Page

2024-06-21T08:19:06Z

Administrator:

----
The content of this page is no longer maintained.
----

= Introduction =

An [[Introduction to Hash Functions|introduction]] to cryptographic hash functions.

= The Hash Function Zoo =

The [[The Hash Function Zoo|Hash Function Zoo]] is a collection of peer-reviewed hash functions.

The [[The SHA-3 Zoo|SHA-3 Zoo]] contains functions submitted to the [http://www.nist.gov/hash-competition NIST Hash Competition]. We also collect [[SHA-3_Hardware_Implementations | hardware implementation results]] of the candidates.

= Generic Attacks on Hash Functions =

[[Generic_Attacks| Generic Attacks on Hash Functions]].

[[GenericAttacksMerkleDamgaard| Generic Attacks on the Merkle-Damgaard Construction]].

= Editors corner =

[[HowTo | How to]] work with math environments and BibTeX.

Mediawiki [http://www.mediawiki.org/wiki/Category:Help help], [http://www.mediawiki.org/wiki/Help:FAQ FAQ], and release [http://mail.wikipedia.org/mailman/listinfo/mediawiki-announce mailing list].

----
ECRYPT is a Network of Excellence within the Information Societies Technology (IST) Programme of the European Commission. The information on this web site is provided as is, and no guarantee or warranty is given or implied that the information is fit for any particular purpose. The user thereof uses the information at his or her sole risk and liability.
----

'''The content of this page is no longer maintained.'''

The eHash Main Page

2024-06-21T08:18:54Z

Administrator:

---
The content of this page is no longer maintained.
---

= Introduction =

An [[Introduction to Hash Functions|introduction]] to cryptographic hash functions.

= The Hash Function Zoo =

The [[The Hash Function Zoo|Hash Function Zoo]] is a collection of peer-reviewed hash functions.

The [[The SHA-3 Zoo|SHA-3 Zoo]] contains functions submitted to the [http://www.nist.gov/hash-competition NIST Hash Competition]. We also collect [[SHA-3_Hardware_Implementations | hardware implementation results]] of the candidates.

= Generic Attacks on Hash Functions =

[[Generic_Attacks| Generic Attacks on Hash Functions]].

[[GenericAttacksMerkleDamgaard| Generic Attacks on the Merkle-Damgaard Construction]].

= Editors corner =

[[HowTo | How to]] work with math environments and BibTeX.

Mediawiki [http://www.mediawiki.org/wiki/Category:Help help], [http://www.mediawiki.org/wiki/Help:FAQ FAQ], and release [http://mail.wikipedia.org/mailman/listinfo/mediawiki-announce mailing list].

----
ECRYPT is a Network of Excellence within the Information Societies Technology (IST) Programme of the European Commission. The information on this web site is provided as is, and no guarantee or warranty is given or implied that the information is fit for any particular purpose. The user thereof uses the information at his or her sole risk and liability.
----

'''The content of this page is no longer maintained.'''

2010-03-01T14:27:17Z

Administrator: /* The algorithm */

== The algorithm ==

* Author(s): Özgül Kücük
* Website: [http://homes.esat.kuleuven.be/~okucuk/hamsi/ http://homes.esat.kuleuven.be/~okucuk/hamsi/]
* NIST submission package:
**round 1/2: [http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/documents/Hamsi_Round2.zip Hamsi_Round2.zip] (old versions: [http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/Hamsi.zip Hamsi.zip], [http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/HamsiUpdate.zip HamsiUpdate.zip])

<bibtex>
@misc{sha3Kucuk09,
author = {Özgül Kücük},
title = {The Hash Function Hamsi},
url = {http://www.cosic.esat.kuleuven.be/publications/article-1203.pdf},
howpublished = {Submission to NIST (updated)},
year = {2009},
}
</bibtex>

<bibtex>
@misc{sha3Kucuk08,
author = {Özgül Kücük},
title = {The Hash Function Hamsi},
url = {http://ehash.iaik.tugraz.at/uploads/9/95/Hamsi.pdf},
howpublished = {Submission to NIST},
year = {2008},
}
</bibtex>

== 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 [http://ehash.iaik.tugraz.at/wiki/Cryptanalysis_Categories#Individual_Hash_Function_Tables here].

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

=== Hash function ===

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

{| border="1" cellpadding="4" cellspacing="0" class="wikitable" style="text-align:center"
|- style="background:#efefef;"
| Type of Analysis || Hash Function Part || Hash Size (n) || Parameters/Variants || Compression Function Calls || Memory Requirements || Reference
|-
| || || || || || ||
|-
|}

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

{| border="1" cellpadding="4" cellspacing="0" class="wikitable" style="text-align:center"
|- style="background:#efefef;"
| Type of Analysis || Hash Function Part || Hash Size (n) || Parameters/Variants || Compression Function Calls || Memory Requirements || Reference
|-
| | non-randomness || compression function || 224, 256 || 5 rounds || || || [http://ehash.iaik.tugraz.at/uploads/d/db/Hamsi_nonrandomness.txt Aumasson]
|-
| | near-collision || compression function || 224, 256 || 3 rounds || 221 || || [http://rump2009.cr.yp.to/936779b3afb9b48a404b487d6865091d.pdf Nikolic]
|-
| | distinguisher || compression function || 224, 256 || 6 rounds || 227 || || [http://www.131002.net/data/papers/AM09.pdf Aumasson,Meier]
|-
| | distinguisher || compression function || 384, 512 || 12 rounds || 2729 || || [http://www.131002.net/data/papers/AM09.pdf Aumasson,Meier]
|-
| | near-collision || compression function || 224, 256 || 3 rounds || 25 || || [http://eprint.iacr.org/2009/484.pdf Wang,Wang,Jia,Wang]
|-
| | near-collision || compression function || 224, 256 || 4 rounds || 232 || || [http://eprint.iacr.org/2009/484.pdf Wang,Wang,Jia,Wang]
|-
| | near-collision || compression function || 224, 256 || 5 rounds || 2125 || || [http://eprint.iacr.org/2009/484.pdf Wang,Wang,Jia,Wang]
|-
| | message-recovery || compression function || 224, 256 || 3 rounds || 210.48 || || [http://eprint.iacr.org/2010/057.pdf Calik,Turan]
|-
| | pseudo-2nd-preimage || hash function || 256 || (3,6) rounds || 2254.25 || || [http://eprint.iacr.org/2010/057.pdf Calik,Turan]
|-
|}

<bibtex>
@misc{hamsiAum09,
author = {Jean-Philippe Aumasson},
title = {On the pseudorandomness of Hamsi},
url = {http://ehash.iaik.tugraz.at/uploads/d/db/Hamsi_nonrandomness.txt},
howpublished = {NIST mailing list (local link)},
year = {2009},
}
</bibtex>

<bibtex>
@misc{hamsiN09,
author = {Ivica Nikolic},
title = {Near Collisions for the Compression Function of Hamsi-256},
url = {http://rump2009.cr.yp.to/936779b3afb9b48a404b487d6865091d.pdf},
howpublished = {CRYPTO rump session},
year = {2009},
}
</bibtex>

<bibtex>
@misc{hamsiAM9,
author = {Jean-Philippe Aumasson and Willi Meier},
title = {Zero-sum distinguishers for reduced Keccak-f and for the core functions of Luffa and Hamsi},
url = {http://www.131002.net/data/papers/AM09.pdf},
howpublished = {NIST mailing list},
year = {2009},
abstract = {We present a new type of distinguisher, called zero-sum distinguisher, and apply it to reduced versions of the Keccak-f permutation. We obtain practical and deterministic distinguishers on up to 9 rounds, and shortcut distinguishers on up to 16 rounds, out of 18 in total. These observations do not seem to affect the security of Keccak. We also briefly describe application of zero-sum distinguishers to the core permutations of Luffa and Hamsi.},
}
</bibtex>

<bibtex>
@misc{hamsiWWJW09,
author = {Meiqin Wang, Xiaoyun Wang, Keting Jia, Wei Wang},
title = {New Pseudo-Near-Collision Attack on Reduced-Round of Hamsi-256},
howpublished = {Cryptology ePrint Archive, Report 2009/484},
year = {2009},
note = {\url{http://eprint.iacr.org/}},
url = {http://eprint.iacr.org/2009/484.pdf},
abstract = {Hamsi-256 is designed by Özgül Kücük and it has been a candidate Hash function for the second round of SHA-3. The compression function of Hamsi-256 maps a 256-bit chaining value and a 32-bit message to a new 256-bit chaining value. As hashing a message, Hamsi-256 operates 3-round except for the last message it operates 6-round. In this paper, we will give the pseudo-near-collision for 5-round Hamsi-256. By the message modifying, the pseudo-near-collision for 3, 4 and 5 rounds can be found with $2^5$, $2^{32}$ and $2^{125}$ compression function computations respectively.},
}
</bibtex>

<bibtex>
@misc{hamsiWWJW09,
author = {Cagdas Calik and Meltem Sonmez Turan},
title = {Message Recovery and Pseudo-Preimage Attacks on the Compression Function of Hamsi-256},
howpublished = {Cryptology ePrint Archive, Report 2010/057}},
year = {2010},
note = {\url{http://eprint.iacr.org/}},
url = {http://eprint.iacr.org/2010/057.pdf},
abstract = {Hamsi is one of the second round candidates of the SHA-3
competition. In this study, we present non-random differential proper-
ties for the compression function of the hash function Hamsi-256. Based
on these properties, we first demonstrate a distinguishing attack that
requires a few evaluations of the compression function and extend the
distinguisher to 5 rounds with complexity 2^83 . Then, we present a mes-
sage recovery attack with complexity of 2^10.48 compression function evaluations. Also, we present a pseudo-preimage attack for the compression
function with complexity 2^254.25 . The pseudo-preimage attack on the
compression function is easily converted to a pseudo second preimage
attack on Hamsi-256 hash function with the same complexity.},
}
</bibtex>

Hamsi

2010-03-01T14:27:01Z

Administrator: /* The algorithm */

== The algorithm ==

* Author(s): Özgül Kücük
* Website: [http://homes.esat.kuleuven.be/~okucuk/hamsi/ http://homes.esat.kuleuven.be/~okucuk/hamsi/]
* NIST submission package:
**round 1/2: [http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/documents/Hamsi_Round2.zip Hamsi_Round2.zip] (old versions: [http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/Hamsi.zip Hamsi.zip], [http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/HamsiUpdate.zip HamsiUpdate.zip])

<bibtex>
@misc{sha3Kucuk09,
author = {\"Ozgül Kücük},
title = {The Hash Function Hamsi},
url = {http://www.cosic.esat.kuleuven.be/publications/article-1203.pdf},
howpublished = {Submission to NIST (updated)},
year = {2009},
}
</bibtex>

<bibtex>
@misc{sha3Kucuk08,
author = {Özgül Kücük},
title = {The Hash Function Hamsi},
url = {http://ehash.iaik.tugraz.at/uploads/9/95/Hamsi.pdf},
howpublished = {Submission to NIST},
year = {2008},
}
</bibtex>

== 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 [http://ehash.iaik.tugraz.at/wiki/Cryptanalysis_Categories#Individual_Hash_Function_Tables here].

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

=== Hash function ===

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

{| border="1" cellpadding="4" cellspacing="0" class="wikitable" style="text-align:center"
|- style="background:#efefef;"
| Type of Analysis || Hash Function Part || Hash Size (n) || Parameters/Variants || Compression Function Calls || Memory Requirements || Reference
|-
| || || || || || ||
|-
|}

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

{| border="1" cellpadding="4" cellspacing="0" class="wikitable" style="text-align:center"
|- style="background:#efefef;"
| Type of Analysis || Hash Function Part || Hash Size (n) || Parameters/Variants || Compression Function Calls || Memory Requirements || Reference
|-
| | non-randomness || compression function || 224, 256 || 5 rounds || || || [http://ehash.iaik.tugraz.at/uploads/d/db/Hamsi_nonrandomness.txt Aumasson]
|-
| | near-collision || compression function || 224, 256 || 3 rounds || 221 || || [http://rump2009.cr.yp.to/936779b3afb9b48a404b487d6865091d.pdf Nikolic]
|-
| | distinguisher || compression function || 224, 256 || 6 rounds || 227 || || [http://www.131002.net/data/papers/AM09.pdf Aumasson,Meier]
|-
| | distinguisher || compression function || 384, 512 || 12 rounds || 2729 || || [http://www.131002.net/data/papers/AM09.pdf Aumasson,Meier]
|-
| | near-collision || compression function || 224, 256 || 3 rounds || 25 || || [http://eprint.iacr.org/2009/484.pdf Wang,Wang,Jia,Wang]
|-
| | near-collision || compression function || 224, 256 || 4 rounds || 232 || || [http://eprint.iacr.org/2009/484.pdf Wang,Wang,Jia,Wang]
|-
| | near-collision || compression function || 224, 256 || 5 rounds || 2125 || || [http://eprint.iacr.org/2009/484.pdf Wang,Wang,Jia,Wang]
|-
| | message-recovery || compression function || 224, 256 || 3 rounds || 210.48 || || [http://eprint.iacr.org/2010/057.pdf Calik,Turan]
|-
| | pseudo-2nd-preimage || hash function || 256 || (3,6) rounds || 2254.25 || || [http://eprint.iacr.org/2010/057.pdf Calik,Turan]
|-
|}

<bibtex>
@misc{hamsiAum09,
author = {Jean-Philippe Aumasson},
title = {On the pseudorandomness of Hamsi},
url = {http://ehash.iaik.tugraz.at/uploads/d/db/Hamsi_nonrandomness.txt},
howpublished = {NIST mailing list (local link)},
year = {2009},
}
</bibtex>

<bibtex>
@misc{hamsiN09,
author = {Ivica Nikolic},
title = {Near Collisions for the Compression Function of Hamsi-256},
url = {http://rump2009.cr.yp.to/936779b3afb9b48a404b487d6865091d.pdf},
howpublished = {CRYPTO rump session},
year = {2009},
}
</bibtex>

<bibtex>
@misc{hamsiAM9,
author = {Jean-Philippe Aumasson and Willi Meier},
title = {Zero-sum distinguishers for reduced Keccak-f and for the core functions of Luffa and Hamsi},
url = {http://www.131002.net/data/papers/AM09.pdf},
howpublished = {NIST mailing list},
year = {2009},
abstract = {We present a new type of distinguisher, called zero-sum distinguisher, and apply it to reduced versions of the Keccak-f permutation. We obtain practical and deterministic distinguishers on up to 9 rounds, and shortcut distinguishers on up to 16 rounds, out of 18 in total. These observations do not seem to affect the security of Keccak. We also briefly describe application of zero-sum distinguishers to the core permutations of Luffa and Hamsi.},
}
</bibtex>

<bibtex>
@misc{hamsiWWJW09,
author = {Meiqin Wang, Xiaoyun Wang, Keting Jia, Wei Wang},
title = {New Pseudo-Near-Collision Attack on Reduced-Round of Hamsi-256},
howpublished = {Cryptology ePrint Archive, Report 2009/484},
year = {2009},
note = {\url{http://eprint.iacr.org/}},
url = {http://eprint.iacr.org/2009/484.pdf},
abstract = {Hamsi-256 is designed by Özgül Kücük and it has been a candidate Hash function for the second round of SHA-3. The compression function of Hamsi-256 maps a 256-bit chaining value and a 32-bit message to a new 256-bit chaining value. As hashing a message, Hamsi-256 operates 3-round except for the last message it operates 6-round. In this paper, we will give the pseudo-near-collision for 5-round Hamsi-256. By the message modifying, the pseudo-near-collision for 3, 4 and 5 rounds can be found with $2^5$, $2^{32}$ and $2^{125}$ compression function computations respectively.},
}
</bibtex>

<bibtex>
@misc{hamsiWWJW09,
author = {Cagdas Calik and Meltem Sonmez Turan},
title = {Message Recovery and Pseudo-Preimage Attacks on the Compression Function of Hamsi-256},
howpublished = {Cryptology ePrint Archive, Report 2010/057}},
year = {2010},
note = {\url{http://eprint.iacr.org/}},
url = {http://eprint.iacr.org/2010/057.pdf},
abstract = {Hamsi is one of the second round candidates of the SHA-3
competition. In this study, we present non-random differential proper-
ties for the compression function of the hash function Hamsi-256. Based
on these properties, we first demonstrate a distinguishing attack that
requires a few evaluations of the compression function and extend the
distinguisher to 5 rounds with complexity 2^83 . Then, we present a mes-
sage recovery attack with complexity of 2^10.48 compression function evaluations. Also, we present a pseudo-preimage attack for the compression
function with complexity 2^254.25 . The pseudo-preimage attack on the
compression function is easily converted to a pseudo second preimage
attack on Hamsi-256 hash function with the same complexity.},
}
</bibtex>

Hamsi

2010-03-01T14:26:28Z

Administrator:

== The algorithm ==

* Author(s): Özgül Kücük
* Website: [http://homes.esat.kuleuven.be/~okucuk/hamsi/ http://homes.esat.kuleuven.be/~okucuk/hamsi/]
* NIST submission package:
**round 1/2: [http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/documents/Hamsi_Round2.zip Hamsi_Round2.zip] (old versions: [http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/Hamsi.zip Hamsi.zip], [http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/HamsiUpdate.zip HamsiUpdate.zip])

<bibtex>
@misc{sha3Kucuk09,
author = {"Ozgül Kücük},
title = {The Hash Function Hamsi},
url = {http://www.cosic.esat.kuleuven.be/publications/article-1203.pdf},
howpublished = {Submission to NIST (updated)},
year = {2009},
}
</bibtex>

<bibtex>
@misc{sha3Kucuk08,
author = {Özgül Kücük},
title = {The Hash Function Hamsi},
url = {http://ehash.iaik.tugraz.at/uploads/9/95/Hamsi.pdf},
howpublished = {Submission to NIST},
year = {2008},
}
</bibtex>

== 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 [http://ehash.iaik.tugraz.at/wiki/Cryptanalysis_Categories#Individual_Hash_Function_Tables here].

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

=== Hash function ===

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

{| border="1" cellpadding="4" cellspacing="0" class="wikitable" style="text-align:center"
|- style="background:#efefef;"
| Type of Analysis || Hash Function Part || Hash Size (n) || Parameters/Variants || Compression Function Calls || Memory Requirements || Reference
|-
| || || || || || ||
|-
|}

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

{| border="1" cellpadding="4" cellspacing="0" class="wikitable" style="text-align:center"
|- style="background:#efefef;"
| Type of Analysis || Hash Function Part || Hash Size (n) || Parameters/Variants || Compression Function Calls || Memory Requirements || Reference
|-
| | non-randomness || compression function || 224, 256 || 5 rounds || || || [http://ehash.iaik.tugraz.at/uploads/d/db/Hamsi_nonrandomness.txt Aumasson]
|-
| | near-collision || compression function || 224, 256 || 3 rounds || 221 || || [http://rump2009.cr.yp.to/936779b3afb9b48a404b487d6865091d.pdf Nikolic]
|-
| | distinguisher || compression function || 224, 256 || 6 rounds || 227 || || [http://www.131002.net/data/papers/AM09.pdf Aumasson,Meier]
|-
| | distinguisher || compression function || 384, 512 || 12 rounds || 2729 || || [http://www.131002.net/data/papers/AM09.pdf Aumasson,Meier]
|-
| | near-collision || compression function || 224, 256 || 3 rounds || 25 || || [http://eprint.iacr.org/2009/484.pdf Wang,Wang,Jia,Wang]
|-
| | near-collision || compression function || 224, 256 || 4 rounds || 232 || || [http://eprint.iacr.org/2009/484.pdf Wang,Wang,Jia,Wang]
|-
| | near-collision || compression function || 224, 256 || 5 rounds || 2125 || || [http://eprint.iacr.org/2009/484.pdf Wang,Wang,Jia,Wang]
|-
| | message-recovery || compression function || 224, 256 || 3 rounds || 210.48 || || [http://eprint.iacr.org/2010/057.pdf Calik,Turan]
|-
| | pseudo-2nd-preimage || hash function || 256 || (3,6) rounds || 2254.25 || || [http://eprint.iacr.org/2010/057.pdf Calik,Turan]
|-
|}

<bibtex>
@misc{hamsiAum09,
author = {Jean-Philippe Aumasson},
title = {On the pseudorandomness of Hamsi},
url = {http://ehash.iaik.tugraz.at/uploads/d/db/Hamsi_nonrandomness.txt},
howpublished = {NIST mailing list (local link)},
year = {2009},
}
</bibtex>

<bibtex>
@misc{hamsiN09,
author = {Ivica Nikolic},
title = {Near Collisions for the Compression Function of Hamsi-256},
url = {http://rump2009.cr.yp.to/936779b3afb9b48a404b487d6865091d.pdf},
howpublished = {CRYPTO rump session},
year = {2009},
}
</bibtex>

<bibtex>
@misc{hamsiAM9,
author = {Jean-Philippe Aumasson and Willi Meier},
title = {Zero-sum distinguishers for reduced Keccak-f and for the core functions of Luffa and Hamsi},
url = {http://www.131002.net/data/papers/AM09.pdf},
howpublished = {NIST mailing list},
year = {2009},
abstract = {We present a new type of distinguisher, called zero-sum distinguisher, and apply it to reduced versions of the Keccak-f permutation. We obtain practical and deterministic distinguishers on up to 9 rounds, and shortcut distinguishers on up to 16 rounds, out of 18 in total. These observations do not seem to affect the security of Keccak. We also briefly describe application of zero-sum distinguishers to the core permutations of Luffa and Hamsi.},
}
</bibtex>

<bibtex>
@misc{hamsiWWJW09,
author = {Meiqin Wang, Xiaoyun Wang, Keting Jia, Wei Wang},
title = {New Pseudo-Near-Collision Attack on Reduced-Round of Hamsi-256},
howpublished = {Cryptology ePrint Archive, Report 2009/484},
year = {2009},
note = {\url{http://eprint.iacr.org/}},
url = {http://eprint.iacr.org/2009/484.pdf},
abstract = {Hamsi-256 is designed by Özgül Kücük and it has been a candidate Hash function for the second round of SHA-3. The compression function of Hamsi-256 maps a 256-bit chaining value and a 32-bit message to a new 256-bit chaining value. As hashing a message, Hamsi-256 operates 3-round except for the last message it operates 6-round. In this paper, we will give the pseudo-near-collision for 5-round Hamsi-256. By the message modifying, the pseudo-near-collision for 3, 4 and 5 rounds can be found with $2^5$, $2^{32}$ and $2^{125}$ compression function computations respectively.},
}
</bibtex>

<bibtex>
@misc{hamsiWWJW09,
author = {Cagdas Calik and Meltem Sonmez Turan},
title = {Message Recovery and Pseudo-Preimage Attacks on the Compression Function of Hamsi-256},
howpublished = {Cryptology ePrint Archive, Report 2010/057}},
year = {2010},
note = {\url{http://eprint.iacr.org/}},
url = {http://eprint.iacr.org/2010/057.pdf},
abstract = {Hamsi is one of the second round candidates of the SHA-3
competition. In this study, we present non-random differential proper-
ties for the compression function of the hash function Hamsi-256. Based
on these properties, we first demonstrate a distinguishing attack that
requires a few evaluations of the compression function and extend the
distinguisher to 5 rounds with complexity 2^83 . Then, we present a mes-
sage recovery attack with complexity of 2^10.48 compression function evaluations. Also, we present a pseudo-preimage attack for the compression
function with complexity 2^254.25 . The pseudo-preimage attack on the
compression function is easily converted to a pseudo second preimage
attack on Hamsi-256 hash function with the same complexity.},
}
</bibtex>

Help:Contents

2010-03-01T07:30:23Z

Administrator:

This is the help page for the IAIK HashLounge. If you have additional questions please send a mail to the WIKI - Admin <wiki@iaik.tugraz.at>.
This page shows the basic commands of editing the IAIK HashLounge WIKI. The information on this help page is taken from the help page of [http://www.mediawiki.org Mediawiki] and modified to reflect only the necessary information. Additional information and documentation can be found at [http://www.mediawiki.org/ Mediawiki]

=== Organizing your writing -- sections, paragraphs, lists and lines ===
{| border="1" cellpadding="2" cellspacing="0"
|-
!What it looks like
!What you type
|-
|

 New section 

 Subsection

 Sub-subsection
|<pre><nowiki>

== New section ==

=== Subsection ===

==== Sub-subsection ====
</nowiki></pre>

|-
|
A single
newline
has no
effect on the
layout.

But an empty line
starts a new paragraph,
or ends a list or indented part.
|<pre><nowiki>

A single
newline
has no
effect on the
layout.

But an empty line
starts a new paragraph.</nowiki></pre>
|-
|You can break lines 
without starting a new paragraph.
|<pre><nowiki>You can break lines 
without starting a new paragraph.</nowiki></pre>
|-
|
* Unordered lists are easy to do:
** start every line with a star
*** more stars means deeper levels
*A newline
*in a list
marks the end of the list.
*Of course
*you can
*start again.

|<pre><nowiki>* Unordered lists are easy to do:
** start every line with a star
*** more stars means deeper levels
*A newline
*in a list
marks the end of the list.
*Of course
*you can
*start again.

</nowiki></pre>
|-
|
# Numbered lists are also good
## very organized
## easy to follow
#A newline
#in a list
marks the end of the list.
#New numbering starts
#with 1.

|<pre><nowiki># Numbered lists are also good
## very organized
## easy to follow
#A newline
#in a list
marks the end of the list.
#New numbering starts
#with 1.
</nowiki></pre>
|-
|
* You can even do mixed lists
*# and nest them
*#* or break lines in lists
|<pre><nowiki>* You can even do mixed lists
*# and nest them
*#* or break lines in lists</nowiki></pre>
|-
|
; word : definition of the word
; longer phrase
: phrase defined
|<pre><nowiki>; word : definition of the word
; longer phrase
: phrase defined</nowiki></pre>
|-
|
;indenting
:A colon indents a line or paragraph.
A manual newline starts a new paragraph.
|<pre><nowiki>: A colon indents a line or paragraph.
A manual newline starts a new paragraph.
</nowiki></pre>
|-
|
When there is a need for separating a block of text
<blockquote>
the '''blockquote''' command will indent both margins when needed instead of the left margin only as the colon does.
</blockquote>
|
<pre><nowiki>
<blockquote>
The '''blockquote''' command will indent
both margins when needed instead of the
left margin only as the colon does.
</blockquote>
</nowiki></pre>
|-
|<center>Centered text.</center>
|<pre><nowiki><center>Centered text.</center></nowiki></pre>
|-
|A horizontal dividing line:
this is above it...
----
...and this is below it.
|<pre><nowiki>A horizontal dividing line:
this is above it...
----
...and this is below it.
</nowiki></pre>
|-
|You can also provide a file download like this. Download the [[media:file.pdf | file]]. Currently there are not all file extensions supported by the WIKI. So if you encounter a file extension which is not allowed contact the system administrator. Some of the supported file extensions: pdf,zip,rar,exe,com.
|<pre><nowiki>[[media:file.pdf | alternative name]]</nowiki></pre>
|}

== Templates ==

{| cellspacing="1" cellpadding="2" style="background: #99f; color: #000;"
|-
! style="background: #fff;" | Wiki Markup
! style="background: #fff;" width="25%" | Purpose
! style="background: #fff;" | Template Display
|-
| style="white-space:nowrap;background: #fff;" align="center" valign=top | '''<nowiki>
{{reviewbox|title=*|author=*|keywords=*|summary=*|links=*|comment=*
|rating=0 (worst) - 5 (best)}}</nowiki>'''
| style="background: #fff;" valign=top | Used to create an [[Paper review box|reviewbox]] to display interesting facts or notable pieces of information about a distinct scientific paper.
| style="background: #fff;padding:0.4em;" | {{reviewbox|title=Sample title|author=Sample authors |keywords=Sample keywords |summary=Sample summary |rating=1 |links=[http://www.iaik.at Sample link] |comment=Sample comment }}
|}

Help:Contents

2010-03-01T07:30:13Z

Administrator:

This is the help page for the IAIK HashLounge äüö#. If you have additional questions please send a mail to the WIKI - Admin <wiki@iaik.tugraz.at>.
This page shows the basic commands of editing the IAIK HashLounge WIKI. The information on this help page is taken from the help page of [http://www.mediawiki.org Mediawiki] and modified to reflect only the necessary information. Additional information and documentation can be found at [http://www.mediawiki.org/ Mediawiki]

=== Organizing your writing -- sections, paragraphs, lists and lines ===
{| border="1" cellpadding="2" cellspacing="0"
|-
!What it looks like
!What you type
|-
|

 New section 

 Subsection

 Sub-subsection
|<pre><nowiki>

== New section ==

=== Subsection ===

==== Sub-subsection ====
</nowiki></pre>

|-
|
A single
newline
has no
effect on the
layout.

But an empty line
starts a new paragraph,
or ends a list or indented part.
|<pre><nowiki>

A single
newline
has no
effect on the
layout.

But an empty line
starts a new paragraph.</nowiki></pre>
|-
|You can break lines 
without starting a new paragraph.
|<pre><nowiki>You can break lines 
without starting a new paragraph.</nowiki></pre>
|-
|
* Unordered lists are easy to do:
** start every line with a star
*** more stars means deeper levels
*A newline
*in a list
marks the end of the list.
*Of course
*you can
*start again.

|<pre><nowiki>* Unordered lists are easy to do:
** start every line with a star
*** more stars means deeper levels
*A newline
*in a list
marks the end of the list.
*Of course
*you can
*start again.

</nowiki></pre>
|-
|
# Numbered lists are also good
## very organized
## easy to follow
#A newline
#in a list
marks the end of the list.
#New numbering starts
#with 1.

|<pre><nowiki># Numbered lists are also good
## very organized
## easy to follow
#A newline
#in a list
marks the end of the list.
#New numbering starts
#with 1.
</nowiki></pre>
|-
|
* You can even do mixed lists
*# and nest them
*#* or break lines in lists
|<pre><nowiki>* You can even do mixed lists
*# and nest them
*#* or break lines in lists</nowiki></pre>
|-
|
; word : definition of the word
; longer phrase
: phrase defined
|<pre><nowiki>; word : definition of the word
; longer phrase
: phrase defined</nowiki></pre>
|-
|
;indenting
:A colon indents a line or paragraph.
A manual newline starts a new paragraph.
|<pre><nowiki>: A colon indents a line or paragraph.
A manual newline starts a new paragraph.
</nowiki></pre>
|-
|
When there is a need for separating a block of text
<blockquote>
the '''blockquote''' command will indent both margins when needed instead of the left margin only as the colon does.
</blockquote>
|
<pre><nowiki>
<blockquote>
The '''blockquote''' command will indent
both margins when needed instead of the
left margin only as the colon does.
</blockquote>
</nowiki></pre>
|-
|<center>Centered text.</center>
|<pre><nowiki><center>Centered text.</center></nowiki></pre>
|-
|A horizontal dividing line:
this is above it...
----
...and this is below it.
|<pre><nowiki>A horizontal dividing line:
this is above it...
----
...and this is below it.
</nowiki></pre>
|-
|You can also provide a file download like this. Download the [[media:file.pdf | file]]. Currently there are not all file extensions supported by the WIKI. So if you encounter a file extension which is not allowed contact the system administrator. Some of the supported file extensions: pdf,zip,rar,exe,com.
|<pre><nowiki>[[media:file.pdf | alternative name]]</nowiki></pre>
|}

== Templates ==

{| cellspacing="1" cellpadding="2" style="background: #99f; color: #000;"
|-
! style="background: #fff;" | Wiki Markup
! style="background: #fff;" width="25%" | Purpose
! style="background: #fff;" | Template Display
|-
| style="white-space:nowrap;background: #fff;" align="center" valign=top | '''<nowiki>
{{reviewbox|title=*|author=*|keywords=*|summary=*|links=*|comment=*
|rating=0 (worst) - 5 (best)}}</nowiki>'''
| style="background: #fff;" valign=top | Used to create an [[Paper review box|reviewbox]] to display interesting facts or notable pieces of information about a distinct scientific paper.
| style="background: #fff;padding:0.4em;" | {{reviewbox|title=Sample title|author=Sample authors |keywords=Sample keywords |summary=Sample summary |rating=1 |links=[http://www.iaik.at Sample link] |comment=Sample comment }}
|}

MediaWiki:Passwordremindertext

2009-03-26T14:11:31Z

Administrator:

MediaWiki:Sidebar

2008-11-03T08:20:41Z

Administrator:

2006-11-21T08:13:15Z

Administrator:

MediaWiki:Confirmemail body

2006-11-21T07:27:02Z

Administrator:

Someone, probably you from IP address $1, has registered an
account "$2" with this e-mail address on {{SITENAME}}.

To confirm that this account really does belong to you and activate
e-mail features on {{SITENAME}}, open this link in your browser:

$3

If this is *not* you, don't follow the link. This confirmation code
will expire at $4.

'''Dear STVL User'''

We only entered data about SHA-1 to demonstrate our idea on the website.
Feel free to send us any comments and suggestions ([mailto:ehash@iaik.tugraz.at eHash]) and also feel free to add/remove/change content.

Note: Please do not 'unrestrict' any pages you are working on. Unrestricting a page means that everybody (also people that are not logged in) can see the content. This is not what we want at the moment.

Thank you for your cooperation!

eHash

MediaWiki:Confirmemail body

2006-11-21T07:23:09Z

Administrator:

Someone, probably you from IP address $1, has registered an
account "$2" with this e-mail address on {{SITENAME}}.

To confirm that this account really does belong to you and activate
e-mail features on {{SITENAME}}, open this link in your browser:

$3

If this is *not* you, don't follow the link. This confirmation code
will expire at $4.

'''Dear STVL User'''

To show our idea we entered some data on SHA-1.
Feel free to send us any comments and suggestions ([mailto:ehash@iaik.tugraz.at eHash]).

Note: Please do not 'unrestrict' any pages you are working on. Unrestricting a page means that everybody (also people that are not logged in) can see the content. This is not what we want at the moment.

Thank you for your cooperation!

eHash

MediaWiki:Confirmemail body

2006-11-21T07:19:59Z

Administrator:

Someone, probably you from IP address $1, has registered an
account "$2" with this e-mail address on {{SITENAME}}.

To confirm that this account really does belong to you and activate
e-mail features on {{SITENAME}}, open this link in your browser:

$3

If this is *not* you, don't follow the link. This confirmation code
will expire at $4.

'''DEAR STVL user:'''

To show our idea we entered some data on SHA-1.
Feel free to send us any comments and suggestions.

Note: Please do not 'unrestrict' any pages you are working on. Unrestricting a page means that everybody (also people that are not logged in) can see the content. This is not what we want at the moment.

Thank you for your cooperation!

eHash

MediaWiki:Confirmemail body

2006-11-21T07:19:20Z

Administrator:

Someone, probably you from IP address $1, has registered an
account "$2" with this e-mail address on {{SITENAME}}.

To confirm that this account really does belong to you and activate
e-mail features on {{SITENAME}}, open this link in your browser:

$3

If this is *not* you, don't follow the link. This confirmation code
will expire at $4.

'''DEAR STVL user:'''

To show our idea we entered some data on SHA-1.
Feel free to send us any comments and suggestions.

Note: Please do not 'unrestrict' any pages you are working on. Unrestricting a page means that everybody (also not logged in people) can see the content. This is not what we want at the moment.

Thank you for your cooperation!

eHash

MediaWiki:Confirmemail body

2006-11-20T15:20:18Z

Administrator:

MediaWiki:Confirmemail body

2006-11-20T14:53:40Z

Administrator:

The eHash Main Page

2006-11-15T10:33:38Z

Administrator: Main Page moved to The eHash Main Page: rename

== List of Hash Functions ==

On this page you can find a collection of existing hash functions.

[http://mediawiki.iaik.tugraz.at/index.php/HashFunctions Collection of Cryptographic Hash Functions]

== Notation and Definition ==

== Generic Attacks on Hash Functions ==

=== Birthday Attack & Generalized Birthday Attack ===
=== ... ===

== Some How Tos ==

[http://mediawiki.iaik.tugraz.at/index.php/HowTo Some hints how to work with math environments and bibtex]

== Getting started ==

* [http://www.mediawiki.org/wiki/Help:FAQ MediaWiki FAQ]
* [http://mail.wikipedia.org/mailman/listinfo/mediawiki-announce MediaWiki release mailing list]

----
ECRYPT is a Network of Excellence within the Information Societies Technology (IST) Programme of the European Commission. The information on this web site is provided as is, and no guarantee or warranty is given or implied that the information is fit for any particular purpose. The user thereof uses the information at his or her sole risk and liability.
----

Main Page

2006-11-15T10:33:38Z

Administrator: Main Page moved to The eHash Main Page: rename

#REDIRECT [[The eHash Main Page]]

MediaWiki:Mainpage

2006-11-15T10:33:07Z

Administrator:

The eHash Main Page

SHA-1

2006-10-11T13:58:15Z

Administrator: /* State Update Transformation */

== General Description ==
SHA-1 is an iterated hash function.

=== Compression Function ===
The compression function takes as input a 512-bit message block and a 160-bit chaining variable, and produces a 160-bit chaining value. The compression function is described as follows:

==== Message Expansion ====

==== State Update Transformation ====
<amsmath>
\begin{aligned}
A_{i+1} &= A_i \lll 5 + W_i + f(B_i,C_i,D_i) + K_i\\
B_{i+1} &= A_i\\
\end{aligned}
</amsmath>

<math>
C_{i+1} = B_i >> 2
</math>

<math>
D_{i+1} = C_i
</math>

<math>
E_{i+1} = D_i
</math>

=== Padding Method ===
=== Initial Value and Constants ===

<amsmath>
K_i = \texttt{0x5A827999} \quad \text{for $i=\phantom{0}0,\dots,19$}
</amsmath>

== Claimed Security Margins ==

== Security Anaylsis ==

* Best know attack: <math>2^{63}</math> by Wang et.al.
* Best known collision example: 64-step collision by De Canniere and Rechberger

something like: best know attack to date: kind of attack, which variant has been looked at (e.g. round-reduced), complexity, and reference to paper and abstract.

may be make here a new page with the other cryptanalysis results.

* [http://mediawiki.iaik.tugraz.at/index.php/SHA-1CryptAnalysis [Detailed overview of cryptanalysis results]]