Unit No. 2: Important Questions

Unit No. 2

Important Questions

Q 1. Explain the applications and requirements of public key cryptography?

Q. 2 Explain the RSA algorithm with an example?

Q. 3 Write and explain the Diffie-Helman Key exchange algorithm?

Q. 4 Explain the distribution of public keys using public-key certificates?

  Q. 5 What is a message authentication code? What are the basics of MAC?

  Q. 6 How is message authentication achieved using Hash functions?

  Q. 7 Explain the Man-in-middle attack?

  Q. 8 Consider the Diffie-Helman Scheme with common prime q=11 and primitive root alpha =2

           A.  Show that 2 is the primitive root of 11.

B.  If user A has a public key YA=9, What is A’s private key XA?

         C.      If user B has a public key YB=3, What is a shared secret key?

        Q. 9    Explain the principles of public key cryptosystems?

        Q. 10 How can encryption be used for message authentication?


Post a Comment