Scribd
Upload
13 views2 pages

Cryptography & Network Security Question Bank

The document is a question bank for the Cryptography and Network Security course at Maharaja Institute of Technology Mysore, focusing on Modules 2 and 3. It includes various tasks such as applying the RSA encryption algorithm, evaluating Diffie-Hellman key exchanges, discussing elliptic curve cryptography, and summarizing X.509 standards. Additionally, it covers topics like secret key distribution, man-in-the-middle attacks, and digital signatures.

Uploaded by

nisargadc714
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
13 views2 pages

Cryptography & Network Security Question Bank

The document is a question bank for the Cryptography and Network Security course at Maharaja Institute of Technology Mysore, focusing on Modules 2 and 3. It includes various tasks such as applying the RSA encryption algorithm, evaluating Diffie-Hellman key exchanges, discussing elliptic curve cryptography, and summarizing X.509 standards. Additionally, it covers topics like secret key distribution, man-in-the-middle attacks, and digital signatures.

Uploaded by

nisargadc714
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

Maharaja Institute of Technology Mysore

Department of Computer Science & Engineering (Data Science)


Section: 7th (ODD) 2024-25

Question Bank
CRYPTOGRAPHY & NETWORK SECURITY
Module 2 & 3
Apply the RSA encryption algorithm using the parameters P = 3, Q = 11, e 10 (L3)
1
= 3, and plaintext message M = 9 to perform the encryption process.
Apply the RSA encryption algorithm using the parameters P = 7, Q = 11, e 10(L3)
2
= 7, and plaintext message M = 88 to perform the encryption process.
Evaluate a Diffie-Hellman Key exchange concept for prime number q=71
and primitive root α = 7.
3
a. If user A has private key XA = 5, What is A’s Public key YA = ?
b. If user B has private key XB = 12, What is B’s Public key YB = ? 10(L3)
c. What is shared key?
Evaluate a Diffie-Hellman Key exchange concept for prime number q=7
and primitive root α = 5.
4
a. If user A has private key XA = 3, What is A’s Public key YA = ?
b. If user B has private key XB = 4, What is B’s Public key YB = ? 10(L3)
c. What is shared key?
Compare how Diffie – Hellman key exchange algorithm useful in 10(L3)
5
evaluating man-in-middle attack concept.
Discuss elliptic curve cryptography for analog of Diffie – Hellman key 10(L3)
6
exchange and explain with neat steps.
Apply the distribution of public key with respect to directory, authority and 10(L3)
7
certificate. page 18

Illustrate secret key distribution with Message authentication and


8 confidentiality. pg 16 10(L2)

Summarize X.509 standards? Explain the structure of X.509 certificate 10(L3)


9
with neat diagram. pg 21
With a figure, bring out the relationship among key elements of PKIX 10(L3)
10.
model. pg 28

Demonstrate on:

11 1. PKIX Management Functions


2. PKIX management Protocols 10(L2)

Explain why man-in-the-middle attacks are ineffective on the secret key 10(L3)
12
distribution protocol with neat diagram.

13 Explain the process of generating a user certificate by a Certification 10(L3)


Authority (CA) and describe how certificate revocation is carried out
Apply the Symmetric key distribution using symmetric encryption with 10(L3)
14
respect to Key Distribution Scenario, Transparent key control scheme.
Demonstrate on:
15
1. Two Simple Hash Functions 10(L2)
2. Digital Signatures

You might also like