The Tale of One-way Functions
Leonid A. Levin
Abstract
The existence of one-way functions is arguably the most important problem in computer theory. The article discusses and refines a number of concepts relevant to this problem. For instance, it gives the first combinatorial complete owf, i.e., a function which is one-way if any function is. There are surprisingly many subtleties in basic definitions. Some of these subtleties are discussed or hinted at in the literature and some are overlooked. Here, a unified approach is attempted.
Create a lesson
Related papers
Integrated Identity Protection for Semantic Communications in Embodied IoT Systems
Yu Zhang, JingQi Liu, Shuangrui Zhao et al.
Signed, Sealed, Leaked: Trust Beyond Signature for MCP Toolchains
Yichiet Aun, Mohammed A. Alhartomi, Jing Jie Tan et al.
Signed but Steerable: Measuring and Closing the Text-Vector Integrity Gap in Offline Retrieval-Augmented Generation
Georgios Feretzakis, Alexandros Papaspyridis
Towards Early Warning of Real-World Vulnerabilities: An Evidence-Aware Decoupled Method for CVSS Vector Prediction Based on Unstructured Disclosures
Jianhong Ma, Wenhao Li, Xixing Li et al.
Shoot on (Core)Sight: Re-enabling Secure Debug on the RP2350 with Photon-Emission Microscopy and Laser Fault Injection
Antoine Plin
CoRTeC: A Differentially Private Release for Synthetic Tabular Data, Decodable by Any Generator
Calister Nnona