5 citations · 9 across the 2 of their papers we have counts for
2 papers
cs.CR2023★ 4 cited
On the Computational Hardness of Quantum One-Wayness
Bruno Cavalar, Eli Goldin, Matthew Gray +3
There is a large body of work studying what forms of computational hardness are needed to realize classical cryptography. In particular, one-way functions and pseudorandom generato…
cs.CC2020★ 5 cited
On One-way Functions and Kolmogorov Complexity
Yanyi Liu, Rafael Pass
We prove that the equivalence of two fundamental problems in the theory of computing. For every polynomial , the following are equivalent:…