http://www.makaut.

com

Name : ……………………………………………………………
Roll No. : ……………………………………………..…………..
Invigilator’s Signature : ………………………………………..
CS/M.Tech (CSE)/SEM-2/CSEM-209/2010
2010
CRYPTOGRAPHY & NETWORK SECURITY
Time Allotted : 3 Hours Full Marks : 70

The figures in the margin indicate full marks.

Candidates are required to give their answers in their own words
as far as practicable.

Answer Question No. 1 and any four from the rest.

5 × 14 = 70
1. a) A generalization of the Caeser cipher, knows as the
affine Caesar cipher, has the following form : For each
plain text letter p, substitutue the ciphertext letter C :
C = E ( [ a, b ], p ) = ( ab + b ) mod 26
A basic requirement of any encryption algorithm is that
it be one-to-one. That is, if p ≠ q, then E ( k, p ) ≠ E
( k, q ). Otherwise decryption is impossible, because
more than one plaintext character maps into the same
ciphertext character. The affine Caeser cipher is not
one-to-one for all values of a. For e.g., for a = 2 and
b = 3, then E ( [ a, b ], 0 ) = E ( [ a, b ], 13 ) = 3.
i) Are there any limitations on the value of b ?
Explain why or why not.
ii) Determine which values of a are not allowed
iii) Provide a general statement of which values of a
are and are not allowed. Justify your statement. 6

30268 (M.Tech) [ Turn over

CS/M.Tech (CSE)/SEM-2/CSEM-209/2010

b) For the message M = 10011101, show the embedding of

this message into an image and also the extraction of
the original message from the stego image. Assume any
random no. of pixels of the cover image for embedding
operation. 4
c) In DES algorithm how expansion permutation is done ?
Show the 48 bit result of the expansion permutation
operation by assuming any 32 bit binary number. 4
2. a) Which cryptographic technique is more efficient
( regarding breaking of cipher text ) between
monoalphabetic and polyalphabetic substitution ?
1
Explain with the help of example. 4
2
b) Using the Vignere cipher, encrypt the word ‘attraction’
using the key leg. Also show how to break the Cipher
! 1
text using the same key. 4
2
c) Explain the REBC2 symmetric cipher structure and
discuss the advancement of this symmetric cipher over
traditional REBC cipher. ! 5
3. a) Discuss the DES algorithm in details with the
explanation of each step and with the help of diagram
( wherever necessary ). 7
b) Explain the key generation process in DES algorithm. 3
c) Discuss the security of DES algorithm in terms of
number of rounds, key length, differential cryptanalysis
etc. 4
4. a) With reference to DES, if the S-Box is as shown below,
and the input to S-box “100110”, what will be the
1
output ? 1
2
S1
14 4 13 1 2 15 11 8 3 10 6 12 5 9 0 7
0 15 7 4 14 2 13 1 10 6 12 11 9 5 3 8
!
4 1 14 8 13 6 2 11 15 12 9 7 3 10 5 0
15 12 8 2 4 9! 1 7 5 11 3 14 10 0 6 13

30268 (M.Tech) 2
 CS/M.Tech (CSE)/SEM-2/CSEM-209/2010

b) In a public-key system using RSA, you intercept the

ciphertext C = 10 sent to a user whose public key is
e = 5, n = 35. What is the plaibtext M ? Show the
1
calculation of d using extended Euclidean algorithm. 4
2

c) The example used by Sun-Tsu to illustrate the CRT was

x " 2 (mod 3); x " 3(mod 5); x " 2(mod 7) solve for x.
!
3

d) “In RSA algorithm if the same message is ever encrypted

!
with two different exponents ( both having the same
modulus ), and those two exponents are relatively prime
( which they generally would be ), then the plaintext can
be recovered without either of the decryption
exponents”. Justify this statement by mentioning and
explaining the type of attack on the ciphertext produced
by the RSA algorithm. Also show the procedure of
recovering the plaintext from the ciphertext using this
attack. 3

e) Use Fermat’s theorem to find a number x between 0 and

28 with x 85 congruent to 6 modulo 29. 2

5. a) “In general, an integer has a multiplicative inverse in

Z if that integer is relatively prime to n.” Justify this
!n
statement with the help of an example. 3

b) “The Diffie-Hellman algorithm depends for its

!
effectiveness on the difficulty of computing discrete
logarithms.” Justify with example. 3

c) How Chinese remainder theorem and Gauss’s algorithm

can be applied on ciphertexts produced by the RSA
algorithm to recover the plaintext using low encryption
1
key attack ? Explain with example. 3
2

30268 (M.Tech) 3 [ Turn over

!
CS/M.Tech (CSE)/SEM-2/CSEM-209/2010

d) Given a superincreasing Knapsack sequence as { 2, 3, 6,

13, 27, 52 }. Show the procedure of creating the public
key from the private key in Knapsack public-key
cryptography. Also show with example the method of
encryption and decryption in Knapsack public-key
cryptography by considering the above Knapsack
1
sequence. 4
2

6. a) Explain the transport mode and the tunnel mode

operations of the AH and ESP protocols in IPSEC.
! 5

b) Which type of problems’ solution is offered by VPN ?

Give one such real life problem. Show how that problem
can be solved by explaining the architecture of the
VPN. 5

c) List the name of those algorithms that PGP supports.

Explain the idea of Introducer trust and Certificate trust
in PGP. 4

7. a) Explain the concept of digital signature. Discuss the

DSA algorithm. 5

b) Explain the one-way authentication using shared secret

key and public key encryption approach. 5

c) Discuss the steps involved in distribution the session

keys to different users by Key Distribution Centre
( KDC ) ( with the help of the diagram ). 4

30268 (M.Tech) 4