Score:2

Deterministically secure PRG from deterministically secure OWF

bd flag

Consider the construction of "A Pseudorandom Generator from any One-way Function" [HILL99] in Hastad et al.

One way to proof pseudorandomness of this construction is by contradiction. That is, an assumed PRG distinguisher is transformed into a OWF inverter (usually through an intermediate notion called pseudoentropy generator). There is both a uniform and a non-uniform version, considering uniform resp. non-uniform distinguishers/inverters. However, in all proofs of the uniform version that I have seen the PRG distinguisher and the OWF inverter are randomized.

Is it (im-)possible to convert a deterministic (uniform) PRG distinguisher into a deterministic (uniform) OWF inverter?

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.