Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

5

CORR
2008
Springer

favoriteEmaildiscussreport

109views Education» more CORR 2008»

New Combinatorial Complete One-Way Functions

13 years 4 months ago

New Combinatorial Complete One-Way Functions

Download logic.pdmi.ras.ru

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.

Arist Kojevnikov, Sergey I. Nikolenko

Real-time Traffic

Complete One-way Function | CORR 2008 | Education | One-way Function | Post Correspondence Problem |

claim paper

Related Content

» Combinatorial sketching for finite programs

» A new pooling strategy for highthroughput screening the Shifted Transversal Design

» Developing Morphological Building Blocks From Design to Implementation

» Rule 110 universality and catenations

» Satisfiability and Computing van der Waerden Numbers

» Approximate Labeling via Graph Cuts Based on Linear Programming

» Effective pvalue computations using Finite Markov Chain Imbedding FMCI application to loca...

» InduceStatements and InduceExpressions Constructs for Inductive Programming

» Design layout and verification of an FPGA using automated tools

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Arist Kojevnikov, Sergey I. Nikolenko

Comments (0)