a)
b)
a)
b)
0)
೩)
0)

0)

111076

PART C
Answer any two full questions, each carries 20 marks.

Explain RSA algorithm with parameters p = 3, ‏بن‎ = 14, € = 7and M = 5.

Give the requirements of a secure password.

What are the advantages of Honey pot?

How does distributed intrusion detection work?

Write note on password protection.

Using Key analogy, explain Public Key Cryptosystem.
Give applications of PKCS.

Discuss the techniques for intrusion detection.

Page 2of 2

Pages: 2

(15)
(5)
(5)
(10)
(5)
(10)
(5)
(5)