MLchartDataset catalogue

Cryptographic hash function

Term · Cybersecurity · MLC-T-CYB-001067

1. A function that maps a bit string of arbitrary length to a fixed-length bit string. Depending upon the relying application, the security strength that can be supported by a hash function is typically measured by the extent to which it possesses one or more of the following properties
1. (Collision resistance) It is computationally infeasible to find any two distinct inputs that map to the same output.
2. (Preimage resistance) Given a randomly chosen target output, it is computationally infeasible to find any input that maps to that output. (This property is called the one-way property.)
3. (Second preimage resistance) Given one input value, it is computationally infeasible to find a second (distinct) input value that maps to the same output as the first value.
This Recommendation uses the strength of the preimage resistance of a hash function as a contributing factor when determining the security strength provided by a key-derivation method.
Approved hash functions are specified in [FIPS 180] and [FIPS 202].

2. A function on bit strings in which the length of the output is fixed. Approved hash functions (such as those specified in FIPS 180 and FIPS 202) are designed to satisfy the following properties:
1. (One-way) It is computationally infeasible to find any input that maps to any new pre-specified output
2. (Collision-resistant) It is computationally infeasible to find any two distinct inputs that map to the same output.

3. A function that maps a bit string of arbitrary length to a fixed length bit string and is expected to have the following three properties:
1) Collision resistance (see Collision resistance),
2) Preimage resistance (see Preimage resistance) and
3) Second preimage resistance (see Second preimage resistance).
Approved cryptographic hash functions are specified in [FIPS 180-3].

4. A function that maps a bit string of arbitrary length to a fixed-length bit string. The function is expected to have the following three properties:
1. Collision resistance (see Collision resistance),
2. Preimage resistance (see Preimage resistance) and
3. Second preimage resistance (see Second preimage resistance).
Approved hash functions are specified in [FIPS 180-4].

5. A function that maps a bit string of arbitrary length to a fixed length bit string. Approved hash functions are designed to satisfy the following properties:
1. (One-way) It is computationally infeasible to find any input that maps to any pre-specified output, and
2. (Collision resistant) It is computationally infeasible to find any two distinct inputs that map to the same output.
Approved hash functions are specified in FIPS 180-3.

6. An algorithm that computes a numerical value (called the hash value) on a data file or electronic message that is used to represent that file or message, and depends on the entire contents of the file or message. A hash function can be considered to be a fingerprint of the file or message.

7. A function that maps a bit string of arbitrary length to a fixed-length bit string. Approved hash functions are expected to satisfy the following properties:
1. One-way: It is computationally infeasible to find any input that maps to any pre-specified output, and
2. Collision resistant: It is computationally infeasible to find any two distinct inputs that map to the same output.

8. See Hash function.

9. A function that maps a bit string of arbitrary length to a fixed-length bit string. Approved hash functions are expected to satisfy the following properties: 1. One-way: it is computationally infeasible to find any input that maps to any pre-specified output, and 2. Collision resistant: It is computationally infeasible to find any two distinct inputs that map to the same output.

10. A function that maps a bit string of arbitrary length to a fixed-length bit string. Approved hash functions are designed to satisfy the following properties:
1. (One-way) It is computationally infeasible to find any input that maps to any pre-specified output, and
2. (Collision resistant) It is computationally infeasible to find any two distinct inputs that map to the same output.
Approved hash functions are specified in FIPS 180.

11. A function that maps a bit string of arbitrary (although bounded) length to a fixed-length bit string. Approved hash functions satisfy the following properties:
1. (One-way) It is computationally infeasible to find any input that maps to any pre-specified output, and
2. (Collision resistant) It is computationally infeasible to find any two distinct inputs that map to the same output.

12. A function that maps a bit string of arbitrary length to a fixed-length bit string. Approved hash functions satisfy the following properties: 1. One-way - It is computationally infeasible to find any input that maps to any pre-specified output. 2. Collision resistant - It is computationally infeasible to find any two distinct inputs that map to the same output.

13. See cryptographic hash function.

