2026-07-24T05:01:55Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1365 2024-03-06T10:33:01Z ddc:004 open_access

New Combinatorial Complete One-Way Functions Kojevnikov, Arist Nikolenko, Sergey I. In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we present two new one-way functions based on semi-Thue string rewriting systems and a version of the Post Correspondence Problem and prove their completeness. Besides, we present an alternative proof of Levin's result. We also discuss the properties a combinatorial problem should have in order to hold a complete one-way function. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Arist Kojevnikov and Sergey I. Nikolenko 2008 Is Part Of LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2008.1365 urn:nbn:de:0030-drops-13652 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1365 eng https://creativecommons.org/licenses/by-nd/3.0/legalcode