On the Computational Hardness of Quantum One-Wayness. (arXiv:2312.08363v2 [cs.CR] UPDATED)

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 generators can be built from each other, and thus require
equivalent computational assumptions to be realized. Furthermore, the existence
of either of these primitives implies that $\rm{P} \neq \rm{NP}$, which gives a
lower bound on the necessary hardness.

One can also define versions of each of these primitives with quantum output:
respectively one-way state generators …

body computational cryptography forms functions large quantum work