Question: Let G be a pseudorandom generator that maps n-bit inputs to (n+ 1)-bit outputs, and define G0 (s1, . . . , sn) = G(s1,

Let G be a pseudorandom generator that maps n-bit inputs to (n+ 1)-bit outputs, and define G0 (s1, . . . , sn) = G(s1, . . . , sn)||(s1 s2). Here s1, . . . , sn are the bits of the seed s, and || denotes concatenation. Is G0 a pseudorandom generator

Let F be a pseudorandom function (PRF) that takes an n-bit key and maps n-bit inputs to n-bit outputs. (We will cover pseudorandom functions in class on September 17th.) Which of the following derived PRFs are secure? Justify your answer.

(a) F 1 k (x) = Fk(x)||0

(b) F 2 k (x, y) = Fk(x) Fk(y)

(c) F 3 k1,k2 (x) = Fk1 (x) Fk2 (x)

(d) F 4 k (x) = Fk(x)||Fk(Fk(x))

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!