Computer Science – Computational Complexity
Scientific paper
2011-10-14
Computer Science
Computational Complexity
5 pages
Scientific paper
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.
No associations
LandOfFree
About set-theoretic properties of one-way functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with About set-theoretic properties of one-way functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and About set-theoretic properties of one-way functions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-522566