Scribd
Upload
9 views7 pages

ITNE361test23 Solved

Uploaded by

ali.alazawi003
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views7 pages

ITNE361test23 Solved

Uploaded by

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

Test 1

ITNE 361: Network Security II

Semester 1

2023-2024

1 By :Zmxwr
Part I: From the material that we discussed in Lecture 2 about the cryptography,
answer the following questions in detail (out of 6): [2 points each]

Q1: Consider a permutation cipher with a key of size 26 characters. Answer the
following questions:
a. What is the key space of this cipher?

Assume:
With repeating letters

b. If there is a supercomputer that can perform 1 attempt of the decryption test in


every 1 microsecond, on average, how long (in years) it will take this supercomputer
to crack the key?

c. Now what if we have a parallel cluster machine that can reach up to 106
decryptions in 1 microsecond, on average, how long (in years) it will take to crack
this password.

2
Part II: From the material that we discussed in Lecture 3 about the number theory,
answer the following questions in detail (out of 12): [4 points each]

Q1: Find the determinant and the matrix inverse of the following residue matrix over
z26:

9 3
A=
7 2

3
Q2: Using the Euclidean algorithm, find the greatest common divisor of the following
pairs of integers: gcd(161, 28) =?

Q3: Use the Extended Euclidean Algorithm to compute 16-1 mod 25. Show your work
gcd(16, 25)

4
Part III: From the material that we discussed in Lecture 4 about the traditional substitution
ciphers, answer the following questions in detail (out of 12): [6 points each]

Q1: Consider an Affine cipher, which encrypts each letter according to the rule: C = (p x k1 + k2)
mod 26. Here C, p, k1, and k2 are each members in the range 0 to 25, where C represents the
ciphertext letter, p the plaintext letter, and k1, and k2 are constant keys. For both the plaintext and
the ciphertext, 0 corresponds to letter "a", 1 corresponds to letter "b" and so on (see the mapping
table in the first page). After a sequence of statistical analysis you figured out that the plaintext "i"
encrypts to ciphertext "X" and plaintext "t" encrypts to ciphertext "G". Find the following:

i. Determine the constant keys k1 and k2.

ii. Find the formula that must be used to perform the decryption calculation.

5
Q2: Suppose that I am using the keyword mixed alphabet method to encrypt my messages. The
keyword I used is "PROFSIONAL" and the key letter is "S".

a. Encrypt the following message "SECURITY UNDER ATTACK". Show your work.

b. What is the advantage of employing keyword mixed alphabet cipher over the
traditional mixed alphabet cipher? Explain.

6
c. What is the most efficient way to attack this (keyword mixed alphabet) cipher?
Explain.

You might also like