Difference between revisions of "Tangle"
From The ECRYPT Hash Function Website
m (→The algorithm) |
m |
||
| (6 intermediate revisions by 2 users not shown) | |||
| Line 17: | Line 17: | ||
} | } | ||
</bibtex> | </bibtex> | ||
| + | |||
== 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 | ||
| + | |- | ||
| + | | | observation || || || || || || [http://ehash.iaik.tugraz.at/uploads/c/c9/Tangle_Observation.pdf Esmaeili] | ||
| + | |- | ||
| + | | style="background:red" | collision || hash || all || || example, 2<sup>13</sup> - 2<sup>28</sup> || - || [http://www2.mat.dtu.dk/people/S.Thomsen/tangle/tangle-coll.pdf Thomsen] | ||
| + | |- | ||
| + | |} | ||
| + | |||
| + | A description of this table is given [http://ehash.iaik.tugraz.at/wiki/Cryptanalysis_Categories#Individual_Hash_Function_Tables here]. | ||
| + | |||
| + | |||
| + | <bibtex> | ||
| + | @misc{tangleSalehani08, | ||
| + | author = {Yaser Esmaeili Salehani}, | ||
| + | title = {Some observations on Tangle}, | ||
| + | url = {http://ehash.iaik.tugraz.at/uploads/c/c9/Tangle_Observation.pdf}, | ||
| + | howpublished = {Available online}, | ||
| + | year = {2008}, | ||
| + | } | ||
| + | </bibtex> | ||
| + | |||
| + | <bibtex> | ||
| + | @misc{Thomsen-tangle-coll, | ||
| + | author = {Søren S. Thomsen}, | ||
| + | title = {Untangled}, | ||
| + | url = {http://www2.mat.dtu.dk/people/S.Thomsen/tangle/tangle-coll.pdf}, | ||
| + | howpublished = {Available online}, | ||
| + | year = {2008}, | ||
| + | abstract = {We describe a collision attack on all variants of the SHA-3 candidate Tangle. Practical collisions have been found, and memory requirements are negligible. The time complexity of the attack ranges from a few seconds (equivalent to 2^13-2^19 compression function evaluations) for all except the longest variant, to several minutes, or about 2^28 compression function evaluations for the longest (1024-bit) variant.} | ||
| + | } | ||
| + | </bibtex> | ||
Latest revision as of 21:50, 29 December 2008
1 The algorithm
- Author(s): Rafael Alvarez, Gary McGuire and Antonio Zamora
- NIST submission package: Tangle.zip
Rafael Alvarez, Gary McGuire, Antonio Zamora - The Tangle Hash Function
- ,2008
- http://ehash.iaik.tugraz.at/uploads/4/40/Tangle.pdf
BibtexAuthor : Rafael Alvarez, Gary McGuire, Antonio Zamora
Title : The Tangle Hash Function
In : -
Address :
Date : 2008
2 Cryptanalysis
| Type of Analysis | Hash Function Part | Hash Size (n) | Parameters/Variants | Compression Function Calls | Memory Requirements | Reference |
| observation | Esmaeili | |||||
| collision | hash | all | example, 213 - 228 | - | Thomsen |
A description of this table is given here.
Yaser Esmaeili Salehani - Some observations on Tangle
- ,2008
- http://ehash.iaik.tugraz.at/uploads/c/c9/Tangle_Observation.pdf
BibtexAuthor : Yaser Esmaeili Salehani
Title : Some observations on Tangle
In : -
Address :
Date : 2008
Søren S. Thomsen - Untangled
