Score:0

Constructing a PRG from a pseudorandom function

fi flag

I have recently understood how we can construct a pseudorandom function from a PRG. However, I would like to prove the reverse - how can I construct a PRG from a PRF?

Marc Ilunga avatar
tr flag
This direction is a bit easier. As a hint: think of what is the distribution of a PRF key with a random key and evaluated at $n$ distinct points.
Score:1
in flag

I suggest you go through the section 4.4.4 of the book titled "A Graduate Course in Applied Cryptography" written by Boneh. In this section, the PRG is constructed by this way:

$G(k):=(F(k,x_1),...,F(k,x_l))$

where $G(\cdot)$ is a PRG, and $F(\cdot,\cdot)$ is a PRF.

Therefore, we can prove that: If F is a secure PRF, then the PRG $G$ described above is a secure PRG.

I sit in a Tesla and translated this thread with Ai:

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.