Cryptographic hash function - Revision history

imported>Unknown user at 00:24, 20 January 2026

2026-01-20T00:24:28Z

← Older revision		Revision as of 00:24, 20 January 2026
(No difference)

imported>Unknown user at 02:53, 15 January 2026

2026-01-15T02:53:33Z

← Older revision		Revision as of 02:53, 15 January 2026
(No difference)

imported>Unknown user at 01:42, 15 January 2026

2026-01-15T01:42:27Z

← Older revision		Revision as of 01:42, 15 January 2026
Line 1:		Line 1:
	{{LanguageHeader\|en}}		{{LanguageHeader\|en}}
	{{CyberTerm\|definition=~~<p>~~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</p><p>1~~. (Collision resistance) It is computationally infeasible to find any two distinct inputs that map to the same output.~~</p><p>~~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.)~~</p><p>~~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.~~</p><p>~~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.~~</p><p>~~Approved hash functions are specified in [FIPS 180] and [FIPS 202].~~</p>~~\|source=NIST SP 800-56C Rev. 2}}		{{CyberTerm\|definition=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 properties1. (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].\|source=NIST SP 800-56C Rev. 2}}

imported>Unknown user at 00:12, 15 January 2026

2026-01-15T00:12:26Z

New page

{{LanguageHeader|en}}
{{CyberTerm|definition=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 properties1. (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].|source=NIST SP 800-56C Rev. 2}}