License: Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2008.1365
URN: urn:nbn:de:0030-drops-13652
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1365/
Go to the corresponding LIPIcs Volume Portal

Kojevnikov, Arist ; Nikolenko, Sergey I.

New Combinatorial Complete One-Way Functions

pdf-format:
22011.KojevnikovArist.Paper.1365.pdf (0.1 MB)

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.


BibTeX - Entry

@InProceedings{kojevnikov_et_al:LIPIcs:2008:1365,
  author =	{Arist Kojevnikov and Sergey I. Nikolenko},
  title =	{{New Combinatorial Complete One-Way Functions}},
  booktitle =	{25th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{457--466},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-06-4},
  ISSN =	{1868-8969},
  year =	{2008},
  volume =	{1},
  editor =	{Susanne Albers and Pascal Weil},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2008/1365},
  URN =		{urn:nbn:de:0030-drops-13652},
  doi =		{10.4230/LIPIcs.STACS.2008.1365},
  annote =	{Keywords: }
}

Collection: 25th International Symposium on Theoretical Aspects of Computer Science
Issue Date: 2008
Date of publication: 06.02.2008

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI