/src/botan/src/lib/block/serpent/serpent.cpp
Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | * Serpent |
3 | | * (C) 1999-2007 Jack Lloyd |
4 | | * |
5 | | * Botan is released under the Simplified BSD License (see license.txt) |
6 | | */ |
7 | | |
8 | | #include <botan/internal/serpent.h> |
9 | | #include <botan/internal/loadstor.h> |
10 | | #include <botan/internal/rotate.h> |
11 | | #include <botan/internal/serpent_sbox.h> |
12 | | |
13 | | #if defined(BOTAN_HAS_SERPENT_SIMD) || defined(BOTAN_HAS_SERPENT_AVX2) |
14 | | #include <botan/internal/cpuid.h> |
15 | | #endif |
16 | | |
17 | | namespace Botan { |
18 | | |
19 | | namespace { |
20 | | |
21 | | /* |
22 | | * Serpent's Linear Transform |
23 | | */ |
24 | | inline void transform(uint32_t& B0, uint32_t& B1, uint32_t& B2, uint32_t& B3) |
25 | 0 | { |
26 | 0 | B0 = rotl<13>(B0); B2 = rotl<3>(B2); |
27 | 0 | B1 ^= B0 ^ B2; B3 ^= B2 ^ (B0 << 3); |
28 | 0 | B1 = rotl<1>(B1); B3 = rotl<7>(B3); |
29 | 0 | B0 ^= B1 ^ B3; B2 ^= B3 ^ (B1 << 7); |
30 | 0 | B0 = rotl<5>(B0); B2 = rotl<22>(B2); |
31 | 0 | } |
32 | | |
33 | | /* |
34 | | * Serpent's Inverse Linear Transform |
35 | | */ |
36 | | inline void i_transform(uint32_t& B0, uint32_t& B1, uint32_t& B2, uint32_t& B3) |
37 | 0 | { |
38 | 0 | B2 = rotr<22>(B2); B0 = rotr<5>(B0); |
39 | 0 | B2 ^= B3 ^ (B1 << 7); B0 ^= B1 ^ B3; |
40 | 0 | B3 = rotr<7>(B3); B1 = rotr<1>(B1); |
41 | 0 | B3 ^= B2 ^ (B0 << 3); B1 ^= B0 ^ B2; |
42 | 0 | B2 = rotr<3>(B2); B0 = rotr<13>(B0); |
43 | 0 | } |
44 | | |
45 | | } |
46 | | |
47 | | /* |
48 | | * XOR a key block with a data block |
49 | | */ |
50 | | #define key_xor(round, B0, B1, B2, B3) \ |
51 | 0 | B0 ^= m_round_key[4*round ]; \ |
52 | 0 | B1 ^= m_round_key[4*round+1]; \ |
53 | 0 | B2 ^= m_round_key[4*round+2]; \ |
54 | 0 | B3 ^= m_round_key[4*round+3]; |
55 | | |
56 | | /* |
57 | | * Serpent Encryption |
58 | | */ |
59 | | void Serpent::encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const |
60 | 0 | { |
61 | 0 | verify_key_set(m_round_key.empty() == false); |
62 | |
|
63 | 0 | #if defined(BOTAN_HAS_SERPENT_AVX2) |
64 | 0 | if(CPUID::has_avx2()) |
65 | 0 | { |
66 | 0 | while(blocks >= 8) |
67 | 0 | { |
68 | 0 | avx2_encrypt_8(in, out); |
69 | 0 | in += 8 * BLOCK_SIZE; |
70 | 0 | out += 8 * BLOCK_SIZE; |
71 | 0 | blocks -= 8; |
72 | 0 | } |
73 | 0 | } |
74 | 0 | #endif |
75 | |
|
76 | 0 | #if defined(BOTAN_HAS_SERPENT_SIMD) |
77 | 0 | if(CPUID::has_simd_32()) |
78 | 0 | { |
79 | 0 | while(blocks >= 4) |
80 | 0 | { |
81 | 0 | simd_encrypt_4(in, out); |
82 | 0 | in += 4 * BLOCK_SIZE; |
83 | 0 | out += 4 * BLOCK_SIZE; |
84 | 0 | blocks -= 4; |
85 | 0 | } |
86 | 0 | } |
87 | 0 | #endif |
88 | |
|
89 | 0 | BOTAN_PARALLEL_SIMD_FOR(size_t i = 0; i < blocks; ++i) |
90 | 0 | { |
91 | 0 | uint32_t B0, B1, B2, B3; |
92 | 0 | load_le(in + 16*i, B0, B1, B2, B3); |
93 | |
|
94 | 0 | key_xor( 0,B0,B1,B2,B3); SBoxE0(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
95 | 0 | key_xor( 1,B0,B1,B2,B3); SBoxE1(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
96 | 0 | key_xor( 2,B0,B1,B2,B3); SBoxE2(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
97 | 0 | key_xor( 3,B0,B1,B2,B3); SBoxE3(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
98 | 0 | key_xor( 4,B0,B1,B2,B3); SBoxE4(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
99 | 0 | key_xor( 5,B0,B1,B2,B3); SBoxE5(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
100 | 0 | key_xor( 6,B0,B1,B2,B3); SBoxE6(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
101 | 0 | key_xor( 7,B0,B1,B2,B3); SBoxE7(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
102 | 0 | key_xor( 8,B0,B1,B2,B3); SBoxE0(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
103 | 0 | key_xor( 9,B0,B1,B2,B3); SBoxE1(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
104 | 0 | key_xor(10,B0,B1,B2,B3); SBoxE2(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
105 | 0 | key_xor(11,B0,B1,B2,B3); SBoxE3(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
106 | 0 | key_xor(12,B0,B1,B2,B3); SBoxE4(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
107 | 0 | key_xor(13,B0,B1,B2,B3); SBoxE5(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
108 | 0 | key_xor(14,B0,B1,B2,B3); SBoxE6(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
109 | 0 | key_xor(15,B0,B1,B2,B3); SBoxE7(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
110 | 0 | key_xor(16,B0,B1,B2,B3); SBoxE0(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
111 | 0 | key_xor(17,B0,B1,B2,B3); SBoxE1(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
112 | 0 | key_xor(18,B0,B1,B2,B3); SBoxE2(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
113 | 0 | key_xor(19,B0,B1,B2,B3); SBoxE3(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
114 | 0 | key_xor(20,B0,B1,B2,B3); SBoxE4(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
115 | 0 | key_xor(21,B0,B1,B2,B3); SBoxE5(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
116 | 0 | key_xor(22,B0,B1,B2,B3); SBoxE6(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
117 | 0 | key_xor(23,B0,B1,B2,B3); SBoxE7(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
118 | 0 | key_xor(24,B0,B1,B2,B3); SBoxE0(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
119 | 0 | key_xor(25,B0,B1,B2,B3); SBoxE1(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
120 | 0 | key_xor(26,B0,B1,B2,B3); SBoxE2(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
121 | 0 | key_xor(27,B0,B1,B2,B3); SBoxE3(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
122 | 0 | key_xor(28,B0,B1,B2,B3); SBoxE4(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
123 | 0 | key_xor(29,B0,B1,B2,B3); SBoxE5(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
124 | 0 | key_xor(30,B0,B1,B2,B3); SBoxE6(B0,B1,B2,B3); transform(B0,B1,B2,B3); |
125 | 0 | key_xor(31,B0,B1,B2,B3); SBoxE7(B0,B1,B2,B3); key_xor(32,B0,B1,B2,B3); |
126 | |
|
127 | 0 | store_le(out + 16*i, B0, B1, B2, B3); |
128 | 0 | } |
129 | 0 | } |
130 | | |
131 | | /* |
132 | | * Serpent Decryption |
133 | | */ |
134 | | void Serpent::decrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const |
135 | 0 | { |
136 | 0 | verify_key_set(m_round_key.empty() == false); |
137 | |
|
138 | 0 | #if defined(BOTAN_HAS_SERPENT_AVX2) |
139 | 0 | if(CPUID::has_avx2()) |
140 | 0 | { |
141 | 0 | while(blocks >= 8) |
142 | 0 | { |
143 | 0 | avx2_decrypt_8(in, out); |
144 | 0 | in += 8 * BLOCK_SIZE; |
145 | 0 | out += 8 * BLOCK_SIZE; |
146 | 0 | blocks -= 8; |
147 | 0 | } |
148 | 0 | } |
149 | 0 | #endif |
150 | |
|
151 | 0 | #if defined(BOTAN_HAS_SERPENT_SIMD) |
152 | 0 | if(CPUID::has_simd_32()) |
153 | 0 | { |
154 | 0 | while(blocks >= 4) |
155 | 0 | { |
156 | 0 | simd_decrypt_4(in, out); |
157 | 0 | in += 4 * BLOCK_SIZE; |
158 | 0 | out += 4 * BLOCK_SIZE; |
159 | 0 | blocks -= 4; |
160 | 0 | } |
161 | 0 | } |
162 | 0 | #endif |
163 | |
|
164 | 0 | BOTAN_PARALLEL_SIMD_FOR(size_t i = 0; i < blocks; ++i) |
165 | 0 | { |
166 | 0 | uint32_t B0, B1, B2, B3; |
167 | 0 | load_le(in + 16*i, B0, B1, B2, B3); |
168 | |
|
169 | 0 | key_xor(32,B0,B1,B2,B3); SBoxD7(B0,B1,B2,B3); key_xor(31,B0,B1,B2,B3); |
170 | 0 | i_transform(B0,B1,B2,B3); SBoxD6(B0,B1,B2,B3); key_xor(30,B0,B1,B2,B3); |
171 | 0 | i_transform(B0,B1,B2,B3); SBoxD5(B0,B1,B2,B3); key_xor(29,B0,B1,B2,B3); |
172 | 0 | i_transform(B0,B1,B2,B3); SBoxD4(B0,B1,B2,B3); key_xor(28,B0,B1,B2,B3); |
173 | 0 | i_transform(B0,B1,B2,B3); SBoxD3(B0,B1,B2,B3); key_xor(27,B0,B1,B2,B3); |
174 | 0 | i_transform(B0,B1,B2,B3); SBoxD2(B0,B1,B2,B3); key_xor(26,B0,B1,B2,B3); |
175 | 0 | i_transform(B0,B1,B2,B3); SBoxD1(B0,B1,B2,B3); key_xor(25,B0,B1,B2,B3); |
176 | 0 | i_transform(B0,B1,B2,B3); SBoxD0(B0,B1,B2,B3); key_xor(24,B0,B1,B2,B3); |
177 | 0 | i_transform(B0,B1,B2,B3); SBoxD7(B0,B1,B2,B3); key_xor(23,B0,B1,B2,B3); |
178 | 0 | i_transform(B0,B1,B2,B3); SBoxD6(B0,B1,B2,B3); key_xor(22,B0,B1,B2,B3); |
179 | 0 | i_transform(B0,B1,B2,B3); SBoxD5(B0,B1,B2,B3); key_xor(21,B0,B1,B2,B3); |
180 | 0 | i_transform(B0,B1,B2,B3); SBoxD4(B0,B1,B2,B3); key_xor(20,B0,B1,B2,B3); |
181 | 0 | i_transform(B0,B1,B2,B3); SBoxD3(B0,B1,B2,B3); key_xor(19,B0,B1,B2,B3); |
182 | 0 | i_transform(B0,B1,B2,B3); SBoxD2(B0,B1,B2,B3); key_xor(18,B0,B1,B2,B3); |
183 | 0 | i_transform(B0,B1,B2,B3); SBoxD1(B0,B1,B2,B3); key_xor(17,B0,B1,B2,B3); |
184 | 0 | i_transform(B0,B1,B2,B3); SBoxD0(B0,B1,B2,B3); key_xor(16,B0,B1,B2,B3); |
185 | 0 | i_transform(B0,B1,B2,B3); SBoxD7(B0,B1,B2,B3); key_xor(15,B0,B1,B2,B3); |
186 | 0 | i_transform(B0,B1,B2,B3); SBoxD6(B0,B1,B2,B3); key_xor(14,B0,B1,B2,B3); |
187 | 0 | i_transform(B0,B1,B2,B3); SBoxD5(B0,B1,B2,B3); key_xor(13,B0,B1,B2,B3); |
188 | 0 | i_transform(B0,B1,B2,B3); SBoxD4(B0,B1,B2,B3); key_xor(12,B0,B1,B2,B3); |
189 | 0 | i_transform(B0,B1,B2,B3); SBoxD3(B0,B1,B2,B3); key_xor(11,B0,B1,B2,B3); |
190 | 0 | i_transform(B0,B1,B2,B3); SBoxD2(B0,B1,B2,B3); key_xor(10,B0,B1,B2,B3); |
191 | 0 | i_transform(B0,B1,B2,B3); SBoxD1(B0,B1,B2,B3); key_xor( 9,B0,B1,B2,B3); |
192 | 0 | i_transform(B0,B1,B2,B3); SBoxD0(B0,B1,B2,B3); key_xor( 8,B0,B1,B2,B3); |
193 | 0 | i_transform(B0,B1,B2,B3); SBoxD7(B0,B1,B2,B3); key_xor( 7,B0,B1,B2,B3); |
194 | 0 | i_transform(B0,B1,B2,B3); SBoxD6(B0,B1,B2,B3); key_xor( 6,B0,B1,B2,B3); |
195 | 0 | i_transform(B0,B1,B2,B3); SBoxD5(B0,B1,B2,B3); key_xor( 5,B0,B1,B2,B3); |
196 | 0 | i_transform(B0,B1,B2,B3); SBoxD4(B0,B1,B2,B3); key_xor( 4,B0,B1,B2,B3); |
197 | 0 | i_transform(B0,B1,B2,B3); SBoxD3(B0,B1,B2,B3); key_xor( 3,B0,B1,B2,B3); |
198 | 0 | i_transform(B0,B1,B2,B3); SBoxD2(B0,B1,B2,B3); key_xor( 2,B0,B1,B2,B3); |
199 | 0 | i_transform(B0,B1,B2,B3); SBoxD1(B0,B1,B2,B3); key_xor( 1,B0,B1,B2,B3); |
200 | 0 | i_transform(B0,B1,B2,B3); SBoxD0(B0,B1,B2,B3); key_xor( 0,B0,B1,B2,B3); |
201 | |
|
202 | 0 | store_le(out + 16*i, B0, B1, B2, B3); |
203 | 0 | } |
204 | 0 | } |
205 | | |
206 | | #undef key_xor |
207 | | #undef transform |
208 | | #undef i_transform |
209 | | |
210 | | /* |
211 | | * Serpent Key Schedule |
212 | | */ |
213 | | void Serpent::key_schedule(const uint8_t key[], size_t length) |
214 | 0 | { |
215 | 0 | const uint32_t PHI = 0x9E3779B9; |
216 | |
|
217 | 0 | secure_vector<uint32_t> W(140); |
218 | 0 | for(size_t i = 0; i != length / 4; ++i) |
219 | 0 | W[i] = load_le<uint32_t>(key, i); |
220 | |
|
221 | 0 | W[length / 4] |= uint32_t(1) << ((length%4)*8); |
222 | |
|
223 | 0 | for(size_t i = 8; i != 140; ++i) |
224 | 0 | { |
225 | 0 | uint32_t wi = W[i-8] ^ W[i-5] ^ W[i-3] ^ W[i-1] ^ PHI ^ uint32_t(i-8); |
226 | 0 | W[i] = rotl<11>(wi); |
227 | 0 | } |
228 | |
|
229 | 0 | SBoxE0(W[ 20],W[ 21],W[ 22],W[ 23]); |
230 | 0 | SBoxE0(W[ 52],W[ 53],W[ 54],W[ 55]); |
231 | 0 | SBoxE0(W[ 84],W[ 85],W[ 86],W[ 87]); |
232 | 0 | SBoxE0(W[116],W[117],W[118],W[119]); |
233 | |
|
234 | 0 | SBoxE1(W[ 16],W[ 17],W[ 18],W[ 19]); |
235 | 0 | SBoxE1(W[ 48],W[ 49],W[ 50],W[ 51]); |
236 | 0 | SBoxE1(W[ 80],W[ 81],W[ 82],W[ 83]); |
237 | 0 | SBoxE1(W[112],W[113],W[114],W[115]); |
238 | |
|
239 | 0 | SBoxE2(W[ 12],W[ 13],W[ 14],W[ 15]); |
240 | 0 | SBoxE2(W[ 44],W[ 45],W[ 46],W[ 47]); |
241 | 0 | SBoxE2(W[ 76],W[ 77],W[ 78],W[ 79]); |
242 | 0 | SBoxE2(W[108],W[109],W[110],W[111]); |
243 | |
|
244 | 0 | SBoxE3(W[ 8],W[ 9],W[ 10],W[ 11]); |
245 | 0 | SBoxE3(W[ 40],W[ 41],W[ 42],W[ 43]); |
246 | 0 | SBoxE3(W[ 72],W[ 73],W[ 74],W[ 75]); |
247 | 0 | SBoxE3(W[104],W[105],W[106],W[107]); |
248 | 0 | SBoxE3(W[136],W[137],W[138],W[139]); |
249 | |
|
250 | 0 | SBoxE4(W[ 36],W[ 37],W[ 38],W[ 39]); |
251 | 0 | SBoxE4(W[ 68],W[ 69],W[ 70],W[ 71]); |
252 | 0 | SBoxE4(W[100],W[101],W[102],W[103]); |
253 | 0 | SBoxE4(W[132],W[133],W[134],W[135]); |
254 | |
|
255 | 0 | SBoxE5(W[ 32],W[ 33],W[ 34],W[ 35]); |
256 | 0 | SBoxE5(W[ 64],W[ 65],W[ 66],W[ 67]); |
257 | 0 | SBoxE5(W[ 96],W[ 97],W[ 98],W[ 99]); |
258 | 0 | SBoxE5(W[128],W[129],W[130],W[131]); |
259 | |
|
260 | 0 | SBoxE6(W[ 28],W[ 29],W[ 30],W[ 31]); |
261 | 0 | SBoxE6(W[ 60],W[ 61],W[ 62],W[ 63]); |
262 | 0 | SBoxE6(W[ 92],W[ 93],W[ 94],W[ 95]); |
263 | 0 | SBoxE6(W[124],W[125],W[126],W[127]); |
264 | |
|
265 | 0 | SBoxE7(W[ 24],W[ 25],W[ 26],W[ 27]); |
266 | 0 | SBoxE7(W[ 56],W[ 57],W[ 58],W[ 59]); |
267 | 0 | SBoxE7(W[ 88],W[ 89],W[ 90],W[ 91]); |
268 | 0 | SBoxE7(W[120],W[121],W[122],W[123]); |
269 | |
|
270 | 0 | m_round_key.assign(W.begin() + 8, W.end()); |
271 | 0 | } |
272 | | |
273 | | void Serpent::clear() |
274 | 0 | { |
275 | 0 | zap(m_round_key); |
276 | 0 | } |
277 | | |
278 | | std::string Serpent::provider() const |
279 | 0 | { |
280 | 0 | #if defined(BOTAN_HAS_SERPENT_AVX2) |
281 | 0 | if(CPUID::has_avx2()) |
282 | 0 | { |
283 | 0 | return "avx2"; |
284 | 0 | } |
285 | 0 | #endif |
286 | | |
287 | 0 | #if defined(BOTAN_HAS_SERPENT_SIMD) |
288 | 0 | if(CPUID::has_simd_32()) |
289 | 0 | { |
290 | 0 | return "simd"; |
291 | 0 | } |
292 | 0 | #endif |
293 | | |
294 | 0 | return "base"; |
295 | 0 | } |
296 | | |
297 | | #undef key_xor |
298 | | |
299 | | } |