Difference between revisions of "Tangle"
From The ECRYPT Hash Function Website
(Added cryptanalytic result on Tangle) |
m |
||
| Line 27: | Line 27: | ||
howpublished = {Available online}, | howpublished = {Available online}, | ||
year = {2008}, | 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> | </bibtex> | ||
Revision as of 19:23, 16 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
Søren S. Thomsen - Untangled
