EXAM questions for the course TTM4135 - Information Security

EXAM questions for the course TTM4135 - Information Security
June 2008 Part 1 This part consists of 8 questions all from one common topic. The number of
maximal points for every correctly answered question is given next to the
question. Maximal number of points in this part of the exam is 36. Time for
work on this test: ~60 minutes. TOPIC: Block ciphers and Data Encryption Standard 1. (5 points) What is a block cipher?
2. (5 points) What is a Feistel structure?
3. (5 points) What is the purpose of diffusion in the design of block
ciphers?
4. (5 points) What is the purpose of confusion in the design of block
ciphers?
5. (4 points) How many rounds have DES, how big is the key and how big is
the block?
6. (4 points) How big can be the key in AES, how many rounds have AES for
each key, and how big is the block?
7. (4 points) Describe the Triple DES with three DES keys.
8. (4 points) What are the two best known general attacks against block
ciphers? KEY for Part 1 TOPIC: 1. Complete answer should mention that block cipher is an
encryption/decryption scheme in which a block of plaintext is treated as
a whole and used to produce a ciphertext block of equal length. 2. Complete answer should mention that a Feistel structure is an
algorithmic structure that consists of a number of identical rounds of
processing. In each round a substitution is performed on one half of the
data being processed, followed by a permutation that interchanges two
halves. The original key is expanded so that a different key is used for
each round. 3. Complete answer should mention that in diffusion the statistical
structure of the plaintext is dissipated into long-range statistics of
the ciphertext. That is achieved by having each plaintext digit affect
the value of many ciphertext digits, or equivalently having each
ciphertext digit be affected by many plaintext digits. 4. Complete answer should mention that the purpose of confusion is to make
the relationship between statistics the ciphertext and the value of the
encryption key as complex as possible, to thwart attempts to discover the
key. 5. Complete answer should say: 16 rounds, 56-bit key, 64-bit block. 6. Complete answer should say: Key can be 128, 192 and 256 bits, the number
of rounds is 10, 12 and 14 correspondingly, and the block size is 128
bits. 7. Complete answer should mention the encryption function: C=E(K3, D(K2,
E(K1, P))), where E and D are DES encryption and decryption with keys K1,
K2 and K3. 8. Complete answer should briefly describe differential and linear
cryptanalysis. EXAM questions for the course TTM4135 - Information Security
June 2008 Part 2 This part consists of 40 questions. For every question 5 alternative
answers are given, of which ONLY ONE is correct. If you chose the correct
answer you will earn 1.6 points, otherwise you will loose 0.4 points (i.e.
the penalty is -0.4 points). If you not choose any answer - then you will
not get any points (i.e. the earned points are 0). Maximal number of points
in this part of the exam is 64. Time for work on this test: ~120 minutes.
1. What is the closest meaning of the phrase "Internet security"?
a. Rules defined in firewall systems b. Rules defined in IPSec c. Rules defined in X.500 d. Measures to protect data during their transmission e. Measures to protect data during their transmission over a
collection of interconnected networks
2. According to the OSI security architecture, "Security service" is:
a. PKI b. A security database server c. A processing or communication service that enhances the security of
the data processing systems and the information transfers of an
organization. d. A process (or a device incorporating such a process) that is
designed to detect, prevent, or recover from a security attack. e. PKI and defined policies
3. What is the closest meaning of the phrase "cryptography" ?
a. A technique of embedding one message into another b. A technique of military communication c. study of principles / methods of deciphering ciphertext without
knowing key d. A technique of military surveillance e. study of encryption principles/methods
4. In a "known plaintext attack" the attacker knows
a. predetermined selected ciphertext b. one plaintext and one key c. predetermined selected plaintext d. one ciphertext and one key e. plaintext and ciphertext
5. The "Playfair Cipher" uses a matrix of size
a. 4 x 4 b. 5 x 5 c. 6 x 6 d. 7 x 7 e. 8 x 8
6. What is a "Rotor machine"?
a. An algorithm that rotates the Caesar alphabet. b. A machine that rotates the secret key with every new message. c. An algorithm that rotates the key of the Vernam Cipher. d. A machine that encodes all messages into a big rotor. e. A machine that consists of a set of independently rotating
cylinders through which electrical pulses can flow.
7. S-boxes in DES map
a. 2 to 4 bits b. 4 to 4 bits c. 6 to 4 bits d. 4 to 6 bits e. 2 to 6 bits
8. The linear cryptanalysis can find DES key knowing
a. 247 bits of known plaintext b. 246 bits of known plaintext c. 245 bits of known plaintext d. 244 bits of known plaintext e. 243 bits of known plaintext
9. Abelian group is
a. every non-associative group b. every group with 2n elements c. every commutative group d. every a finite set of elements e. every matrix of order n x n 10. gcd(1974,1068) =
a. 4 b. 6 c. 8 d. 9 e. 1
11. How many finalists have been chosen in the AES competition
a. 4 b. 5 c. 6 d. 10 e. 15
12. How many S-boxes has AES?
a. 16 b. 8 c. 4 d. 2 e. 1
13. What is the biggest advantage of CBC mode of operation
a. It can encrypt in parallel different parts of the messages b. It does not propagate errors in the ciphertext c. It does not need Initialization Vector (IV) d. The Initialization Vector (IV) is secret - so the length of the
secret key is doubled e. A ciphertext block depends on all blocks before it
14. The term "keystream" is usually connected with
a. stream ciphers b. block ciphers c. public-key ciphers d. key-exchange protocols e. key-distribution protocols
15. In "link encryption"
a. encryption occurs at a random location between original source and
final destination b. need devices with shared keys only at the start and end of the
multilink connection c. message is encrypted in the application layer at the sending host d. encryption occurs independently on every link e. end user applies encryption
16. In OSI Reference model "end-to-end encryption" occurs in layers
a. 3, 4, 6 and 7 b. just 1 c. just 2 d. just 3 and 4 e. just 7
17. Which two important issues are addressed with public-key cryptography
a. Production of big prime numbers and their multiplication b. Factorization of natural numbers and discrete logarithm problem c. Key distribution and Digital signatures d. Production of master and session keys e. Authentication and identification of users
18. On which hard mathematical problem does RSA base its security?
a. Factorization of big numbers b. Finding big prime numbers c. Multiplication of big prime numbers d. Exponentiation of big numbers e. Computing discrete logarithms
19. Message authentication is not concerned with
a. key exchange b. protecting the integrity of a message c. validating identity of originator d. non-repudiation of origin (dispute resolution) e. detecting errors in transmission of a message
20. In computing the Message Authentication Codes both parties have to use
a. the public key of the other party b. the private key of the other party c. two different secret keys d. one master and one session key e. a shared secret key
21. What does it mean that a function H has "preimage resistance"?
a. Given h, it is infeasible to find x s.t. H(x) = h b. Given x, it is infeasible to find y s.t. H(y) = H(x) c. It is infeasible to find any x, y s.t. H(y) = H(x) d. It can be applied to any sized message M e. It is easy to compute h = H(M) for any message M
22. Secure Hash Algorithm (SHA) functions are based on the following hash
function:
a. MD2 b. Whirlpool c. Haval d. MD4 e. MD5
23. How many internal iterative steps has SHA-512
a. 32 b. 48 c. 56 d. 64 e. 80
24. What is the block size for message processing of SHA-256?
a. 1024 bits b. 512 bits c. 256 bits d. 128 bits e. 64 bits
25. The hash function Whirlpool is based on components of which algorithm?
a. DES b. Triple-DES c. AES d. Serpent e. Mars
26. What is HMAC?
a. Heuristic MAC function b. Hash function based on MAC c. MAC based on a hash function d. MAC based on the hash function Haval e. Hash function based on a block cipher
27. In direct digital signatures, signing can be done
a. only on the whole message b. only on the hash of the message c. either on the whole message or on the hash of the message d. on the public key of the receiver e. on the private key of the receiver
28. What is the Needham-Schroeder Protocol?