

MCQOPTIONS
Saved Bookmarks
This section includes 15 Mcqs, each offering curated multiple-choice questions to sharpen your Cryptography and Network Security knowledge and support exam preparation. Choose a topic below to get started.
1. |
Which one of these is not a Whirlpool function? |
A. | Add Key |
B. | Substitute Bytes |
C. | Mix Rows |
D. | Shift Rows |
Answer» E. | |
2. |
How many rounds are there in one Whirlpool Iteration? |
A. | 3 |
B. | 4 |
C. | 6 |
D. | 8 |
Answer» C. 6 | |
3. |
The hash matrix of 8 × 8 is preferred over a 16 × 4 matrix because |
A. | it is symmetric |
B. | it is smaller in size |
C. | it is faster in computation |
D. | none of the mentioned |
Answer» D. none of the mentioned | |
4. |
The 8 × 8 hash matrix holds values of size |
A. | 16 bits |
B. | 32 bits |
C. | 8 bits |
D. | 4 bits |
Answer» D. 4 bits | |
5. |
THE_HASH_MATRIX_OF_8_‚ÄÖ√†√∂‚Àւ•_8_IS_PREFERRED_OVER_A_16_‚ÄÖ√†√∂‚Àւ•_4_MATRIX_BECAUSE?$# |
A. | it is symmetric |
B. | it is smaller in size |
C. | it is faster in computation |
D. | none of the mentioned |
Answer» D. none of the mentioned | |
6. |
Which one of these is not a Whirlpool function?$ |
A. | Add Key |
B. | Substitute Bytes |
C. | Mix Rows |
D. | Shift Rows |
Answer» E. | |
7. |
How_many_rounds_are_there_in_one_Whirlpool_Iteration?$ |
A. | 3 |
B. | 4 |
C. | 6 |
D. | 8 |
Answer» C. 6 | |
8. |
The 8 √ó 8 hash matrix holds values of siz?# |
A. | 16 bits |
B. | 32 bits |
C. | 8 bits |
D. | 4 bits |
Answer» D. 4 bits | |
9. |
The hash matrix is of the size |
A. | 16 √ó 8 |
B. | 16 √ó 4 |
C. | 8 √ó 8 |
D. | 4 √ó 16 |
Answer» D. 4 ‚Äö√†√∂‚àö‚â• 16 | |
10. |
The length of the message is appended to the message. What is the size of this length? |
A. | 256 bits |
B. | 512 bits |
C. | 128 bits |
D. | 1024 bits |
Answer» B. 512 bits | |
11. |
The message is padded to |
A. | 1024 bits |
B. | 512 bits |
C. | Odd multiple of 256 bits |
D. | Odd multiple of 512 bits |
Answer» D. Odd multiple of 512 bits | |
12. |
Given a message and its n-bit hash result, the expected workload of finding a message that hashes to the same value is of the order _______________ |
A. | 2<sup>(n/2)</sup> |
B. | 2<sup>(n-1)</sup> |
C. | 2<sup>(n)</sup> |
D. | 2<sup>(2n)</sup> |
Answer» D. 2<sup>(2n)</sup> | |
13. |
Given a message, the expected workload of finding a message that hashes to that value is of the order ____________ |
A. | 2<sup>(n/2)</sup> |
B. | 2<sup>(n-1)</sup> |
C. | 2<sup>(n)</sup> |
D. | 2<sup>(2n)</sup> |
Answer» D. 2<sup>(2n)</sup> | |
14. |
The expected workload of generating a collision is of the order of ____________ executions of Whirlpool. |
A. | 2<sup>(n/2)</sup> |
B. | 2<sup>(n-1)</sup> |
C. | 2<sup>(n)</sup> |
D. | 2<sup>(2n)</sup> |
Answer» B. 2<sup>(n-1)</sup> | |
15. |
Which of the following is not true for whirlpool hashing function? |
A. | It is a two way hashing function |
B. | It is based on a 512 bit block cipher |
C. | The block cipher is similar to AES structure |
D. | It is resistant to differential attacks |
Answer» B. It is based on a 512 bit block cipher | |