Question: Let G be a pseudorandom generator with length function l (n) = n + 1. Define a new function H by the rule H(rx) =
Let G be a pseudorandom generator with length function l(n) = n + 1. Define a new function H by the rule
H(rx) = r G(x),
where |r| = 4. Thus H just passes the first 4 bits of its input through untouched and applies G to the last n 4 bits. Prove with a full reduction that H is a PRG. (You can ignore the behavior of H on inputs of length less than 4.0
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
