| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149 | /** * Copyright: Copyright (C) Thomas Dixon 2008. All rights reserved. * License: BSD style: $(LICENSE) * Authors: Thomas Dixon */ module tango.util.cipher.TEA; private import tango.util.cipher.Cipher; /** Implementation of the TEA cipher designed by David Wheeler and Roger Needham. */ class TEA : BlockCipher { private { enum uint ROUNDS = 32, KEY_SIZE = 16, BLOCK_SIZE = 8, DELTA = 0x9e3779b9u, DECRYPT_SUM = 0xc6ef3720u; uint sk0, sk1, sk2, sk3, sum; } this() {} this(bool encrypt, ubyte[] key) { this(); init(encrypt, key); } final override void reset(){} @property final override const(char)[] name() { return "TEA"; } @property final override const uint blockSize() { return BLOCK_SIZE; } final void init(bool encrypt, ubyte[] key) { _encrypt = encrypt; if (key.length != KEY_SIZE) invalid(name()~": Invalid key length (requires 16 bytes)"); sk0 = ByteConverter.BigEndian.to!(uint)(key[0..4]); sk1 = ByteConverter.BigEndian.to!(uint)(key[4..8]); sk2 = ByteConverter.BigEndian.to!(uint)(key[8..12]); sk3 = ByteConverter.BigEndian.to!(uint)(key[12..16]); _initialized = true; } final override uint update(const(void[]) input_, void[] output_) { if (!_initialized) invalid(name()~": Cipher not initialized"); const(ubyte[]) input = cast(const(ubyte[])) input_; ubyte[] output = cast(ubyte[]) output_; if (input.length < BLOCK_SIZE) invalid(name()~": Input buffer too short"); if (output.length < BLOCK_SIZE) invalid(name()~": Output buffer too short"); uint v0 = ByteConverter.BigEndian.to!(uint)(input[0..4]), v1 = ByteConverter.BigEndian.to!(uint)(input[4..8]); sum = _encrypt ? 0 : DECRYPT_SUM; for (int i = 0; i < ROUNDS; i++) { if (_encrypt) { sum += DELTA; v0 += ((v1 << 4) + sk0) ^ (v1 + sum) ^ ((v1 >> 5) + sk1); v1 += ((v0 << 4) + sk2) ^ (v0 + sum) ^ ((v0 >> 5) + sk3); } else { v1 -= ((v0 << 4) + sk2) ^ (v0 + sum) ^ ((v0 >> 5) + sk3); v0 -= ((v1 << 4) + sk0) ^ (v1 + sum) ^ ((v1 >> 5) + sk1); sum -= DELTA; } } ByteConverter.BigEndian.from!(uint)(v0, output[0..4]); ByteConverter.BigEndian.from!(uint)(v1, output[4..8]); return BLOCK_SIZE; } /** Some TEA test vectors. */ debug (UnitTest) { unittest { enum immutable(char)[][] test_keys = [ "00000000000000000000000000000000", "00000000000000000000000000000000", "0123456712345678234567893456789a", "0123456712345678234567893456789a" ]; enum immutable(char)[][] test_plaintexts = [ "0000000000000000", "0102030405060708", "0000000000000000", "0102030405060708" ]; enum immutable(char)[][] test_ciphertexts = [ "41ea3a0a94baa940", "6a2f9cf3fccf3c55", "34e943b0900f5dcb", "773dc179878a81c0" ]; TEA t = new TEA(); foreach (uint i, string test_key; test_keys) { ubyte[] buffer = new ubyte[t.blockSize]; char[] result; auto key = ByteConverter.hexDecode(test_key); // Encryption t.init(true, key); t.update(ByteConverter.hexDecode(test_plaintexts[i]), buffer); result = ByteConverter.hexEncode(buffer); assert(result == test_ciphertexts[i], t.name~": ("~result~") != ("~test_ciphertexts[i]~")"); // Decryption t.init(false, key); t.update(ByteConverter.hexDecode(test_ciphertexts[i]), buffer); result = ByteConverter.hexEncode(buffer); assert(result == test_plaintexts[i], t.name~": ("~result~") != ("~test_plaintexts[i]~")"); } } } } |