Numerical and Algorithm-Based Questions
1. RSA Algorithm:
a. Perform encryption and decryption using the RSA algorithm for p=5, q=11, e=3 and M=9.
b. P and Q are two prime numbers. P=17, and Q=31. Take public key E=7. If the plaintext value is 2,
what will be the private key and ciphertext value according to the RSA algorithm?
c. Compute the public key and private key of RSA with p=11, q=17 and e=7.
d. Explain the RSA algorithm and also compute the public key and private key of RSA with p=53, q=59
and e=3.
2. Diffie-Hellman Key Exchange:
a. For the Diffie-Hellman algorithm, two publicly known numbers are prime number 23 and primitive
root (g) is 9. A selects the random integer 4 and B selects 3. Compute the public key of A and B. Also,
compute the common secret key.
b. In a Diffie-Hellman Key Exchange, Alice and Bob have chosen a prime value q=17 and a primitive
root =5. If Alice's secret key is 4 and Bob's secret key is 6, what is the secret key they exchanged?
c. In a Diffie-Hellman Key Exchange, Alice and Bob have chosen prime value 11 and 7. If Alice's secret
key is 3 and Bob's secret key is 6, what is the secret key they exchanged?
d. How is the same key calculated in the Diffie-Hellman key exchange algorithm?
3. Symmetric Ciphers:
a. Encrypt the message "Asymmetric key cryptography is fun" using a Transposition cipher with key
(3,2,6,1,5,4).
b. Construct a Playfair matrix with the key "engineering" and encrypt the message "test this
Balloon".
c. Encrypt the message "CORONA" using Hill Cipher with key (9547).
d. Encrypt the message "WE ARE DISCOVERED FLEE AT ONCE" using a Rail fence cipher with rail = 3.
e. Encrypt the message "attc" with the Hill cipher key (9547).
f. Encrypt the plain-text message "helloe jassmin" using Playfair cipher with the keyword "cipherj".
g. What would be the transformation of a message 'Happy Birthday to you' using the Rail Fence
technique level = 3?
h. Generate a Ciphertext for plaintext 'MISSION' with key 'IMPOSSIBLE' using a Playfair cipher.
i. Generate a Ciphertext for plaintext "hi" using the Hill cipher key "jefh".
4. Cryptographic Algorithms and Properties:
a. In MAC, if an 80-bit key is used and the tag is 32 bits, then after how many rounds will an attacker
produce a key, which must be the one used by the sender?
b. Write the Euclid algorithm.
c. Compute the Inverse of b=550 mod m=1759 using the Euclid algorithm.
d. Write down the algorithm used for calculating exponentiation efficiently. Also give an example.
