IGNOU MMTE 6 SOLVED ASSIGNMENT

Included:

MMTE 006 (January 2025 - July 2025) - ENGLISH

Assignment

Course Code: MMTE-006

Assignment Code: MTE-006/TMA/2025

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)  Find the product of using the algorithm in page 23, block 1. You should show all the steps as in example 11, pag 22, block 1.

b) 

). The table of values is given below:

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	(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

ii) Compute  using the logarithm an antilogarithm tables

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

i) Text: "CBBGYAEBBFZCFEPXYAEBB", encrypted with affine cipher with key (7,2).

ii) Text:"KSTYZKESLNZUV", encrypted with Vigenère cipher with key "RESULT".

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.

3)a) Find the inverse of 13 (mod 51) using extended euclidean algorithm.

b) Use Miller-Rabin test to check whether 75521 is a strong pseuodprime to the base 2.

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 7_26-

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 Z₂₆- as follows:

Next, we choose an inveritble 2×2 matrix with coefficients in Z_26, for example.This matrix has determinant5 is a unit in Z₂₆ with inverse We write each pair of elements in Z26 as a column vector and multiply it by A:

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 pairs of characters to pairs of numbers and multiply by

Decrypt the text "TWDXHUJLUENN" which was encrypted using the Hill’s cipher with the

5) a) Decrypt the ciphertext 101000111001 which was encrypted with the Toy block cipher once using the key 101010010. Show all the steps

b) A 64 bit key for the DES is given below

i) Check whether the key is error free using the parity bits.

ii) Find the keys for the second round.

6) a) Considering the bytes 10001001 and 10101010 as elements of the  g(X)) is the polynomia  find their product and quotient.

b) Find a recurrence that generates the sequence 110110110110110.

7) a) Apply the frequency test, serial test and autocorrelation test to the following sequence at level of significance α = 0.05: 011001110000110010011100

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

8) a) Decrypt the message c = 23 that was encrypted using RSA algorithm with e = 43 and n = 77.

b) i) Bob uses ElGamal cyrptosystem with parametersand the secret value x = 3. What values will he make public?

ii) Alice wants to send Bob the messageShe chooses k = 5. How will she compute the cipher text? What information does she send to Bob?

iii) Explain how Bob will decrypt the message

a) Solve the discrete logarithm problem 5^x ≡ 22 (mod 47) using Baby-Step, Giant-Step algorithm.

b) Alice wants to use the ElGamal digital signature scheme with public parameters  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

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?

Q: How will I receive the PDF?
A: Immediately after payment, the download link will appear and be sent to your email.

Q: Is this hand-written or typed?
A: This is a professional typed computer PDF. You can use it as a reference for your handwritten submission.