New Combinatorial Complete One-Way Functions
Computational Complexity
2008-02-21 v1 Cryptography and Security
Abstract
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.
Cite
@article{arxiv.0802.2863,
title = {New Combinatorial Complete One-Way Functions},
author = {Arist Kojevnikov and Sergey I. Nikolenko},
journal= {arXiv preprint arXiv:0802.2863},
year = {2008}
}