Scribd
Upload
75 views3 pages

VL2023240500682 Da

The document is a digital assignment for a cryptography and network security course. It contains 6 questions testing students' knowledge of topics like: 1) determining greatest common divisors and relatively prime numbers, 2) using the extended Euclidean algorithm to find multiplicative inverses, 3) checking for primality using Miller-Rabin and applying Fermat's theorem, 4) using the Chinese Remainder Theorem, and 5) encrypting/decrypting messages using Hill cipher and Playfair cipher. It also contains questions on finding round keys for the DES and AES algorithms. Tables with details of the DES algorithm are provided as notes.

Uploaded by

kx.graphy
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
75 views3 pages

VL2023240500682 Da

The document is a digital assignment for a cryptography and network security course. It contains 6 questions testing students' knowledge of topics like: 1) determining greatest common divisors and relatively prime numbers, 2) using the extended Euclidean algorithm to find multiplicative inverses, 3) checking for primality using Miller-Rabin and applying Fermat's theorem, 4) using the Chinese Remainder Theorem, and 5) encrypting/decrypting messages using Hill cipher and Playfair cipher. It also contains questions on finding round keys for the DES and AES algorithms. Tables with details of the DES algorithm are provided as notes.

Uploaded by

kx.graphy
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/ 3

SCHOOL OF COMPUTER SCIENCE ENGINEERING

WINTER SEMESTER 2023-2024

Digital Assignment-1 Slot: E1 + TE1 Class: VL2023240500682

Programme Name & Branch: B. Tech (CSE)

Course Code & Title: BCSE309L-CRYPTOGRAPHY AND NETWORK SECURITY (TH)

Faculty Name: Dr. K. Murugan Maximum Marks: 20

ANSWER ALL THE QUESTIONS


S. No. Question Marks
1 Determine each of the following greatest common divisors. Which of the
pairs are relatively prime?
a. gcd(37, 3120).
b. gcd(24, 138). (2)
c. gcd(12378, 3054).
d. gcd(314, 159).
e. gcd(306, 657).
2 Using the extended Euclidean algorithm, find the multiplicative inverse of
a) 1234 mod 4321
b) 24140 mod 40902 (2)
c) 550 mod 1769

3 (a) Check 1719 for primality using Miller-Rabin Method


(2)
(b) Evalute3^21 mod 11 using Fermat’s theorem
4 State Chinese Remainder theorem and find X for the given set of congruent (2)
equations using CRT.
X=3 mod 7
X=3 mod 13
X=0 mod 12
5
a) Use Hill Cipher to encrypt and decrypt the message “ attack is
(4)
tonight ”
Key = 3 10 20
20 9 17 (3 X 3) MATRIX
9 4 17
b) Use the playfair cipher to encipher the message “The key is hidden
under the door pad”. The secret key can be made by filling the first
and part of the second row with the word “GUIDANCE” and filling the
rest of the matrix with the rest of the alphabet.

6 In DES Algorithm If the key with parity bit (64 bits) is 0123 ABCD 2562 1456, find
the first round key.
(4)

In AES algorithm Cipher key is (24 75 A2 B3 34 75 56 88 31 E2 12 00 13


AA 54 87)16 Find the 4 round key 128 bits.
(4)

NOTE:

DES ALGORITHM TABLE

Input Key

1 2 3 4 5 6 7 8
9 10 11 12 13 14 15 16
17 18 19 20 21 22 23 24
25 26 27 28 29 30 31 32
33 34 35 36 37 38 39 40
41 42 43 44 45 46 47 48
49 50 51 52 53 54 55 56
57 58 59 60 61 62 63 64

Permuted Choice one (PC-1)

57 49 41 33 25 17 9
1 58 50 42 34 26 18
10 2 59 51 43 35 27
19 11 3 60 52 44 36
63 55 47 39 31 23 15
7 62 54 46 38 30 22
14 6 61 53 45 37 29
21 13 5 28 20 12 4

Permuted Choice two (PC-2)

14 17 11 24 1 5 3 28
15 6 21 10 23 19 12 4
26 8 16 7 27 20 13 2
41 52 31 37 47 55 30 40
51 45 33 48 44 49 39 56
34 53 46 42 50 36 29 32

Schedule of Left Shifts

Round 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
Number
Bits 1 1 2 2 2 2 2 2 1 2 2 2 2 2 2 1
Rotated

You might also like