0% found this document useful (0 votes)
34 views5 pages

Model Exam: Cryptography & Cyber Security

The document outlines a model examination for a Cryptography & Cyber Security course at Arasu Engineering College, detailing the assessment of course outcomes through various question types. It includes sections for lower and higher order thinking questions, covering topics such as encryption algorithms, cyber crimes, and security mechanisms. The exam is structured into three parts, with a total of 100 marks available.

Uploaded by

revicse
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
34 views5 pages

Model Exam: Cryptography & Cyber Security

The document outlines a model examination for a Cryptography & Cyber Security course at Arasu Engineering College, detailing the assessment of course outcomes through various question types. It includes sections for lower and higher order thinking questions, covering topics such as encryption algorithms, cyber crimes, and security mechanisms. The exam is structured into three parts, with a total of 100 marks available.

Uploaded by

revicse
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

SET-01

Roll No.
ARASU ENGINEERING COLLEGE, KUMBAKONAM-612 501 DEPARTMENT
OF COMPUTER SCIENCE AND ENGINEERING

MODEL EXAMINATION
Year/Sem/Branch : III /V/CSE-‘B’ Max. Marks: 100
Sub. Code & Name: CB3491- Cryptography & Cyber Security
Date & Session : 16.11.2024 & AN Duration : 3 hours
The Model Examination is used to assess the course outcomes CO1 to CO5, Lower Order Thinking (LOT) and
Higher Order Thinking (HOT) of the course.

K1 – Remembering K2 – Understanding. K3 – Applying.


K4 – Analyzing. K5 – Evaluating. K6 – Creating

COURSE COURSE OUTCOMES (COs)


CODE

C303.1 Understand the fundamentals of networks security, security architecture,


threats and vulnerabilities
C303.2 Apply the different cryptographic operations of symmetric cryptographic
algorithms
C303.3 Apply the different cryptographic operations of public key cryptography
Apply the various Authentication schemes to simulate different
C303.4
applications.
C303.5 Understand various cyber crimes and cyber security.

Answer all the questions


Part- A (10 X 2 = 20 Marks)

1. What is an active attack? Give an example. [CO1, LOT, K1]


2. What are the two basic functions used in encryption algorithm? [CO1, LOT, K1]
3. What types of attacks are addressed by DES algorithm? [CO2, LOT, K1]
4. State few applications of RC4 algorithm. [CO2, LOT, K1]
5. Apply RSA Algorithm where cipher message=80, p=11, q=19, d=17 and [CO3, LOT, K3]
thus find the plain text.
6. Find 117 mod 13. [CO3, LOT, K3]
7. List the applications of X.509 Certificate. [CO4, LOT, K1]
8. How digital signatures differ from authentication protocols? [CO4, LOT, K2]
9. What is a proxy server? [CO5, LOT, K1]
10. What is password sniffing? [CO5, LOT, K1]
Part – B (5 X 13 = 65 Marks)

11.a. Explain in about transposition technique in detail. [CO1,HOT,K5]


(or)
b. What is steganography? Describe the various techniques used in [CO1,HOT,K6]
steganography.

12.a. Discuss the properties that are satisfied by groups, rings and fields. [CO2,HOT,K6]
(or)
b. Explain AES algorithm with all its round functions in detail. [CO2,HOT,K5]

13.a. State Chinese Remainder theorem and find the value of X for the given set [CO3,HOT,K5]
of congruent equations using the theorem.
X ≡1(mod 5)
X ≡2(mod 7)
X ≡3(mod 9)
(or)
b. User A and B use the Diffie-Hellman key exchange technique, and [CO3,HOT,K5]
chooses a common prime number q=11 and a primitive root alpha=7.
i) If user A has private key XA=3. What is A’s public key YA? (4)
ii) If B has private key XB=6. What is B’s public key YB? (4)
iii) What is the Shared secret key? Write the algorithm. (5)

14.a. Compare the uses of MAC and Hash Function. Represent them using [CO4,HOT,K4]
appropriate diagrams.
(or)
b. Explain ElGamal public key cryptosystems with an example. [CO4,HOT,K5]

15.a. Explain the classification of cyber crimes. [CO5,HOT,K5]


(or)
b. Write a short note on cloud security. List out the challenges and risks in [CO5,HOT,K5]
cloud security.

Part – C (1 X 15 = 15 Marks)

16.a. Explain OSI security architecture model with a neat diagram. [CO1, HOT, K5]
(or)

b. Explain the design principles of block cipher and its modes of operation. [CO2, HOT, K5]
SET-02
Roll No.
ARASU ENGINEERING COLLEGE, KUMBAKONAM-612 501 DEPARTMENT
OF COMPUTER SCIENCE AND ENGINEERING

MODEL EXAMINATION
Year/Sem/Branch : III /V/CSE-‘B’ Max. Marks: 100
Sub. Code & Name: CB3491- Cryptography & Cyber Security
Date & Session : 16.11.2024 & AN Duration : 3 hours
The Model Examination is used to assess the course outcomes CO1 to CO5, Lower Order Thinking (LOT) and
Higher Order Thinking (HOT) of the course.

K1 – Remembering K2 – Understanding. K3 – Applying.


K4 – Analyzing. K5 – Evaluating. K6 – Creating

COURSE COURSE OUTCOMES (COs)


CODE

C303.1 Understand the fundamentals of networks security, security architecture,


threats and vulnerabilities
C303.2 Apply the different cryptographic operations of symmetric cryptographic
algorithms
C303.3 Apply the different cryptographic operations of public key cryptography
Apply the various Authentication schemes to simulate different
C303.4
applications.
C303.5 Understand various cyber crimes and cyber security.

Answer all the questions


Part- A (10 X 2 = 20 Marks)

1. Define Cryptography. [CO1, LOT, K1]


2. Compare block and stream cipher. [CO1, LOT, K2]
3. Explain the strength of triple DES. [CO2, LOT, K1]
4. What is Key-Distribution Center? [CO2, LOT, K1]
5. Illustrate the purpose of Diffie Hellman key exchange. [CO3, LOT, K3]
6. Are strong primes necessary in RSA? Justify. [CO3, LOT, K2]
7. Show the significance of signature function in Digital Signature [CO4, LOT, K2]
Standard (DSS) approach.
8. Summarize the classes of message authentication function. [CO4, LOT, K2]
9. What is SQL injection? [CO5, LOT, K1]
10. Differentiate Botnets and Zombies. [CO5, LOT, K2]
Part – B (5 X 13 = 65 Marks)

11.a. Compute encryption and decryption using hill cipher for the following. [CO1,HOT,K3]
Message: PEN and Key: ACTIVATED
(or)
b. i) Discuss the various security mechanisms. (7) [CO1,HOT,K6]
ii) Explain OSI security architecture model with neat diagram. (6) [CO1,HOT,K5]

12.a. Explain the following modes of operation in block cipher. [CO2,HOT,K5]


i) Electronic code book and Cipher block chaining. (7)
ii) Cipher feedback mode and output feedback mode. (6)
(or)
b. Discuss the Structure of Simplified DES (S-DES) and Reverse Cipher. [CO2,HOT,K6]

13.a. i) Discuss how discrete logarithm is evaluated for a number? What is the [CO3,HOT,K6]
role of discrete log in the Diffie - Hellman key exchange in exchanging the
secret key among two users? (7)
ii) What are elliptic curves? Discuss how the elliptic curves are useful for
cryptography? (6) [CO3,HOT,K6]
(or)
b. i) Describe RSA algorithm (6) [CO3,HOT,K5]
ii) Perform encryption and decryption using RSA algorithm for the following [CO3,HOT,K3]
values p=7 q=11, e=7, M=9. (7)

14.a. What is Digital Signature? Explain how it is created at the sender end and [CO4,HOT,K5]
retrieved at the receiver end. Differentiate digital signature from digital
certificate.
(or)
b. With a neat diagram, explain the steps involved in SHA algorithm for [CO4,HOT,K5]
128
encrypting a message with maximum length of < 2 bits and produces an
output of 512-bit message digest.

15.a. Elaborate the concept of Network Access Control (NAC). [CO5,HOT,K6]


(or)
b. Discuss the various tools and mechanisms used in cyber security. [CO5,HOT,K6]
Part – C (1 X 15 = 15 Marks)

16.a. i) Explain Kerberos version 5. Elaborate the environmental shortcomings [CO4, HOT, K6]
and technical deficiencies of Kerberos version 4. (8)
ii) Elaborate how the encryption key is generated from the password in
Kerberos. (7) [CO4, HOT, K6]
(or)
b. Find the secret key shared between user A and user B using Diffie- [CO3, HOT, K3]
Hellman Algorithm for the following values q=353; α (primitive root) =3,
XA=45 and XB=50.

You might also like