adplus-dvertising

Welcome to the Cryptographic Hash Functions MCQs Page

Dive deep into the fascinating world of Cryptographic Hash Functions with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Cryptographic Hash Functions, a crucial aspect of Cryptography and Network Security. In this section, you will encounter a diverse range of MCQs that cover various aspects of Cryptographic Hash Functions, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Cryptography and Network Security.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Cryptographic Hash Functions. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Cryptography and Network Security.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Cryptographic Hash Functions. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Cryptographic Hash Functions MCQs | Page 3 of 8

Explore more Topics under Cryptography and Network Security

Q21.
If the compression function is collision resistant, then so is the resultant iterated hash function.
Discuss
Answer: (a).True
Q22.
A larger hash code cannot be decomposed into independent subcodes.
Discuss
Answer: (b).False
Q23.
We define collision as: A collision occurs if we have x=y and H(x) = H(y).
Discuss
Answer: (b).False
Q24.
Consider the following properties:

Variable Input size
Fixed Output size
Efficiency
Pre image resistant
Second Pre image Resistant
Collision resistant
Pseudo randomness

A has function that satisfies the first _______ properties in the above table is referred to as a weak hash function.

a.

5

b.

4

c.

3

d.

2

Discuss
Answer: (a).5
Q25.
A function that is second pre-image resistant is also collision resistant.
Discuss
Answer: (b).False
Q26.
Which attack requires the least effort/computations?
Discuss
Answer: (c).Collision
Q27.
SHA-1 produces a hash value of
Discuss
Answer: (b).160 bits
Q28.
What is the number of round computation steps in the SHA-256 algorithm?
Discuss
Answer: (c).64
Q29.
In SHA-512, the message is divided into blocks of size ___ bits for the hash computation.
Discuss
Answer: (a).1024
Q30.
What is the maximum length of the message (in bits) that can be taken by SHA-512?
Discuss
Answer: (a).2^128
Page 3 of 8

Suggested Topics

Are you eager to expand your knowledge beyond Cryptography and Network Security? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!