New Combinatorial Complete One-Way Functions

Simple item page
dc.creatorKojevnikov, Arist
dc.creatorNikolenko, Sergey I.
dc.date2008-02-20
dc.date.accessioned2026-07-07T09:22:04Z
dc.date.available2026-07-07T09:22:04Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/0802.2863
dc.identifierhttp://arxiv.org/abs/0802.2863
dc.identifierDans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, Bordeaux : France (2008)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/155247
dc.subjectComputational Complexity
dc.subjectCryptography and Security
dc.titleNew Combinatorial Complete One-Way Functions
dc.typetext

Files

Collections

arXiv