Vinayaka Missions University 2010 B.E Information Technology Cryptography and network security - Question Paper

2. Write the difference ranging from a session key and a master key.
3. What is key distribution center?
4. Determine the gcd(24140,16762) using Euclid’s algorithm.
5. Specify the techniques for distribution of public key.
6. State Fermat’s theorem.
7. List out the sequence of steps in establishing a session key.
8. Define Euler’s totient function.
9. Differentiate ranging from an index and a discrete logarithm.
10. What is a primitive root of a number?
11. Write the roles of public and private key.
12. Give an account on trapdoor 1 way function.
13. State man-in-the-middle attack.
14. Write the 3 broad categories of applications of of public key cryptosystems.
15. List 4 general categories of schemes for the distribution of public keys.
16. What is the sum of 3 points on an elliptic curve that lie on a straight line?
17. Define abelian group.
18. Write a note on simple secret key distribution.
19. Draw a neat sketch showing the key distribution scenario.
20. Suggest 2 criteria that is used to validate that a sequence of numbers is random.
21. What is nonce?
22. Differentiate ranging from statistical randomness and unpredictability.
23. Why is the middle portion of 3DES a decryption rather than an encryption?
24. Specify the application of public key cryptography.
25. Perform encryption and decryption using RSA algorithm. For the subsequent.
P=7; q=11; e=17; M=8.

PART B

1. Explain in detail about RSA algorithm highlighting its computational aspects and security.
2. Briefly discuss Diffie-Hellman key exchange with an example.
3. Explain RSA algorithm and state approaches for attacking RSA algorithm and
the counter measures for the identical.
4. Give a detailed explanation regarding the different Key management techniques.
5. Explain with necessary example the concept of man-in-the-middle attack.
6. Illustrate with example the concepts of groups, rings and fields.
7. Explain in detail about Elliptic Curve Architecture.
8. With examples illustrate the 3 classes of polynomial arithmetic.
9. With a neat sketch about key distribution scenario discuss the key control schemes.
10. Explain in detail about confidentiality using symmetric key and public key cryptography.

UNIT III
PART A

1. Define the classes of message authentication function.
2. Specify the requirements for message authentication.
3. Differentiate MAC and Hash function.
4. What is message authentication?

Earning:   Approval pending.