Secure Hash Algorithm
nounid
4008·updated Aug 30, 2026verified· unreviewed
A hash algorithm with the property that is computationally infeasible 1) to find a message that corresponds to a given message digest, or 2) to find two different messages that produce the same message digest.
MWE
Attested in
No recorded attestations. They are written when an MWE tagging stage is completed, stamped with the pack version and the document’s digest.
Classifications
Entity Type
Capability0%rule-basedmulti_axis_classifier_low_confidence.v1
Sensitivity
—90%llm-generatedllm:claude-haiku-4-5
Information Class
—95%llm-generatedllm:claude-haiku-4-5
Variants
- acronym
- SHA
- plural
- Secure Hash Algorithms
- possessive
- Secure Hash Algorithm's
- pluralpossessive
- Secure Hash Algorithms'
Framework definitions
- §1
- A hash algorithm with the property that is computationally infeasible 1) to find a message that corresponds to a given message digest, or 2) to find two different messages that produce the same message digest.
- §1
- A hash algorithm with the property that is computationally infeasible 1) to find a message that corresponds to a given message digest, or 2) to find two different messages that produce the same message digest.
- §1 · legacy_primary
- A hash algorithm with the property that is computationally infeasible 1) to find a message that corresponds to a given message digest, or 2) to find two different messages that produce the same message digest.DR-088 backfill from the noun definition column
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.