Define G(s):= s||s where || denotes concatenation. Describe and analyze an attack showing that G is not a pseudorandom generator.
Added by Patricia C.
Step 1
Let's think step by step. Show more…
Show all steps
Your feedback will help us improve your experience
Adi S and 91 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Let G be a pseudorandom generator with an expansion factor l(n) > 2n. In each of the following cases, say whether G' is necessarily a pseudorandom generator. If yes, give a proof; if not, show a counterexample. (a) Define G'(s) = G(s1...s[n/2]), where s = s1...sn. (b) Define G'(s) = G(0|s|||s). (c) Define G'(s) = G(s) || G(s + 1).
Adi S.
Let H be a Merkle-Damgard hash function and suppose that a keyed HMAC function is defined by H(k || m). Why is this insecure? Provide the mathematical details.
Akash M.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD