Difference between revisions of "Twister"

Revision as of 15:41, 30 December 2008

Ewan Fleischmann, Christian Forler, Michael Gorski - The Twister Hash Function Family

,2008

Author : Ewan Fleischmann, Christian Forler, Michael Gorski
Title : The Twister Hash Function Family
In : -
Address :
Date : 2008

Type of Analysis	Hash Function Part	Hash Size (n)	Parameters/Variants	Compression Function Calls	Memory Requirements	Reference
pseudo-collision	compression	all		2^26.5	2²⁸	Mendel,Rechberger,Schläffer
collision	hash	512		2²⁵²	-	Mendel,Rechberger,Schläffer
2nd preimage	hash	512		2⁴⁴⁸	2⁶⁴	Mendel,Rechberger,Schläffer

A description of this table is given here.

Florian Mendel, Christian Rechberger, Martin Schläffer - Cryptanalysis of Twister

,2008

Author : Florian Mendel, Christian Rechberger, Martin Schläffer
Title : Cryptanalysis of Twister
In : -
Address :
Date : 2008

@@ Line 41: / Line 41: @@
    howpublished = {Available online},
    year = {2008},
-   abstract = {In this paper, we present a pseudo-collision attack on the compression function of all Twister variants (224,256,384,512) with complexity of about 2^26.5 compression function evaluations. Furthermore, we show how the compression function attack can be extended to construct collisions for Twister-512 with a time complexity starting from about 2^231.4 and different time-memory tradeoffs.},
+   abstract = {In this paper, we present a pseudo-collision attack on the compression function of all
+Twister variants (224,256,384,512) with complexity of about 2^26.5 compression function evalua-
+tions. We show how the compression function attack can be extended to construct collisions for
+Twister-512 slightly faster than brute force search. Furthermore, we present a second-preimage at-
+tack for Twister-512 with complexity of about 2^448 compression function evaluations and memory
+requirement of 2^64.
 }
 </bibtex>