Difference between revisions of "Ponic"

From The ECRYPT Hash Function Website
 
m
 
(8 intermediate revisions by 3 users not shown)
Line 2: Line 2:
  
 
* Author(s): Peter Schmidt-Nielsen
 
* Author(s): Peter Schmidt-Nielsen
 +
<!--
 
* Website:   
 
* Website:   
* Specification:  
+
-->
 +
* Source: [http://ehash.iaik.tugraz.at/uploads/6/61/PonicReference.zip submitted to NIST], [http://ehash.iaik.tugraz.at/uploads/2/2e/Ponic-1280.zip improved version]
 +
 
  
 
<bibtex>
 
<bibtex>
@misc{shaSN08,
+
@misc{sha3Schmidt08,
 
   author    = {Peter Schmidt-Nielsen},
 
   author    = {Peter Schmidt-Nielsen},
 
   title    = {The Ponic Hash Function},
 
   title    = {The Ponic Hash Function},
 +
  url        = {http://ehash.iaik.tugraz.at/uploads/3/3c/PonicSpecification.pdf },
 
   howpublished = {Submission to NIST},
 
   howpublished = {Submission to NIST},
 
   year      = {2008},
 
   year      = {2008},
 
}
 
}
 
</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:yellow" | 2nd preimage || hash || 512 ||  || 2<sup>265</sup> || 2<sup>256</sup> || [http://131002.net/data/papers/ponic.pdf Naya-Plasencia]
 +
|-                                     
 +
|}                   
 +
 
 +
A description of this table is given [http://ehash.iaik.tugraz.at/wiki/Cryptanalysis_Categories#Individual_Hash_Function_Tables here].
 +
 
 +
 
 +
<bibtex>
 +
@misc{ponicN08,
 +
  author    = {María Naya-Plasencia},
 +
  title    = {Second preimage attack on Ponic},
 +
  url = {http://131002.net/data/papers/ponic.pdf},
 +
  howpublished = {Available online},
 +
  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>

Latest revision as of 21:59, 29 December 2008

1 The algorithm


Peter Schmidt-Nielsen - The Ponic Hash Function

,2008
http://ehash.iaik.tugraz.at/uploads/3/3c/PonicSpecification.pdf
Bibtex
Author : Peter Schmidt-Nielsen
Title : The Ponic 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
2nd preimage hash 512 2265 2256 Naya-Plasencia

A description of this table is given here.


María Naya-Plasencia - Second preimage attack on Ponic

,2008
http://131002.net/data/papers/ponic.pdf
Bibtex
Author : María Naya-Plasencia
Title : Second preimage attack on Ponic
In : -
Address :
Date : 2008