About set-theoretic properties of one-way functions
  We investigate the problem of cryptanalysis as a problem belonging to the class NP. A class of problems UF is defined for which the time constructing any feasible solution is polynomial. The properties of the problems of NP, which may be one-way functions, are established. 
Anatoly D. Plotnikov
cs.CC