MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 3 Mcqs, each offering curated multiple-choice questions to sharpen your Data Integrity Algorithms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which attack requires the least effort/computations? |
| A. | Pre-image |
| B. | Second Pre-image |
| C. | Collision |
| D. | All required the same effort |
| Answer» D. All required the same effort | |
| 2. |
For an m bit hash value, if we pick data blocks at random we can expect to find two data blocks with the same hash value within ____ attempts. |
| A. | 2<sup>m</sup> |
| B. | 2<sup>(m-1)</sup> |
| C. | 2<sup>(m/2)</sup> |
| D. | (2<sup>m</sup>) 1 |
| Answer» D. (2<sup>m</sup>) 1 | |
| 3. |
For an m-bit value, the adversary would have to try ____________ values to generates a given hash value h. |
| A. | 2<sup>m</sup> |
| B. | 2<sup>(m-1)</sup> |
| C. | 2<sup>(m/2)</sup> |
| D. | (2<sup>m</sup>) 1 |
| Answer» C. 2<sup>(m/2)</sup> | |