Scribd
Upload
51 views3 pages

Is Tutorial 1

This document contains 10 questions related to cryptography and network security concepts along with their answer keys. The questions cover topics like mathematical attacks in RSA, use of timestamps, nonce values, IDEA cipher operations and keys, initial permutation tables, threats to computer assets, types of substitution ciphers, Shannon's characteristics of a good cipher, and types of active attacks.

Uploaded by

chithrasreemod
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
51 views3 pages

Is Tutorial 1

This document contains 10 questions related to cryptography and network security concepts along with their answer keys. The questions cover topics like mathematical attacks in RSA, use of timestamps, nonce values, IDEA cipher operations and keys, initial permutation tables, threats to computer assets, types of substitution ciphers, Shannon's characteristics of a good cipher, and types of active attacks.

Uploaded by

chithrasreemod
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

ASSIGNMENT QUESTIONS-2

1. What is a mathematical attack? How can it be avoided?


2. What is the purpose of using timestamps in distribution of public keys?
3. What is a nonce value? Why is it used?
4. What are the different types of operations used in IDEA?
5. How many rounds of operation are there in IDEA? What is the number of keys used in
each round?
6. What is the use of an Initial Permutation Table?
7. List the different types of threats to a computer asset.
8. What is the difference between a mono-alphabetic substitution technique and a poly-
alphabetic substitution technique?
9. What are Shannons characteristics of a good cipher?
10. What are the different types of active attacks possible in message transmission?

















ANSWER KEYS

1. Mathematical attack is a type of attack possible in RSA. Here, the attacker tries to
factor product n to obtain prime numbers p and q. Once p and q is obtained, the
attacker can easily calculate private and public keys.
To avoid mathematical attack:
a. Select p and q in such a manner that there is no large difference between the
two numbers.
b. GCD (p, q) should be small.
2. Timestamps are used to prevent replay attacks.
3. Nonce value is a random number generated by the sender. It is used to provide
authentication.
4. Operations used in IDEA are:
a. XOR
b. Addition modulo 2
16

c. Multiplication modulo 2
16
+1
5. 8 encryption rounds (each uses 6 keys) and 1 output transformation round (uses 4
keys).
6. Initial permutation table is used to scramble the bits in the plaintext message.
7. Threats to a computer asset:
a. Interception
b. Interruption
c. Modification
d. Fabrication
8. Mono-alphabetic substitution technique: only one alphabet can replace a given plain
text alphabet.
Poly-alphabetic substitution technique: more than one alphabet can replace a given
plain text alphabet.
9. Shannons characteristics of a good cipher:
a. Amount of secrecy is directly proportional to work of encryption or
decryption
b. Keys and encryption algorithm should not be complex
c. Implementation should be simple
d. Errors in ciphering should not propagate to the rest of the cipher text
e. Size of cipher text should not be larger than plain text
10. Active attacks:
a. Modification
b. Replay
c. Masquerading
d. Denial of service

You might also like