Difference between revisions of "SHAvite-3"
From The ECRYPT Hash Function Website
(Peyrin's chosen-salt, chosen-counter, pseudo-collision on SHAvite-3) |
m (added cryptanalysis table) |
||
| Line 19: | Line 19: | ||
== Cryptanalysis == | == Cryptanalysis == | ||
| + | |||
| + | {| 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 | ||
| + | |- | ||
| + | | | pseudo-collision || compression || all || || || || [http://ehash.iaik.tugraz.at/uploads/e/ea/Peyrin-SHAvite-3.txt Peyrin] | ||
| + | |- | ||
| + | |} | ||
| + | |||
| + | A description of this table is given [http://ehash.iaik.tugraz.at/wiki/Cryptanalysis_Categories#Individual_Hash_Function_Tables here]. | ||
| + | |||
<bibtex> | <bibtex> | ||
Revision as of 10:53, 21 January 2009
1 The algorithm
- Author(s): Eli Biham and Orr Dunkelman
- NIST submission package: SHAvite-3.zip
Eli Biham, Orr Dunkelman - The SHAvite-3 Hash Function
- ,2008
- http://ehash.iaik.tugraz.at/uploads/f/f5/Shavite.pdf
BibtexAuthor : Eli Biham, Orr Dunkelman
Title : The SHAvite-3 Hash Function
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 | Peyrin |
A description of this table is given here.
Thomas Peyrin - Chosen-salt, chosen-counter, pseudo-collision on SHAvite-3 compression function
