The Complexity of Collision-Resistant Hashing
Files
No Access Until
Permanent Link(s)
Other Titles
Abstract
A long-standing open problem on the intersection of Complexity Theory and Cryptography is whether the security of cryptographic primitives can be based on the worst-case hardness of NP. We show that, unless coNP
Under an average-case strengthening of the assumption that coNP