Difference between revisions of "Grindahl-256"
From The ECRYPT Hash Function Website
(→Best Known Results) |
|||
| Line 12: | Line 12: | ||
=== Best Known Results === | === Best Known Results === | ||
| + | The best collision attack on Grindahl was published by Peyrin. It has complexity of 2<sup>112</sup> hash evaluations. | ||
---- | ---- | ||
Revision as of 18:38, 10 March 2008
Contents
1 Specification
2 Cryptanalysis
2.1 Best Known Results
The best collision attack on Grindahl was published by Peyrin. It has complexity of 2112 hash evaluations.
2.2 Generic Attacks
2.3 Collision Attacks
Thomas Peyrin - Cryptanalysis of Grindahl
- ASIACRYPT 4833:551-567,2007
- http://dx.doi.org/10.1007/978-3-540-76900-2_34
BibtexAuthor : Thomas Peyrin
Title : Cryptanalysis of Grindahl
In : ASIACRYPT -
Address :
Date : 2007
