Difference between revisions of "Twister"

From The ECRYPT Hash Function Website
m (Cryptanalysis)
m
 
(6 intermediate revisions by 2 users not shown)
Line 23: Line 23:
 
|    Type of Analysis || Hash Function Part || Hash Size (n) || Parameters/Variants || Compression Function Calls || Memory Requirements ||  Reference  
 
|    Type of Analysis || Hash Function Part || Hash Size (n) || Parameters/Variants || Compression Function Calls || Memory Requirements ||  Reference  
 
|-                                         
 
|-                                         
|  | pseudo-collision || compression || all ||  || 2<sup>26.5</sup> || 2<sup>28</sup> || [http://ehash.iaik.tugraz.at/uploads/d/dd/Twister_attack.pdf Mendel,Rechberger,Schläffer]
+
|  | pseudo-collision || compression || all ||  || 2<sup>8</sup> || - || [http://online.tu-graz.ac.at/tug_online/voe_main2.getVollText?pDocumentNr=104903 Mendel,Rechberger,Schläffer]
 
|-                     
 
|-                     
| style="background:greenyellow" | collision || hash || 512 ||  || 2<sup>252</sup> || - || [http://ehash.iaik.tugraz.at/uploads/d/dd/Twister_attack.pdf Mendel,Rechberger,Schläffer]
+
| style="background:greenyellow" | collision || hash || 512 ||  || 2<sup>252</sup> || 2<sup>9</sup> || [http://online.tu-graz.ac.at/tug_online/voe_main2.getVollText?pDocumentNr=104903 Mendel,Rechberger,Schläffer]
 
|-                     
 
|-                     
|  style="background:yellow" | 2nd preimage || hash || 512 ||  || 2<sup>448</sup> || 2<sup>64</sup> || [http://ehash.iaik.tugraz.at/uploads/d/dd/Twister_attack.pdf Mendel,Rechberger,Schläffer]
+
|  style="background:orange" | 2nd preimage || hash || 512 ||  || 2<sup>384+s</sup> || 2<sup>64-s</sup> || [http://online.tu-graz.ac.at/tug_online/voe_main2.getVollText?pDocumentNr=104903 Mendel,Rechberger,Schläffer]
|-                                      
+
|-                   
|}                  
+
|  style="background:orange" | preimage || hash || 512 ||  || 2<sup>456</sup> || 2<sup>10</sup> || [http://online.tu-graz.ac.at/tug_online/voe_main2.getVollText?pDocumentNr=104903 Mendel,Rechberger,Schläffer]
 +
|-
 +
|}
  
 
A description of this table is given [http://ehash.iaik.tugraz.at/wiki/Cryptanalysis_Categories#Individual_Hash_Function_Tables here].
 
A description of this table is given [http://ehash.iaik.tugraz.at/wiki/Cryptanalysis_Categories#Individual_Hash_Function_Tables here].
  
 +
 +
<bibtex>
 +
@misc{acnsMRS09,
 +
  author    = {Florian Mendel and Christian Rechberger and Martin Schläffer},
 +
  title    = {Cryptanalysis of Twister},
 +
  url = {http://online.tu-graz.ac.at/tug_online/voe_main2.getVollText?pDocumentNr=104903},
 +
  howpublished = {In Proceedings of ACNS, Springer},
 +
  year = {2009},
 +
  abstract = {In this paper, we present a semi-free-start collision attack on the compression
 +
function for all Twister variants with negligible complexity. We show how this
 +
compression function attack can be extended to construct collisions for
 +
Twister-512 slightly faster than brute force search. Furthermore, we present a
 +
second-preimage and preimage attack for Twister-512 with complexity of about
 +
$2^{384}$ and $2^{456}$ compression function evaluations, respectively.}
 +
</bibtex>
 +
 +
 +
=== Archive ===
  
 
<bibtex>
 
<bibtex>
Line 41: Line 61:
 
   howpublished = {Available online},
 
   howpublished = {Available online},
 
   year = {2008},
 
   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>
 
</bibtex>

Latest revision as of 10:16, 24 June 2009

1 The algorithm


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

,2008
http://ehash.iaik.tugraz.at/uploads/3/39/Twister.pdf
Bibtex
Author : Ewan Fleischmann, Christian Forler, Michael Gorski
Title : The Twister Hash Function Family
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 28 - Mendel,Rechberger,Schläffer
collision hash 512 2252 29 Mendel,Rechberger,Schläffer
2nd preimage hash 512 2384+s 264-s Mendel,Rechberger,Schläffer
preimage hash 512 2456 210 Mendel,Rechberger,Schläffer

A description of this table is given here.


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

,2009
http://online.tu-graz.ac.at/tug_online/voe_main2.getVollText?pDocumentNr=104903
Bibtex
Author : Florian Mendel, Christian Rechberger, Martin Schläffer
Title : Cryptanalysis of Twister
In : -
Address :
Date : 2009


2.1 Archive

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

,2008
http://ehash.iaik.tugraz.at/uploads/d/dd/Twister_attack.pdf
Bibtex
Author : Florian Mendel, Christian Rechberger, Martin Schläffer
Title : Cryptanalysis of Twister
In : -
Address :
Date : 2008