Score:0

Double length inefficient PRG

ne flag

Is there a known example of a deterministic algorithm that given an n-bit input returns 2n-bit output, and where a random output can't be efficiently distinguished from a random 2n bit string?

phantomcraft avatar
pf flag
Deterministic? I don't know, but see MeshHash2: https://eprint.iacr.org/2009/232 -- See page 15
cn flag
So you're looking for literally any length doubling 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.