A ___________ is an algorithm for which it is computationally infeasible to find either (a) a data object that maps to a pre-specified hash result or (b) two data objects that map to the same hash result.

Question

BlackTom AI · Accepted Answer

A cryptographic hash function is a deterministic algorithm that maps arbitrary-length input data to a fixed-size output (the hash) while providing security properties that make certain attacks computationally infeasible.

1) Relevant knowledge points and concepts
- Hash function: maps variable-length input to fixed-length output.
- Pre-image resistance (one-wayness): given a hash value h, it is infeasible to find any input x such that hash(x) = h.
- Second pre-image resistance: given an input x1, it is infeasible to find x2 ≠ x1 such that hash(x2) = hash(x1).
- Collision resistance (strong collision resistance): it is infeasible to find any two distinct inputs x1, x2 such that hash(x1) = hash(x2).
- Cryptographic hash function: a hash function designed to satisfy the above security properties.

2) Step-by-step reasoning
- The prompt specifies two infeasibility conditions: (a) finding a data object that maps to a pre-specified hash result (pre-image resistance), and (b) finding two data objects that map to the same result (collision resistance).
- An algorithm that precisely aims to provide both infeasibilities is by definition a cryptographic hash function, because it must be one-way and collision-resistant.
- Evaluate answer options: the phrase must name an algorithm class that enforces both pre-image and collision infeasibility.

3) Intermediate logical steps
- If only pre-image resistance were required, the term "one-way hash function" would be relevant.
- If only collision resistance were being named, "strong collision resistance" refers to a property, not the algorithm itself.
- "Compression function" is a low-level component that reduces block size but does not by itself guarantee the security properties.

4) Why the correct answer is correct
- "Cryptographic hash function" explicitly denotes a hash algorithm designed to make both pre-image and collision attacks computationally infeasible, matching both conditions (a) and (b).

5) Why other options are incorrect
- Compression function: a building block for many hash constructions; it is not defined by the infeasibility properties described.
- Strong collision resistance: this is a property (also called collision resistance), not the name of an algorithm.
- One-way hash function: emphasizes pre-image resistance but does not necessarily imply collision resistance, so it does not fully match both conditions.

Conclusion: The correct choice is "cryptographic hash function," which matches the provided answer.

A ___________ is an algorithm for which it is computationally infeasible to find either (a) a data object that maps to a pre-specified hash result or (b) two data objects that map to the same hash result.单项选择题

类似问题

Which properties of hash functions are critical for message integrity?

Which of the following statements correctly describe properties or applications of hash functions?

Which statement correctly distinguishes between one-wayness (pre-image resistance) and second pre-image resistance in cryptographic hash functions?

The Secure Hash Algorithm design closely models, and is based on, the hash function __________ .

Hash functions can be used for intrusion and virus detections.

Question at position 38 The hash of a block is: (Select all answers that apply.) 100 charactersfixed in lengthwhat helps makes a blockchain securegenerated by an algorithm

Which of the following is a property of a good hash function for use in key-value based storage structures?

Ch.08. A strong cryptographic hash function guarantees mathematically that no two distinct messages will ever produce the same hash value.

更多留学生实用工具

智能学习助手

风格化写作助手

论文查重助手

文献引用助手

课堂转译助手

课堂笔记助手

Quiz搜索助手

学校历年真题

智能刷题助手

智能匹配练习

希望你的学习变得更简单