| > First off you have a basic problem in definition: You have to specify
| > *one* hash with *one* output size, but NP-completeness has to do with
| > asymptotic behavior. For any hash producing a fixed-size output string,
| > there is a deterministic machine that runs in time O(1) that computes
| What kind of problems do people run into when they try to make
| cryptographic algorithms that reduce to problems of known complexity?
| I'm expecting that the literature is full of such attempts, and one
| could probably spend a lifetime reading up on them, but I have other
| plans and would app
What kind of problems do people run into when they try to make
cryptographic algorithms that reduce to problems of known complexity?
I'm expecting that the literature is full of such attempts, and one
could probably spend a lifetime reading up on them, but I have other
plans and would appreciate a
