Extendable-output function - Revision history

Dimawik: /* Sources */ per the discussion on the talk page

2025-05-29T08:27:04Z

Sources: per the discussion on the talk page

← Previous revision		Revision as of 08:27, 29 May 2025
Line 19:		Line 19:

	[[Category:Extendable-output functions]]		[[Category:Extendable-output functions]]

	{{improve categories\|date=June 2023}}

Jlwoodwa: WP:STUBSPACING

2024-04-29T18:34:18Z

WP:STUBSPACING

← Previous revision		Revision as of 18:34, 29 April 2024
Line 17:		Line 17:
	* {{cite web \|last1=Perlner \|first1=Ray \|title=Extendable-Output Functions (XOFs) \|url=https://csrc.nist.gov/events/2014/sha-3-2014-workshop \|website=csrc.nist.gov \|publisher=[[NIST]] \|access-date=22 June 2023 \| date = August 22, 2014}}		* {{cite web \|last1=Perlner \|first1=Ray \|title=Extendable-Output Functions (XOFs) \|url=https://csrc.nist.gov/events/2014/sha-3-2014-workshop \|website=csrc.nist.gov \|publisher=[[NIST]] \|access-date=22 June 2023 \| date = August 22, 2014}}
	* {{cite web \|last1=Dworkin \|first1=Morris \|title=Domain Extensions \|url=https://csrc.nist.gov/events/2014/sha-3-2014-workshop \|website=csrc.nist.gov \|publisher=[[NIST]] \|access-date=22 June 2023 \| date = August 22, 2014}}		* {{cite web \|last1=Dworkin \|first1=Morris \|title=Domain Extensions \|url=https://csrc.nist.gov/events/2014/sha-3-2014-workshop \|website=csrc.nist.gov \|publisher=[[NIST]] \|access-date=22 June 2023 \| date = August 22, 2014}}

⚫	{{crypto-stub}}
	[[Category:Extendable-output functions]]		[[Category:Extendable-output functions]]


	{{improve categories\|date=June 2023}}		{{improve categories\|date=June 2023}}


		⚫	{{crypto-stub}}

Dimawik: Undid revision 1199060251 by Evgeny Kapun (talk) fix turned a blue link into a red one, unfixing

2024-01-25T23:56:02Z

Undid revision 1199060251 by Evgeny Kapun (talk) fix turned a blue link into a red one, unfixing

← Previous revision		Revision as of 23:56, 25 January 2024
Line 2:		Line 2:
	'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, the [[sponge construction]] makes any [[sponge hash]] a natural XOF: the squeeze operation can be repeated, and the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}		'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, the [[sponge construction]] makes any [[sponge hash]] a natural XOF: the squeeze operation can be repeated, and the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}

	The genesis of a XOF makes it [[Collision resistance\|collision]], [[Preimage resistance\|preimage]] and [[second preimage]] resistant. Technically, any XOF can be turned into a cryptographic hash by truncating the result to a fixed length (in practice, hashes and XOFs are defined differently for [[domain separation]]{{sfn\|Dworkin\|2014\|p=3}}). The examples of XOF include the algorithms from the [[Keccak]] family: [[SHAKE128]], [[SHAKE256]], and a variant with higher efficiency, [[KangarooTwelve]].{{sfn\|Peyrin\|Wang\|2020\|p=7}}		The genesis of a XOF makes it [[Collision resistance\|collision]], [[Preimage resistance\|preimage]] and [[second preimage]] resistant. Technically, any XOF can be turned into a cryptographic hash by truncating the result to a fixed length (in practice, hashes and XOFs are defined differently for [[Domain separation (cryptography)\|domain separation]]{{sfn\|Dworkin\|2014\|p=3}}). The examples of XOF include the algorithms from the [[Keccak]] family: [[SHAKE128]], [[SHAKE256]], and a variant with higher efficiency, [[KangarooTwelve]].{{sfn\|Peyrin\|Wang\|2020\|p=7}}

	XOFs are used as [[key derivation function]]s (KDFs), [[stream cipher]]s,{{sfn\|Peyrin\|Wang\|2020\|p=7}} [[mask generation function]]s.{{sfn\|Perlner\|2014\|p=4}}		XOFs are used as [[key derivation function]]s (KDFs), [[stream cipher]]s,{{sfn\|Peyrin\|Wang\|2020\|p=7}} [[mask generation function]]s.{{sfn\|Perlner\|2014\|p=4}}

Evgeny Kapun: Fixed domain separation link

2024-01-25T20:42:39Z

Fixed domain separation link

← Previous revision		Revision as of 20:42, 25 January 2024
Line 2:		Line 2:
	'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, the [[sponge construction]] makes any [[sponge hash]] a natural XOF: the squeeze operation can be repeated, and the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}		'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, the [[sponge construction]] makes any [[sponge hash]] a natural XOF: the squeeze operation can be repeated, and the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}

	The genesis of a XOF makes it [[Collision resistance\|collision]], [[Preimage resistance\|preimage]] and [[second preimage]] resistant. Technically, any XOF can be turned into a cryptographic hash by truncating the result to a fixed length (in practice, hashes and XOFs are defined differently for [[~~Domain separation (cryptography)\|~~domain separation]]{{sfn\|Dworkin\|2014\|p=3}}). The examples of XOF include the algorithms from the [[Keccak]] family: [[SHAKE128]], [[SHAKE256]], and a variant with higher efficiency, [[KangarooTwelve]].{{sfn\|Peyrin\|Wang\|2020\|p=7}}		The genesis of a XOF makes it [[Collision resistance\|collision]], [[Preimage resistance\|preimage]] and [[second preimage]] resistant. Technically, any XOF can be turned into a cryptographic hash by truncating the result to a fixed length (in practice, hashes and XOFs are defined differently for [[domain separation]]{{sfn\|Dworkin\|2014\|p=3}}). The examples of XOF include the algorithms from the [[Keccak]] family: [[SHAKE128]], [[SHAKE256]], and a variant with higher efficiency, [[KangarooTwelve]].{{sfn\|Peyrin\|Wang\|2020\|p=7}}

	XOFs are used as [[key derivation function]]s (KDFs), [[stream cipher]]s,{{sfn\|Peyrin\|Wang\|2020\|p=7}} [[mask generation function]]s.{{sfn\|Perlner\|2014\|p=4}}		XOFs are used as [[key derivation function]]s (KDFs), [[stream cipher]]s,{{sfn\|Peyrin\|Wang\|2020\|p=7}} [[mask generation function]]s.{{sfn\|Perlner\|2014\|p=4}}

Dimawik: /* top */ fixed style

2023-11-01T09:44:57Z

top: fixed style

← Previous revision		Revision as of 09:44, 1 November 2023
Line 1:		Line 1:
	{{Technical\|date=July 2023}}		{{Technical\|date=July 2023}}
	'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, the [[sponge construction]] makes any [[sponge hash]] a natural XOF (the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}		'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, the [[sponge construction]] makes any [[sponge hash]] a natural XOF: the squeeze operation can be repeated, and the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}

	The genesis of a XOF makes it [[Collision resistance\|collision]], [[Preimage resistance\|preimage]] and [[second preimage]] resistant. Technically, any XOF can be turned into a cryptographic hash by truncating the result to a fixed length (in practice, hashes and XOFs are defined differently for [[Domain separation (cryptography)\|domain separation]]{{sfn\|Dworkin\|2014\|p=3}}). The examples of XOF include the algorithms from the [[Keccak]] family: [[SHAKE128]], [[SHAKE256]], and a variant with higher efficiency, [[KangarooTwelve]].{{sfn\|Peyrin\|Wang\|2020\|p=7}}		The genesis of a XOF makes it [[Collision resistance\|collision]], [[Preimage resistance\|preimage]] and [[second preimage]] resistant. Technically, any XOF can be turned into a cryptographic hash by truncating the result to a fixed length (in practice, hashes and XOFs are defined differently for [[Domain separation (cryptography)\|domain separation]]{{sfn\|Dworkin\|2014\|p=3}}). The examples of XOF include the algorithms from the [[Keccak]] family: [[SHAKE128]], [[SHAKE256]], and a variant with higher efficiency, [[KangarooTwelve]].{{sfn\|Peyrin\|Wang\|2020\|p=7}}

Citation bot: Add: s2cid, pages, volume, series, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Whoop whoop pull up | #UCB_webform 339/895

2023-10-29T17:47:19Z

Add: s2cid, pages, volume, series, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Whoop whoop pull up | #UCB_webform 339/895

← Previous revision		Revision as of 17:47, 29 October 2023
Line 13:		Line 13:

	==Sources==		==Sources==
	* {{cite book \| ~~last~~=Mittelbach \| ~~first~~=Arno \| last2=Fischlin \| first2=Marc \| title=The Theory of Hash Functions and Random Oracles: An Approach to Modern Cryptography \| publisher=Springer International Publishing \| series=Information Security and Cryptography \| year=2021 \| chapter = Extendable Output Functions (XOFs) \| isbn=978-3-030-63287-8 \| chapter-url=https://books.google.com/books?id=Ly8WEAAAQBAJ&pg=PA526 \| access-date=2023-06-22}}		* {{cite book \| last1=Mittelbach \| first1=Arno \| last2=Fischlin \| first2=Marc \| title=The Theory of Hash Functions and Random Oracles: An Approach to Modern Cryptography \| publisher=Springer International Publishing \| series=Information Security and Cryptography \| year=2021 \| chapter = Extendable Output Functions (XOFs) \| isbn=978-3-030-63287-8 \| chapter-url=https://books.google.com/books?id=Ly8WEAAAQBAJ&pg=PA526 \| access-date=2023-06-22}}
	* {{cite book \| ~~last~~=Peyrin \| ~~first~~=Thomas \| last2=Wang \| first2=Haoyang \| title=Advances in Cryptology – CRYPTO 2020 \| chapter=The MALICIOUS Framework: Embedding Backdoors into Tweakable Block Ciphers \| publisher=Springer International Publishing \| year=2020 \| isbn=978-3-030-56876-4 \| issn=0302-9743 \| doi=10.1007/978-3-030-56877-1_9 \| chapter-url=https://eprint.iacr.org/2020/986.pdf}}		* {{cite book \| last1=Peyrin \| first1=Thomas \| last2=Wang \| first2=Haoyang \| series=Lecture Notes in Computer Science \| volume=12172 \| pages=249–278 \| title=Advances in Cryptology – CRYPTO 2020 \| chapter=The MALICIOUS Framework: Embedding Backdoors into Tweakable Block Ciphers \| publisher=Springer International Publishing \| year=2020 \| isbn=978-3-030-56876-4 \| issn=0302-9743 \| doi=10.1007/978-3-030-56877-1_9 \| s2cid=221107066 \| chapter-url=https://eprint.iacr.org/2020/986.pdf}}
	* {{cite web \|last1=Perlner \|first1=Ray \|title=Extendable-Output Functions (XOFs) \|url=https://csrc.nist.gov/events/2014/sha-3-2014-workshop \|website=csrc.nist.gov \|publisher=[[NIST]] \|access-date=22 June 2023 \| date = August 22, 2014}}		* {{cite web \|last1=Perlner \|first1=Ray \|title=Extendable-Output Functions (XOFs) \|url=https://csrc.nist.gov/events/2014/sha-3-2014-workshop \|website=csrc.nist.gov \|publisher=[[NIST]] \|access-date=22 June 2023 \| date = August 22, 2014}}
	* {{cite web \|last1=Dworkin \|first1=Morris \|title=Domain Extensions \|url=https://csrc.nist.gov/events/2014/sha-3-2014-workshop \|website=csrc.nist.gov \|publisher=[[NIST]] \|access-date=22 June 2023 \| date = August 22, 2014}}		* {{cite web \|last1=Dworkin \|first1=Morris \|title=Domain Extensions \|url=https://csrc.nist.gov/events/2014/sha-3-2014-workshop \|website=csrc.nist.gov \|publisher=[[NIST]] \|access-date=22 June 2023 \| date = August 22, 2014}}

Dimawik: /* top */ wl

2023-08-01T22:30:46Z

top: wl

← Previous revision		Revision as of 22:30, 1 August 2023
Line 2:		Line 2:
	'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, the [[sponge construction]] makes any [[sponge hash]] a natural XOF (the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}		'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, the [[sponge construction]] makes any [[sponge hash]] a natural XOF (the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}

	The genesis of a XOF makes it [[Collision resistance\|collision]], [[Preimage resistance\|preimage]] and [[~~Second-reimage resistance\|~~second-preimage]] resistant. Technically, any XOF can be turned into a cryptographic hash by truncating the result to a fixed length (in practice, hashes and XOFs are defined differently for [[Domain separation (cryptography)\|domain separation]]{{sfn\|Dworkin\|2014\|p=3}}). The examples of XOF include the algorithms from the [[Keccak]] family: [[SHAKE128]], [[SHAKE256]], and a variant with higher efficiency, [[KangarooTwelve]].{{sfn\|Peyrin\|Wang\|2020\|p=7}}		The genesis of a XOF makes it [[Collision resistance\|collision]], [[Preimage resistance\|preimage]] and [[second preimage]] resistant. Technically, any XOF can be turned into a cryptographic hash by truncating the result to a fixed length (in practice, hashes and XOFs are defined differently for [[Domain separation (cryptography)\|domain separation]]{{sfn\|Dworkin\|2014\|p=3}}). The examples of XOF include the algorithms from the [[Keccak]] family: [[SHAKE128]], [[SHAKE256]], and a variant with higher efficiency, [[KangarooTwelve]].{{sfn\|Peyrin\|Wang\|2020\|p=7}}

	XOFs are used as [[key derivation function]]s (KDFs), [[stream cipher]]s,{{sfn\|Peyrin\|Wang\|2020\|p=7}} [[mask generation function]]s.{{sfn\|Perlner\|2014\|p=4}}		XOFs are used as [[key derivation function]]s (KDFs), [[stream cipher]]s,{{sfn\|Peyrin\|Wang\|2020\|p=7}} [[mask generation function]]s.{{sfn\|Perlner\|2014\|p=4}}

JayBeeEll: Added {{Technical}} tag

2023-07-03T00:26:27Z

Added {{Technical}} tag

← Previous revision		Revision as of 00:26, 3 July 2023
Line 1:		Line 1:
			{{Technical\|date=July 2023}}
	'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, the [[sponge construction]] makes any [[sponge hash]] a natural XOF (the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}		'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, the [[sponge construction]] makes any [[sponge hash]] a natural XOF (the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}

Dimawik: /* top */ style

2023-06-23T06:42:35Z

top: style

← Previous revision		Revision as of 06:42, 23 June 2023
Line 1:		Line 1:
	'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, ~~the nature of~~ the [[sponge construction]] makes any [[sponge hash]] a natural XOF (the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}		'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, the [[sponge construction]] makes any [[sponge hash]] a natural XOF (the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}

	The genesis of a XOF makes it [[Collision resistance\|collision]], [[Preimage resistance\|preimage]] and [[Second-reimage resistance\|second-preimage]] resistant. Technically, any XOF can be turned into a cryptographic hash by truncating the result to a fixed length (in practice, hashes and XOFs are defined differently for [[Domain separation (cryptography)\|domain separation]]{{sfn\|Dworkin\|2014\|p=3}}). The examples of XOF include the algorithms from the [[Keccak]] family: [[SHAKE128]], [[SHAKE256]], and a variant with higher efficiency, [[KangarooTwelve]].{{sfn\|Peyrin\|Wang\|2020\|p=7}}		The genesis of a XOF makes it [[Collision resistance\|collision]], [[Preimage resistance\|preimage]] and [[Second-reimage resistance\|second-preimage]] resistant. Technically, any XOF can be turned into a cryptographic hash by truncating the result to a fixed length (in practice, hashes and XOFs are defined differently for [[Domain separation (cryptography)\|domain separation]]{{sfn\|Dworkin\|2014\|p=3}}). The examples of XOF include the algorithms from the [[Keccak]] family: [[SHAKE128]], [[SHAKE256]], and a variant with higher efficiency, [[KangarooTwelve]].{{sfn\|Peyrin\|Wang\|2020\|p=7}}

BoyTheKingCanDance: Added tags to the page using Page Curation (improve categories)

2023-06-23T03:20:21Z

Added tags to the page using Page Curation (improve categories)

← Previous revision		Revision as of 03:20, 23 June 2023
Line 18:		Line 18:
	{{crypto-stub}}		{{crypto-stub}}
	[[Category:Extendable-output functions]]		[[Category:Extendable-output functions]]


			{{improve categories\|date=June 2023}}

← Previous revision		Revision as of 23:56, 25 January 2024
Line 2:		Line 2:
	'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, the [[sponge construction]] makes any [[sponge hash]] a natural XOF: the squeeze operation can be repeated, and the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}		'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, the [[sponge construction]] makes any [[sponge hash]] a natural XOF: the squeeze operation can be repeated, and the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}

	The genesis of a XOF makes it [[Collision resistance\|collision]], [[Preimage resistance\|preimage]] and [[second preimage]] resistant. Technically, any XOF can be turned into a cryptographic hash by truncating the result to a fixed length (in practice, hashes and XOFs are defined differently for [[domain separation]]{{sfn\|Dworkin\|2014\|p=3}}). The examples of XOF include the algorithms from the [[Keccak]] family: [[SHAKE128]], [[SHAKE256]], and a variant with higher efficiency, [[KangarooTwelve]].{{sfn\|Peyrin\|Wang\|2020\|p=7}}		The genesis of a XOF makes it [[Collision resistance\|collision]], [[Preimage resistance\|preimage]] and [[second preimage]] resistant. Technically, any XOF can be turned into a cryptographic hash by truncating the result to a fixed length (in practice, hashes and XOFs are defined differently for [[Domain separation (cryptography)\|domain separation]]{{sfn\|Dworkin\|2014\|p=3}}). The examples of XOF include the algorithms from the [[Keccak]] family: [[SHAKE128]], [[SHAKE256]], and a variant with higher efficiency, [[KangarooTwelve]].{{sfn\|Peyrin\|Wang\|2020\|p=7}}

	XOFs are used as [[key derivation function]]s (KDFs), [[stream cipher]]s,{{sfn\|Peyrin\|Wang\|2020\|p=7}} [[mask generation function]]s.{{sfn\|Perlner\|2014\|p=4}}		XOFs are used as [[key derivation function]]s (KDFs), [[stream cipher]]s,{{sfn\|Peyrin\|Wang\|2020\|p=7}} [[mask generation function]]s.{{sfn\|Perlner\|2014\|p=4}}

← Previous revision		Revision as of 20:42, 25 January 2024
Line 2:		Line 2:
	'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, the [[sponge construction]] makes any [[sponge hash]] a natural XOF: the squeeze operation can be repeated, and the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}		'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, the [[sponge construction]] makes any [[sponge hash]] a natural XOF: the squeeze operation can be repeated, and the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}

	The genesis of a XOF makes it [[Collision resistance\|collision]], [[Preimage resistance\|preimage]] and [[second preimage]] resistant. Technically, any XOF can be turned into a cryptographic hash by truncating the result to a fixed length (in practice, hashes and XOFs are defined differently for [[~~Domain separation (cryptography)\|~~domain separation]]{{sfn\|Dworkin\|2014\|p=3}}). The examples of XOF include the algorithms from the [[Keccak]] family: [[SHAKE128]], [[SHAKE256]], and a variant with higher efficiency, [[KangarooTwelve]].{{sfn\|Peyrin\|Wang\|2020\|p=7}}		The genesis of a XOF makes it [[Collision resistance\|collision]], [[Preimage resistance\|preimage]] and [[second preimage]] resistant. Technically, any XOF can be turned into a cryptographic hash by truncating the result to a fixed length (in practice, hashes and XOFs are defined differently for [[domain separation]]{{sfn\|Dworkin\|2014\|p=3}}). The examples of XOF include the algorithms from the [[Keccak]] family: [[SHAKE128]], [[SHAKE256]], and a variant with higher efficiency, [[KangarooTwelve]].{{sfn\|Peyrin\|Wang\|2020\|p=7}}

	XOFs are used as [[key derivation function]]s (KDFs), [[stream cipher]]s,{{sfn\|Peyrin\|Wang\|2020\|p=7}} [[mask generation function]]s.{{sfn\|Perlner\|2014\|p=4}}		XOFs are used as [[key derivation function]]s (KDFs), [[stream cipher]]s,{{sfn\|Peyrin\|Wang\|2020\|p=7}} [[mask generation function]]s.{{sfn\|Perlner\|2014\|p=4}}

← Previous revision		Revision as of 09:44, 1 November 2023
Line 1:		Line 1:
	{{Technical\|date=July 2023}}		{{Technical\|date=July 2023}}
	'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, the [[sponge construction]] makes any [[sponge hash]] a natural XOF (the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}		'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, the [[sponge construction]] makes any [[sponge hash]] a natural XOF: the squeeze operation can be repeated, and the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}

	The genesis of a XOF makes it [[Collision resistance\|collision]], [[Preimage resistance\|preimage]] and [[second preimage]] resistant. Technically, any XOF can be turned into a cryptographic hash by truncating the result to a fixed length (in practice, hashes and XOFs are defined differently for [[Domain separation (cryptography)\|domain separation]]{{sfn\|Dworkin\|2014\|p=3}}). The examples of XOF include the algorithms from the [[Keccak]] family: [[SHAKE128]], [[SHAKE256]], and a variant with higher efficiency, [[KangarooTwelve]].{{sfn\|Peyrin\|Wang\|2020\|p=7}}		The genesis of a XOF makes it [[Collision resistance\|collision]], [[Preimage resistance\|preimage]] and [[second preimage]] resistant. Technically, any XOF can be turned into a cryptographic hash by truncating the result to a fixed length (in practice, hashes and XOFs are defined differently for [[Domain separation (cryptography)\|domain separation]]{{sfn\|Dworkin\|2014\|p=3}}). The examples of XOF include the algorithms from the [[Keccak]] family: [[SHAKE128]], [[SHAKE256]], and a variant with higher efficiency, [[KangarooTwelve]].{{sfn\|Peyrin\|Wang\|2020\|p=7}}

← Previous revision		Revision as of 17:47, 29 October 2023
Line 13:		Line 13:

	==Sources==		==Sources==
	* {{cite book \| ~~last~~=Mittelbach \| ~~first~~=Arno \| last2=Fischlin \| first2=Marc \| title=The Theory of Hash Functions and Random Oracles: An Approach to Modern Cryptography \| publisher=Springer International Publishing \| series=Information Security and Cryptography \| year=2021 \| chapter = Extendable Output Functions (XOFs) \| isbn=978-3-030-63287-8 \| chapter-url=https://books.google.com/books?id=Ly8WEAAAQBAJ&pg=PA526 \| access-date=2023-06-22}}		* {{cite book \| last1=Mittelbach \| first1=Arno \| last2=Fischlin \| first2=Marc \| title=The Theory of Hash Functions and Random Oracles: An Approach to Modern Cryptography \| publisher=Springer International Publishing \| series=Information Security and Cryptography \| year=2021 \| chapter = Extendable Output Functions (XOFs) \| isbn=978-3-030-63287-8 \| chapter-url=https://books.google.com/books?id=Ly8WEAAAQBAJ&pg=PA526 \| access-date=2023-06-22}}
	* {{cite book \| ~~last~~=Peyrin \| ~~first~~=Thomas \| last2=Wang \| first2=Haoyang \| title=Advances in Cryptology – CRYPTO 2020 \| chapter=The MALICIOUS Framework: Embedding Backdoors into Tweakable Block Ciphers \| publisher=Springer International Publishing \| year=2020 \| isbn=978-3-030-56876-4 \| issn=0302-9743 \| doi=10.1007/978-3-030-56877-1_9 \| chapter-url=https://eprint.iacr.org/2020/986.pdf}}		* {{cite book \| last1=Peyrin \| first1=Thomas \| last2=Wang \| first2=Haoyang \| series=Lecture Notes in Computer Science \| volume=12172 \| pages=249–278 \| title=Advances in Cryptology – CRYPTO 2020 \| chapter=The MALICIOUS Framework: Embedding Backdoors into Tweakable Block Ciphers \| publisher=Springer International Publishing \| year=2020 \| isbn=978-3-030-56876-4 \| issn=0302-9743 \| doi=10.1007/978-3-030-56877-1_9 \| s2cid=221107066 \| chapter-url=https://eprint.iacr.org/2020/986.pdf}}
	* {{cite web \|last1=Perlner \|first1=Ray \|title=Extendable-Output Functions (XOFs) \|url=https://csrc.nist.gov/events/2014/sha-3-2014-workshop \|website=csrc.nist.gov \|publisher=[[NIST]] \|access-date=22 June 2023 \| date = August 22, 2014}}		* {{cite web \|last1=Perlner \|first1=Ray \|title=Extendable-Output Functions (XOFs) \|url=https://csrc.nist.gov/events/2014/sha-3-2014-workshop \|website=csrc.nist.gov \|publisher=[[NIST]] \|access-date=22 June 2023 \| date = August 22, 2014}}
	* {{cite web \|last1=Dworkin \|first1=Morris \|title=Domain Extensions \|url=https://csrc.nist.gov/events/2014/sha-3-2014-workshop \|website=csrc.nist.gov \|publisher=[[NIST]] \|access-date=22 June 2023 \| date = August 22, 2014}}		* {{cite web \|last1=Dworkin \|first1=Morris \|title=Domain Extensions \|url=https://csrc.nist.gov/events/2014/sha-3-2014-workshop \|website=csrc.nist.gov \|publisher=[[NIST]] \|access-date=22 June 2023 \| date = August 22, 2014}}

← Previous revision		Revision as of 22:30, 1 August 2023
Line 2:		Line 2:
	'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, the [[sponge construction]] makes any [[sponge hash]] a natural XOF (the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}		'''Extendable-output function''' ('''XOF''') is an extension{{sfn\|Peyrin\|Wang\|2020\|p=7}} of the [[cryptographic hash]] that allows its output to be arbitrarily long. In particular, the [[sponge construction]] makes any [[sponge hash]] a natural XOF (the regular hash functions with a fixed-size result are obtained from a sponge mechanism by stopping the squeezing phase after obtaining the fixed number of bits).{{sfn \| Mittelbach \| Fischlin \| 2021 \| p=526}}

	The genesis of a XOF makes it [[Collision resistance\|collision]], [[Preimage resistance\|preimage]] and [[~~Second-reimage resistance\|~~second-preimage]] resistant. Technically, any XOF can be turned into a cryptographic hash by truncating the result to a fixed length (in practice, hashes and XOFs are defined differently for [[Domain separation (cryptography)\|domain separation]]{{sfn\|Dworkin\|2014\|p=3}}). The examples of XOF include the algorithms from the [[Keccak]] family: [[SHAKE128]], [[SHAKE256]], and a variant with higher efficiency, [[KangarooTwelve]].{{sfn\|Peyrin\|Wang\|2020\|p=7}}		The genesis of a XOF makes it [[Collision resistance\|collision]], [[Preimage resistance\|preimage]] and [[second preimage]] resistant. Technically, any XOF can be turned into a cryptographic hash by truncating the result to a fixed length (in practice, hashes and XOFs are defined differently for [[Domain separation (cryptography)\|domain separation]]{{sfn\|Dworkin\|2014\|p=3}}). The examples of XOF include the algorithms from the [[Keccak]] family: [[SHAKE128]], [[SHAKE256]], and a variant with higher efficiency, [[KangarooTwelve]].{{sfn\|Peyrin\|Wang\|2020\|p=7}}

	XOFs are used as [[key derivation function]]s (KDFs), [[stream cipher]]s,{{sfn\|Peyrin\|Wang\|2020\|p=7}} [[mask generation function]]s.{{sfn\|Perlner\|2014\|p=4}}		XOFs are used as [[key derivation function]]s (KDFs), [[stream cipher]]s,{{sfn\|Peyrin\|Wang\|2020\|p=7}} [[mask generation function]]s.{{sfn\|Perlner\|2014\|p=4}}