Talk:Security of cryptographic hash functions: Difference between revisions

Content deleted Content added
IQAndreas (talk | contribs)
NoahSD (talk | contribs)
PSPACE-complete?!: new section
Line 38:
 
[[User:IQAndreas|IQAndreas]] ([[User talk:IQAndreas|talk]]) 03:05, 9 July 2016 (UTC)
 
== PSPACE-complete?! ==
 
The text says that finding a collision in a particular hash function "is supposed to be hard, at least PSPACE-complete." But, this can't be true unless NP = PSPACE, since finding a collision is trivially in NP. Right?!