Work

Guest Column: On Cryptography and Meta-Complexity

Year: 2025

Type: article

Abstract: Meta-complexity refers to the study of the computational complexity of computing natural complexity measures, such as time-bounded Kolmogorov complexity and the minimal circuit size. Despite decades of interest, important basic questions about these problems remain unresolved. This survey explores some of the recent connections between meta-complexity and cryptography, focusing on how tools from one domain can help solving long-standing questions in the other.

Source: ACM SIGACT News

DOI: 10.1145/3744715.3744722

Authors: Noam Mazor, Rafael Pass

Institutions: Tel Aviv University, Technion – Israel Institute of Technology, Cornell Tech

Language: English

Topic: Cryptography and Data Security

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: National Science Foundation, European Commission, Air Force Office of Scientific Research

Awards: G1523888516, G508219574, G5158369177, SaTC: CORE: Small: On Cryptography and Kolmogorov Complexity