2. (PRGS) Let G : {0, 1}" → {0, 1}2 be a PRG and let H: {0,1}²n → {0, 1}" be a collision resistant hash function. Argue whether each of the following candidates is or is not a secure PRG.| def (a) G'(x) G(H(x||x)) def (b) G"(x)H(G(x))||H(G(x)) def (c) G" (x)G(x)||H(G(x))

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter2: Systems Of Linear Equations
Section2.4: Applications
Problem 29EQ
icon
Related questions
Question
Please do not rely too much on chatgpt, because its answer may be wrong. Please consider it carefully and give your own answer. You can borrow ideas from gpt, but please do not believe its answer.Very very grateful!Please do not rely too much on chatgpt, because its answer may be wrong. Please consider it carefully and give your own answer. You can borrow ideas from gpt, but please do not believe its answer.
 
Very very grateful!
2. (PRGS) Let G : {0, 1}" → {0, 1}2 be a PRG and let H: {0,1}²n → {0, 1}" be a
collision resistant hash function. Argue whether each of the following candidates
is or is not a secure PRG.|
def
(a) G'(x) G(H(x||x))
def
(b) G"(x)H(G(x))||H(G(x))
def
(c) G" (x)G(x)||H(G(x))
Transcribed Image Text:2. (PRGS) Let G : {0, 1}" → {0, 1}2 be a PRG and let H: {0,1}²n → {0, 1}" be a collision resistant hash function. Argue whether each of the following candidates is or is not a secure PRG.| def (a) G'(x) G(H(x||x)) def (b) G"(x)H(G(x))||H(G(x)) def (c) G" (x)G(x)||H(G(x))
Expert Solution
steps

Step by step

Solved in 1 steps

Blurred answer
Similar questions
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,