# Foundations of Cryptography | NPTEL | Week 2 Assignment Solutions

This set of MCQ(multiple choice questions) focuses on the Foundations of Cryptography NPTEL Week 2 Assignment Solutions.

NOTE: You can check your answer immediately by clicking show answer button. Moreover, this set of “Foundations of Cryptography NPTEL Week 2 Assignment Solution” contains 05 questions.

Now, start attempting the quiz.

### Foundations of Cryptography NPTEL Week 2 Assignment Solutions

Q1. Let G be a secure PRG. Then which of the following is not a secure PRG?

Q2. Which of the following is(are) true about PRG?

a) A PRG is a deterministic algorithm
b) A PRG is a randomized algorithm
c) We can construct a PRG, which is secure against a computationally unbounded adversary
d) A computationally unbounded adversary can always determine the seed of a secure PRG, by seeing the output of the PRG

Q3. Select the incorrect statement(s):

a) While using a PRG, same key can be used for every instance of encryption
b) If G(s) is a secure PRG, then G1 (s) ≝ G(s) || G(s+2) is also a secure PRG

Q4. Let G:{0,1}m => {0,1}n be a secure PRG. Then which of the following is/are false?

Q5.

a) Function G is a PRG
b) Function G is a true random number generator
c) Function G is not a PRG

Foundations of Cryptography NPTEL Week 2 Assignment Solutions

<< Prev- Foundations of Cryptography NPTEL Week 1 Solutions

>> Next- Foundations of Cryptography NPTEL Week 3 Solutions

The above question set contains all the correct answers. But in any case, you find any typographical, grammatical or any other error in our site then kindly inform us. Don’t forget to provide the appropriate URL along with error description. So that we can easily correct it.

1. 