Coverage Report

Created: 2022-01-14 08:07

/src/botan/src/lib/block/seed/seed.cpp
Line
Count
Source (jump to first uncovered line)
1
/*
2
* SEED
3
* (C) 1999-2007,2020 Jack Lloyd
4
*
5
* Botan is released under the Simplified BSD License (see license.txt)
6
*/
7
8
#include <botan/internal/seed.h>
9
#include <botan/internal/loadstor.h>
10
11
namespace Botan {
12
13
namespace {
14
15
alignas(256) const uint8_t SEED_S0[256] = {
16
    0xA9, 0x85, 0xD6, 0xD3, 0x54, 0x1D, 0xAC, 0x25, 0x5D, 0x43, 0x18, 0x1E, 0x51, 0xFC, 0xCA, 0x63,
17
    0x28, 0x44, 0x20, 0x9D, 0xE0, 0xE2, 0xC8, 0x17, 0xA5, 0x8F, 0x03, 0x7B, 0xBB, 0x13, 0xD2, 0xEE,
18
    0x70, 0x8C, 0x3F, 0xA8, 0x32, 0xDD, 0xF6, 0x74, 0xEC, 0x95, 0x0B, 0x57, 0x5C, 0x5B, 0xBD, 0x01,
19
    0x24, 0x1C, 0x73, 0x98, 0x10, 0xCC, 0xF2, 0xD9, 0x2C, 0xE7, 0x72, 0x83, 0x9B, 0xD1, 0x86, 0xC9,
20
    0x60, 0x50, 0xA3, 0xEB, 0x0D, 0xB6, 0x9E, 0x4F, 0xB7, 0x5A, 0xC6, 0x78, 0xA6, 0x12, 0xAF, 0xD5,
21
    0x61, 0xC3, 0xB4, 0x41, 0x52, 0x7D, 0x8D, 0x08, 0x1F, 0x99, 0x00, 0x19, 0x04, 0x53, 0xF7, 0xE1,
22
    0xFD, 0x76, 0x2F, 0x27, 0xB0, 0x8B, 0x0E, 0xAB, 0xA2, 0x6E, 0x93, 0x4D, 0x69, 0x7C, 0x09, 0x0A,
23
    0xBF, 0xEF, 0xF3, 0xC5, 0x87, 0x14, 0xFE, 0x64, 0xDE, 0x2E, 0x4B, 0x1A, 0x06, 0x21, 0x6B, 0x66,
24
    0x02, 0xF5, 0x92, 0x8A, 0x0C, 0xB3, 0x7E, 0xD0, 0x7A, 0x47, 0x96, 0xE5, 0x26, 0x80, 0xAD, 0xDF,
25
    0xA1, 0x30, 0x37, 0xAE, 0x36, 0x15, 0x22, 0x38, 0xF4, 0xA7, 0x45, 0x4C, 0x81, 0xE9, 0x84, 0x97,
26
    0x35, 0xCB, 0xCE, 0x3C, 0x71, 0x11, 0xC7, 0x89, 0x75, 0xFB, 0xDA, 0xF8, 0x94, 0x59, 0x82, 0xC4,
27
    0xFF, 0x49, 0x39, 0x67, 0xC0, 0xCF, 0xD7, 0xB8, 0x0F, 0x8E, 0x42, 0x23, 0x91, 0x6C, 0xDB, 0xA4,
28
    0x34, 0xF1, 0x48, 0xC2, 0x6F, 0x3D, 0x2D, 0x40, 0xBE, 0x3E, 0xBC, 0xC1, 0xAA, 0xBA, 0x4E, 0x55,
29
    0x3B, 0xDC, 0x68, 0x7F, 0x9C, 0xD8, 0x4A, 0x56, 0x77, 0xA0, 0xED, 0x46, 0xB5, 0x2B, 0x65, 0xFA,
30
    0xE3, 0xB9, 0xB1, 0x9F, 0x5E, 0xF9, 0xE6, 0xB2, 0x31, 0xEA, 0x6D, 0x5F, 0xE4, 0xF0, 0xCD, 0x88,
31
    0x16, 0x3A, 0x58, 0xD4, 0x62, 0x29, 0x07, 0x33, 0xE8, 0x1B, 0x05, 0x79, 0x90, 0x6A, 0x2A, 0x9A,
32
};
33
34
alignas(256) const uint8_t SEED_S1[256] = {
35
    0x38, 0xE8, 0x2D, 0xA6, 0xCF, 0xDE, 0xB3, 0xB8, 0xAF, 0x60, 0x55, 0xC7, 0x44, 0x6F, 0x6B, 0x5B,
36
    0xC3, 0x62, 0x33, 0xB5, 0x29, 0xA0, 0xE2, 0xA7, 0xD3, 0x91, 0x11, 0x06, 0x1C, 0xBC, 0x36, 0x4B,
37
    0xEF, 0x88, 0x6C, 0xA8, 0x17, 0xC4, 0x16, 0xF4, 0xC2, 0x45, 0xE1, 0xD6, 0x3F, 0x3D, 0x8E, 0x98,
38
    0x28, 0x4E, 0xF6, 0x3E, 0xA5, 0xF9, 0x0D, 0xDF, 0xD8, 0x2B, 0x66, 0x7A, 0x27, 0x2F, 0xF1, 0x72,
39
    0x42, 0xD4, 0x41, 0xC0, 0x73, 0x67, 0xAC, 0x8B, 0xF7, 0xAD, 0x80, 0x1F, 0xCA, 0x2C, 0xAA, 0x34,
40
    0xD2, 0x0B, 0xEE, 0xE9, 0x5D, 0x94, 0x18, 0xF8, 0x57, 0xAE, 0x08, 0xC5, 0x13, 0xCD, 0x86, 0xB9,
41
    0xFF, 0x7D, 0xC1, 0x31, 0xF5, 0x8A, 0x6A, 0xB1, 0xD1, 0x20, 0xD7, 0x02, 0x22, 0x04, 0x68, 0x71,
42
    0x07, 0xDB, 0x9D, 0x99, 0x61, 0xBE, 0xE6, 0x59, 0xDD, 0x51, 0x90, 0xDC, 0x9A, 0xA3, 0xAB, 0xD0,
43
    0x81, 0x0F, 0x47, 0x1A, 0xE3, 0xEC, 0x8D, 0xBF, 0x96, 0x7B, 0x5C, 0xA2, 0xA1, 0x63, 0x23, 0x4D,
44
    0xC8, 0x9E, 0x9C, 0x3A, 0x0C, 0x2E, 0xBA, 0x6E, 0x9F, 0x5A, 0xF2, 0x92, 0xF3, 0x49, 0x78, 0xCC,
45
    0x15, 0xFB, 0x70, 0x75, 0x7F, 0x35, 0x10, 0x03, 0x64, 0x6D, 0xC6, 0x74, 0xD5, 0xB4, 0xEA, 0x09,
46
    0x76, 0x19, 0xFE, 0x40, 0x12, 0xE0, 0xBD, 0x05, 0xFA, 0x01, 0xF0, 0x2A, 0x5E, 0xA9, 0x56, 0x43,
47
    0x85, 0x14, 0x89, 0x9B, 0xB0, 0xE5, 0x48, 0x79, 0x97, 0xFC, 0x1E, 0x82, 0x21, 0x8C, 0x1B, 0x5F,
48
    0x77, 0x54, 0xB2, 0x1D, 0x25, 0x4F, 0x00, 0x46, 0xED, 0x58, 0x52, 0xEB, 0x7E, 0xDA, 0xC9, 0xFD,
49
    0x30, 0x95, 0x65, 0x3C, 0xB6, 0xE4, 0xBB, 0x7C, 0x0E, 0x50, 0x39, 0x26, 0x32, 0x84, 0x69, 0x93,
50
    0x37, 0xE7, 0x24, 0xA4, 0xCB, 0x53, 0x0A, 0x87, 0xD9, 0x4C, 0x83, 0x8F, 0xCE, 0x3B, 0x4A, 0xB7,
51
};
52
53
/*
54
* SEED G Function
55
*/
56
inline uint32_t SEED_G(uint32_t X)
57
0
   {
58
0
   const uint32_t M = 0x01010101;
59
0
   const uint32_t s0 = M * SEED_S0[get_byte<3>(X)];
60
0
   const uint32_t s1 = M * SEED_S1[get_byte<2>(X)];
61
0
   const uint32_t s2 = M * SEED_S0[get_byte<1>(X)];
62
0
   const uint32_t s3 = M * SEED_S1[get_byte<0>(X)];
63
64
0
   const uint32_t M0 = 0x3FCFF3FC;
65
0
   const uint32_t M1 = 0xFC3FCFF3;
66
0
   const uint32_t M2 = 0xF3FC3FCF;
67
0
   const uint32_t M3 = 0xCFF3FC3F;
68
69
0
   return (s0 & M0) ^ (s1 & M1) ^ (s2 & M2) ^ (s3 & M3);
70
0
   }
71
72
}
73
74
/*
75
* SEED Encryption
76
*/
77
void SEED::encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const
78
0
   {
79
0
   verify_key_set(m_K.empty() == false);
80
81
0
   for(size_t i = 0; i != blocks; ++i)
82
0
      {
83
0
      uint32_t B0 = load_be<uint32_t>(in, 0);
84
0
      uint32_t B1 = load_be<uint32_t>(in, 1);
85
0
      uint32_t B2 = load_be<uint32_t>(in, 2);
86
0
      uint32_t B3 = load_be<uint32_t>(in, 3);
87
88
0
      for(size_t j = 0; j != 16; j += 2)
89
0
         {
90
0
         uint32_t T0, T1;
91
92
0
         T0 = B2 ^ m_K[2*j];
93
0
         T1 = SEED_G(B2 ^ B3 ^ m_K[2*j+1]);
94
0
         T0 = SEED_G(T1 + T0);
95
0
         T1 = SEED_G(T1 + T0);
96
0
         B1 ^= T1;
97
0
         B0 ^= T0 + T1;
98
99
0
         T0 = B0 ^ m_K[2*j+2];
100
0
         T1 = SEED_G(B0 ^ B1 ^ m_K[2*j+3]);
101
0
         T0 = SEED_G(T1 + T0);
102
0
         T1 = SEED_G(T1 + T0);
103
0
         B3 ^= T1;
104
0
         B2 ^= T0 + T1;
105
0
         }
106
107
0
      store_be(out, B2, B3, B0, B1);
108
109
0
      in += BLOCK_SIZE;
110
0
      out += BLOCK_SIZE;
111
0
      }
112
0
   }
113
114
/*
115
* SEED Decryption
116
*/
117
void SEED::decrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const
118
0
   {
119
0
   verify_key_set(m_K.empty() == false);
120
121
0
   for(size_t i = 0; i != blocks; ++i)
122
0
      {
123
0
      uint32_t B0 = load_be<uint32_t>(in, 0);
124
0
      uint32_t B1 = load_be<uint32_t>(in, 1);
125
0
      uint32_t B2 = load_be<uint32_t>(in, 2);
126
0
      uint32_t B3 = load_be<uint32_t>(in, 3);
127
128
0
      for(size_t j = 0; j != 16; j += 2)
129
0
         {
130
0
         uint32_t T0, T1;
131
132
0
         T0 = B2 ^ m_K[30-2*j];
133
0
         T1 = SEED_G(B2 ^ B3 ^ m_K[31-2*j]);
134
0
         T0 = SEED_G(T1 + T0);
135
0
         T1 = SEED_G(T1 + T0);
136
0
         B1 ^= T1;
137
0
         B0 ^= T0 + T1;
138
139
0
         T0 = B0 ^ m_K[28-2*j];
140
0
         T1 = SEED_G(B0 ^ B1 ^ m_K[29-2*j]);
141
0
         T0 = SEED_G(T1 + T0);
142
0
         T1 = SEED_G(T1 + T0);
143
0
         B3 ^= T1;
144
0
         B2 ^= T0 + T1;
145
0
         }
146
147
0
      store_be(out, B2, B3, B0, B1);
148
149
0
      in += BLOCK_SIZE;
150
0
      out += BLOCK_SIZE;
151
0
      }
152
0
   }
153
154
/*
155
* SEED Key Schedule
156
*/
157
void SEED::key_schedule(const uint8_t key[], size_t)
158
0
   {
159
0
   const uint32_t RC[16] = {
160
0
      0x9E3779B9, 0x3C6EF373, 0x78DDE6E6, 0xF1BBCDCC,
161
0
      0xE3779B99, 0xC6EF3733, 0x8DDE6E67, 0x1BBCDCCF,
162
0
      0x3779B99E, 0x6EF3733C, 0xDDE6E678, 0xBBCDCCF1,
163
0
      0x779B99E3, 0xEF3733C6, 0xDE6E678D, 0xBCDCCF1B
164
0
   };
165
166
0
   secure_vector<uint32_t> WK(4);
167
168
0
   for(size_t i = 0; i != 4; ++i)
169
0
      WK[i] = load_be<uint32_t>(key, i);
170
171
0
   m_K.resize(32);
172
173
0
   for(size_t i = 0; i != 16; i += 2)
174
0
      {
175
0
      m_K[2*i  ] = SEED_G(WK[0] + WK[2] - RC[i]);
176
0
      m_K[2*i+1] = SEED_G(WK[1] - WK[3] + RC[i]) ^ m_K[2*i];
177
178
0
      uint32_t T = (WK[0] & 0xFF) << 24;
179
0
      WK[0] = (WK[0] >> 8) | (get_byte<3>(WK[1]) << 24);
180
0
      WK[1] = (WK[1] >> 8) | T;
181
182
0
      m_K[2*i+2] = SEED_G(WK[0] + WK[2] - RC[i+1]);
183
0
      m_K[2*i+3] = SEED_G(WK[1] - WK[3] + RC[i+1]) ^ m_K[2*i+2];
184
185
0
      T = get_byte<0>(WK[3]);
186
0
      WK[3] = (WK[3] << 8) | get_byte<0>(WK[2]);
187
0
      WK[2] = (WK[2] << 8) | T;
188
0
      }
189
0
   }
190
191
void SEED::clear()
192
0
   {
193
0
   zap(m_K);
194
0
   }
195
196
}