CSS Total Question Bank
CSS Total Question Bank
Subject: CSS
Question Bank
1. Introduction & Number Theory: (CO1)
1. List with examples the different mechanisms to achieve security.
2. Enlist security goals. Discuss their significance.
3. Define the goals of security and specify mechanisms to achieve each goal.
4. List and explain various types of attacks on encrypted message.
5. What are traditional ciphers? Discuss any one substitution and transposition
cipher with example. List their merits and demerits.
6. Explain with examples, keyed and keyless transposition ciphers.
7. Compare and contrast block and stream ciphers.
8. Encrypt the message “Cryptography is fun” with a multiplicative cipher with
key = 15. Decrypt to get back original plaintext.
9. Encrypt the plaintext message “SECURITY” using affine cipher with the key
pair (3, 7). Decrypt to get back original plaintext.
10. Encrypt the given message using Autokey cipher, key = 7 and the message is:
“The house is being sold tonight”.
11. Use the Play fair cipher with the keyword: “MEDICINE” to encipher the
message “The greatest wealth is health”.
12. Encrypt the string “This is an easy task” using a playfair cipher with key
“monarchy”.
13. Encrypt “The key is hidden under the door” using Playfair cipher with
keyword “domestic”.
14. Using the playfair cipher with the keyword : “Health” to encipher the message
“Life is full of Surprises”.
15. Use Hill cipher to encrypt the text “short”. The key to be used is “hill”.
16. Using the extended Euclidean algorithm, find the multiplicative inverse of
550 mod 1769. (Ans: 550)
17. Using Fermats’s theorem, find 3201 mod 11 (Ans: 3)
18. Using Chinese remainder theorem solve the following:
x ≡ 2(mod 3), x ≡ 3(mod 5), x ≡ 2(mod 7). Find x.
19. Define block ciphers. Explain with examples the CBC and ECB modes of
block ciphers.
20. Discuss in detail block cipher modes of operation.
21. Compare DES and AES. Which one is bit oriented? Which one is byte
oriented?
22. Explain DES, detailing the Feistel structure and S-block design.
23. Describe triple DES with two DES keys. Is man in the middle attack possible
on triple DES?
24. State the purpose of S-boxes in DES? Explain the avalanche effect?
25. Explain structure of DES wrt:
a. Fiestel structure and its significance
b. Significance of extra swap between left and right half blocks
c. Expansion
d. Significance of S-box
e. DES function
26. With reference to DES comment on the following:
a. Block size and key size
b. Need for expansion permutation
c. Avalanche and completeness effects
d. Weak keys and semi-weak keys
e. Role of S-box
27. Briefly define idea behind RSA and also explain
a. What is the one way function in this system?
b. What is the trap door in this?
c. Give public key and private key.
d. Describe security in this system.
28. Explain 3DES in short.
29. A and B want to use RSA to communicate securely. A chooses public key as
(7, 119) and B chooses public key as (13, 221). Calculate their private keys. A
wishes to send message m = 10 to B. Produce the ciphertext? Formulate the
key using which A encrypt the message “m” if A need to authenticate itself to
B?
30. In an RSA system the public key (e, n) of user A is defined as (7, 119).
Calculate Φn and private key d. Produce cipher text when you encrypt
message m = 10, using the private key?
31. In RSA system the public key of a given user e = 7 & n = 187.
a. Calculate the private key of this user?
b. If the intercepted CT = 11 and sent to a user whose public key e = 7 &
n = 187. Calculate the PT?
c. Elaborate various kinds of attacks on RSA algorithm.
32. If A and B wish to use RSA to communicate securely. A chooses public key
(e, n) as (7, 247) and B chooses public key (e, n) as (5, 221).
a. Calculate A’s private key
b. Calculate B’s private key
c. What will be the cipher text sent by A to B, if A wishes to send M=5 to
B.
33. A and B decide to use Diffie-Hellman algorithm to share a key. They choose p
= 23 and g = 5 as the public parameters. Their secret keys are 6 and 15
respectively. Compute the secret key that they share.
34. Users A and B use the Diffie-Hellman key exchange technique with a
common prime 71 and primitive root 7. Show that 7 is primitive root of 71. If
user A has private key x=5, what is A’s Public Key R1? If user B has private
key y=12, what is B’s public key R2? What is the shared secret key?
35. Explain man in the middle attack on Diffie Hellman. Explain how to
overcome the same.
36. Explain how a key is shared between two parties using Diffie Hellman key
exchange algorithm. What is the drawback of this algorithm?