Department:- School of Computer Science & Engineering

CSE403T: Network Security & Cryptography

Submitted by: Submitted to:

Name: Vijendra Singh Himanshi
Section: K2R36 Ass. Professor
Roll No: A-02
Reg.No: 11105375
Q. 1

(a) What is difference between an unconditionally secure and computationally secure cipher?

Ans.

Unconditionally secure cipher: If the cipher text generated by the scheme does not contain
enough information to determine uniquely the corresponding plain text, no matter how much
cipher text is available, that scheme is unconditionally secure cipher.

Computationally secure cipher: If the cost of breaking the cipher exceeds the value of the
encrypted information and the time required to break the cipher exceeds the useful lifetime of
information, that scheme is computationally secure cipher.

(b) Show a play fair cipher in use using a 6*4 matrix, ignoring Q and Z and filling other 24
alphabets, keyword is your ”First Name” and plaintext is “I am loving it”.

Ans.

F I R S
T N A M
E B C D
G H J K
L O P U
V W X Y

Decoded text is:- n rt ulwnbf hva

(e) Show difference between the block and stream cipher using the same plaintext.

Ans.

 Block ciphers encrypt fixed length blocks of bits, while stream ciphers combine plain-text bits
with a pseudorandom cipher bits stream using XOR operation.
 Even though block ciphers use the same transformation, stream ciphers use varying
transformations based on the state of the engine.
 Stream ciphers usually execute faster than block ciphers.
 In terms of hardware complexity, stream ciphers are relatively less complex.
 Stream ciphers are the typical preference over block ciphers when the plain-text is available in
varying quantities (for e.g. a secure wifi connection), because block ciphers cannot operate
directly on blocks shorter than the block size.
  DES is block cipher and one time pad is block cipher.

Q.2 For each of the following assets, assign a low, moderate, or high impact level for the loss of
confidentiality, availability, and integrity, respectively. Justify your answers.

a. An organization managing public information on its Web server.

b. A law enforcement organization managing extremely sensitive investigative information.
c. A financial organization managing routine administrative information (not privacy related
information).
d. An information system used for large acquisitions in a contracting organization contains
both sensitive, pre-solicitation phase contract information and routine administrative
information. Assess the impact for the two data sets separately and the information system
as a whole.
e. A power plant contains a SCADA (supervisory control and data acquisition) system
controlling the distribution of electric power for a large military installation. The SCADA
system contains both real-time sensor data and routine administrative information. Assess
the impact for the two data sets separately and the information system as a whole.
Ans.
(a). Security Category of an organization managing public information on its web server:
Confidentiality-NA (Not Applicable)
Integrity-Moderate
Availability-Moderate
(b). Security Category of law enforcement organization managing extremely sensitive investigation
information:
Confidentiality-High
Integrity-Moderate
Availability-Moderate
(c). Security Category of financial organization managing routine administrative information:
Confidentiality-Low
Integrity-Low
Availability-Low
(d). Security Category of Contract information:
Confidentiality- Moderate
Integrity-Moderate
Availability-Low
Security Category of administrative information:
Confidentiality-Low
 Integrity-Low
Availability-Low

Security Category of Acquisition system:

Confidentiality-Moderate
Integrity-Moderate
Availability-Low
(e). Security Category of Sensor data:
Confidentiality-NA (Not Applicable)
Integrity-High
Availability-High
Security Category of administrative information:
Confidentiality-Low
Integrity-Low
Availability-Low
Security Category of SCADA system:
Confidentiality-Low
Integrity-High
Availability-High

Q. 3 The following cipher text was generated using simple substitution algorithm:

Decrypt the message.

Ans. A good glass in the bishop's hostel in the devil's seat twenty-one degrees and thirteen
minutes northeast and by north main branch seventh limb east side shoot from the
left eye of the death's-head a bee line from the tree through the shot fifty feet out.

Of the character 8 there are 33.

