Question Bank Information and Network Security (15CS743)

INFORMATION AND NETWORK SECURITY

Subject Code: 15CS743 I.A. Marks: 20
Hours/Week: 04 Exam Hours: 03
Total Hours: 40 Exam Marks: 80

QUESTION BANK

Module-1: Introduction

1. Explain the terms

a) Cryptology
b) Cryptography
c) Cryptanalysis

2. With an example explain simple substitution cipher.

3. Given the Caesar’s cipher find the plain text from the cipher text DQWUDUHSVSRQJERHER
4. How does Vigenere cipher work? Give an example.
5. Define the terms confusion and diffusion in the context of cryptology.
6. How does a forward search attack work against a public key cryptosystem.
7. Define exhaustive key search.
8. Explain in detail double transposition cipher.
9. Explain the three broad categories of ciphers.
10. Explain cipher text and plain text attack. Give examples.
11. Define kreckhoff’s principle.
12. Outline an automated attack on a double transposition cipher assuming that the size of matrix is
known.
13. Encrypt the message we are all together using a double transposition cipher (of the type described in
the text) with 4 rows and 4 columns, using the row permutation (1,2,3,4)—> (2,4,1,3) and the column
permutation (1,2,3,4)—* (3,1,2,4).

Module-2: Hash Function

1. What is a cryptographic hash function?
2. Explain the cryptographic hash functions MD5 and SHA-1?
3. Consider a CRC that uses the divisor 10011. Find two collisions with 10101011, that is, find two other
data values that produce the same CRC checksum as 10101011.
4. Write a short note on HMAC.
5. Explain the uses of hash functions.
6. What is a forward search attack on public key encryption, and how is it prevented?
7. How can you prevent a forward search attack on a hash function?
8. What are random numbers? Why is it required to generate symmetric keys?
9. Discuss the two aspects of information hiding.

1
Question Bank Information and Network Security (15CS743)

10. Where are random numbers used in symmetric key cryptography?

11. How is a digital signature computed and verified?
12. Show that a digital signature provides integrity protection and non-repudiation.
13. A fc-way collision is a set of values xo, x\,..., Xk-i that all hash to the same value, that is,
h(x0) = h(xi) = · · · = h(xk-i).
Suppose that h is a secure hash that generates an n-bit hash value.
a. What is the expected number of hashes that must be computed to find one fc-way collision?
b. What is the expected number of hashes that must be computed to find two fc-way collision?
c. What is the expected number of hashes that must be computed to find m distinct fc-way collisions?
14. Does a MAC satisfy the same properties that an HMAC satisfies? Explain.
15. Why are statistically random numbers (which are often used in simulations) not sufficient for cryptographic
applications?
Module – 3: Random Number Generation
1. Define Randomness. Explain the types of Generator mechanisms.
2. Explain the types of Freshness mechanisms.
3. List the applications of Entity authentication.
4. List the flaws that affects the security of an application.
5. Discuss about Cryptographic password protection in detail.
6.Explain about Dynamic Password scheme with an example.
7.Write short notes on Zero Knowledge analogy.
8. Design a protocol based on Protocol 1(in Text book), in addition to the existing protocol goals, also allows
Alice to confirm that Bob is alive.
9. List the components of a cryptographic protocol.
10. Explain about Diffie–Hellman key agreement protocol.
11. Explain how a man-in-the-middle attack against a generic cryptographic protocol works.

Module -4: Key Management

1. Write short notes on Key Life cycle.
2. Explain the types of key generation in detail.
3. Discuss the important concepts involved in Key hierarchy.
4. Give a clear picture of key storage on software.
5. Describe Key storage risk factors with a neat diagram. mechanics of key change, key activation and key
destruction
6. Explain about public key certificate.
7.Discuss in detail about Certificate lifecycle.
8.What are the different public key management models? Explain with necessary diagrams.
9.Write short notes on IDPKC.
10. Write short notes on mechanics of key change, key activation and key destruction.

Module- 5: Cryptographic Applications

1.Explain how cryptography is used in SSL.
2.Discuss about SSL protocols.

2
Question Bank Information and Network Security (15CS743)

3.Discuss in detail about SSL key management.

4. List the design issues in SSL.
5.Explain about cryptography for Wireless local area networks.
6. Explain about cryptography for mobile telecommunications.
7. Explain about cryptography for secure payment.
8. Explain about cryptography for video broadcast cryptography.
9. Explain about cryptography for identity cards.
10. Explain about cryptography for home users.