On one-way functions and the average time complexity of almost-optimal compression

We show that one-way functions exist if and only if there exists an efficient distribution relative to which almost-optimal compression is hard on average. The result is obtained by combining a theorem of Ilango, Ren, and Santhanam and one by Bauwens and Zimand.

Bibliographische Detailangaben

1. Verfasser:	Zimand, Marius
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Complexity
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!