A permutation of ℕ that is computable in polynomial time, but such that no provably (in ZFC) total recursive function computes its inverse.
-
-
Ah, gotcha.
-
Actually, can prob make avg case hard too, in that no provably total recursive function agrees w/ f^-1 on non-negligible fraction of inputs.
-
Important difference is that in definition of one-way function f, function to find x from f(x) also given length(x) in unary as parameter.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.