One-way function
In computer science, a one-way function is a function that is easy to compute on every input, but hard to invert given the image of a random input. Here, "easy" and "hard" are to be understood in the sense of computational complexity theory, specifically the theory of polynomial time problems. Not being one-to-one is not considered sufficient for a function to be called one-way (see Theoretical definition, below).
One-way function - Wikipedia Jump to content From Wikipedia, the free encyclopedia Function used in computer cryptography Unsolved problem in computer science Do one-way functions exist? More unsolved problems in computer science In computer science , a one-way function is a function that is easy to compute on every input, but hard to invert given the image of a random input. Here, "easy" and "hard" are to be understood in the sense of computational complexity theory , specifically the theory of polynomial time problems. This has nothing to do with whether the function is one-to-one ; finding
Explore this link on the map →related reading
- Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- ZK-Friendly Hash Functions | Zellic — Researchzellic.io
- What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
- P versus NP problem - Wikipediaen.wikipedia.org
- Computational Complexityblog.computationalcomplexity.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Secure multi-party computation - Wikipediaen.wikipedia.org
- Complexity class - Wikipediaen.wikipedia.org
- Pseudorandom permutation - Wikipediaen.wikipedia.org
- Computer Scientists Figure Out How To Prove Lies | Quanta Magazinequantamagazine.org
- What P vs NP is actually about – Vasek Rozhon's blogvasekrozhon.wordpress.com