Difference between revisions of "TIB3"
From The ECRYPT Hash Function Website
m |
Mschlaeffer (talk | contribs) (Pseudo-Collisions and Collisions for TIB3 added) |
||
| Line 19: | Line 19: | ||
== Cryptanalysis == | == Cryptanalysis == | ||
| − | + | {| 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 | ||
| + | |- | ||
| + | | | pseudo-collision || compression || all || || 2<sup>24</sup> || - || [http://ehash.iaik.tugraz.at/uploads/2/2b/Tib3-pseudo.pdf Mendel,Schläffer] | ||
| + | |- | ||
| + | | style="background:greenyellow" | collision || hash || 256 || || 2<sup>122.5</sup> || - || [http://ehash.iaik.tugraz.at/uploads/2/2b/Tib3-pseudo.pdf Mendel,Schläffer] | ||
| + | |- | ||
| + | | style="background:orange" | collision || hash || 512 || || 2<sup>244.5</sup> || - || [http://ehash.iaik.tugraz.at/uploads/2/2b/Tib3-pseudo.pdf Mendel,Schläffer] | ||
| + | |- | ||
| + | |} | ||
| + | |||
| + | A description of this table is given [http://ehash.iaik.tugraz.at/wiki/Cryptanalysis_Categories#Individual_Hash_Function_Tables here]. | ||
| + | |||
| + | |||
| + | <bibtex> | ||
| + | @misc{twisterMRS08, | ||
| + | author = {Florian Mendel and Martin Schläffer}, | ||
| + | title = {On Pseudo-Collisions and Collisions for TIB3}, | ||
| + | url = {http://ehash.iaik.tugraz.at/uploads/2/2b/Tib3-pseudo.pdf}, | ||
| + | howpublished = {Available online}, | ||
| + | year = {2009}, | ||
| + | abstract = {In this paper, we present a pseudo-collision for TIB3 with a complexity of about $2^{32}$ compression function evaluations. By using message modification techniques the complexity can be further reduced. Furthermore, we show how to construct collisions for TIB3 slightly faster than brute force search using the fact that we can construct several (different) pseudo-collisions for the compression function. The complexity to construct collisions is about $2^{122.5}$ for TIB3-256 and $2^{244.5}$ for TIB3-512 with neglible memory requirements. | ||
| + | This attack shows that compression function attacks have been underestimated in the design of TIB3. Although the practicality of the proposed attacks might be debatable, it nevertheless exhibits non-random properties that are not present in the SHA-2 family and opens the possibility for further improved attacks.} | ||
| + | </bibtex> | ||
Revision as of 16:30, 20 January 2009
1 The algorithm
- Author(s): Daniel Penazzi, Miguel Montes
- Website: http://www.famaf.unc.edu.ar/~penazzi/tib3/
- NIST submission package: TIB3.zip
Miguel Montes, Daniel Penazzi - The TIB3 Hash
- ,2008
- http://www.famaf.unc.edu.ar/~penazzi/tib3/submitted/Supporting_Documentation/TIB3_Algorithm_Specification.pdf
BibtexAuthor : Miguel Montes, Daniel Penazzi
Title : The TIB3 Hash
In : -
Address :
Date : 2008
2 Cryptanalysis
| Type of Analysis | Hash Function Part | Hash Size (n) | Parameters/Variants | Compression Function Calls | Memory Requirements | Reference |
| pseudo-collision | compression | all | 224 | - | Mendel,Schläffer | |
| collision | hash | 256 | 2122.5 | - | Mendel,Schläffer | |
| collision | hash | 512 | 2244.5 | - | Mendel,Schläffer |
A description of this table is given here.
Florian Mendel, Martin Schläffer - On Pseudo-Collisions and Collisions for TIB3
