MMTE-006

ASSIGNMENT BOOKLET

It is compulsory to submit the assignment before submitting the

examination form.

M.Sc. (Mathematics with Applications in Computer Science)

CRYPTOGRAPHY
(January 31st , 2024 – December 31st , 2024)

School of Sciences
Indira Gandhi National Open University
Maidan Garhi, New Delhi 110068
2024
Dear Student,
Please read the section on assignments in the Programme Guide that we sent you after your enrolment.
As you may know already from the programme guide, the continuous evaluation component has 20%
weightage. This assignment is for the continuous evaluation component of the course.

Instructions for Formating Your Assignments

Before attempting the assignment please read the following instructions carefully.

1) On top of the first page of your answer sheet, please write the details exactly in the
following format:

ROLL NO. : . . . . . . . . . . . . . . . . . . . . . . . . . . . .
NAME : . . . . . . . . . . . . . . . . . . . . . . . . . . . .
ADDRESS : . . . . . . . . . . . . . . . . . . . . . . . . . . . .
............................
............................
COURSE CODE : . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ............................
COURSE TITLE : . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
STUDY CENTRE : . . . . . . . . . . . . . . . . . . . . . . . . . . . . DATE . . . . . . . . . . . . . . . . . . . . . . . . . . . .
PLEASE FOLLOW THE ABOVE FORMAT STRICTLY TO FACILITATE EVALUATION AND
TO AVOID DELAY.

2) Use only foolscap size writing paper (but not of very thin variety) for writing your answers.

3) Leave 4 cm margin on the left, top and bottom of your answer sheet.

4) Your answers should be precise.

5) While solving problems, clearly indicate which part of which question is being solved.

6) Write all the answers in your own words. Do not copy from the internet, from your fellow students
or from any other source. If your assignment is found to be copied, it will be rejected.

7) This assignment is valid only up to 31st December, 2024. If you fail in this assignment or fail to
submit it by 31st December, 2024, then you need to get the assignment for 2025 and submit it as per
the instructions given in the Programme Guide.

8) At the time of filling in the online Term End Examination form, you are supposed to give an under-
taking that you have submitted/you will submit the assignment. Please ensure that you comply with
the undertaking.

We strongly suggest that you retain a copy of your answer sheets.

Wish you good luck.

2
 Assignment
Course Code: MMTE-006
Assignment Code: MMTE-006/TMA/2024
Maximum Marks: 100

Note: The notations and conventions in this assignment are those used in the course material. Block
numbers, unit numbers, etc. refer to the course material.)

1) a) Let f (x) = x3 − x − 1 ∈ Z5 [x]. Find the product of x2 + 2x + 1 + ( f (x)) and x2 + 3x − 1 + ( f (x))

using the algorithm in page 23, block 1. You should show all the steps as in example 11, page
22, block 1. (3)
b) Let f (x) = x4 + x + 1 ∈ F2 [x]. We represent the field F24 by F2 [x]/( f (x)). Let us write
γ = x + ( f (x)). The table of values is given below:

i γi Vector i γi Vector
0 1 (0, 0, 0, 1) 8 γ2 + 1 (0, 1, 0, 1)
1 γ (0, 0, 1, 0) 9 γ3 + γ (1, 0, 1, 0)
2 γ2 (0, 1, 0, 0) 10 γ2 + γ + 1 (0, 1, 1, 1)
3 γ3 (1, 0, 0, 0) 11 γ3 + γ2 + γ (1, 1, 1, 0)
4 γ +1 (0, 0, 1, 1) 12 γ3 + γ2 + γ + 1 (1, 1, 1, 1)
5 γ2 + γ (0, 1, 1, 0) 13 γ3 + γ2 + 1 (1, 1, 0, 1)
6 γ3 + γ2 (1, 1, 0, 0) 14 γ3 + 1 (1, 0, 0, 1)
7 γ3 + γ + 1 (1, 0, 1, 1)

i) Prepare logarithm and antilogarithm tables as given in page 23 of block 1. (4)

(γ 4 +γ 2 )+ γ 3 +γ +1


γ 2 (γ 2 +γ +1)
ii) Compute 2 4
(1+γ +γ )(1+γ ) 3 and (γ 3 +γ 2 )(1+γ 5 )
using the logarithm and
antilogarithm tables. (3)

2) a) Decrypt each of the following cipher texts:

