Difference between revisions of "SHAvite-3"
From The ECRYPT Hash Function Website
m (→The algorithm) |
(Peyrin's chosen-salt, chosen-counter, pseudo-collision on SHAvite-3) |
||
Line 20: | Line 20: | ||
== Cryptanalysis == | == Cryptanalysis == | ||
− | + | <bibtex> | |
+ | @misc{Peyrin-SHAvite-3, | ||
+ | author = {Thomas Peyrin}, | ||
+ | title = {Chosen-salt, chosen-counter, pseudo-collision on SHAvite-3 compression function}, | ||
+ | url = {http://ehash.iaik.tugraz.at/uploads/e/ea/Peyrin-SHAvite-3.txt}, | ||
+ | howpublished = {Available online}, | ||
+ | year = {2009}, | ||
+ | } | ||
+ | </bibtex> |
Revision as of 09:58, 20 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
Thomas Peyrin - Chosen-salt, chosen-counter, pseudo-collision on SHAvite-3 compression function