{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Tutorial2_jul10

# Tutorial2_jul10 - Tutorial 2 ICT 211 Question 1(a Suppose...

This preview shows pages 1–2. Sign up to view the full content.

Tutorial 2 – ICT 211 Question 1 (a) Suppose you have a network of n users. You need to protect the communication in the network such that a non-user cannot read the messages transmitted. On the other hand, every user can read all the messages. How many keys do you need if you are using a secret-key algorithm to encrypt the message? (b) Explain the following types of cryptanalytic attacks: (i) Ciphertext only (ii) Chosen plaintext (iii) Chosen ciphertext Question 2 (a) Consider a symmetric key algorithm with a 11-bit key. Suppose you are using this algorithm. How many times do you have to try to obtain the key for the following cases? (i) the best case (ii) the worst case (iii) the average case. Explain your answers. (b) Consider the two plaintext-ciphertext pairs (P1, C1) and (P2, C2). The ciphertext C1 is obtained by encrypting the plaintext P1 using an algorithm with a 20 bits key K1. The C2 is obtained by encrypting P2 using another algorithm with a 40 bits key K2. (i) Suppose exhaustive search is used to find the keys. Which key is more likely

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 2

Tutorial2_jul10 - Tutorial 2 ICT 211 Question 1(a Suppose...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online