2 MARKS

1. List the characteristics of CIA triangle.

2. Define brute-force attack.
3. Express the role of diffie-hellman key exchange play in the elgamal system.
4. Recall hash in cryptography.
5. List out the applications of SSL.
6. Illustrate the process of SDLC.
7. Interpret masquerade attack.
8. Discuss the reason why the asymmetric cryptography bad for huge data.
9. Illustrate the measures required to protect confidentiality of information?
10. Define field and ring in number theory.
11. List the five modes of operation of block cipher.
12. Define hash in cryptography.
13. Outline the services provided by PGP.
14. Express the critical characteristics of Information.
15. State fermat's little theorem.
16. State the difference between private key and public key algorithm.

COMPULSORY

1.Demonstrate the concepts of digital signature algorithm with key generation and
verification in detail. – 16 M

2.Explain the components of an information system. – 8 M

Explain SecSDLC in detail. – 8 M

PART C

1. Explain in detail about email security. – 16 M

2. Illustrate (G,*) is a cyclic group, where G={1,ω,ω2}. – 8 M
3. Is (Z,+) a group? verify and simulate CAIN Properties. – 8 M
4. Perform encryption and decryption using RSA algorithm for the following
values: p=7, q=11, e=7, M=9. – 16 M
5. Illustrate euler's theorem hold true for a=10 and n=11. – 8 M
6. Explain SecSDLC in detail. – 8M
7. Construct and prove fermat's theorem does not hold true for p=6 and a=2.
8. Explain the critical characteristics of information. – 8 M
9. Demonstrate the DH key exchange methodology using following key values:
p=11 , g=2 , XA = 9 , XB = 4. – 16 M
10. Illustrate digital signature algorithm and show how signing and verification is
done using DSS. – 16 M
11. Explain intrusion detection system (IDS) in detail with suitable diagram. – 16 M
12. Alice and bob use the diffie – hellman key exchange technique with a common
prime number 11 and a primitive root of 2. If alice and bob choose distinct secret
integers as 9 and 3, respectively, then compute the shared secret key. – 16 M
13. Explain how PGP encryption is implemented with suitable diagram. – 16 M
14. In a public-key system using RSA, you intercept the ciphertext
15. C = 20 sent to a user whose public key is e = 13, n = 77. predict the plaintext M.
– 16 M
16. Demonstrate the steps involved in SHA algorithm for encrypting a message with
maximum length of less than 2128 bits and produces as output of 512 bit
message digest. – 16 M
17. Construct fermat's theorem that holds true for p=13 and a=11. – 8 M
18. Construct and express (G,*) is a cyclic group, where G={1,ω,ω2}. – 8 M
19. In a public-key system using RSA, you intercept the ciphertext
20. C = 20 sent to a user whose public key is e = 13, n = 77. predict the plaintext M.
– 16 M