0% found this document useful (0 votes)
12 views3 pages

22CS552 Model QP Oct 2024

This document is a model question paper for a Cryptography and Network Security course at JSS Science and Technology University. It includes compulsory questions in Part A and optional questions in Part B, covering topics such as symmetric key ciphers, cryptanalysis attacks, Elgamal cryptosystem, and RSA algorithm. The paper assesses various course outcomes related to cryptographic principles, algorithms, and security issues in networking.
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
0% found this document useful (0 votes)
12 views3 pages

22CS552 Model QP Oct 2024

This document is a model question paper for a Cryptography and Network Security course at JSS Science and Technology University. It includes compulsory questions in Part A and optional questions in Part B, covering topics such as symmetric key ciphers, cryptanalysis attacks, Elgamal cryptosystem, and RSA algorithm. The paper assesses various course outcomes related to cryptographic principles, algorithms, and security issues in networking.
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

USN 22CS552

JSS MAHAVIDYAPEETHA
JSS SCIENCE AND TECHNOLOGY UNIVERSITY, MYSURU
V Semester BE
Model Question Paper
Department of Computer Science and Engineering
CRYPTOGRAPHY AND NETWORK SECURITY
Duration: 3 Hours Max. Marks:100

NOTE: NOTE: PART- A Questions are Compulsory.


PART- B has Internal Choice.
PART – A

Q.NO CO CD PI QUESTION MARKS

CO1 L1 List and define different security services and


1. 1.1.1 10
security mechanisms.

Briefly explain the Symmetric key ciphers and


2. CO2 L2 1.1.1 10
different cryptanalysis attacks.

With necessary diagram explain the Elgamal


3. CO3 L2 1.3.1 10
cryptosystem.

With necessary diagram explain the Needham


4. CO4 L2 1.3.1 10
Schroeder Protocol.

With necessary diagrams write a note on Pretty


5. CO5 L2 1.3.1 10
Good Privacy(PGP).

PART – B

Q.NO CO CD PI QUESTION MARKS


Explain Extended Euclidean algorithm.
6 CO1 L3 1.1.1 Using Extended Euclidean algorithm, Find GCD of 10
(270 and 192).

OR

Explain cryptanalytic and non-cryptanalytic


7 CO1 L2 1.1.1 10
attacks.

With necessary diagram explain the architecture of


8 CO2 L2 1.1.1 10
DES crypto system and key generation system.

Page 1 of 3
USN 22CS552

OR

With necessary diagram, explain the working of


9 CO2 L2 1.1.1 10
AES encryption and decryption process.

Briefly describe the RSA algorithm. Evaluate the


10 CO3 L3 1.3.1 RSA algorithm for the values P=7, Q=11, e=13 10
and; M=5. Perform both encryption and decryption.

OR

With necessary diagram explain the ECC


11 CO3 L2 1.3.1 10
algorithm.

Explain different criteria’s/properties of


12 CO4 L2 1.3.1 cryptographic hash function with necessary block 10
diagram.

OR

Explain types of authentication with necessary


13 CO4 L2 1.3.1 10
diagrams.

With necessary diagrams write a note on Secure


14 CO5 L2 1.3.1 10
Socket Layer (SSL) Protocol.

OR

15 CO5 L2 1.3.1 With necessary diagrams write a note on S/MIME. 10

Course Outcome (CO):

CO–1 Explain basic cryptographic principles, and mathematics


involved.
CO–2 Illustrate algorithms related to the Secret Key cryptography.

CO–3 Illustrate algorithms related to the Public Key cryptography.


Explain the authentication and Key management activities.
CO–4

CO–5 Analyze issues related to security in Network, Transport and


Application Layer.

Page 2 of 3
USN 22CS552

Performance Indicator (PI):


1.1.1 Apply the knowledge of discrete structures, linear algebra, statistics,
numerical techniques and theoretical computer science to solve
problems.
1.3.1 Apply engineering fundamentals.

Cognitive Domains
L1 Remember
L2 Understand
L3 Apply
L4 Analyze

--- End ---

Page 3 of 3

You might also like