4. Let G be a pseudorandom generator with expansion factor (n) > 2n. In each of...

 

Transcribed Image Text:

4. Let G be a pseudorandom generator with expansion factor (n) > 2n. In each of the following cases, say whether G' is necessarily a pseudorandom generator and explain why or why not. Here, "|| denotes string concatenation. 1 (a) Define G'(s) = s||s. Describe and formally analyze an attack if G' is not a pseudorandom gener- ator. (b) Define G' (s) G(s1 Sn-2), where s = 8s and si represents the i-th bit of s. (c) Define G'(s) = G(s)||G(s + 1). 4. Let G be a pseudorandom generator with expansion factor (n) > 2n. In each of the following cases, say whether G' is necessarily a pseudorandom generator and explain why or why not. Here, "|| denotes string concatenation. 1 (a) Define G'(s) = s||s. Describe and formally analyze an attack if G' is not a pseudorandom gener- ator. (b) Define G' (s) G(s1 Sn-2), where s = 8s and si represents the i-th bit of s. (c) Define G'(s) = G(s)||G(s + 1).

Answer rating: 100% (QA)

In the following we will formally analyze the given cases to determine if G is necessarily a pseudorandom generator ... View the full answer