Q#01 G= (Z26*, X)

a. Using Lagrange’s theorem, find the orders of all the potential subgroups of
the group.
b. Find order of all the elements in the group.
c. Find first four subgroups of the group.
d. Is G cyclic or not.

NOTE For Questions no 2-4 :

Use P1, P2, P3, K in questions no. 2-4 where

P1 = ij (hex) ; P2 = vw (hex) ; P3 = iw (hex) ; K = uvw (hex)

and

i = 4th digit of your mobile no

j = 5th digit of your mobile no

u = 8th digit of your mobile no

v = 9th digit of your mobile no

w = 10th digit of your mobile no

e.g my mobile no. is 53126212041

Digits 1st 2nd 3rd 4th 5th 6th 7th 8th 9th 10th 11th
Mob# 5 3 1 2 6 2 1 2 0 4 1

i=6 j=2 u=0 v=4 w=1

P1 = 62 (hex) ; P2 = 41 (hex) ; P3 = 61(hex) ; K = 041 (hex)

Take each digit of mobile number as hexadecimal. e.g

P1 = 62 (hex) = 0110 0010 (binary)

K = 041 (hex) = 0000 0100 0001 (binary)

Use your mobile no. which are assigned to you by the CR otherwise zero will be
awarded .
Q#02
a) Whether the inverse of P1 in GF (28) using modulus x8+x4+ x3+x+1 exists
or not. If exists what is P1-1. (Use extended Euclidean algorithm)

b) Multiply P1 & P2 in GF (28) using irreducible polynomial x8+x4+ x3+x+1

Hint: first convert P1 and P2 into polynomial

Q#03
Show the steps how a computer having add and multiply but not divide operation
can carry out multiplication of P1 by P3 in GF (28) using 100011011 as modulus.

Q#04
a. Use least significant 10 bits of K as Cipher key. Encrypt P1 using S-DES and
show the output (in hexadecimal) of each intermediate stage in hexadecimal.

b. Decrypt the cipher text found in part (a) by using the same cipher key and S-
DES. Also Show the output (in hexadecimal) of each intermediate stage.

NOTE:
Marks will be deducted if the outputs of intermediate stages will
not be in hexadecimal

Hint:
Since k = 041 = 0000 0100 0001 & P1 = 62 = 0110 0010
Hence cipher key is least significant 10 bits of K which are “00 00 0100 0001”
For help read the APPENDIX O given in BOOK “Cryptography and Network Security”
by Behrouz .A Frozen.