Revision as of 01:42, 15 January 2026

XOF

A function on bit strings in which the output can be extended to any desired length. Approved XOFs (e.g., those specified in FIPS 202) are designed to satisfy the following properties as long as the specified output length is sufficiently long to prevent trivial attacks1. (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.

Source: FIPS 204 | Category:

Revision as of 00:12, 15 January 2026 view source imported>Unknown user No edit summary		Revision as of 01:42, 15 January 2026 view source imported>Unknown user No edit summary Newer edit →
Line 1:		Line 1:
	{{LanguageHeader\|en}}		{{LanguageHeader\|en}}
	{{CyberTerm\|definition=~~<p>~~A function on bit strings in which the output can be extended to any desired length. Approved XOFs (e.g., those specified in FIPS 202) are designed to satisfy the following properties as long as the specified output length is sufficiently long to prevent trivial ~~attacks</p><p>1~~. (One-way) It is computationally infeasible to find any input that maps to any new pre-specified output.~~</p><p>~~2. (Collision-resistant) It is computationally infeasible to find any two distinct inputs that map to the same output.~~</p>~~\|source=FIPS 204}}		{{CyberTerm\|definition=A function on bit strings in which the output can be extended to any desired length. Approved XOFs (e.g., those specified in FIPS 202) are designed to satisfy the following properties as long as the specified output length is sufficiently long to prevent trivial attacks1. (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.\|source=FIPS 204}}