Revision as of 18:17, 9 January 2019 edit NoahSD (talk \| contribs) 40 edits →PSPACE-complete?!: new section ← Previous edit		Revision as of 18:18, 9 January 2019 edit undo SineBot (talk \| contribs) Bots 2,564,740 edits m Signing comment by NoahSD - "→PSPACE-complete?!: new section" Next edit →
Line 41: == 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?! <!-- Template:Unsigned --><small class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[User:NoahSD\|NoahSD]] ([[User talk:NoahSD#top\|talk]] • [[Special:Contributions/NoahSD\|contribs]]) 18:17, 9 January 2019 (UTC)</small> <!--Autosigned by SineBot-->

Talk:Security of cryptographic hash functions: Difference between revisions