Difference between revisions of "Boole"

From The ECRYPT Hash Function Website
m (Cryptanalysis)
 
(20 intermediate revisions by 4 users not shown)
Line 1: Line 1:
 
== The algorithm ==
 
== The algorithm ==
  
* Author(s): Greg Rose
+
* Author(s): Greg G. Rose
 
* Website: [http://seer-grog.net/Boole.html http://seer-grog.net/Boole.html]
 
* Website: [http://seer-grog.net/Boole.html http://seer-grog.net/Boole.html]
* Specification:  
+
* NIST submission package: [http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/BOOLE.zip BOOLE.zip]
 
<!--
 
<!--
 
[http://ehash.iaik.tugraz.at/uploads/3/37/BoolePaper.pdf local link]
 
[http://ehash.iaik.tugraz.at/uploads/3/37/BoolePaper.pdf local link]
 
-->
 
-->
 +
  
 
<bibtex>
 
<bibtex>
Line 17: Line 18:
 
}
 
}
 
</bibtex>
 
</bibtex>
 +
  
 
== Cryptanalysis ==
 
== Cryptanalysis ==
  
* None yet
+
{| 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
 +
|-                   
 +
| style="background:red" | collision || hash || 224,256 ||  || example, 2<sup>34</sup> || - || [http://ehash.iaik.tugraz.at/uploads/0/0b/BooleCollision.txt Mendel,Nad,Schläffer]
 +
|-                   
 +
| style="background:red" | collision || hash || 384,512 ||  || 2<sup>66</sup> || - || [http://ehash.iaik.tugraz.at/uploads/0/0b/BooleCollision.txt Mendel,Nad,Schläffer]
 +
|-                   
 +
| style="background:orange" | preimage || hash || all ||  || 2<sup>9n/16</sup> || - || [http://ehash.iaik.tugraz.at/uploads/2/2f/Boole.pdf Nikolić]
 +
|-                   
 +
|}                   
 +
 
 +
A description of this table is given [http://ehash.iaik.tugraz.at/wiki/Cryptanalysis_Categories#Individual_Hash_Function_Tables here].
 +
 
 +
 
 +
<bibtex>
 +
@misc{booleMNS08,
 +
  author    = {Florian Mendel and Tomislav Nad and Martin Schläffer},
 +
  title    = {Collision Attack on Boole-n},
 +
  url = {http://ehash.iaik.tugraz.at/uploads/0/0b/BooleCollision.txt},
 +
  howpublished = {NIST mailing list (local link)},
 +
  year = {2008},
 +
 
 +
}
 +
</bibtex>
 +
 
 +
<bibtex>
 +
@misc{booleN08,
 +
  author    = {Ivica Nikolić},
 +
  title    = {Preimage attack on Boole-n},
 +
  url        = {http://ehash.iaik.tugraz.at/uploads/2/2f/Boole.pdf},
 +
  howpublished = {Available online},
 +
  year      = {2008},
 +
  abstract  = {Boole is a family of hash functions proposed for SHA-3. In this paper we present a preimage attack on Boole-n that requires $2^{9n/16} computations and negligible memory.},
 +
}
 +
</bibtex>

Latest revision as of 22:00, 29 December 2008

1 The algorithm


Gregory G. Rose - Design and Primitive Specification for Boole

,2008
http://seer-grog.net/BoolePaper.pdf
Bibtex
Author : Gregory G. Rose
Title : Design and Primitive Specification for Boole
In : -
Address :
Date : 2008


2 Cryptanalysis

Type of Analysis Hash Function Part Hash Size (n) Parameters/Variants Compression Function Calls Memory Requirements Reference
collision hash 224,256 example, 234 - Mendel,Nad,Schläffer
collision hash 384,512 266 - Mendel,Nad,Schläffer
preimage hash all 29n/16 - Nikolić

A description of this table is given here.


Florian Mendel, Tomislav Nad, Martin Schläffer - Collision Attack on Boole-n

,2008
http://ehash.iaik.tugraz.at/uploads/0/0b/BooleCollision.txt
Bibtex
Author : Florian Mendel, Tomislav Nad, Martin Schläffer
Title : Collision Attack on Boole-n
In : -
Address :
Date : 2008

Ivica Nikolić - Preimage attack on Boole-n

,2008
http://ehash.iaik.tugraz.at/uploads/2/2f/Boole.pdf
Bibtex
Author : Ivica Nikolić
Title : Preimage attack on Boole-n
In : -
Address :
Date : 2008