| | A generic hardcore predicate for any one-way function (Site not responding. Last check: 2007-10-10) |
 | | A hard-core predicate of the function f is a polynomial-time computable predicate of x which is hard to approximate from f(x). |
 | | Goldreich with Levin proved that any one-way function of the form f(x,r)=(f'(x),r) has a hard-core predicate (specifically, the inner-product mod~2 of x and r). |
 | | In particular, it yields a very simple construction of a pseudorandom generator based on any one-way permutation and was used (by Hastad, Impagliazzo, Levin and Luby) to construct a pseudorandom generator based on any one-way function. |
| www.wisdom.weizmann.ac.il /~oded/gl.html (262 words) |