About set-theoretic properties of one-way functions
Computational Complexity
2015-03-19 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1110.3189,
title = {About set-theoretic properties of one-way functions},
author = {Anatoly D. Plotnikov},
journal= {arXiv preprint arXiv:1110.3189},
year = {2015}
}
Comments
5 pages