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…