Scribd
Upload
29 views4 pages

Cryptography Exam: B.Tech CSE Winter 2023

This document outlines the Continuous Assessment Test for the Cryptography and Network Security course at the School of Computer Science and Engineering for the Winter Semester 2023-24. It includes instructions, exam duration, maximum marks, and a series of questions covering topics such as greatest common divisors, congruences, modular exponentiation, block cipher modes, and the Data Encryption Standard (DES) algorithm. Each question specifies the maximum marks and provides sample answers or solutions.

Uploaded by

sarvagyassingh
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
29 views4 pages

Cryptography Exam: B.Tech CSE Winter 2023

This document outlines the Continuous Assessment Test for the Cryptography and Network Security course at the School of Computer Science and Engineering for the Winter Semester 2023-24. It includes instructions, exam duration, maximum marks, and a series of questions covering topics such as greatest common divisors, congruences, modular exponentiation, block cipher modes, and the Data Encryption Standard (DES) algorithm. Each question specifies the maximum marks and provides sample answers or solutions.

Uploaded by

sarvagyassingh
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/ 4

School of Computer Science and Engineering

Winter Semester 2023-24


Continuous Assessment Test – I
SLOT: E2 + TE2
Programme Name & Branch: B. Tech CSE
Course Name & Code: Cryptography and Network Security – BCSE309L
Class Number (s): Applicable to All
Faculty Name (s): Prof. S. Ramani
Exam Duration: 90 Min. Maximum Marks: 50

General instruction(s):
Answer all the Questions.
Tables related to DES/AES are given in the question paper.

Q. Question Max
No. Marks

1. a) Find the greatest common divisor d of 412 and 54, and find 5
integers x and y solving the equation 412x + 54y = d.

Ans: d = 2. The extended Euclidean algorithm gives x = 8 and y = -61. 5


(There are other solutions for x and y; these are not unique.)
b) Solve the congruence X^103 ≡ 4 mod 11 to find the value of X using Fermat’s
theorem.

Ans: By Fermat’s Little Theorem, x^10 ≡ 1 mod 11. Thus, x^103 ≡ x^3 mod 11. So, we only
need to solve x^3 ≡ 4 mod 11. If we try all the values from x = 1 through x = 10, we find that
53 ≡ 4 mod 11. Thus, x ≡ 5 mod 11.
2. a) Solve the given congruence equations to obtain the value of x 8

x=2(mod5)
x=3(mod7)
x=10(mod11)
2
Ans: x ≡ 87 (mod 385)

b) Find ϕ(1200)

Ans. 320
3. a) Solve 7^106 mod 143 using fast modular exponentiation 5

5
b) Determine all integers in the set {1, ..., 11} that are primitive roots of modulo 11

Ans: 2,6,7,8
4. a) Differentiate Initialization vector and Nonce in Block cipher modes operations. 3
Explain the reason that you should use block cipher CBC mode instead of block
cipher ECB mode.

An IV is a nonce with an additional requirement: it must be selected in a


7
nonpredictable way. That is, the IV can't be sequential; it must be random.
CBC has the advantage over the ECB mode in that the XORing process
hides plaintext patterns. Even if the first plaintext block and third plaintext
block were the exact same segment of plaintext, it is highly unlikely that the
first ciphertext block and third ciphertext block would be the same.
b) Discuss primitive operations and key expansion procedure in IDEA and also
Explain the steps involved in one round of IDEA to encrypt the plain text.

• Each rounds makes use of 6 subkeys (8X6=48) and the final output
transformation uses four subkeys(48+4 =52 subkeys).

• 128-bit key is divided into 8 parts K1 to K8 each of 16 bits.

• Of which K1 to K6 is used for ROUND 1 operation.

• For the remaining round subkeys are generated by performing key shifting.

• The original key is shifted left circularly by 25 bits and hence 52 subkeys are
generated.

• Operations performed are Addition, Multiplication, XOR

5. A person wants to share a plaintext “123456ABCD132536” to his friend in the 10


opposite side through social network. He/she uses Data Encryption Standard (DES)
algorithm for session encryption during his communication and assume that he/she
uses, the key as “AABB 0918 2736 CCDD”. Show the key generated for the first two
rounds.

Parity Drop Table


Compression Box Table

Key in Hexa to Binary

AABB 0918 2736 CCDD

1010 1010 1011 1011 0000 1001 0001 1000 0010 0111 0011 0110 1100 1100
1101 1101
Key 1: 000110010100110011010000011100101101111010001100

Key 2: 010001010110100001011000000110101011110011001110

************************************************************************************************

You might also like