NPTEL Ethical Hacking Week 6 Assignment Answers 2023

Join Our WhatsApp Group Join Now
Join Us On Telegram Join Now
NPTEL Ethical Hacking Assignment Answers 2023

NPTEL Ethical Hacking Week 6 Assignment Solutions 2023

NPTEL Ethical Hacking Week 6 Assignment Answers 2023

Q1. Which of the following is not an example of active security attack?
a. Masquerade
b. Replay
c. Traffic analysis
d. Modification
e. Denial of Service.

Answer:- c

Q2. Consider the following statements:
(i) In symmetric key cryptography, single shared key is used by sender and receiver.
(ii) In Asymmetric key cryptography, separate keys are used by sender and receiver.
a. Only (i) is true
b. Only (ii) is true
c. Both (i) and (ii) are true.
d. Both (i) and (in) are false.

Answer:- For Answer Click Here

Q3. 15 parties want to exchange messages securely using a symmetric key encryption algorithm. The number of distinct key values required will be __________________

Answer:- 

Q4. Consider a mono-alphabetic cipher with the following key value:
(ABCDIJKLEFGH MNO PUV WXQRST Y Z)
What will be the encrypted form of the message “WIN DO W” ?
a. WENDHW
b. SKNGHS
C. SENDOS
d. None of these.

Answer:- For Answer Click Here

Q5. How many AES rounds are required for 192-bit key size?
a. 10
b. 11
c. 12
d. 14

Answer:- 

Q6. What is the key length in data encryption standard (DES)?
a. 56
b. 64
c. 128
d. 192

Answer:- For Answer Click Here

Q7. 100 parties want to exchange messages securely using some public key encryption technique like RSA. The number of distinct key values required will be _______________

Answer:- 

Q8. In Digital signature sender signs a message with its:
a. Private key
b. Public key

Answer:- For Answer Click Here

Q9. On which difficult mathematical problem does the security of RSA algorithm depend on?
a. Discrete logarithm problem.
b. Testing whether a given number if prime or not.
c. Prime factorization problem.
d. The RSA threshold detection.
e. All of these.

Answer:- 

Q10. Which of the following statements) is/are true for Diffie-Hellman Key Exchange algorithm?
a. It allows group of users to agree on secret key over insecure channel.
b. The security of the algorithm depends on prime factorization problem.
c. The algorithm is vulnerable to man-in-the-middle attack.
d. It does not require any prior communication between sender and receiver.
e. All of these.

Answer:- For Answer Click Here

Leave a comment