SURYA GROUP OF INSTITUTIONS
SCHOOL OF ENGINEERING & TECHNOLOGY
Vikiravandi – Villupuram
Department of Computer Science & Engineering
---------------------------------------------------------------------------------------------------------------------------------------
Subject Code / Subject : CB3491/ CRYPTOGRAPHY AND CYBER SECURITY
Year / Semester : III/ VI Unit Number : 3
PART - A
1. What is public key cryptography?
2. What is the difference between symmetric key cryptography and public key cryptography
3. Define primitive root
4. State Fermat‟s theorem
5. Name any 2 methods for testing prime numbers.
6. Define Euler‟s totient function.
7. State Euler‟s theorem.
8. State alternative form of Fermat‟s theorem with example.
9. State alternative form of Fermat‟s theorem with example.
10. List the 6 ingredients of public key encryption.
11. Perform encryption for the plaintext M=88 using the RSA algorithm P=17, q=11 and public component
e=7
12. Perform encryption and decryption using the RSA algorithm for the following.
P=7, q=11, e=17 and M=8
13. List the 5 possible approaches to attacking the RSA algorithm
14. Define discrete logarithm
15. What is the principal attraction of ECC, compared to RSA? (Dec 2021)
16. What is an ellipse curve?
17. Give the significance of key control
18. Why is asymmetric cryptography bad for huge data? Specify the reasons
19. Give the applications of the public key crypto system
20. What is the use of Fermat‟s theorem
21. Define primality testing.
22. State whether symmetric and asymmetric cryptography algorithm needs key exchange
23. Using Fermat‟s theorem find 5201 and mod 41
24. Find the GCD of (2740, 1760) using Euclid‟s Algorithm.
25. For p = 11 and q = 19 and choose d = 17. Apply RSA algorithm where Cipher message= 80 and thus
find the plain text.
26. What is meet in the Middle Attack?
PART - B
1. State Chinese Remainder Theorem and find X for the given set of congruent equations using CRT
i. X = 2 (mod 3)
ii. X = 3 (mod 5)
iii. X = 2 (mod 7)
2. State and prove Fermat‟s theorem.
3. Explain RSA algorithm, perform encryption and decryption to the system with p=7, q=11, e=17,
M=8
4. Users Alice and Bob use the Diffie-Hellman key exchange technique with a common prime q=83 and a
primitive root α=5.
i. If Alice has a private key XA=6, what is Alice‟s public key YA?
ii. If Bob has a private key XB=10, what is Bob‟s public key YB?
iii. What is the shared secret key?
5. State Chinese Remainder Theorem and find X for the given set of congruent equations using CRT (Dec
2020) X=1 (mod 5) X=2 (mod 7) X=3 (mod 9) X=4 (mod 11)
6. Explain Diffie-Hellman key exchange algorithm in detail
7. Perform encryption and decryption using RSA algorithm for p=17, q=11, e=7 and u=88
8. Why ECC is better than RSA? However, why is it not widely used? Defend it.
9. State and prove Chinese remainder theorem. What are the last two digits of 4919?
10. (ii) With a neat sketch explain the Elliptic curve cryptography with an example (8)
11. (ii) Alice and Bob use the Diffie – Hellman key exchange technique with a common prime number 11
and a primitive root of 2. If Alice and Bob choose distinct secret integers as 9 and 3, respectively, then
compute the shared secret key. (5) (Dec 2020)
12. Describe RSA algorithm & Perform encryption and decryption using RSA algorithm for the following:
p=7, q=11, e=7, M=9
13. Explain briefly about Diffie-Hellman key exchange algorithm with its merits and demerits.
14. Explain public key cryptography and when it is preferred?
15. Explain the working of RSA and chose an application of your choice for RSA and explain How
encryption and decryption is carried out?
16. Prove Fermat‟s theorem and Euler’s theorem Demonstrate encryption and decryption for the RSA
algorithm: Parameters – p=3, q=11, e=7, d=?, M=5
17. Demonstrate encryption and decryption for the RSA algorithm: Parameters – p=7, q=13, e=5, d=?,
M=10
18. In a public-key system using RSA, you intercept the ciphertext C = 10 sent to a user whose public key is
e = 5, n = 35. What is the plaintext M.
19. Given prime number q=17, Primitive root a=6, private key of A, XA =5, message m=13, random
number k=10. Perform encryption & decryption using Elgamal cryptosystem.