i) Text: "CBBGYAEBBFZCFEPXYAEBB", encrypted with affine cipher
with key (7, 2). (3)
ii) Text:"KSTYZKESLNZUV", encrypted with Vigenère cipher with key "RESULT". (3)
b) Another version of the columnar transposition cipher is the cipher using a key word. In this
cipher, we encrypt as follows: Given a key word, we remove all the duplicate characters in the
key word. For example, if the key word is ‘SECRET’, we remove the second ‘E’ and use
‘SECRT’ as the key word. To encrypt, we form a table as follows: In the first row, we write
down the key word. In the following rows, we write the plaintext. Suppose we want to encrypt
the text ‘ATTACKATDAWN’. We make a table as follows:
S E C R T
A T T A C
K A T D A
W N X X X
Then we read off the columns in alphabetical order. We first read the column under ‘C’,
followed by the columns under ‘E’, ‘R’, ‘S’ and ‘T’. We get the cipher text TTX TAN ADX
AKW CAX. To decrypt, we reverse the process. Note that, since we know the length of the
keyword, we can find the length of the columns by dividing the length of the message by the
length of the keyword.
Given the ciphertext ‘HNDWUEOESSRORUTXLARFASUXTINOOGFNEGASTORX’ and
the key word ‘LANCE’, find the plaintext. (4)

3
3) a) Find the inverse of 13 (mod 51) using extended euclidean algorithm. (4)
b) Use Miller-Rabin test to check whether 75521 is a strong pseuodprime to the base 2. (5)

4) a) In this exercise, we introduce you to Hill cipher. In this cipher, we convert our message to
numbers, just as in affine cipher. However, instead of encrypting character by character, we
encrypt pairs of characters by multiplying them with an invertible matrix with co-efficients in
Z26 .
Here is an example: Suppose we want to ENCRYPT "ALLISWELL". Since we require the
plaintext to have even number of characters, we pad the message with the character ‘X’. We
break up the message into pairs of characters AL, LI, SW, EL and LX. We convert each pair of
characters into a pair elements in Z26 as follows:

AL (0, 11)
LI (11, 8)
SW (18, 22)
EL (4, 11)
LX (11, 23)
 
3 1
Next, we choose an inveritble 2 × 2 matrix with coefficients in Z26 , for example, A = .
7 4
This matrix has determinant 3 · 4 − 7 · 1 = 5 and 5 is a unit in Z26 with inverse 21. We write each
pair of elements in Z26 as a column vector and multiply it by A:
       
0 11 11 15
A = ,A = ,...
11 18 8 5

We then convert each pair of numbers to a pair of characters and write them down. In this
example, we get the cipher text "LSPFYGXUEN" corresponding to the plain text "ALLWELL".
To decrypt,we convert
 pairsof characters
 to  pairsof numbers and multiply by
−1 4 −1 4 −1 6 5
A−1 = 5 = 21 = and we have
−7 3 −7 3 9 11
    
6 5 11 0
= ,....
9 11 18 18

Decrypt the text

 "TWDXHUJLUENN" which was encrypted using the Hill’s cipher with the
3 1
matrix as the encryption matrix. (6)
0 9
5) a) Decrypt the ciphertext 101000111001 which was encrypted with the Toy block cipher once
using the key 101010010. Show all the steps. (5)
b) A 64 bit key for the DES is given below

11000111 10000101
11110111 11000001
11111011 10101011
10011101 10010001

i) Check whether the key is error free using the parity bits.
ii) Find the keys for the second round. (4)

6) a) Considering the bytes 10001001 and 10101010 as elements of the field F2 [X]/hg(X)i, where
g(X) is the polynomial X 8 + X 4 + X 3 + X + 1, find their product and quotient. (6)

4
 b) Find a recurrence that generates the sequence 110110110110110. (6)

7) a) Apply the frequency test, serial test and autocorrelation test to the following sequence at level of
significance α = 0.05:
011001110000110010011100. (6)
b) Apply poker test to the following sequence with level of significane α = 0.05. (4)
1001101000010000101111011
01110100101101100100110.
c) Apply runs test to the following sequence:
1001101000010000101111011
0111010010110110010011010
0110011100001100100111000
1100001101010111101001110
0010001111000001101010010
1000110100000110100101101
1110001001 (5)

8) a) Decrypt the message c = 23 that was encrypted using RSA algorithm with e = 43
and n = 77. (4)
b) i) Bob uses ElGamal cyrptosystem with parameters p = 47, g = 5 and the secret value
x = 3. What values will he make public? (2)
ii) Alice wants to send Bob the message M = 15. She chooses k = 5. How will she compute
the cipher text? What information does she send to Bob? (4)
iii) Explain how Bob will decrypt the message. (4)

9) a) Solve the discrete logarithm problem 5x ≡ 22 (mod 47) using Baby-Step, Giant-Step
algorithm. (7)
b) Alice wants to use the ElGamal digital signature scheme with public parameters p = 47, α = 2,
secret value a = 7 and β = 34. She wants to sign the message M = 20 and send it to Bob. She
chooses k = 5 as the secret value. Explain the procedure that Alice will use for computing the
signature of the message. What information will she send Bob? (4)
c) Alice wants to use the Digital Signature algorithm for signing messages. She chooses p = 83,
q = 41, g = 2 and a = 3. Alice wants to sign the message M = 20. She chooses the secret value
k = 8. Explain the procedure that Alice will use for computing the signature. What information
will she send Bob? (4)