14. A function that maps a bit string of arbitrary (although bounded) length to a fixed-length bit string. Approved hash functions satisfy the following properties: 1. (One-way) It is computationally infeasible to find any input that maps to any pre-specified output. 2. (Collision-resistant) It is computationally infeasible to find any two distinct inputs that map to the same output.

15. A function that maps a bit string of arbitrary lenth to a fixed-length bit string.

16. A function that maps a bit string of arbitrary length to a fixed-length bit string. Approved hash functions satisfy the following properties: 1. (One-way) It is computationally infeasible to find any input that maps to any pre-specified output, and 2. (Collision resistant) It is computationally infeasible to find any two distinct inputs that map to the same output.

Table 1. Record
IdentifierMLC-T-CYB-001067
FieldCybersecurity
AbbreviationHash function
ReferencesNIST SP 800-56C Rev. 2; FIPS 186-5; NIST SP 800-106; NIST SP 800-107 Rev. 1; NIST SP 800-108 [Superseded]; NIST SP 800-152; NIST SP 800-56A Rev. 2 [Superseded]; NIST SP 800-56B Rev. 1 [Superseded]; NIST SP 800-57 Part 1 Rev. 4 [Superseded]; NIST SP 800-57 Part 1 Rev. 5; NIST SP 800-57 Part 1 Rev. 3 [Superseded]; NIST SP 800-56B Rev. 2; NIST SP 800-56C [Superseded]; NIST SP 800-57 Part 1 Rev. 4 [Superseded]; NIST SP 800-175B Rev. 1; NIST SP 800-57 Part 1 Rev. 5; NISTIR 8202; NIST SP 800-57 Part 1 Rev. 3 [Superseded]; NIST CSRC Glossary
See alsoHashing algorithm
Record as JSON 
{
  "id": "MLC-T-CYB-001067",
  "term": "Cryptographic hash function",
  "field": "Cybersecurity",
  "definition": "1. A function that maps a bit string of arbitrary length to a fixed-length bit string. Depending upon the relying application, the security strength that can be supported by a hash function is typically measured by the extent to which it possesses one or more of the following properties\n1. (Collision resistance) It is computationally infeasible to find any two distinct inputs that map to the same output.\n2. (Preimage resistance) Given a randomly chosen target output, it is computationally infeasible to find any input that maps to that output. (This property is called the one-way property.)\n3. (Second preimage resistance) Given one input value, it is computationally infeasible to find a second (distinct) input value that maps to the same output as the first value.\nThis Recommendation uses the strength of the preimage resistance of a hash function as a contributing factor when determining the security strength provided by a key-derivation method.\nApproved hash functions are specified in [FIPS 180] and [FIPS 202].\n\n2. A function on bit strings in which the length of the output is fixed. Approved hash functions (such as those specified in FIPS 180 and FIPS 202) are designed to satisfy the following properties:\n1. (One-way) It is computationally infeasible to find any input that maps to any new pre-specified output\n2. (Collision-resistant) It is computationally infeasible to find any two distinct inputs that map to the same output.\n\n3. A function that maps a bit string of arbitrary length to a fixed length bit string and is expected to have the following three properties:\n1) Collision resistance (see Collision resistance),\n2) Preimage resistance (see Preimage resistance) and\n3) Second preimage resistance (see Second preimage resistance).\nApproved cryptographic hash functions are specified in [FIPS 180-3].\n\n4. A function that maps a bit string of arbitrary length to a fixed-length bit string. The function is expected to have the following three properties:\n1. Collision resistance (see Collision resistance),\n2. Preimage resistance (see Preimage resistance) and\n3. Second preimage resistance (see Second preimage resistance).\nApproved hash functions are specified in [FIPS 180-4].\n\n5. A function that maps a bit string of arbitrary length to a fixed length bit string. Approved hash functions are designed to satisfy the following properties:\n1. (One-way) It is computationally infeasible to find any input that maps to any pre-specified output, and\n2. (Collision resistant) It is computationally infeasible to find any two distinct inputs that map to the same output.\nApproved hash functions are specified in FIPS 180-3.\n\n6. An algorithm that computes a numerical value (called the hash value) on a data file or electronic message that is used to represent that file or message, and depends on the entire contents of the file or message. A hash function can be considered to be a fingerprint of the file or message.\n\n7. A function that maps a bit string of arbitrary length to a fixed-length bit string. Approved hash functions are expected to satisfy the following properties:\n1. One-way: It is computationally infeasible to find any input that maps to any pre-specified output, and\n2. Collision resistant: It is computationally infeasible to find any two distinct inputs that map to the same output.\n\n8. See Hash function.\n\n9. A function that maps a bit string of arbitrary length to a fixed-length bit string. Approved hash functions are expected to satisfy the following properties: 1. One-way: it is computationally infeasible to find any input that maps to any pre-specified output, and 2. Collision resistant: It is computationally infeasible to find any two distinct inputs that map to the same output.\n\n10. A function that maps a bit string of arbitrary length to a fixed-length bit string. Approved hash functions are designed to satisfy the following properties:\n1. (One-way) It is computationally infeasible to find any input that maps to any pre-specified output, and\n2. (Collision resistant) It is computationally infeasible to find any two distinct inputs that map to the same output.\nApproved hash functions are specified in FIPS 180.\n\n11. A function that maps a bit string of arbitrary (although bounded) length to a fixed-length bit string. Approved hash functions satisfy the following properties:\n1. (One-way) It is computationally infeasible to find any input that maps to any pre-specified output, and\n2. (Collision resistant) It is computationally infeasible to find any two distinct inputs that map to the same output.\n\n12. A function that maps a bit string of arbitrary length to a fixed-length bit string. Approved hash functions satisfy the following properties: 1. One-way - It is computationally infeasible to find any input that maps to any pre-specified output. 2. Collision resistant - It is computationally infeasible to find any two distinct inputs that map to the same output.\n\n13. See cryptographic hash function.\n\n14. A function that maps a bit string of arbitrary (although bounded) length to a fixed-length bit string. Approved hash functions satisfy the following properties: 1. (One-way) It is computationally infeasible to find any input that maps to any pre-specified output. 2. (Collision-resistant) It is computationally infeasible to find any two distinct inputs that map to the same output.\n\n15. A function that maps a bit string of arbitrary lenth to a fixed-length bit string.\n\n16. A function that maps a bit string of arbitrary length to a fixed-length bit string. Approved hash functions satisfy the following properties: 1. (One-way) It is computationally infeasible to find any input that maps to any pre-specified output, and 2. (Collision resistant) It is computationally infeasible to find any two distinct inputs that map to the same output.",
  "abbreviation": "Hash function",
  "see_also": [
    "Hashing algorithm"
  ],
  "references": [
    "NIST SP 800-56C Rev. 2",
    "FIPS 186-5",
    "NIST SP 800-106",
    "NIST SP 800-107 Rev. 1",
    "NIST SP 800-108 [Superseded]",
    "NIST SP 800-152",
    "NIST SP 800-56A Rev. 2 [Superseded]; NIST SP 800-56B Rev. 1 [Superseded]",
    "NIST SP 800-57 Part 1 Rev. 4 [Superseded]; NIST SP 800-57 Part 1 Rev. 5; NIST SP 800-57 Part 1 Rev. 3 [Superseded]",
    "NIST SP 800-56B Rev. 2",
    "NIST SP 800-56C [Superseded]",
    "NIST SP 800-57 Part 1 Rev. 4 [Superseded]",
    "NIST SP 800-175B Rev. 1",
    "NIST SP 800-57 Part 1 Rev. 5",
    "NISTIR 8202",
    "NIST SP 800-57 Part 1 Rev. 3 [Superseded]",
    "NIST CSRC Glossary"
  ],
  "url": "https://mlchart.com/terminology/cybersecurity/cryptographic-hash-function/"
}

Record 1,067 of 4,693 in Cybersecurity terminology (MLC-0102). Request the full dataset.