0% found this document useful (0 votes)
48 views

Assignment 1 Questions

The document contains 15 questions related to various cryptographic techniques including affine cipher, Hill cipher, Playfair cipher, Caesar cipher, shift cipher, and multiplicative cipher. The questions cover topics such as determining encryption and decryption functions, calculating the number of possible keys, encrypting and decrypting messages using given keys, and illustrating the encryption and decryption processes for different ciphers.

Uploaded by

Sadhvika
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
48 views

Assignment 1 Questions

The document contains 15 questions related to various cryptographic techniques including affine cipher, Hill cipher, Playfair cipher, Caesar cipher, shift cipher, and multiplicative cipher. The questions cover topics such as determining encryption and decryption functions, calculating the number of possible keys, encrypting and decrypting messages using given keys, and illustrating the encryption and decryption processes for different ciphers.

Uploaded by

Sadhvika
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment Questions

Q1. Suppose that K= (5,21) is a key in Affine Cipher over Z29.


(i) Express the decryption function as dk(y)=a’y+b’, where a’,b’ Ꜫ Z29.
(ii) Prove that dk(ek(x)) = x for all x Ꜫ Z29
Q2. Show that the unicity distance of the Hill Cipher over Z26 (with m x m
encryption matrix) is less than m/RL, where RL is the redundancy of the
language.
Q4. If an encryption ek is identical to the decryption function dk, then k is said
to be an involuntary key. Let the set of involuntary keys in the shift cipher
over Z26 is S1 and in the affine cipher over Z5 is S2. Find the value of S1
and S2.
Q5. Let r1 and r2 be the numbers of all possible keys of affine cipher and
Vigenere cipher, respectively, where affine cipher: P= C= Z20 and K={(a,b)
ε Z20 x Z20: gcd(a,20)=1}, and Vigenere Cipher P=C=Z420=K. Determine
the value of r1 and r2.
Q6. Suppose that we have two plaintext and ciphertext pairs obtained from
Affine cipher (8,0) and (4,14) over Z26. Find the value of a and b, where k=
(a,b) is a key.
Q7. (i) The number of keys in an Affine Cipher in Zm for m=30.
(iii) Suppose that k= (5,21) is a key in an Affine Cipher over Z32. Then find
the value of a and b.
Q8. Let S1 be a multiplicative cipher over Z26 and S2 be a shift cipher over Z26.
Suppose that S= S1 x S2. Find the ciphertext y of “JULIUS” using the
cryptosystem S, where K1=3 and K2=1.
Q9. (i) Let p=11 and q=7. Then find multiplicative inverse of 13 modulo Ø(pq)
(ii) Encrypt the message “national institute of technology raipur ” with a key of

9 using multiplicative cipher


(iii) Decrypt the message “TARIDWX” with a key of 11 using multiplicative
cipher
Q10. (i) Encrypt the message “Let us meet at our usual place” using the Hill
cipher with the key
9 4
5 7 . Show the calculations and result
(ii) Show the calculations for the corresponding decryption of the ciphertext to
recover the original plaintext.
Q11. Explain the playfair cipher encryption and decryption process using
keyword= CRYPTOFUN and message= PEER TO PEER CONNECTION.

Q.12 Bob sends a message = MEET AT CAMPUS to his friend Tom using
keyword= FINAL TERM EXAM, using Playfair encryption algorithm.
Illustrate how Bob encrypts the message, and Tom decrypts the message.

Q13. Perform caesar cipher encryption for the message = The quick fox jumps.
Also, show the encryption verification.

Q14. Illustrate the procedure of ciphering and deciphering of message “MADE


IN INDIA” through shift cipher with key=23.

Q15. Bob sends a message = MEET AT CAMPUS to his friend Tom using
key=7, using shift cipher encryption algorithm. Illustrate how Bob encrypts the
message, and Tom decrypts the message.

You might also like