New Combinatorial Complete One-Way Functions

Authors Arist Kojevnikov, Sergey I. Nikolenko

Thumbnail PDF


  • Filesize: 151 kB
  • 10 pages

Document Identifiers

Author Details

Arist Kojevnikov
Sergey I. Nikolenko

Cite AsGet BibTex

Arist Kojevnikov and Sergey I. Nikolenko. New Combinatorial Complete One-Way Functions. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 457-466, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


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.


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads