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

CCS Model Exam Paper - Cryptography

The document outlines the model examination for the Cryptography & Cyber Security course at Arasu Engineering College, detailing the structure, course outcomes, and types of questions included. It assesses both lower and higher order thinking skills through various parts, including multiple-choice questions and detailed problem-solving tasks. The examination covers key concepts such as encryption techniques, security architectures, and cyber crimes.

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)
66 views5 pages

CCS Model Exam Paper - Cryptography

The document outlines the model examination for the Cryptography & Cyber Security course at Arasu Engineering College, detailing the structure, course outcomes, and types of questions included. It assesses both lower and higher order thinking skills through various parts, including multiple-choice questions and detailed problem-solving tasks. The examination covers key concepts such as encryption techniques, security architectures, and cyber crimes.

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-‘A’ Max. Marks: 100
Sub. Code & Name: CB3491- Cryptography & Cyber Security
Date & Session : 12.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. Encrypt the plaintext ‘tobeornottobe’ using the vigenere cipher for the key [CO1, LOT, K3]
value ‘now’.
2. Why is asymmetric cryptography bad for handling huge data? Specify the [CO1, LOT, K2]
reason.
3. Find the gcd(2749,1760) using Euclidean Algorithm. [CO2, LOT, K3]
4. Compare DES and AES. [CO2, LOT, K2]
5. Using Fermat’s Theorem, check whether 19 is a prime or not. Consider a is [CO3, LOT, K3]
7.
6. Why RSA is secure? [CO3, LOT, K1]
7. What are the security services provided by digital signature? [CO4, LOT, K1]
8. Differentiate Kerberos version 4 and version 5. [CO4, LOT, K2]
9. Define spyware. [CO5, LOT, K1]
10. What are the classifications of cyber crimes? [CO5, LOT, K1]
Part – B (5 X 13 = 65 Marks)

11.a. Describe OSI security architecture and derive a relativity matrix between [CO1,HOT,K6]
security attacks, services and mechanisms.
(or)
b. Discuss any four substitution techniques and list their merits and [CO1,HOT,K6]
demerits.

12.a. Perform SDES encryption with neat sketch. [CO2,HOT,K5]


(or)
b. Explain the block cipher mode of operation with a neat sketch. [CO2,HOT,K5]

13.a. Perform encryption and decryption using RSA algorithm and identify the [CO3,HOT,K5]
possible threats and counter measures of the algorithm.
(or)
b. Write about Elliptic Curve Architecture in detail and explain how they are [CO3,HOT,K5]
useful for cryptography.

14.a. What is a Digital Signature? Explain the key generation, signing and [CO4,HOT,K5]
signature verification of the algorithm. Bring out the steps for creating a
digital signature.
(or)
b. Explain the Secure Hash Algorithm (SHA). [CO4,HOT,K5]

15.a. Explain the cyber crime and information security. [CO5,HOT,K5]


(or)
b. Elaborate the concept of Network Access Control (NAC). [CO5,HOT,K5]

Part – C (1 X 15 = 15 Marks)

16.a. Examine the Kerberos authentication mechanism with suitable diagrams. [CO4, HOT, K5]
(or)

b. Explain classical encryption technique with symmetric cipher and hill [CO1, HOT, K5]
cipher model.
SET-02
Roll No.
ARASU ENGINEERING COLLEGE, KUMBAKONAM-612 501 DEPARTMENT
OF COMPUTER SCIENCE AND ENGINEERING

MODEL EXAMINATION
Year/Sem/Branch : III /V/CSE-‘A’ Max. Marks: 100
Sub. Code & Name: CB3491- Cryptography & Cyber Security
Date & Session : 12.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. Differentiate passive attack from active attack with an example. [CO1, LOT, K2]
2. Define Brute force attack. [CO1, LOT, K1]
3. Find the gcd(24140,16762) using Euclid’s algorithm. [CO2, LOT, K3]
4. What is an Avalanche effect? [CO2, LOT, K1]
5. State Fermat’s theorem. [CO3, LOT, K1]
6. Compute encryption and decryption using RSA algorithm for the following [CO3, LOT, K3]
data.
p=7, q=11, e=17 and M=8.
7. What are the two approaches of digital signature? [CO4, LOT, K1]
8. How can public keys be distributed? [CO4, LOT, K1]
9. Illustrate the security life cycle with neat sketch. [CO5, LOT, K3]
10. What are the security concerns and dangers associated with cloud security? [CO5, LOT, K1]
Part – B (5 X 13 = 65 Marks)

11.a. Perform encryption and decryption for the message “attack” using hill [CO1,HOT,K6]
cipher technique with the key value K.

(or)
b.(i) Give a detailed explanation of Feistel Structure. (7) [CO1,HOT,K5]

(ii) Examine the examples of substitution and transposition strategies. (6) [CO1,HOT,K3]

12.a (i) Illustrate the Extended Euclidean Algorithm with an example. (6) [CO2,HOT,K3]

(ii) Outline the functionality diagram of Data Encryption Standard with (7) [CO2,HOT,K4]
number of bits in each flow of data.
(or)
b. Discuss the properties that are satisfied by groups, rings and fields. [CO2,HOT,K5]

13.a (i) Justify that Euler’s totient value for a prime number (p) is p-1 and for a (7) [CO3,HOT,K5]
non prime number (n) is (p-1)×(q-1), where p×q are prime factor of n.
(ii) Compare and contrast symmetric and asymmetric key cryptography. (6) [CO3,HOT,K4]
(or)
b. User Alice and Bob use the Diffie-Hellman key exchange technique, and [CO3,HOT,K4]
chooses a common prime number q=11 and a primitive root alpha=7.
i) If user Alice has a private key X A=3. What is Alice’s public key (4)
YA?
ii) If user Bob has a private key XB=6. What is Bob’s public key YB? (4)
iii) What is the shared secret key? Write the Algorithm. (5)

14.a(i) Compare the applications of the Hash Function and Message (7) [CO4,HOT,K4]
Authentication code (MAC). Illustrate them with the relevant diagrams.
(ii) Write down the steps involved in Schnorr Digital Signature scheme. (6) [CO4,HOT,K4]
(or)
b. Explain ElGamal public key cryptosystems with an example. [CO4,HOT,K5]

15.a. Discuss the categories of cyber crimes. [CO5,HOT,K6]


(or)
b. Briefly describe the web and cloud security. [CO5,HOT,K6]
Part – C (1 X 15 = 15 Marks)

16.a. Explain OSI security architecture model with neat diagram. [CO1, HOT, K5]
(or)
b. Define RSA algorithm with an example. List the counter measures and [CO3, HOT, K4]
potential risks of the RSA algorithm.

Common questions

Powered by AI

Symmetric key cryptography uses a single shared key for both encryption and decryption, making it faster and less computationally intensive. It is suitable for encrypting large volumes of data. Asymmetric key cryptography uses a pair of keys (public and private) for encryption and decryption, providing secure key distribution and digital signatures. It is better suited for secure key exchanges and authentication due to its ability to keep the private key secret while distributing the public key openly .

The Euclidean Algorithm is used to find the greatest common divisor (GCD) of two integers, which is fundamental for operations like calculating multiplicative inverses in modular arithmetic. It is particularly important in public key cryptography, such as RSA, where determining co-prime numbers is essential for key generation. Efficiently computing the GCD ensures robust cryptographic processes and operations .

RSA ensures data security by using a pair of keys, where the public key encrypts data and the private key decrypts it. The security of RSA relies on the difficulty of factoring large composite numbers into their prime factors. Potential vulnerabilities include weak key generation, side-channel attacks, and the risk of discovering the private key if the two prime numbers are not sufficiently large or randomly selected .

Cloud computing environments face challenges such as data breaches, insufficient access management, insecure APIs, data loss, and account hijacking. The shared infrastructure can also lead to concerns about data privacy and compliance with regulations. A lack of direct control over data storage and processing poses additional security risks and requires robust security strategies and continuous monitoring .

The OSI security architecture provides a framework for understanding and designing security services and mechanisms needed to protect data networks. It integrates with security services by defining the security requirements (e.g., confidentiality, integrity, availability) and mechanisms (e.g., encryption, digital signatures) to defend against various security attacks (e.g., interception, modification). The architecture helps in identifying potential vulnerabilities across different layers of the network stack, enabling targeted security measures .

Substitution techniques enhance security by replacing elements of plaintext with ciphertext elements according to a defined system, making recognition by unauthorized parties difficult. Each substitution method varies in complexity, such as simple character substitutions or more advanced systems like the Vigenère cipher, which uses multiple alphabets. These techniques obscure patterns in the plaintext, making it harder for attackers to decipher without knowledge of the specific substitution system used .

Kerberos version 5 improved upon version 4 by introducing support for multiple encryption types, allowing for better integration with various security systems. It also improved message integrity mechanisms, introduced timestamps to prevent replay attacks, and enhanced cross-realm authentication capabilities, providing more robust and flexible security management .

The Avalanche effect is crucial because it ensures that a small change in the input (e.g., a single bit) results in a significant and unpredictable change in the output. This property makes it difficult for attackers to detect patterns or derive meaningful information from encrypted data, thereby enhancing the security of cryptographic algorithms .

Digital signatures provide authentication by verifying the identity of the sender. They ensure data integrity by allowing recipients to confirm that the data has not been altered in transit. Non-repudiation is achieved because the sender cannot deny originating the message, as the digital signature is unique to them and created using their private key, which only they possess .

Asymmetric cryptography is inefficient for large data volumes due to its computational complexity and slower processing speed compared to symmetric cryptography. The algorithms typically involve resource-intensive mathematical operations, making them suitable for encrypting smaller pieces of data, such as keys for symmetric encryption, rather than bulk data .

You might also like