Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexity

DOI10.1145/3406325.3451121OpenAlexW3167613576MaRDI QIDQ6087039

Rafael Pass, Yanyi Liu

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3406325.3451121

zbMATH Keywords

Kolmogorov complexityone-way functions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

NP-hardness of approximating meta-complexity: a cryptographic approach

This page was built for publication: Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexity