Scribd
Upload
5 views

Question Bank Module 3

This document is a question bank for the Cryptography and Information Security course at B.N.M. Institute of Technology. It includes a variety of questions covering key concepts such as Lagrange’s Theorem, the Chinese remainder theorem, RSA encryption, Diffie Hellman key exchange, and cryptographic hash properties. The questions are designed to assess understanding of both theoretical and practical aspects of cryptography.

Uploaded by

bhumika honnalli
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

Question Bank Module 3

This document is a question bank for the Cryptography and Information Security course at B.N.M. Institute of Technology. It includes a variety of questions covering key concepts such as Lagrange’s Theorem, the Chinese remainder theorem, RSA encryption, Diffie Hellman key exchange, and cryptographic hash properties. The questions are designed to assess understanding of both theoretical and practical aspects of cryptography.

Uploaded by

bhumika honnalli
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

B.N.M.

Institute of Technology
An Autonomous Institution under VTU
DEPARTMENT: Information Science & Engineering

Question Bank Module 3

Semester: VI
Course Name: Cryptography and Information Security (21ISE161)

1. Define the following: Lagrange’s Theorem, Euler’s Theorem and Fermat’s Little
Theorem
2. Check if 7 and 3 are generators of (Z*13,*13)
3. Using Lagrange’s theorem, find the orders of all the potential subgroups of the
following groups
a. G= (Z*12,*12)
b. G= (Z*19,*19)
4. Find all subgroups of the following groups
a. G= (Z*16,*16)
b. G= (Z*17,*17)
5. Explain the Chinese remainder theorem
6. Solve using Chinese remainder theorem
a. x  2 mod 3, x  3 mod 5, x  2 mod 7
b. x  4 mod 5, x  10 mod 11
7. What is Euler’s totient function?
8. The Miller–Rabin test can determine if a number is not prime but cannot determine
9. if a number is prime. How can such an algorithm be used to test for primality?
10. What is a primitive root of a number?
11. What is the difference between an index and a discrete logarithm?
12. Find all primitive roots of 37.
13. Given 5 as a primitive root of 23, construct a table of discrete logarithms
14. Explain the steps of encryption and decryption in RSA
15. Why does RSA work?
16. Explain the attacks on RSA
17. Explain how speed of secret key cryptography is combined with convenience of
public key cryptography
18. Explain PKCS #1
19. Perform encryption and decryption using the RSA algorithm for the following:
p = 3; q = 11, e = 7;M = 5
p = 5; q = 11, e = 3;M = 9
p = 7; q = 11, e = 17;M = 8
p = 11; q = 13, e = 11;M = 7
p = 17; q = 31, e = 7;M = 2
20. Exercise numerical problems Questions 8.7,8.5,8.3 on Diffie Hellman and El
Gamal
21. Explain Diffie Hellman key exchange protocol
22. Briefly describe man in the middle attack on Diffie Hellman key exchange
23. Explain the El Gamal encryption
24. Explain the properties of a cryptographic hash
25. Explain the attack complexity with respect to weak collision resistance and strong
collision resistance
26. Explain the construction of a general cryptographic hash
27. Explain SHA-1 with a neat diagram
28. Explain HMAC with a neat diagram
29. Briefly explain the steps in creation of digital signature
30. What is a Birthday Attack

You might also like