|
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 64-bit block Feistel cipher with a 128-bit key and a suggested 64 rounds. Several differences from TEA are apparent, including a somewhat more complex key-schedule and a rearrangement of the shifts, XORs, and additions. ==Implementations== 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 / * take 64 bits of data in v() and v() and 128 bits of key() - key() */ void encipher(unsigned int num_rounds, uint32_t v(), uint32_t const key()) void decipher(unsigned int num_rounds, uint32_t v(), uint32_t const key()) The changes from the reference source code are minor: * The reference source code used the unsigned long type rather than the 64-bit clean uint32_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 +=;The recommended value for the "num_rounds" parameter is 32, not 64, as each iteration of the loop does two Feistel-cipher rounds. To additionally improve speed, the loop can be unrolled by pre-computing the values of sum+key[]. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「XTEA」の詳細全文を読む スポンサード リンク
|