1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
/*
* TEA
* (C) 1999-2007 Jack Lloyd
*
* Distributed under the terms of the Botan license
*/
#include <botan/tea.h>
#include <botan/loadstor.h>
namespace Botan {
/*
* TEA Encryption
*/
void TEA::encrypt_n(const byte in[], byte out[], size_t blocks) const
{
for(size_t i = 0; i != blocks; ++i)
{
u32bit L = load_be<u32bit>(in, 0);
u32bit R = load_be<u32bit>(in, 1);
u32bit S = 0;
for(size_t j = 0; j != 32; ++j)
{
S += 0x9E3779B9;
L += ((R << 4) + K[0]) ^ (R + S) ^ ((R >> 5) + K[1]);
R += ((L << 4) + K[2]) ^ (L + S) ^ ((L >> 5) + K[3]);
}
store_be(out, L, R);
in += BLOCK_SIZE;
out += BLOCK_SIZE;
}
}
/*
* TEA Decryption
*/
void TEA::decrypt_n(const byte in[], byte out[], size_t blocks) const
{
for(size_t i = 0; i != blocks; ++i)
{
u32bit L = load_be<u32bit>(in, 0);
u32bit R = load_be<u32bit>(in, 1);
u32bit S = 0xC6EF3720;
for(size_t j = 0; j != 32; ++j)
{
R -= ((L << 4) + K[2]) ^ (L + S) ^ ((L >> 5) + K[3]);
L -= ((R << 4) + K[0]) ^ (R + S) ^ ((R >> 5) + K[1]);
S -= 0x9E3779B9;
}
store_be(out, L, R);
in += BLOCK_SIZE;
out += BLOCK_SIZE;
}
}
/*
* TEA Key Schedule
*/
void TEA::key_schedule(const byte key[], size_t)
{
for(size_t i = 0; i != 4; ++i)
K[i] = load_be<u32bit>(key, i);
}
}
|
