all InfoSec news
Levin–Kolmogorov Complexity is not in Linear Time
May 6, 2024, 6 a.m. |
IACR News www.iacr.org
ePrint Report: Levin–Kolmogorov Complexity is not in Linear Time
Nicholas Brandt
Understanding the computational hardness of Kolmogorov complexity is a central open question in complexity theory.
An important notion is Levin's version of Kolmogorov complexity, Kt, and its decisional variant, MKtP,
due to its connections to universal search, derandomization, and oneway functions, among others.
The question whether MKtP can be computed in polynomial time is particularly interesting because it is not subject to known technical barriers such as algebrization or …
complexity computational connections eprint report functions important linear notion question report search theory understanding version
More from www.iacr.org / IACR News
$\mathsf{FRAST}$: TFHE-friendly Cipher Based on Random S-boxes
2 days, 22 hours ago |
www.iacr.org
A Deniability Analysis of Signal's Initial Handshake PQXDH
2 days, 22 hours ago |
www.iacr.org
BGJ15 Revisited: Sieving with Streamed Memory Access
2 days, 22 hours ago |
www.iacr.org
Quantum Key-Revocable Dual-Regev Encryption, Revisited
2 days, 22 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
Information Security Engineers
@ D. E. Shaw Research | New York City
Technology Security Analyst
@ Halton Region | Oakville, Ontario, Canada
Senior Cyber Security Analyst
@ Valley Water | San Jose, CA
Sr. Staff Firmware Engineer – Networking & Firewall
@ Axiado | Bengaluru, India
Compliance Architect / Product Security Sr. Engineer/Expert (f/m/d)
@ SAP | Walldorf, DE, 69190
SAP Security Administrator
@ FARO Technologies | EMEA-Portugal