About set-theoretic properties of one-way functions
Anatoly D. Plotnikov
TL;DR
This paper explores the set-theoretic properties of one-way functions within the context of NP problems, introducing a new class UF and analyzing the cryptanalytic implications.
Contribution
It defines the class UF for problems with polynomial-time feasible solution construction and examines properties of NP problems that may be one-way functions.
Findings
Introduction of the UF class for polynomial-time feasible solutions
Analysis of NP problems that could be one-way functions
Insights into the cryptanalytic complexity of one-way functions
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Cryptographic Implementations and Security