; " 26.
4 " 19.
+ ) " 16.
* " 13.
5 " 12.
6 " 11.
 ! 1 " 8.
0 " 6.
9 2 " 5.
: 3 " 4.
? " 3.
` " 2.
- . " 1.

Key:
012345689+!()*;?-`:
----------------------------------------
LF BG HAIE M 0 D R S NTU CVY

Cipher text  Plaintext

5 3++! 305)) 6* ;48 26)4+.) 4+);80 6* ;48

a good glass in the bishops hostel in the

!8`60) )85 ;]8*;: +*8 !83(88) 5*! ;46(;88*

devils sea twenty one degrees and thirteen

96*?;8) *+(;485); 5*! 2: *+(;4 956* 2(5*-4 )8`8*;4

minutes northeast and by north main branch seventh

0692 85); )6!8 )4++; 1(+9 ;48 081;

limb east side shoot from the left

8:8 +1 ;48 !85;4)485! 5 288 06*8 1(+9

eye of the deathshead a bee line from

;48 ;(88 ;4(+?34 ;48 )4+; 161;: 188; +?;

the tree through the shot fifty feet out
Q.4

Ans.
(a) First, pass the 64-bit input through PC-1 to produce a 56-bit result. Then perform a left circular
shift separately on the two 28-bit halves. Finally, pass the 56-bit result through PC-2 to produce
the 48-bit K1.
in binary notation: 0000 1011 0000 0010 0110 0111
1001 1011 0100 1001 1010 0101
in hexadecimal notation: 0 B 0 2 6 7 9 B 4 9 A 5

(b) . L0, R0 are derived by passing the 64-plaintext through IP :

L0 = 1100 1100 0000 0000 1100 1100 1111 1111
R0 = 1111 0000 1010 1010 1111 0000 1010 1010

(c). The E table expands R0 to 48 bits:

E(R0) = 01110 100001 010101 010101 011110 100001 010101 010101

(d). A = 011100 010001 011100 110010 111000 010101 110011 110000

(e). S100 (1110) = S10(14) = 0 (base 10) = 0000 (base 2)

S201(1000) = S21(8) = 12 (base 10) = 1100 (base 2)
S300 (1110) = S30(14) = 2 (base 10) = 0010 (base 2)
S410 (1001) = S42(9) = 1 (base 10) = 0001 (base 2)
S510 (1100) = S52(12) = 6 (base 10) = 0110 (base 2)
S601(1010) = S61(10) = 13 (base 10) = 1101 (base 2)
S711(1001) = S73(9) = 5 (base 10) = 0101 (base 2)
S810 (1000) = S82(8) = 0 (base 10) = 0000 (base 2)
(f). B = 0000 1100 0010 0001 0110 1101 0101 0000
(g). Using P(B) = 1001 0010 0001 1100 0010 0000 1001 1100
(h). R1 = 0101 1110 0001 1100 1110 1100 0110 0011
(i). L1 = R0. The cipher text is the concatenation of L1 and R1.

Q. 5

(a) Using the Playfair Matrix :

T M P Q S

Z V W X Y
Encrypt this message:
E O C U R
“The enemy must be stopped at all costs. Do
F N A B D whatever is necessary.”

Ans. L G H I/J K Encrypted message is:

pluzofotvsrqqfrtmeqwtcbfpfizhermtmnrcpfpozeokqfouoqypddr

(b) (i) How many possible keys does a Play fair cipher have? Ignore the fact that some keys might
produce identical encryption results. Express your answer as an approximate power of 2.

Ans. 25! 2^84

(b) (ii) Now take into account the fact that some Play fair cipher keys produce the same
encryption results. How many effectively unique keys does the Play fair cipher have?

Ans. Given any 5x5 configuration, any of the four row rotations is equivalent, for a total of five
equivalent configurations. For each of these five configurations, any of the four column rotations
is equivalent. So each configuration in fact represents 25 equivalent configurations. Thus, the
total number of unique keys is 25! /25 = 24!