New Combinatorial Complete One-Way Functions

Details New Combinatorial Complete One-Way Functions New Combinatorial Complete One-Way Functions

2008-02-20

arxiv.org/abs/0802.2863v1

Dans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, Bordeaux : France (

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

New Combinatorial Complete One-Way Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with New Combinatorial Complete One-Way Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Combinatorial Complete One-Way Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-647871