Content deleted Content added
No edit summary Tags: Reverted Mobile edit Mobile web edit |
m Reverted edits by 37.239.218.6 (talk) to last version by Caleb Stanford |
||
Line 1:
{{Short description|Function that is easy to compute on every input, but hard to invert given the image of a random input}}
{{unsolved|computer science|Do one-way functions exist?}}
In [[computer
The existence of such one-way functions is still an open [[conjecture]]. Their existence would prove that the [[complexity classes]] [[P = NP problem|P and NP are not equal]], thus resolving the foremost unsolved question of theoretical computer science.<ref name=Goldreich>[[Oded Goldreich]] (
In applied contexts, the terms "easy" and "hard" are usually interpreted relative to some specific computing entity; typically "cheap enough for the legitimate users" and "prohibitively expensive for any [[Black hat hacking|malicious agent]]s". One-way
==Theoretical definition==
|