Cryptographic hash function

Hash function that is suitable for use in cryptography

A cryptographic hash function (CHF) is a hash algorithm that has special properties desirable for a cryptographic application:the probability of a particular -bit output result for a random input string ("message") is , so the hash value can be used as a representative of the message; finding an input string that matches a given hash value is infeasible, assuming all input strings are equally likely. The resistance to such search is quantified as security strength: a cryptographic hash with bits of hash value is expected to have a preimage resistance strength of bits, unless the space of possible input values is significantly smaller than ; a second preimage resistance strength, with the same expectations, refers to a similar problem of finding a second message that matches the given hash value when one message is already known; finding any pair of different messages that yield the same hash value is also infeasible: a cryptographic hash is expected to have a collision resistance strength of bits.

This keyword could refer to multiple things. Here are some suggestions: