Question

Let G be a pseudorandom generator that maps n-bit inputs to (n+1)-bit outputs, and define G (81, ..., Sn) = G(81, ..., Sn)||

0 0
Add a comment Improve this question Transcribed image text
Answer #1

The requirements for a pseudorandom generator is basically that you should generate random numbers, which has no relationship with its meaning or actually can be derived from the seed without generator i.e it should have a avalanche effect in its construction.

Here the result will have G which is pseudo random number generator and even if we add one extra bit at the end it wouldn't make any difference.

So yes, even if we add just one bit changes anything in it the total will change drastically so yes.

This also tells us that we can generate our own random generator from a existing one, or by mixing two .

Hope it helps

Add a comment
Know the answer?
Add Answer to:
Let G be a pseudorandom generator that maps n-bit inputs to (n+1)-bit outputs, and define G'...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT