College of Computing and Information Technology, Heliopolis

CS/IS421: Security assignment Period:6 hrs.

__________________________________________________________________________________________________________________
Name:Youssef Mohamed Abdelfatah Mohamed…………………………………………………………………...
ID:15104520……………….
________________________________________________________________________________________________________
Question#1 (6 points )

Page|1
 E C.T
P.T
&”202
”0
P.T= “your last name” & “1999”
E= play fair algorithm (6x6) with keyword= “security2211”

Find: The detailed steps of E(P.T) to get C.T

THE ANSWETR
------------------------------------------------------------------------------------------------------

s e
t y
d f
l m
v w
4 5
c u
2 1
g h
n o
x z
6 7
r i
a b
j k
p q
0 3
8 9

P.T: Mohamed1999 Key:Security2211

MONP
HA-> J1
ME-> WY
D1 ->HT
9X->63
9X->63
9X->63
C.T

Question (2): ESSAY (9 points)

Note: you can use the text book uploaded in cortex and PPT to answer the essay questions:

Page|2
 A) In AES cipher, each round contains 4 transformation processes. Fill the following empty cells
in the following table:

Process Name Operation type (Substitution/Permutation)

1-………Subbytes…………... ……………Substitution…………...
2-………Addroundkeys…………………... ……………Substitution………………...
3-……………Mix columns…………………... ………………Permutation………………...
4-……………Shift rows…………………... …………Permutation……………………...

B) Discuss the chosen parameters and design features that Feistel structure symmetric block
cipher depends on. (Text book -Chapter 2).

THE ANSWETR
------------------------------------------------------------------------------------------------------

1-Block size: larger block sizes mean greater security.

2-Key Size: larger key size means greater security.

3-Number of rounds: multiple rounds offer increasing security.

4-Subkey generation algorithm: greater complexity will lead to

greater difficulty of cryptanalysis.

5-Fast software encryption/decryption: the speed of execution of

the algorithm becomes a concern

C) Discuss the following substitution ciphers: Monoalphabetic, Play Fair, and Vigenère from the
security analysis view. Then sort them according the best security algorithm till the worst
one.
THE ANSWETR
------------------------------------------------------------------------------------------------------

Sorting:
1- Vigenère
2- Play Fair
Page|3
3- Monoalphabetic

Vigenère:
• Vigenere has multiple ciphertext letter for
the same plaintext letter
• Hence letter frequencies are obscured (but not
totally lost).

Play Fair:
security much improved over monoalphabetic
since has 36x 36= 1296 diagrams
• would need a 1296 entry frequency table to analyse
(verses 26 for a monoalphabetic) .
• Was widely used for many years (e.g. US & British
military in WW1)

Monoalphabetic:
• Now have a total of 26! keys
• With so many keys, might think the system is secure.
But would be !!!WRONG!!!
• Problem is because of the regularities of the language

Page|4
Page|5