All Questions
Tagged with polynomial pseudo-random-generator
1 question
2
votes
0
answers
62
views
Inefficient double-lengthening PRG
I'm trying to prove that an inefficient double-lengthening PRG exists, i.e. construct a PRG $G: \{0,1\}^n \rightarrow \{0,1\}^{2n}$
My current approach is to bound the number of poly-time non-uniform ...