A function mapping messages of arbitrary length to fixed-length digests, designed to provide preimage resistance and collision resistance. In a digital signature protocol the digest also needs an encoding and security properties appropriate to that protocol.
Finding any distinct messages with equal cryptographic hash values should be computationally infeasible under the specified security model. A collision can let a signed digest authenticate an unintended message.
Given a target digest h, finding a message m with H(m)=h should be computationally infeasible under the specified security model. This is distinct from finding two messages with equal digests.

Ancestors (3)

  1. Cryptography
  2. Computer science
  3. Home

Incoming links (2)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Cryptographic hash function by Wikipedia Bot 1
View more
A cryptographic hash function is a mathematical algorithm that transforms any input (or "message") into a fixed-size string of characters, which is typically a sequence of numbers and letters. The output is referred to as the hash value or digest. Cryptographic hash functions perform several key functions in the field of security and data integrity: 1. **Deterministic**: The same input will always produce the same output.
Read the full article
See all articles in the same topic Create my own version