Log In Sign Up

On One-way Functions and Kolmogorov Complexity

by   Yanyi Liu, et al.

We prove that the equivalence of two fundamental problems in the theory of computing. For every polynomial t(n)≥ (1+ε)n, ε>0, the following are equivalent: - One-way functions exists (which in turn is equivalent to the existence of secure private-key encryption schemes, digital signatures, pseudorandom generators, pseudorandom functions, commitment schemes, and more); - t-time bounded Kolmogorov Complexity, K^t, is mildly hard-on-average (i.e., there exists a polynomial p(n)>0 such that no PPT algorithm can compute K^t, for more than a 1-1/p(n) fraction of n-bit strings). In doing so, we present the first natural, and well-studied, computational problem characterizing the feasibility of the central private-key primitives and protocols in Cryptography.


page 1

page 2

page 3

page 4


One-Wayness in Quantum Cryptography

The existence of one-way functions is one of the most fundamental assump...

Block encryption of quantum messages

In modern cryptography, block encryption is a fundamental cryptographic ...

Black-Hole Radiation Decoding is Quantum Cryptography

We propose to study equivalence relations between phenomena in high-ener...

RSA+: An algorithm at least as secure as RSA

The RSA algorithm has been around for nearly five decades and remains on...

Cryptography from Pseudorandom Quantum States

Pseudorandom states, introduced by Ji, Liu and Song (Crypto'18), are eff...

Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms

We study the problems of testing isomorphism of polynomials, algebras, a...

Computational Limitations in Robust Classification and Win-Win Results

We continue the study of computational limitations in learning robust cl...