Tiny Encryption Algorithm - Revision history

BD2412: Clean up spacing around commas and other punctuation fixes, replaced: ,C → , C

2025-03-16T03:44:41Z

Clean up spacing around commas and other punctuation fixes, replaced: ,C → , C

← Previous revision		Revision as of 03:44, 16 March 2025
Line 1:		Line 1:
			{{Short description\|Block cipher}}
	{{About-distinguish-text\|the Tiny Encryption Algorithm\|the [[~~Terrestrial_Trunked_Radio~~#~~Air_interface_encryption~~\|TETRA encryption algorithm]]}}{{~~Short~~ ~~description~~\|~~Block~~ ~~cipher~~}}		{{About-distinguish-text\|the Tiny Encryption Algorithm\|the [[Terrestrial Trunked Radio#Air interface encryption\|TETRA encryption algorithm]]}}{{Use dmy dates\|date=April 2022}}
	{{Use dmy dates\|date=April 2022}}
	{{Infobox block cipher		{{Infobox block cipher
	\| name = TEA		\| name = TEA
Line 28:		Line 28:
	TEA operates on two 32-bit [[unsigned integers]] (could be derived from a 64-bit data [[block size (cryptography)\|block]]) and uses a 128-bit [[key (cryptography)\|key]]. It has a [[Feistel network\|Feistel structure]] with a suggested 64 rounds, typically implemented in pairs termed ''cycles''. It has an extremely simple [[key schedule]], mixing all of the key material in exactly the same way for each cycle. Different multiples of a [[magic number (programming)\|magic constant]] are used to prevent simple attacks based on the [[symmetry]] of the rounds. The magic constant, 2654435769 or 0x9E3779B9 is chosen to be {{math\|⌊2{{sup\|32}}{{fraction}}{{phi}}⌋}}, where {{math\|{{phi}}}} is the [[golden ratio]] (as a [[nothing-up-my-sleeve number]]).<ref name="teapaper"/>		TEA operates on two 32-bit [[unsigned integers]] (could be derived from a 64-bit data [[block size (cryptography)\|block]]) and uses a 128-bit [[key (cryptography)\|key]]. It has a [[Feistel network\|Feistel structure]] with a suggested 64 rounds, typically implemented in pairs termed ''cycles''. It has an extremely simple [[key schedule]], mixing all of the key material in exactly the same way for each cycle. Different multiples of a [[magic number (programming)\|magic constant]] are used to prevent simple attacks based on the [[symmetry]] of the rounds. The magic constant, 2654435769 or 0x9E3779B9 is chosen to be {{math\|⌊2{{sup\|32}}{{fraction}}{{phi}}⌋}}, where {{math\|{{phi}}}} is the [[golden ratio]] (as a [[nothing-up-my-sleeve number]]).<ref name="teapaper"/>

	TEA has a few weaknesses. Most notably, it suffers from equivalent keys—each key is equivalent to three others, which means that the effective key size is only 126 [[bit]]s.<ref name="kelsey1996">{{cite book \|first1=John \|last1=Kelsey \|last2=Schneier \|first2=Bruce \|author-link2=Bruce Schneier \|last3=Wagner \|first3=David \|title=Advances in Cryptology — CRYPTO '96 \|chapter=Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES \|series=Lecture Notes in Computer Science \|url=http://www.schneier.com/paper-key-schedule.pdf \|volume=1109 \|pages=237–251 \|year=1996 \|doi=10.1007/3-540-68697-5_19 \|isbn=978-3-540-61512-5 \|access-date=25 February 2008 \|archive-date=8 February 2012 \|archive-url=https://web.archive.org/web/20120208081900/http://www.schneier.com/paper-key-schedule.pdf \|url-status=dead }}</ref> As a result, TEA is especially bad as a [[cryptographic hash function]]. This weakness led to a method for [[Hacker (hobbyist)\|hacking]] [[Microsoft]]'s [[Xbox (console)\|Xbox]] [[game console]], where the cipher was used as a hash function.<ref>{{cite web \|url=http://www.xbox-linux.org/wiki/17_Mistakes_Microsoft_Made_in_the_Xbox_Security_System#Startup_Security.2C_Take_Two \|title=17 Mistakes Microsoft Made in the Xbox Security System \|author=Michael Steil \|archive-url=https://web.archive.org/web/20090416175601/http://www.xbox-linux.org/wiki/17_Mistakes_Microsoft_Made_in_the_Xbox_Security_System \|archive-date=16 April 2009}}</ref> TEA is also susceptible to a [[related-key attack]] which requires 2<sup>23</sup> [[chosen plaintext]]s under a related-key pair, with 2<sup>32</sup> time complexity.<ref name="kelsey1997">{{cite book \|first1=John \|last1=Kelsey \|last2=Schneier \|first2=Bruce \|author-link2=Bruce Schneier \|last3=Wagner \|first3=David \|title=Information and Communications Security \|chapter=Related-key cryptanalysis of 3-WAY, Biham-DES,CAST, DES-X, NewDES, RC2, and TEA \|series=Lecture Notes in Computer Science \|		TEA has a few weaknesses. Most notably, it suffers from equivalent keys—each key is equivalent to three others, which means that the effective key size is only 126 [[bit]]s.<ref name="kelsey1996">{{cite book \|first1=John \|last1=Kelsey \|last2=Schneier \|first2=Bruce \|author-link2=Bruce Schneier \|last3=Wagner \|first3=David \|title=Advances in Cryptology — CRYPTO '96 \|chapter=Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES \|series=Lecture Notes in Computer Science \|url=http://www.schneier.com/paper-key-schedule.pdf \|volume=1109 \|pages=237–251 \|year=1996 \|doi=10.1007/3-540-68697-5_19 \|isbn=978-3-540-61512-5 \|access-date=25 February 2008 \|archive-date=8 February 2012 \|archive-url=https://web.archive.org/web/20120208081900/http://www.schneier.com/paper-key-schedule.pdf \|url-status=dead }}</ref> As a result, TEA is especially bad as a [[cryptographic hash function]]. This weakness led to a method for [[Hacker (hobbyist)\|hacking]] [[Microsoft]]'s [[Xbox (console)\|Xbox]] [[game console]], where the cipher was used as a hash function.<ref>{{cite web \|url=http://www.xbox-linux.org/wiki/17_Mistakes_Microsoft_Made_in_the_Xbox_Security_System#Startup_Security.2C_Take_Two \|title=17 Mistakes Microsoft Made in the Xbox Security System \|author=Michael Steil \|archive-url=https://web.archive.org/web/20090416175601/http://www.xbox-linux.org/wiki/17_Mistakes_Microsoft_Made_in_the_Xbox_Security_System \|archive-date=16 April 2009}}</ref> TEA is also susceptible to a [[related-key attack]] which requires 2<sup>23</sup> [[chosen plaintext]]s under a related-key pair, with 2<sup>32</sup> time complexity.<ref name="kelsey1997">{{cite book \|first1=John \|last1=Kelsey \|last2=Schneier \|first2=Bruce \|author-link2=Bruce Schneier \|last3=Wagner \|first3=David \|title=Information and Communications Security \|chapter=Related-key cryptanalysis of 3-WAY, Biham-DES, CAST, DES-X, NewDES, RC2, and TEA \|series=Lecture Notes in Computer Science \|
	url = http://www.schneier.com/paper-relatedkey.html \|		url = http://www.schneier.com/paper-relatedkey.html \|
	volume = 1334 \| pages = 233–246 \| year = 1997 \|		volume = 1334 \| pages = 233–246 \| year = 1997 \|

Suffusion of Yellow: Reverted 1 edit by Apartmienen (talk): Rm mass-aditions of WP:OR, see Wikipedia:Sockpuppet investigations/Dabadeeda5

2024-04-14T18:51:37Z

Reverted 1 edit by Apartmienen (talk): Rm mass-aditions of WP:OR, see Wikipedia:Sockpuppet investigations/Dabadeeda5

← Previous revision		Revision as of 18:51, 14 April 2024
Line 40:		Line 40:

	A third version ([[XXTEA]]), published in 1998, described further improvements for enhancing the security of the Block TEA algorithm.		A third version ([[XXTEA]]), published in 1998, described further improvements for enhancing the security of the Block TEA algorithm.

	TEA2 was released in 2006. It has exactly the same design but uses 64-bit integers instead of 32-bit integers. It no longer works on 64-bit blocks but on 128-bit blocks like AES and with 256-bit keys.<ref>{{cite web \|url=http://pccipher.free.fr/tea2/tea2.txt \|website=Alexander Pukall Web Page \|year=2006 \|title=TEA2 cipher }}</ref>

	==Reference code==		==Reference code==

Apartmienen at 22:40, 17 February 2024

2024-02-17T22:40:45Z

← Previous revision		Revision as of 22:40, 17 February 2024
Line 40:		Line 40:

	A third version ([[XXTEA]]), published in 1998, described further improvements for enhancing the security of the Block TEA algorithm.		A third version ([[XXTEA]]), published in 1998, described further improvements for enhancing the security of the Block TEA algorithm.

			TEA2 was released in 2006. It has exactly the same design but uses 64-bit integers instead of 32-bit integers. It no longer works on 64-bit blocks but on 128-bit blocks like AES and with 256-bit keys.<ref>{{cite web \|url=http://pccipher.free.fr/tea2/tea2.txt \|website=Alexander Pukall Web Page \|year=2006 \|title=TEA2 cipher }}</ref>

	==Reference code==		==Reference code==

Knot126: Grammar

2023-11-06T02:02:09Z

Grammar

← Previous revision		Revision as of 02:02, 6 November 2023
Line 1:		Line 1:
	{{About-distinguish-text\|Tiny Encryption Algorithm\|[[Terrestrial_Trunked_Radio#Air_interface_encryption\|TETRA encryption algorithm]]}}{{Short description\|Block cipher}}		{{About-distinguish-text\|the Tiny Encryption Algorithm\|the [[Terrestrial_Trunked_Radio#Air_interface_encryption\|TETRA encryption algorithm]]}}{{Short description\|Block cipher}}
	{{Use dmy dates\|date=April 2022}}		{{Use dmy dates\|date=April 2022}}
	{{Infobox block cipher		{{Infobox block cipher

Knot126: Use template to distinguish from TETRA

2023-11-06T02:01:12Z

Use template to distinguish from TETRA

← Previous revision		Revision as of 02:01, 6 November 2023
Line 1:		Line 1:
	{{Short description\|Block cipher}}		{{About-distinguish-text\|Tiny Encryption Algorithm\|[[Terrestrial_Trunked_Radio#Air_interface_encryption\|TETRA encryption algorithm]]}}{{Short description\|Block cipher}}
	{{Use dmy dates\|date=April 2022}}		{{Use dmy dates\|date=April 2022}}
	{{Infobox block cipher		{{Infobox block cipher
Line 23:		Line 23:

	The cipher is not subject to any [[patent]]s.		The cipher is not subject to any [[patent]]s.

	Note that this cipher is unrelated to the [[Terrestrial Trunked Radio#Air interface encryption\|TETRA Encryption Algorithm]].

	==Properties==		==Properties==

InternetArchiveBot: Rescuing 2 sources and tagging 0 as dead.) #IABot (v2.0.9.5) (Whoop whoop pull up - 15814

2023-10-17T01:45:51Z

Rescuing 2 sources and tagging 0 as dead.) #IABot (v2.0.9.5) (Whoop whoop pull up - 15814

← Previous revision		Revision as of 01:45, 17 October 2023
Line 30:		Line 30:
	TEA operates on two 32-bit [[unsigned integers]] (could be derived from a 64-bit data [[block size (cryptography)\|block]]) and uses a 128-bit [[key (cryptography)\|key]]. It has a [[Feistel network\|Feistel structure]] with a suggested 64 rounds, typically implemented in pairs termed ''cycles''. It has an extremely simple [[key schedule]], mixing all of the key material in exactly the same way for each cycle. Different multiples of a [[magic number (programming)\|magic constant]] are used to prevent simple attacks based on the [[symmetry]] of the rounds. The magic constant, 2654435769 or 0x9E3779B9 is chosen to be {{math\|⌊2{{sup\|32}}{{fraction}}{{phi}}⌋}}, where {{math\|{{phi}}}} is the [[golden ratio]] (as a [[nothing-up-my-sleeve number]]).<ref name="teapaper"/>		TEA operates on two 32-bit [[unsigned integers]] (could be derived from a 64-bit data [[block size (cryptography)\|block]]) and uses a 128-bit [[key (cryptography)\|key]]. It has a [[Feistel network\|Feistel structure]] with a suggested 64 rounds, typically implemented in pairs termed ''cycles''. It has an extremely simple [[key schedule]], mixing all of the key material in exactly the same way for each cycle. Different multiples of a [[magic number (programming)\|magic constant]] are used to prevent simple attacks based on the [[symmetry]] of the rounds. The magic constant, 2654435769 or 0x9E3779B9 is chosen to be {{math\|⌊2{{sup\|32}}{{fraction}}{{phi}}⌋}}, where {{math\|{{phi}}}} is the [[golden ratio]] (as a [[nothing-up-my-sleeve number]]).<ref name="teapaper"/>

	TEA has a few weaknesses. Most notably, it suffers from equivalent keys—each key is equivalent to three others, which means that the effective key size is only 126 [[bit]]s.<ref name="kelsey1996">{{cite book \|first1=John \|last1=Kelsey \|last2=Schneier \|first2=Bruce \|author-link2=Bruce Schneier \|last3=Wagner \|first3=David \|title=Advances in Cryptology — CRYPTO '96 \|chapter=Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES \|series=Lecture Notes in Computer Science \|url=http://www.schneier.com/paper-key-schedule.pdf \|volume = 1109 \|pages=237–251 \|year=1996 \|doi = 10.1007/3-540-68697-5_19 \|isbn=978-3-540-61512-5}}</ref> As a result, TEA is especially bad as a [[cryptographic hash function]]. This weakness led to a method for [[Hacker (hobbyist)\|hacking]] [[Microsoft]]'s [[Xbox (console)\|Xbox]] [[game console]], where the cipher was used as a hash function.<ref>{{cite web \|url=http://www.xbox-linux.org/wiki/17_Mistakes_Microsoft_Made_in_the_Xbox_Security_System#Startup_Security.2C_Take_Two \|title=17 Mistakes Microsoft Made in the Xbox Security System \|author=Michael Steil \|archive-url=https://web.archive.org/web/20090416175601/http://www.xbox-linux.org/wiki/17_Mistakes_Microsoft_Made_in_the_Xbox_Security_System \|archive-date=16 April 2009}}</ref> TEA is also susceptible to a [[related-key attack]] which requires 2<sup>23</sup> [[chosen plaintext]]s under a related-key pair, with 2<sup>32</sup> time complexity.<ref name="kelsey1997">{{cite book \|first1=John \|last1=Kelsey \|last2=Schneier \|first2=Bruce \|author-link2=Bruce Schneier \|last3=Wagner \|first3=David \|title=Information and Communications Security \|chapter=Related-key cryptanalysis of 3-WAY, Biham-DES,CAST, DES-X, NewDES, RC2, and TEA \|series=Lecture Notes in Computer Science \|		TEA has a few weaknesses. Most notably, it suffers from equivalent keys—each key is equivalent to three others, which means that the effective key size is only 126 [[bit]]s.<ref name="kelsey1996">{{cite book \|first1=John \|last1=Kelsey \|last2=Schneier \|first2=Bruce \|author-link2=Bruce Schneier \|last3=Wagner \|first3=David \|title=Advances in Cryptology — CRYPTO '96 \|chapter=Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES \|series=Lecture Notes in Computer Science \|url=http://www.schneier.com/paper-key-schedule.pdf \|volume=1109 \|pages=237–251 \|year=1996 \|doi=10.1007/3-540-68697-5_19 \|isbn=978-3-540-61512-5 \|access-date=25 February 2008 \|archive-date=8 February 2012 \|archive-url=https://web.archive.org/web/20120208081900/http://www.schneier.com/paper-key-schedule.pdf \|url-status=dead }}</ref> As a result, TEA is especially bad as a [[cryptographic hash function]]. This weakness led to a method for [[Hacker (hobbyist)\|hacking]] [[Microsoft]]'s [[Xbox (console)\|Xbox]] [[game console]], where the cipher was used as a hash function.<ref>{{cite web \|url=http://www.xbox-linux.org/wiki/17_Mistakes_Microsoft_Made_in_the_Xbox_Security_System#Startup_Security.2C_Take_Two \|title=17 Mistakes Microsoft Made in the Xbox Security System \|author=Michael Steil \|archive-url=https://web.archive.org/web/20090416175601/http://www.xbox-linux.org/wiki/17_Mistakes_Microsoft_Made_in_the_Xbox_Security_System \|archive-date=16 April 2009}}</ref> TEA is also susceptible to a [[related-key attack]] which requires 2<sup>23</sup> [[chosen plaintext]]s under a related-key pair, with 2<sup>32</sup> time complexity.<ref name="kelsey1997">{{cite book \|first1=John \|last1=Kelsey \|last2=Schneier \|first2=Bruce \|author-link2=Bruce Schneier \|last3=Wagner \|first3=David \|title=Information and Communications Security \|chapter=Related-key cryptanalysis of 3-WAY, Biham-DES,CAST, DES-X, NewDES, RC2, and TEA \|series=Lecture Notes in Computer Science \|
	url = http://www.schneier.com/paper-relatedkey.html \|		url = http://www.schneier.com/paper-relatedkey.html \|
	volume = 1334 \| pages = 233–246 \| year = 1997 \|		volume = 1334 \| pages = 233–246 \| year = 1997 \|
Line 108:		Line 108:
	======================={{No more links}}=============================-->		======================={{No more links}}=============================-->
	* [http://www.cix.co.uk/~klockstone/teavect.htm Test vectors for TEA]		* [http://www.cix.co.uk/~klockstone/teavect.htm Test vectors for TEA]
	* [http://www.farfarfar.com/scripts/encrypt/ JavaScript implementation of XXTEA with Base64]		* [http://www.farfarfar.com/scripts/encrypt/ JavaScript implementation of XXTEA with Base64] {{Webarchive\|url=https://web.archive.org/web/20060428132257/http://www.farfarfar.com/scripts/encrypt/ \|date=28 April 2006 }}
	* [http://www.php-einfach.de/sonstiges_generator_xtea.php PHP implementation of XTEA (German language)]		* [http://www.php-einfach.de/sonstiges_generator_xtea.php PHP implementation of XTEA (German language)]
	* [http://www.movable-type.co.uk/scripts/tea-block.html JavaScript implementation of XXTEA]		* [http://www.movable-type.co.uk/scripts/tea-block.html JavaScript implementation of XXTEA]

Itsme~enwiki: noting that this TEA is not the Tetra TEA.

2023-10-02T19:59:51Z

noting that this TEA is not the Tetra TEA.

← Previous revision		Revision as of 19:59, 2 October 2023
Line 23:		Line 23:

	The cipher is not subject to any [[patent]]s.		The cipher is not subject to any [[patent]]s.

			Note that this cipher is unrelated to the [[Terrestrial Trunked Radio#Air interface encryption\|TETRA Encryption Algorithm]].

	==Properties==		==Properties==

Citation bot: Removed parameters. | Use this bot. Report bugs. | Suggested by Abductive | #UCB_webform 2580/3850

2023-09-06T08:48:41Z

Removed parameters. | Use this bot. Report bugs. | Suggested by Abductive | #UCB_webform 2580/3850

← Previous revision		Revision as of 08:48, 6 September 2023
Line 87:		Line 87:
	* {{cite web \| first = Vikram Reddy \| last = Andem \| title = A Cryptanalysis of the Tiny Encryption Algorithm, Masters thesis \| publisher = The University of Alabama \| location = Tuscaloosa \| year = 2003 \| url = https://www.tayloredge.com/reference/Mathematics/VRAndem.pdf}}		* {{cite web \| first = Vikram Reddy \| last = Andem \| title = A Cryptanalysis of the Tiny Encryption Algorithm, Masters thesis \| publisher = The University of Alabama \| location = Tuscaloosa \| year = 2003 \| url = https://www.tayloredge.com/reference/Mathematics/VRAndem.pdf}}
	* {{cite book \| first = Julio César \| last = Hernández \|author2=Isasi, Pedro \|author3=Ribagorda, Arturo \| chapter= An application of genetic algorithms to the cryptoanalysis of one round TEA \| title = Proceedings of the 2002 Symposium on Artificial Intelligence and Its Application \| year = 2002 \|chapter-url = http://www.actapress.com/PDFViewer.aspx?paperId=26972}}		* {{cite book \| first = Julio César \| last = Hernández \|author2=Isasi, Pedro \|author3=Ribagorda, Arturo \| chapter= An application of genetic algorithms to the cryptoanalysis of one round TEA \| title = Proceedings of the 2002 Symposium on Artificial Intelligence and Its Application \| year = 2002 \|chapter-url = http://www.actapress.com/PDFViewer.aspx?paperId=26972}}
	* {{cite book \| doi = 10.1109/CEC.2003.1299943 \| first = Julio César \| last = Hernández \|author2=Sierra, José María \|author3=Isasi, Pedro \|author4=Ribargorda, Arturo ~~\| date = 2003~~ \| title = The 2003 Congress on Evolutionary Computation, 2003. CEC '03 \| chapter = Finding efficient distinguishers for cryptographic mappings, with an application to the block cipher TEA \| volume = 3 \| pages = 2189–2193 \| year = 2003 \| hdl = 10016/3944 \| isbn = 978-0-7803-7804-9 \| s2cid = 62216777 }}		* {{cite book \| doi = 10.1109/CEC.2003.1299943 \| first = Julio César \| last = Hernández \|author2=Sierra, José María \|author3=Isasi, Pedro \|author4=Ribargorda, Arturo \| title = The 2003 Congress on Evolutionary Computation, 2003. CEC '03 \| chapter = Finding efficient distinguishers for cryptographic mappings, with an application to the block cipher TEA \| volume = 3 \| pages = 2189–2193 \| year = 2003 \| hdl = 10016/3944 \| isbn = 978-0-7803-7804-9 \| s2cid = 62216777 }}
	* {{cite book \| first = Julio César \| last = Hernández \| author2 = Sierra, José María \| author3 = Ribagorda, Arturo \| author4 = Ramos, Benjamín \| author5 = Mex-Perera, J. C. \| title = Cryptography and Coding \| chapter = Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA do Not Have the SAC or do Not Generate Random Numbers \| volume = 2260 \| pages = 374–377 \| year = 2001 \| url = http://163.117.174.60/downloads/Publicaciones/2001/HernandezSRRM01.pdf \| archive-url = https://web.archive.org/web/20120426091456/http://163.117.174.60/downloads/Publicaciones/2001/HernandezSRRM01.pdf \| url-status = dead \| archive-date = 2012-04-26 \| doi = 10.1007/3-540-45325-3_34 \| series = Lecture Notes in Computer Science \| isbn = 978-3-540-43026-1 }}		* {{cite book \| first = Julio César \| last = Hernández \| author2 = Sierra, José María \| author3 = Ribagorda, Arturo \| author4 = Ramos, Benjamín \| author5 = Mex-Perera, J. C. \| title = Cryptography and Coding \| chapter = Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA do Not Have the SAC or do Not Generate Random Numbers \| volume = 2260 \| pages = 374–377 \| year = 2001 \| url = http://163.117.174.60/downloads/Publicaciones/2001/HernandezSRRM01.pdf \| archive-url = https://web.archive.org/web/20120426091456/http://163.117.174.60/downloads/Publicaciones/2001/HernandezSRRM01.pdf \| url-status = dead \| archive-date = 2012-04-26 \| doi = 10.1007/3-540-45325-3_34 \| series = Lecture Notes in Computer Science \| isbn = 978-3-540-43026-1 }}
	* {{cite book \| first = Dukjae \| last = Moon \|author2=Hwang, Kyungdeok \|author3=Lee, Wonil \|author4=Lee, Sangjin \|author5=Lim, Jongin \| title = Fast Software Encryption \| chapter = Impossible Differential Cryptanalysis of Reduced Round XTEA and TEA \| series = Lecture Notes in Computer Science \| volume = 2365 \| pages = 49–60 \| year = 2002 \| url = https://www.iacr.org/archive/fse2002/23650050/23650050.pdf \| doi = 10.1007/3-540-45661-9_4\| isbn = 978-3-540-44009-3 }}		* {{cite book \| first = Dukjae \| last = Moon \|author2=Hwang, Kyungdeok \|author3=Lee, Wonil \|author4=Lee, Sangjin \|author5=Lim, Jongin \| title = Fast Software Encryption \| chapter = Impossible Differential Cryptanalysis of Reduced Round XTEA and TEA \| series = Lecture Notes in Computer Science \| volume = 2365 \| pages = 49–60 \| year = 2002 \| url = https://www.iacr.org/archive/fse2002/23650050/23650050.pdf \| doi = 10.1007/3-540-45661-9_4\| isbn = 978-3-540-44009-3 }}

Ira Leviton: Fixed a reference. Please see Category:CS1 errors: unsupported parameter.

2023-08-27T18:52:44Z

Fixed a reference. Please see Category:CS1 errors: unsupported parameter.

← Previous revision		Revision as of 18:52, 27 August 2023
Line 85:		Line 85:
	==References==		==References==

	* {{cite ~~document~~ \| first = Vikram Reddy \| last = Andem \| title = A Cryptanalysis of the Tiny Encryption Algorithm, Masters thesis \| publisher = The University of Alabama \| location = Tuscaloosa \| year = 2003 \| url = https://www.tayloredge.com/reference/Mathematics/VRAndem.pdf}}		* {{cite web \| first = Vikram Reddy \| last = Andem \| title = A Cryptanalysis of the Tiny Encryption Algorithm, Masters thesis \| publisher = The University of Alabama \| location = Tuscaloosa \| year = 2003 \| url = https://www.tayloredge.com/reference/Mathematics/VRAndem.pdf}}
	* {{cite book \| first = Julio César \| last = Hernández \|author2=Isasi, Pedro \|author3=Ribagorda, Arturo \| chapter= An application of genetic algorithms to the cryptoanalysis of one round TEA \| title = Proceedings of the 2002 Symposium on Artificial Intelligence and Its Application \| year = 2002 \|chapter-url = http://www.actapress.com/PDFViewer.aspx?paperId=26972}}		* {{cite book \| first = Julio César \| last = Hernández \|author2=Isasi, Pedro \|author3=Ribagorda, Arturo \| chapter= An application of genetic algorithms to the cryptoanalysis of one round TEA \| title = Proceedings of the 2002 Symposium on Artificial Intelligence and Its Application \| year = 2002 \|chapter-url = http://www.actapress.com/PDFViewer.aspx?paperId=26972}}
	* {{cite book \| doi = 10.1109/CEC.2003.1299943 \| first = Julio César \| last = Hernández \|author2=Sierra, José María \|author3=Isasi, Pedro \|author4=Ribargorda, Arturo \| date = 2003 \| title = The 2003 Congress on Evolutionary Computation, 2003. CEC '03 \| chapter = Finding efficient distinguishers for cryptographic mappings, with an application to the block cipher TEA \| volume = 3 \| pages = 2189–2193 \| year = 2003 \| hdl = 10016/3944 \| isbn = 978-0-7803-7804-9 \| s2cid = 62216777 }}		* {{cite book \| doi = 10.1109/CEC.2003.1299943 \| first = Julio César \| last = Hernández \|author2=Sierra, José María \|author3=Isasi, Pedro \|author4=Ribargorda, Arturo \| date = 2003 \| title = The 2003 Congress on Evolutionary Computation, 2003. CEC '03 \| chapter = Finding efficient distinguishers for cryptographic mappings, with an application to the block cipher TEA \| volume = 3 \| pages = 2189–2193 \| year = 2003 \| hdl = 10016/3944 \| isbn = 978-0-7803-7804-9 \| s2cid = 62216777 }}

Headbomb: /* References */ ce

2023-08-22T13:28:30Z

References: ce

← Previous revision		Revision as of 13:28, 22 August 2023
Line 86:		Line 86:

	* {{cite document \| first = Vikram Reddy \| last = Andem \| title = A Cryptanalysis of the Tiny Encryption Algorithm, Masters thesis \| publisher = The University of Alabama \| location = Tuscaloosa \| year = 2003 \| url = https://www.tayloredge.com/reference/Mathematics/VRAndem.pdf}}		* {{cite document \| first = Vikram Reddy \| last = Andem \| title = A Cryptanalysis of the Tiny Encryption Algorithm, Masters thesis \| publisher = The University of Alabama \| location = Tuscaloosa \| year = 2003 \| url = https://www.tayloredge.com/reference/Mathematics/VRAndem.pdf}}
	* {{cite book \| first = Julio César \| last = Hernández \|author2=Isasi, Pedro \|author3=Ribagorda, Arturo \| chapter= An application of genetic algorithms to the cryptoanalysis of one round TEA \| title = Proceedings of the 2002 Symposium on Artificial Intelligence and Its Application \| year = 2002 \| url = http://www.actapress.com/PDFViewer.aspx?paperId=26972}}		* {{cite book \| first = Julio César \| last = Hernández \|author2=Isasi, Pedro \|author3=Ribagorda, Arturo \| chapter= An application of genetic algorithms to the cryptoanalysis of one round TEA \| title = Proceedings of the 2002 Symposium on Artificial Intelligence and Its Application \| year = 2002 \|chapter-url = http://www.actapress.com/PDFViewer.aspx?paperId=26972}}
	* {{cite book \| doi = 10.1109/CEC.2003.1299943 \| first = Julio César \| last = Hernández \|author2=Sierra, José María \|author3=Isasi, Pedro \|author4=Ribargorda, Arturo \| date = 2003 \| title = The 2003 Congress on Evolutionary Computation, 2003. CEC '03 \| chapter = Finding efficient distinguishers for cryptographic mappings, with an application to the block cipher TEA \| volume = 3 \| pages = 2189–2193 \| year = 2003 \| hdl = 10016/3944 \| isbn = 978-0-7803-7804-9 \| s2cid = 62216777 }}		* {{cite book \| doi = 10.1109/CEC.2003.1299943 \| first = Julio César \| last = Hernández \|author2=Sierra, José María \|author3=Isasi, Pedro \|author4=Ribargorda, Arturo \| date = 2003 \| title = The 2003 Congress on Evolutionary Computation, 2003. CEC '03 \| chapter = Finding efficient distinguishers for cryptographic mappings, with an application to the block cipher TEA \| volume = 3 \| pages = 2189–2193 \| year = 2003 \| hdl = 10016/3944 \| isbn = 978-0-7803-7804-9 \| s2cid = 62216777 }}
	* {{cite book \| first = Julio César \| last = Hernández \| author2 = Sierra, José María \| author3 = Ribagorda, Arturo \| author4 = Ramos, Benjamín \| author5 = Mex-Perera, J. C. \| title = Cryptography and Coding \| chapter = Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA do Not Have the SAC or do Not Generate Random Numbers \| volume = 2260 \| pages = 374–377 \| year = 2001 \| url = http://163.117.174.60/downloads/Publicaciones/2001/HernandezSRRM01.pdf \| archive-url = https://web.archive.org/web/20120426091456/http://163.117.174.60/downloads/Publicaciones/2001/HernandezSRRM01.pdf \| url-status = dead \| archive-date = 2012-04-26 \| doi = 10.1007/3-540-45325-3_34 \| series = Lecture Notes in Computer Science \| isbn = 978-3-540-43026-1 }}		* {{cite book \| first = Julio César \| last = Hernández \| author2 = Sierra, José María \| author3 = Ribagorda, Arturo \| author4 = Ramos, Benjamín \| author5 = Mex-Perera, J. C. \| title = Cryptography and Coding \| chapter = Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA do Not Have the SAC or do Not Generate Random Numbers \| volume = 2260 \| pages = 374–377 \| year = 2001 \| url = http://163.117.174.60/downloads/Publicaciones/2001/HernandezSRRM01.pdf \| archive-url = https://web.archive.org/web/20120426091456/http://163.117.174.60/downloads/Publicaciones/2001/HernandezSRRM01.pdf \| url-status = dead \| archive-date = 2012-04-26 \| doi = 10.1007/3-540-45325-3_34 \| series = Lecture Notes in Computer Science \| isbn = 978-3-540-43026-1 }}

← Previous revision		Revision as of 03:44, 16 March 2025
Line 1:		Line 1:
			{{Short description\|Block cipher}}
	{{About-distinguish-text\|the Tiny Encryption Algorithm\|the [[~~Terrestrial_Trunked_Radio~~#~~Air_interface_encryption~~\|TETRA encryption algorithm]]}}{{~~Short~~ ~~description~~\|~~Block~~ ~~cipher~~}}		{{About-distinguish-text\|the Tiny Encryption Algorithm\|the [[Terrestrial Trunked Radio#Air interface encryption\|TETRA encryption algorithm]]}}{{Use dmy dates\|date=April 2022}}
	{{Use dmy dates\|date=April 2022}}
	{{Infobox block cipher		{{Infobox block cipher
	\| name = TEA		\| name = TEA
Line 28:		Line 28:
	TEA operates on two 32-bit [[unsigned integers]] (could be derived from a 64-bit data [[block size (cryptography)\|block]]) and uses a 128-bit [[key (cryptography)\|key]]. It has a [[Feistel network\|Feistel structure]] with a suggested 64 rounds, typically implemented in pairs termed ''cycles''. It has an extremely simple [[key schedule]], mixing all of the key material in exactly the same way for each cycle. Different multiples of a [[magic number (programming)\|magic constant]] are used to prevent simple attacks based on the [[symmetry]] of the rounds. The magic constant, 2654435769 or 0x9E3779B9 is chosen to be {{math\|⌊2{{sup\|32}}{{fraction}}{{phi}}⌋}}, where {{math\|{{phi}}}} is the [[golden ratio]] (as a [[nothing-up-my-sleeve number]]).<ref name="teapaper"/>		TEA operates on two 32-bit [[unsigned integers]] (could be derived from a 64-bit data [[block size (cryptography)\|block]]) and uses a 128-bit [[key (cryptography)\|key]]. It has a [[Feistel network\|Feistel structure]] with a suggested 64 rounds, typically implemented in pairs termed ''cycles''. It has an extremely simple [[key schedule]], mixing all of the key material in exactly the same way for each cycle. Different multiples of a [[magic number (programming)\|magic constant]] are used to prevent simple attacks based on the [[symmetry]] of the rounds. The magic constant, 2654435769 or 0x9E3779B9 is chosen to be {{math\|⌊2{{sup\|32}}{{fraction}}{{phi}}⌋}}, where {{math\|{{phi}}}} is the [[golden ratio]] (as a [[nothing-up-my-sleeve number]]).<ref name="teapaper"/>

	TEA has a few weaknesses. Most notably, it suffers from equivalent keys—each key is equivalent to three others, which means that the effective key size is only 126 [[bit]]s.<ref name="kelsey1996">{{cite book \|first1=John \|last1=Kelsey \|last2=Schneier \|first2=Bruce \|author-link2=Bruce Schneier \|last3=Wagner \|first3=David \|title=Advances in Cryptology — CRYPTO '96 \|chapter=Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES \|series=Lecture Notes in Computer Science \|url=http://www.schneier.com/paper-key-schedule.pdf \|volume=1109 \|pages=237–251 \|year=1996 \|doi=10.1007/3-540-68697-5_19 \|isbn=978-3-540-61512-5 \|access-date=25 February 2008 \|archive-date=8 February 2012 \|archive-url=https://web.archive.org/web/20120208081900/http://www.schneier.com/paper-key-schedule.pdf \|url-status=dead }}</ref> As a result, TEA is especially bad as a [[cryptographic hash function]]. This weakness led to a method for [[Hacker (hobbyist)\|hacking]] [[Microsoft]]'s [[Xbox (console)\|Xbox]] [[game console]], where the cipher was used as a hash function.<ref>{{cite web \|url=http://www.xbox-linux.org/wiki/17_Mistakes_Microsoft_Made_in_the_Xbox_Security_System#Startup_Security.2C_Take_Two \|title=17 Mistakes Microsoft Made in the Xbox Security System \|author=Michael Steil \|archive-url=https://web.archive.org/web/20090416175601/http://www.xbox-linux.org/wiki/17_Mistakes_Microsoft_Made_in_the_Xbox_Security_System \|archive-date=16 April 2009}}</ref> TEA is also susceptible to a [[related-key attack]] which requires 2<sup>23</sup> [[chosen plaintext]]s under a related-key pair, with 2<sup>32</sup> time complexity.<ref name="kelsey1997">{{cite book \|first1=John \|last1=Kelsey \|last2=Schneier \|first2=Bruce \|author-link2=Bruce Schneier \|last3=Wagner \|first3=David \|title=Information and Communications Security \|chapter=Related-key cryptanalysis of 3-WAY, Biham-DES,CAST, DES-X, NewDES, RC2, and TEA \|series=Lecture Notes in Computer Science \|		TEA has a few weaknesses. Most notably, it suffers from equivalent keys—each key is equivalent to three others, which means that the effective key size is only 126 [[bit]]s.<ref name="kelsey1996">{{cite book \|first1=John \|last1=Kelsey \|last2=Schneier \|first2=Bruce \|author-link2=Bruce Schneier \|last3=Wagner \|first3=David \|title=Advances in Cryptology — CRYPTO '96 \|chapter=Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES \|series=Lecture Notes in Computer Science \|url=http://www.schneier.com/paper-key-schedule.pdf \|volume=1109 \|pages=237–251 \|year=1996 \|doi=10.1007/3-540-68697-5_19 \|isbn=978-3-540-61512-5 \|access-date=25 February 2008 \|archive-date=8 February 2012 \|archive-url=https://web.archive.org/web/20120208081900/http://www.schneier.com/paper-key-schedule.pdf \|url-status=dead }}</ref> As a result, TEA is especially bad as a [[cryptographic hash function]]. This weakness led to a method for [[Hacker (hobbyist)\|hacking]] [[Microsoft]]'s [[Xbox (console)\|Xbox]] [[game console]], where the cipher was used as a hash function.<ref>{{cite web \|url=http://www.xbox-linux.org/wiki/17_Mistakes_Microsoft_Made_in_the_Xbox_Security_System#Startup_Security.2C_Take_Two \|title=17 Mistakes Microsoft Made in the Xbox Security System \|author=Michael Steil \|archive-url=https://web.archive.org/web/20090416175601/http://www.xbox-linux.org/wiki/17_Mistakes_Microsoft_Made_in_the_Xbox_Security_System \|archive-date=16 April 2009}}</ref> TEA is also susceptible to a [[related-key attack]] which requires 2<sup>23</sup> [[chosen plaintext]]s under a related-key pair, with 2<sup>32</sup> time complexity.<ref name="kelsey1997">{{cite book \|first1=John \|last1=Kelsey \|last2=Schneier \|first2=Bruce \|author-link2=Bruce Schneier \|last3=Wagner \|first3=David \|title=Information and Communications Security \|chapter=Related-key cryptanalysis of 3-WAY, Biham-DES, CAST, DES-X, NewDES, RC2, and TEA \|series=Lecture Notes in Computer Science \|
	url = http://www.schneier.com/paper-relatedkey.html \|		url = http://www.schneier.com/paper-relatedkey.html \|
	volume = 1334 \| pages = 233–246 \| year = 1997 \|		volume = 1334 \| pages = 233–246 \| year = 1997 \|

← Previous revision		Revision as of 08:48, 6 September 2023
Line 87:		Line 87:
	* {{cite web \| first = Vikram Reddy \| last = Andem \| title = A Cryptanalysis of the Tiny Encryption Algorithm, Masters thesis \| publisher = The University of Alabama \| location = Tuscaloosa \| year = 2003 \| url = https://www.tayloredge.com/reference/Mathematics/VRAndem.pdf}}		* {{cite web \| first = Vikram Reddy \| last = Andem \| title = A Cryptanalysis of the Tiny Encryption Algorithm, Masters thesis \| publisher = The University of Alabama \| location = Tuscaloosa \| year = 2003 \| url = https://www.tayloredge.com/reference/Mathematics/VRAndem.pdf}}
	* {{cite book \| first = Julio César \| last = Hernández \|author2=Isasi, Pedro \|author3=Ribagorda, Arturo \| chapter= An application of genetic algorithms to the cryptoanalysis of one round TEA \| title = Proceedings of the 2002 Symposium on Artificial Intelligence and Its Application \| year = 2002 \|chapter-url = http://www.actapress.com/PDFViewer.aspx?paperId=26972}}		* {{cite book \| first = Julio César \| last = Hernández \|author2=Isasi, Pedro \|author3=Ribagorda, Arturo \| chapter= An application of genetic algorithms to the cryptoanalysis of one round TEA \| title = Proceedings of the 2002 Symposium on Artificial Intelligence and Its Application \| year = 2002 \|chapter-url = http://www.actapress.com/PDFViewer.aspx?paperId=26972}}
	* {{cite book \| doi = 10.1109/CEC.2003.1299943 \| first = Julio César \| last = Hernández \|author2=Sierra, José María \|author3=Isasi, Pedro \|author4=Ribargorda, Arturo ~~\| date = 2003~~ \| title = The 2003 Congress on Evolutionary Computation, 2003. CEC '03 \| chapter = Finding efficient distinguishers for cryptographic mappings, with an application to the block cipher TEA \| volume = 3 \| pages = 2189–2193 \| year = 2003 \| hdl = 10016/3944 \| isbn = 978-0-7803-7804-9 \| s2cid = 62216777 }}		* {{cite book \| doi = 10.1109/CEC.2003.1299943 \| first = Julio César \| last = Hernández \|author2=Sierra, José María \|author3=Isasi, Pedro \|author4=Ribargorda, Arturo \| title = The 2003 Congress on Evolutionary Computation, 2003. CEC '03 \| chapter = Finding efficient distinguishers for cryptographic mappings, with an application to the block cipher TEA \| volume = 3 \| pages = 2189–2193 \| year = 2003 \| hdl = 10016/3944 \| isbn = 978-0-7803-7804-9 \| s2cid = 62216777 }}
	* {{cite book \| first = Julio César \| last = Hernández \| author2 = Sierra, José María \| author3 = Ribagorda, Arturo \| author4 = Ramos, Benjamín \| author5 = Mex-Perera, J. C. \| title = Cryptography and Coding \| chapter = Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA do Not Have the SAC or do Not Generate Random Numbers \| volume = 2260 \| pages = 374–377 \| year = 2001 \| url = http://163.117.174.60/downloads/Publicaciones/2001/HernandezSRRM01.pdf \| archive-url = https://web.archive.org/web/20120426091456/http://163.117.174.60/downloads/Publicaciones/2001/HernandezSRRM01.pdf \| url-status = dead \| archive-date = 2012-04-26 \| doi = 10.1007/3-540-45325-3_34 \| series = Lecture Notes in Computer Science \| isbn = 978-3-540-43026-1 }}		* {{cite book \| first = Julio César \| last = Hernández \| author2 = Sierra, José María \| author3 = Ribagorda, Arturo \| author4 = Ramos, Benjamín \| author5 = Mex-Perera, J. C. \| title = Cryptography and Coding \| chapter = Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA do Not Have the SAC or do Not Generate Random Numbers \| volume = 2260 \| pages = 374–377 \| year = 2001 \| url = http://163.117.174.60/downloads/Publicaciones/2001/HernandezSRRM01.pdf \| archive-url = https://web.archive.org/web/20120426091456/http://163.117.174.60/downloads/Publicaciones/2001/HernandezSRRM01.pdf \| url-status = dead \| archive-date = 2012-04-26 \| doi = 10.1007/3-540-45325-3_34 \| series = Lecture Notes in Computer Science \| isbn = 978-3-540-43026-1 }}
	* {{cite book \| first = Dukjae \| last = Moon \|author2=Hwang, Kyungdeok \|author3=Lee, Wonil \|author4=Lee, Sangjin \|author5=Lim, Jongin \| title = Fast Software Encryption \| chapter = Impossible Differential Cryptanalysis of Reduced Round XTEA and TEA \| series = Lecture Notes in Computer Science \| volume = 2365 \| pages = 49–60 \| year = 2002 \| url = https://www.iacr.org/archive/fse2002/23650050/23650050.pdf \| doi = 10.1007/3-540-45661-9_4\| isbn = 978-3-540-44009-3 }}		* {{cite book \| first = Dukjae \| last = Moon \|author2=Hwang, Kyungdeok \|author3=Lee, Wonil \|author4=Lee, Sangjin \|author5=Lim, Jongin \| title = Fast Software Encryption \| chapter = Impossible Differential Cryptanalysis of Reduced Round XTEA and TEA \| series = Lecture Notes in Computer Science \| volume = 2365 \| pages = 49–60 \| year = 2002 \| url = https://www.iacr.org/archive/fse2002/23650050/23650050.pdf \| doi = 10.1007/3-540-45661-9_4\| isbn = 978-3-540-44009-3 }}

← Previous revision		Revision as of 13:28, 22 August 2023
Line 86:		Line 86:

	* {{cite document \| first = Vikram Reddy \| last = Andem \| title = A Cryptanalysis of the Tiny Encryption Algorithm, Masters thesis \| publisher = The University of Alabama \| location = Tuscaloosa \| year = 2003 \| url = https://www.tayloredge.com/reference/Mathematics/VRAndem.pdf}}		* {{cite document \| first = Vikram Reddy \| last = Andem \| title = A Cryptanalysis of the Tiny Encryption Algorithm, Masters thesis \| publisher = The University of Alabama \| location = Tuscaloosa \| year = 2003 \| url = https://www.tayloredge.com/reference/Mathematics/VRAndem.pdf}}
	* {{cite book \| first = Julio César \| last = Hernández \|author2=Isasi, Pedro \|author3=Ribagorda, Arturo \| chapter= An application of genetic algorithms to the cryptoanalysis of one round TEA \| title = Proceedings of the 2002 Symposium on Artificial Intelligence and Its Application \| year = 2002 \| url = http://www.actapress.com/PDFViewer.aspx?paperId=26972}}		* {{cite book \| first = Julio César \| last = Hernández \|author2=Isasi, Pedro \|author3=Ribagorda, Arturo \| chapter= An application of genetic algorithms to the cryptoanalysis of one round TEA \| title = Proceedings of the 2002 Symposium on Artificial Intelligence and Its Application \| year = 2002 \|chapter-url = http://www.actapress.com/PDFViewer.aspx?paperId=26972}}
	* {{cite book \| doi = 10.1109/CEC.2003.1299943 \| first = Julio César \| last = Hernández \|author2=Sierra, José María \|author3=Isasi, Pedro \|author4=Ribargorda, Arturo \| date = 2003 \| title = The 2003 Congress on Evolutionary Computation, 2003. CEC '03 \| chapter = Finding efficient distinguishers for cryptographic mappings, with an application to the block cipher TEA \| volume = 3 \| pages = 2189–2193 \| year = 2003 \| hdl = 10016/3944 \| isbn = 978-0-7803-7804-9 \| s2cid = 62216777 }}		* {{cite book \| doi = 10.1109/CEC.2003.1299943 \| first = Julio César \| last = Hernández \|author2=Sierra, José María \|author3=Isasi, Pedro \|author4=Ribargorda, Arturo \| date = 2003 \| title = The 2003 Congress on Evolutionary Computation, 2003. CEC '03 \| chapter = Finding efficient distinguishers for cryptographic mappings, with an application to the block cipher TEA \| volume = 3 \| pages = 2189–2193 \| year = 2003 \| hdl = 10016/3944 \| isbn = 978-0-7803-7804-9 \| s2cid = 62216777 }}
	* {{cite book \| first = Julio César \| last = Hernández \| author2 = Sierra, José María \| author3 = Ribagorda, Arturo \| author4 = Ramos, Benjamín \| author5 = Mex-Perera, J. C. \| title = Cryptography and Coding \| chapter = Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA do Not Have the SAC or do Not Generate Random Numbers \| volume = 2260 \| pages = 374–377 \| year = 2001 \| url = http://163.117.174.60/downloads/Publicaciones/2001/HernandezSRRM01.pdf \| archive-url = https://web.archive.org/web/20120426091456/http://163.117.174.60/downloads/Publicaciones/2001/HernandezSRRM01.pdf \| url-status = dead \| archive-date = 2012-04-26 \| doi = 10.1007/3-540-45325-3_34 \| series = Lecture Notes in Computer Science \| isbn = 978-3-540-43026-1 }}		* {{cite book \| first = Julio César \| last = Hernández \| author2 = Sierra, José María \| author3 = Ribagorda, Arturo \| author4 = Ramos, Benjamín \| author5 = Mex-Perera, J. C. \| title = Cryptography and Coding \| chapter = Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA do Not Have the SAC or do Not Generate Random Numbers \| volume = 2260 \| pages = 374–377 \| year = 2001 \| url = http://163.117.174.60/downloads/Publicaciones/2001/HernandezSRRM01.pdf \| archive-url = https://web.archive.org/web/20120426091456/http://163.117.174.60/downloads/Publicaciones/2001/HernandezSRRM01.pdf \| url-status = dead \| archive-date = 2012-04-26 \| doi = 10.1007/3-540-45325-3_34 \| series = Lecture Notes in Computer Science \| isbn = 978-3-540-43026-1 }}