Scribd
Upload
148 views7 pages

Winsem2023-24 Bcse309l TH VL2023240500721 Cat-1-Qp - Key

This document outlines the Continuous Assessment Test for the B.Tech Computer Science and Engineering program for the Winter Semester 2023-24. It includes various cryptography and network security questions, covering topics such as the Extended Euclidean Algorithm, Fermat's Little Theorem, the RC4 algorithm, DES feistel structure, and AES key generation. The exam consists of multiple questions with specified marks and instructions for completion.

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
148 views7 pages

Winsem2023-24 Bcse309l TH VL2023240500721 Cat-1-Qp - Key

This document outlines the Continuous Assessment Test for the B.Tech Computer Science and Engineering program for the Winter Semester 2023-24. It includes various cryptography and network security questions, covering topics such as the Extended Euclidean Algorithm, Fermat's Little Theorem, the RC4 algorithm, DES feistel structure, and AES key generation. The exam consists of multiple questions with specified marks and instructions for completion.

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

School of Computer Science and Engineering

Winter Semester 2023-24


Continuous Assessment Test – I
SLOT E1+TE1
Programme Name & Branch: B.Tech & Computer Science and Engineering
Course Name & Code: Cryptography and Network Security & BCSE309L
Class Number (s): Applicable to all
Faculty Name (s): Applicable to all
Exam Duration: 90 Min. Maximum Marks: 50

General instruction(s):
Answer All the Questions and calculator is allowed

Q. Question Max
No. Marks

1. a) Find GCD, variables S and T by construct a table for the following inputs using Extended Euclidean 5
Algorithm. 291, 41.

b) Find the remainder for 220 + 330 + 440 + 550 + 660 mod 7 using Fermat's Little Theorem. 5
2. A hoard of gold pieces comes into the possession of’ a band of 15 pirates. When they come to divide 10
up the coins, they find that 3 are left over. Their discussion of what to do with these extra coins
becomes animated, and by the time some semblance of order returns there remain only 7 pirates
capable of making an effective claim on the hoard. When, however, the hoard is divided between
these seven it is found that 2 pieces are left over. There ensues an unfortunate repetition of the earlier
disagreement, but this does at least have the consequence that the 4 pirates who remain are able to
divide up the hoard evenly between them. What is the minimum number of gold pieces which could
have been in the hoard?
3. Draw an architecture of RC4 algorithm and discuss the process of initialization, initial state permutation, key 10
stream generation and encryption in detail.

Architecture – 2
Initialization process - 2
Initial state permutation - 2
Key stream generation - 2
Encryption - 2

4. a) Explain the DES feistel structure in detail with neat diagram. 5


b) Answer the following questions about S-boxes in DES:

i) Show the result of passing the input 111111 through S-box 2. 5


ii) Show the result of passing the input 000000 through S-box 7.

S-box 2 Table

S-box 7 Table
i)

ii)

5. Find the third round key of AES 128 using the following second round key which is given in hexadecimal, S- 10
Box table and round constant 04.
Second Round Key
56 C7 76 A0
08 1A 43 3A
20 B1 55 F7
07 8F 69 FA

S-Box Table
Round 3 key:
D2 60 0D E7 15 7A BC 68 63 39 E9 01 C3 03 1E FB

You might also like