Unit 1
Unit 1
12. Write the message in a rectangle, row by row and red the message off, column by column but
permute the order of the columns. The order of the columns then becomes the key to the
algorithm.
Key: 4312567
Plaintext: MEET ME AFTER SOME TIME BECAUSE BUSY.
1. Generate public and private keys by using RSA cryptosystem. Given N = 77, e = 13, Encrypt the
message m = 5 using RSA algorithm. Decrypt the same.
2. Explain Diffie-Hellman key exchange algorithm / protocol in detail. And also Illustrate how this
protocol suffers Man-in-the-Middle attack?
3. Differentiate between conventional and public key cryptosystem.
4. In RSA system, given p = 3, q = 11, e = 7 and m = 5. Find the cipher text ‘C’ and also find message
‘m’ from decryption.
5. Discuss general idea of asymmetric key cryptosystem.
6. Explain the working of Diffie-Hellman key exchange algorithm. Compute Diffie-Hellman practical
key and secret key where a = 24, b = 27, g = 2, and p = 131.
7. Give a detailed note on Elgamal encryption. A block of plaintext message m = 3 has to be
encrypted. Assume p = 11, g = 2, recipients private key = 5. Sender chooses random integer r = 7,
perform encryption and decryption.
8.
9.