Scribd
Upload
28 views11 pages

CSE2221 Cryptography Solution

This document outlines the Even Semester Mid Term Examination for the BTech - CSE program, focusing on Cryptography. It includes various sections with questions on security attacks, ciphers, key spaces, and encryption algorithms such as RSA and AES. The exam is structured to assess students' understanding of cryptographic principles and their applications.

Uploaded by

megav369
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
28 views11 pages

CSE2221 Cryptography Solution

This document outlines the Even Semester Mid Term Examination for the BTech - CSE program, focusing on Cryptography. It includes various sections with questions on security attacks, ciphers, key spaces, and encryption algorithms such as RSA and AES. The exam is structured to assess students' understanding of cryptographic principles and their applications.

Uploaded by

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

Name:

Enrolment No:

Even Semester Mid Term Examination, March 2025


Faculty of Science, Technology and Architecture, School of CSE and IT
Department of Computer Science and Engineering
BTech - CSE
Course Code: CSE2221 Course: Cryptography Semester:
IV
Time: 1.5 hrs. Max. Marks: 30
Instructions: All questions are compulsory. Missing data, if any, may be assumed suitably.
Calculator is allowed.
SECTION A
S.No. CO
Distinguish between passive and active security attacks with example.

Passive and Active Security Attacks

1. Passive Attack: The attacker intercepts or monitors communication without altering


Q A1 the data. The goal is to gather information without detection. [2] CO1
o Example: Eavesdropping on network traffic, Traffic Analysis. [1 Mark]
2. Active Attack: The attacker modifies, disrupts, or injects malicious data into
communication. The goal is to alter or damage information.
o Example: Man-in-the-Middle (MITM) attack [1 Mark]

What is the key space for the following ciphers?


i. Affine cipher
Q A2 26 * 12 [1 Mark] [2] CO1
ii. Monoalphabetic substitution cipher
26! [1 Mark]
Use Fermat theorem to find the result of 515 mod 13.
As per Fermat theorem
Q A3 ap−1 ≡ 1 mod p [2] CO2
so, 512 = 1 mod 13 [1 Mark]
512 * 125 = 8 mod 13. [1 Mark]
SECTION B
Encrypt the message “hail” using Hill cipher with the following encryption key, K. Also, find
the decryption key.
Q B1 03 02 [4] CO1
K= 05 07
What are the four weak keys in DES? Why are these DES keys considered weak?
The four weak keys in the Data Encryption Standard (DES) are:
1. 0x0101010101010101
2. 0xFEFEFEFEFEFEFEFE
3. 0xE0E0E0E0F1F1F1F1
4. 0x1F1F1F1F0E0E0E0E [2 Marks]
Why are these keys considered weak?
Weak keys in DES have properties that make them highly vulnerable to cryptanalysis:
1. They produce the same subkeys for all 16 rounds
o DES generates 16 subkeys from the main key, which are used in different
rounds of encryption. Weak keys produce identical or highly correlated
Q B2 subkeys, reducing the complexity of brute-force attacks. [1 mark] [4] CO3
2. They result in encryption that behaves like decryption
o Encrypting a plaintext with a weak key and then encrypting the result again
with the same weak key returns the original plaintext. This is due to the
structure of DES, making these keys behave like an involution. [1 mark]
3. They lead to a significant reduction in security
o Normally, DES keys should create a highly unpredictable transformation of
data, but weak keys reduce the effectiveness of encryption by simplifying the
transformation.
These weak keys are rare (only 4 out of 2562^{56} possible keys), but they are still an
important consideration when implementing DES-based cryptographic systems.

Q B3 Perform encryption and decryption using the RSA algorithm for p = 17; q = 31, e = 7; M = 2. [4] CO4
Consider a Diffie-Hellman scheme with a common prime q = 11 and a primitive root a= 2.
a. Show that 2 is a primitive root of 11.
b. If user A has public key, YA = 7, what is A's private key, XA?
c. If user B has public key, YB = 3, what is the shared secret key, K shared with A?

Q B4 [4] CO4
SECTION-C
Use Simplified AES algorithm to encrypt 16-bit plaintext 0101 1011 1110 0100 with the
round keys given as follows.
CO2
Q C1 Key0 = 0100 1010 1111 0101 [8]
CO3
Key1 = 1101 1101 0010 1000
Key2 = 1000 0111 1010 1111

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy