Tiny Encryption Algorithm: Difference between revisions
imported>Sandy Harris mNo edit summary |
John Leach (talk | contribs) m (Text replacement - "{{subpages}}" to "{{PropDel}}<br><br>{{subpages}}") |
||
| Line 1: | Line 1: | ||
{{subpages}} | {{PropDel}}<br><br>{{subpages}} | ||
The '''Tiny Encryption Algorithm''', or '''TEA''' | The '''Tiny Encryption Algorithm''', or '''TEA''' | ||
<ref> {{citation | <ref> {{citation | ||
Latest revision as of 04:49, 8 April 2024
| This article may be deleted soon. | ||
|---|---|---|
 The Tiny Encryption Algorithm, or TEA [1] is a block cipher designed for small size and easy software implementation. It is a Feistel cipher with 64-bit blocks, a 128-bit key, 32 rounds and a very simple round function using only 32-bit operations — addition, bitwise XOR and shift. In C, the encryption and decryption routines are under 10 lines each. No S-boxes are used, so the data space required is also tiny. TEA has some weaknesses. Equivalent keys are one problem; each key is equivalent to three others, so the effective key size is only 126 bits. [2]. As a result, TEA is weak if used to build a cryptographic hash. This weakness led to a method for hacking Microsoft's Xbox game console, where the cipher was used as a hash function. [3] TEA is also susceptible to a related-key attack which requires 223 chosen plaintexts under a related-key pair, with 232 time complexity [4]. Partly because of these weaknesses, a number of revisions of TEA have been designed. Block TEA or XTEA extends TEA to build a variable block size cipher. XXTEA is a later revision. The cipher is freely available for any use. It has a home page. References
|
||
