[24] Alice and Bob use the Diffie–Hellman key exchange technique with a common prime nu

mber 29 and a primitive root 10. Alice has a private key 15 and Bob has a private key 27.
Find the public key of Alice and Bob and find the shared session key between Alice and
Bob.
[25] Alice want to send bob an encrypted message and Alice has chosen a plaintext "VIT".
Two prime numbers are 3 and 11 and public key is 7. Find the private key, ciphertext and
plaintext using RSA algorithm.
[26] In RSA, given n = 12091 and e = 13, Encrypt the message “THIS IS TOUGH” using
the 00 to 26 encoding schemes. (00 to 25 for letters A to Z and 26 for the space). Decrypt the
cipher text to find the original message. (Note: For encryption, create 4-digit blocks so that
the value of each block be less than n)
[27] Consider the elliptic curve E 11(1,6 n ). Assume that the secret key K and the generator
point G chosen by user is 4 and (3,6) respectively. Step by step, compute and determine
corresponding public key Q.
[28] The following illustrations (figure 1 & 2) are part of the secure hash algorithm. Using
these illustrations, construct suitable equations for SHA and investigate the same
meticulously to identify various challenges involved during the implementation of SHA with
respect to design complexity, Software and Hardware.

[29] a) Briefly explain Diffie–Hellman key exchange. (3 marks)

b) Alice and Bob use the Diffie-Hellman key exchange technique with a common prime q
= 23 and a primitive root a = 5.
i. If Bob has a private key XB = 10, what is Bob’s public key YB? (1m)
ii. If Alice has a private key XA = 8, what is Alice’s public key YB? (1m)
 iii. What is the shared secret key K with Alice and Bob? Show that they are identical.
(2m)
iv. Show that 5 is a primitive root of 23. Is this primitive root always a valid choice?
Justify. (3m)