Cryptographic Hash Function
nounid
2094·updated May 9, 2026candidate
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 which 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.
MWE
Classifications
Entity Type
Capability85%llm-generatedllm:claude-haiku-4-5
Sensitivity
—90%llm-generatedllm:claude-haiku-4-5
Information Class
—90%llm-generatedllm:claude-haiku-4-5
Variants
- plural
- Cryptographic Hash Functions
- possessive
- Cryptographic Hash Function's
- pluralpossessive
- Cryptographic Hash Functions'
Framework definitions
- §1
- 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 which 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.
- §1
- 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 which 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.
Outgoing relationships
No outgoing triples
This term is not the subject of any RDF-style relationship yet.
Incoming relationships
No incoming triples
No other term currently asserts a relationship to this one.