Functions with this property do not exist in Pessiland, the “worst of all possible worlds” according to Russell Impagliazzo’s (15[2])“five worlds” paper. Miklós Ajtai names a family of functions proposed to have this property based on the short integer solution problem. A theorem that guarantees the existence of a hardcore predicate for every function with this (15[1])property is named for Goldreich and Levin, who also proposed enumerating (15[1])all computable Turing machines to construct a (*) “universal” function with this property. Modular squaring is part of a collection of functions thought (10[1])to have this (-5[1])property (10[1])named for Rabin, whose existence (-5[1])would imply that P (10[1])≠ NP. (10[2])Multiplication has this property if factoring is “hard.” (-5[1])For 10 points, (10[1]-5[1])name this property possessed by functions ubiquitous in cryptography, which are (10[1])easy to compute (10[1])but difficult (-5[1])to invert. ■END■ (0[8])