In cryptography, XTEA (eXtended TEA) is a block cipher designed to correct weaknesses in TEA. The cipher's designers were David Wheeler and Roger Needham of the Cambridge Computer Laboratory, and the algorithm was presented in an unpublished technical report in 1997 (Needham and Wheeler, 1997). It is not subject to any patents.
Like TEA, XTEA is a 64bit block Feistel network with a 128bit key and a suggested 64 rounds. Several differences from TEA are apparent, including a somewhat more complex keyschedule and a rearrangement of the shifts, XORs, and additions.
Presented along with XTEA was a variablewidth block cipher termed Block TEA, which uses the XTEA round function but applies it cyclically across an entire message for several iterations. Because it operates on the entire message, Block TEA has the property that it does not need a mode of operation. An attack on the full Block TEA was described in (Saarinen, 1998), which also details a weakness in Block TEA's successor, XXTEA.
{{Infobox }}, the best attack reported on XTEA is a relatedkey differential attack on 27 out of 64 rounds of XTEA, requiring 2^{20.5} chosen plaintexts and a time complexity of 2^{115.15} (Ko et al., 2004).ImplementationsEdit
This standard C source code, adapted from the reference code released into the public domain by David Wheeler and Roger Needham, encrypts and decrypts using XTEA:
#include <stdint.h> /* take 64 bits of data in v[0] and v[1] and 128 bits of key in k[0]  k[3] */ void encipher(unsigned int num_rounds, uint32_t v[2], uint32_t const k[4]) { unsigned int i; uint32_t v0=v[0], v1=v[1], sum=0, delta=0x9E3779B9; for (i=0; i < num_rounds; i++) { v0 += (((v1 << 4) ^ (v1 >> 5)) + v1) ^ (sum + k[sum & 3]); sum += delta; v1 += (((v0 << 4) ^ (v0 >> 5)) + v0) ^ (sum + k[(sum>>11) & 3]); } v[0]=v0; v[1]=v1; } void decipher(unsigned int num_rounds, uint32_t v[2], uint32_t const k[4]) { unsigned int i; uint32_t v0=v[0], v1=v[1], delta=0x9E3779B9, sum=delta*num_rounds; for (i=0; i < num_rounds; i++) { v1 = (((v0 << 4) ^ (v0 >> 5)) + v0) ^ (sum + k[(sum>>11) & 3]); sum = delta; v0 = (((v1 << 4) ^ (v1 >> 5)) + v1) ^ (sum + k[sum & 3]); } v[0]=v0; v[1]=v1; }
The changes from the reference source code are minor:
 The reference source code used the
unsigned long
type rather than the 64bit cleanuint32_t
.  The reference source code did not use
const
types.  The reference source code omitted redundant parentheses, using C precedence to write the round function as e.g.
v1 += (v0<<4 ^ v0>>5) + v0 ^ sum + k[sum>>11 & 3]
;
The recommended value for the "num_rounds" parameter is 32, not 64, as each iteration of the loop does two Feistelnetwork rounds. To additionally improve speed, the loop can be unrolled by precomputing the values of sum+k[].
See alsoEdit
 RC4 — A stream cipher that, just like XTEA, is designed to be very simple to implement.
 XXTEA — Block TEA's successor.
 TEA — Block TEA's precursor.
ReferencesEdit
 Youngdai Ko, Seokhie Hong, Wonil Lee, Sangjin Lee, and Jongin Lim. "Related key differential attacks on 27 rounds of XTEA and full rounds of GOST." In Proceedings of FSE '04, Lecture Notes in Computer Science, 2004. SpringerVerlag.
 Seokhie Hong, Deukjo Hong, Youngdai Ko, Donghoon Chang, Wonil Lee, and Sangjin Lee. "Differential cryptanalysis of TEA and XTEA." In Proceedings of ICISC 2003, 2003b.
 Dukjae Moon, Kyungdeok Hwang, Wonil Lee, Sangjin Lee, and Jongin Lim. "Impossible differential cryptanalysis of reduced round XTEA and TEA." Lecture Notes in Computer Science, 2365: 4960, 2002. ISSN 03029743.
 Roger M. Needham and David J. Wheeler. "Tea extensions." Technical report, Computer Laboratory, University of Cambridge, October 1997.
 Vikram Reddy Andem. "A Cryptanalysis of the Tiny Encryption Algorithm", Masters thesis, The University of Alabama, Tuscaloosa, 2003.
 MarkkuJuhani Saarinen. "Cryptanalysis of Block TEA." Unpublished manuscript, October 1998. Can be found on the author's homepage or in the sci.crypt.research Usenet archive.
 Template:Citation
External linksEdit
 DataFlow Diagram
 A web page advocating TEA and XTEA and providing a variety of implementations
 Test vectors for TEA and XTEA
 A Cryptanalysis of the Tiny Encryption Algorithm
 PHP implementation of XTEA
 Pascal/Delphi implementation of XTEA
 Java implementation of XTEA (32 rounds)
 Python implementation of XTEA
 Linden Scripting Language (LSL) implementation of XTEA for Second Life scripting
 Verilog implementation of XTEA

es:Extended Tiny Encryption Algorithm fr:XTEA it:XTEA ru:XTEA