Pseudorandom Strings from Pseudorandom Quantum States. (arXiv:2306.05613v1 [quant-ph])

A fundamental result in classical cryptography is that pseudorandom
generators are equivalent to one-way functions and in fact implied by nearly
every classical cryptographic primitive requiring computational assumptions. In
this work, we consider a variant of pseudorandom generators called quantum
pseudorandom generators (QPRGs), which are quantum algorithms that
(pseudo)deterministically map short random seeds to long pseudorandom strings.
We provide evidence that QPRGs can be as useful as PRGs by providing
cryptographic applications of QPRGs such as commitments and encryption schemes. …

algorithms called computational cryptography fact functions map quantum quantum algorithms random result states strings work