Difference between revisions of "Ponic"
From The ECRYPT Hash Function Website
m (→Cryptanalysis) |
|||
| Line 26: | Line 26: | ||
howpublished = {Available online}, | howpublished = {Available online}, | ||
year = {2008}, | year = {2008}, | ||
| + | abstract = {Ponic is a candidate to the SHA-3 NIST competition. We present here a second preimage attack against the 512-bit version with time complexity $2^{265}$. The attack exploits the fact that the round function is invertible and it works for any number of rounds.}, | ||
} | } | ||
</bibtex> | </bibtex> | ||
Revision as of 13:16, 1 December 2008
1 The algorithm
- Author(s): Peter Schmidt-Nielsen
- Specification: local link
Peter Schmidt-Nielsen - The Ponic Hash Function
- ,2008
- http://ehash.iaik.tugraz.at/uploads/3/3c/PonicSpecification.pdf
BibtexAuthor : Peter Schmidt-Nielsen
Title : The Ponic Hash Function
In : -
Address :
Date : 2008
2 Cryptanalysis
María Naya-Plasencia - Second preimage attack on Ponic
