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.
Q1. Let G be a secure PRG. Then which of the following is not a secure PRG?
Show Answer
Answer: a), b), c), d)
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
Answer: a), d)
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
Answer: a), b)
Q4. Let G: m => n be a secure PRG. Then which of the following is/are false?
Show Answer
Answer: c), d)
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
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.
Thanks in advance.
For discussion about any question, join the below comment section. And get the solution of your query. Also, try to share your thoughts about the topics covered in this particular quiz.
