# Pseudo random generator that is non injective

I was reading answer to https://crypto.stackexchange.com/questions/24941/prove-there-is-prg-that-is-not-necessarily-one-to-one Here assuming existence of G: from n bit to l(n) bits non injective G' is created from n+1 bits to l(n) bits
I was wondering if it is possible to construct G with domain of n bits instead of n+1.

• Your title is very general. Can you make it more specific to your question? – Yuval Filmus Apr 2 at 13:32
• Given a pseudorandom permutation $G$, try $G'$ which is the same as $G$ except that if $G(x) \in \{0,1\}$ then $G'(x) = 0$. – Yuval Filmus Apr 2 at 13:33
• Please give a self-contained statement of your problem, that doesn't require us to read an external link to understand what question you are asking. – D.W. Apr 2 at 19:41
• @YuvalFilmus can you elaborate more about $G(x)\in \lbrace{0,1 \rbrace}$? I am relatively new to this topic and my thinking was G(x) is l(n) bit and not one bit. – Root Apr 3 at 8:41
• So are my $0,1$. They are two arbitrary $l(n)$ bit strings, say those representing the integers $0$ and $1$. – Yuval Filmus Apr 3 at 11:35