Bachelor of Technology

Fisrt Semester examinations

Department: Option : CCN, IT, SWE

Course code/ Title: Cryptography and Network Security Credit value: 03
Duration: Date: Venue:
Course Instructor Dr. JDD Nkapkop

Problem I: Cryptography Multiple Choice Questions / 15 [Good answer: 1; False answer: -0.5; No
answer: 0]
1) In brute force attack, on average half of all possible keys must be tried to achieve success.
A) True
2) An encryption scheme is unconditionally secure if the ciphertext generated does not contain enough
information to determine uniquely the corresponding plaintext, no matter how much cipher text is
available.
A) True
3) Use Caesar’s Cipher to decipher the following: HQFUBSWHG WHAW
B) ENCRYPTED TEXT
4) The estimated computations required to crack a password of 6 characters from the 26 letter alphabet is-
A) 308915776
5) Monoalphabetic ciphers are stronger than Polyalphabetic ciphers because frequency analysis is tougher
on the former.
B) False
6) Choose from among the following cipher systems, from best to the worst, with respect to ease of
decryption using frequency analysis.
C) Random Polyalphabetic, Vignere, Playfair, Plaintext
7) On Encrypting “thepepsiisintherefrigerator” using Vignere Cipher System using the keyword
“HUMOR” we get cipher text-
B) abqdvmwuwjphfvvyyrfznydokvl
8) On Encrypting “cryptography” using Vignere Cipher System using the keyword “LUCKY” we get
cipher text
A) nlazeiibljji
9) DES follows
C) Feistel Cipher Structure
10) The DES algorithm has a key length of
C) 64 bits
11) In the DES algorithm the Round Input is 32 bits, which is expanded to 48 bits via ____________
A) Scaling of the existing bits
12) The Initial Permutation table/matrix is of size
C) 8×8
13) Like DES, AES also uses Feistel Structure.
B) False
14) What is the expanded key size of AES-192?
C) 52 words
15) Which of the 4 operations are false for each round in the AES algorithm
i) Substitute Bytes; ii) Shift Columns; iii) Mix Rows; iv) XOR Round Key.

1/3

©Dr. JDD Nkapkop, PhD

 B) ) ii) iii) and iv)
Problem II: Questions / 5
- Modern cryptography: is a mathematical technique (science) that offers various aspects in information
security such as data confidentiality, data integrity, authentication, and non-repudiation.
- Classic cryptography: is a mathematical technique (art) offering only the confidentiality of the data.
- DES: Data Encryption Standard is a symmetric encryption algorithm that encrypts 64-bit blocks with
56-bit keys.
- RSA: Rivest-Shamir-Adleman is an asymmetric cryptosystem, which uses two keys composed of prime
numbers in order to encrypt large volumes of data.
2. An encryption scheme has five ingredients. Name them:
- (01) Plaintext; (02) Encryption algorithm; (03) Secret Key; (04) Ciphertext; (05) Decryption
algorithm. / 0.25×5
3. For a transposition cipher the letter frequency remains unchanged. (yes/no) ? Why ? /
0.25+0.5
Yes, because a transposition cipher changes only the position of the letters and not their value
4. A substitution cipher destroys dependency between letters. (yes/no) ? Why ? /
0.25+0.5
Yes, because in a substitution cipher, the value of the letters changes
5. A transposition cipher destroys dependency between letters. (yes/no) ? /
0.25+0.5
No, because in a transposition cipher, the value of the letters does not changes
Problem III: RSA Algorithm Examples /5
In each part, the modulus N and the encryption exponent a are given. A message to encrypt (M)
and a message to decrypt (D) are given (just numbers!) In each part, find the decryption exponent s,
encrypt the message to encrypt and decrypt the message to decrypt.
1) N = 851 ;
a = 5 ;
M = 24 ;
D = 111. / 2.5
Solutions: the encryption of 24 is 668. The decryption exponent is 317.
The decryption of 111 is 148.
Detailed Solutions:
For the first part, we need to compute 245mod851.
245 = 7962624; 7962624 - (9356)(851) = 668; the answer is 668.
To do the second part, we first need to find the encryption exponent.
N = 851 = (23)(37) so E = (22)(36) = 792. gcd(5, 792) = 1 as desired.
We need to find the multiplicative inverse of a = 5 mod 792; this will be our encryption exponent s.
2) N = 247 ;
a = 7 ;
M = 100 ;
D = 200. / 2.5
Solutions: the encryption of 100 is 35. The decryption exponent is 31.
The decryption of 120 is 42.

2/3

©Dr. JDD Nkapkop, PhD

Problem IV: Caesar Cipher /3
1) What does “CAESAR” become with a shift of F? / 0.5
HFJXFW
2) What key do we need to make “CAESAR” become “MKOCKB”? / 0.5
The key is “K”
3) What key do we need to make “CIPHER” become “SYFXUH”? / 0.5
The key is “Q”
Above we saw that “CAESAR” becomes “RPTHPG” using a key P.
4) Can you find a key that will turn “RPTHPG" back into “CAESAR”? / 0.5
We need a shift of “L”
5) Use a key N to shift “CAESAR”. What key is needed to shift back? What do you notice? Is this true
for all texts? / 0.5
After a shift of ‘N’, “CAESAR” becomes “PNRFNE". The same key ‘N’ shifts the
ciphertext back to “CAESAR”. This is true for all texts. It is also true for the key “A”
6) How can we find the decryption key from the encryption key? / 0.5
The encryption and decryption keys occur in pairs (apart from ‘A’ and ‘N’). The pairs are
(‘B’,‘Z’), (‘C’,‘Y’) and so until (‘M’, ‘O’).

Problem VI: Vignère Cipher /2

1) Use the key “CODE” to encrypt the sentence “TO BE OR NOT TO BE”. Some of the
ciphertext is already completed for you:

/2
VCEIQFQSVHRFG

3/3

©Dr. JDD Nkapkop, PhD