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

We show that one-way functions exist if and only 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.

Gespeichert in:

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!

container_end_page
container_issue
container_start_page
container_title
container_volume
creator	Zimand, Marius
description	We show that one-way functions exist if and only 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.
doi_str_mv	10.48550/arxiv.2412.03392
format	Article
fullrecord	<record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2412_03392</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2412_03392</sourcerecordid><originalsourceid>FETCH-arxiv_primary_2412_033923</originalsourceid><addsrcrecordid>eNqFjr0KwjAUhbM4iPoATt4XSGybFnQWxU0Q93KptxrIT0libd7eWtydzvCdj3MYW-eZKHdVlW3RD6oXRZkXIpNyX8zZ9WLBWeJvTNC-bBOVswHQ3iE-CbAnjw-CqAxB40ynaVAxgWsBtXEhcteNDPUEPYUw6ks2a1EHWv1ywTan4-1w5tN63flR8Kn-vqinF_J_4wO1ZD3w</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On one-way functions and the average time complexity of almost-optimal compression</title><source>arXiv.org</source><creator>Zimand, Marius</creator><creatorcontrib>Zimand, Marius</creatorcontrib><description>We show that one-way functions exist if and only 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.</description><identifier>DOI: 10.48550/arxiv.2412.03392</identifier><language>eng</language><subject>Computer Science - Computational Complexity</subject><creationdate>2024-12</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2412.03392$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2412.03392$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Zimand, Marius</creatorcontrib><title>On one-way functions and the average time complexity of almost-optimal compression</title><description>We show that one-way functions exist if and only 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.</description><subject>Computer Science - Computational Complexity</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNqFjr0KwjAUhbM4iPoATt4XSGybFnQWxU0Q93KptxrIT0libd7eWtydzvCdj3MYW-eZKHdVlW3RD6oXRZkXIpNyX8zZ9WLBWeJvTNC-bBOVswHQ3iE-CbAnjw-CqAxB40ynaVAxgWsBtXEhcteNDPUEPYUw6ks2a1EHWv1ywTan4-1w5tN63flR8Kn-vqinF_J_4wO1ZD3w</recordid><startdate>20241204</startdate><enddate>20241204</enddate><creator>Zimand, Marius</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20241204</creationdate><title>On one-way functions and the average time complexity of almost-optimal compression</title><author>Zimand, Marius</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-arxiv_primary_2412_033923</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Computer Science - Computational Complexity</topic><toplevel>online_resources</toplevel><creatorcontrib>Zimand, Marius</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Zimand, Marius</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On one-way functions and the average time complexity of almost-optimal compression</atitle><date>2024-12-04</date><risdate>2024</risdate><abstract>We show that one-way functions exist if and only 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.</abstract><doi>10.48550/arxiv.2412.03392</doi><oa>free_for_read</oa></addata></record>
fulltext	fulltext_linktorsrc
identifier	DOI: 10.48550/arxiv.2412.03392
ispartof
issn
language	eng
recordid	cdi_arxiv_primary_2412_03392
source	arXiv.org
subjects	Computer Science - Computational Complexity
title	On one-way functions and the average time complexity of almost-optimal compression
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T05%3A23%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20one-way%20functions%20and%20the%20average%20time%20complexity%20of%20almost-optimal%20compression&rft.au=Zimand,%20Marius&rft.date=2024-12-04&rft_id=info:doi/10.48550/arxiv.2412.03392&rft_dat=%3Carxiv_GOX%3E2412_03392%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true