serpent.c 24.5 KB
Newer Older
Simon Josefsson's avatar
Simon Josefsson committed
1
/* serpent.c
2
 *
3
 * The serpent block cipher.
4
5
6
7
8
 *
 * For more details on this algorithm, see the Serpent website at
 * http://www.cl.cam.ac.uk/~rja14/serpent.html
 */

9
10
/* nettle, low-level cryptographics library
 *
11
 * Copyright (C) 2011  Niels Möller
Simon Josefsson's avatar
Simon Josefsson committed
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
 * Copyright (C) 2010, 2011  Simon Josefsson
 * Copyright (C) 2003, 2004, 2005 Free Software Foundation, Inc.
 *  
 * The nettle library is free software; you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as published by
 * the Free Software Foundation; either version 2.1 of the License, or (at your
 * option) any later version.
 * 
 * The nettle library is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
 * or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public
 * License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public License
 * along with the nettle library; see the file COPYING.LIB.  If not, write to
 * the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
 * MA 02111-1307, USA.
29
30
 */

Simon Josefsson's avatar
Simon Josefsson committed
31
32
33
34
35
36
37
38
39
/* This file is derived from cipher/serpent.c in Libgcrypt v1.4.6.
   The adaption to Nettle was made by Simon Josefsson on 2010-12-07
   with final touches on 2011-05-30.  Changes include replacing
   libgcrypt with nettle in the license template, renaming
   serpent_context to serpent_ctx, renaming u32 to uint32_t, removing
   libgcrypt stubs and selftests, modifying entry function prototypes,
   using FOR_BLOCKS to iterate through data in encrypt/decrypt, using
   LE_READ_UINT32 and LE_WRITE_UINT32 to access data in
   encrypt/decrypt, and running indent on the code. */
40

41
#if HAVE_CONFIG_H
Simon Josefsson's avatar
Simon Josefsson committed
42
#include "config.h"
43
44
45
#endif

#include <assert.h>
46
#include <limits.h>
47

Rafael Sevilla's avatar
Rafael Sevilla committed
48
49
#include "serpent.h"

50
51
#include "macros.h"

Simon Josefsson's avatar
Simon Josefsson committed
52
53
54
/* Magic number, used during generating of the subkeys.  */
#define PHI 0x9E3779B9

55
/* FIXME: Unify ROL macros used here, in camellia.c and cast128.c. */
56
#define ROL32(x,n) ((((x))<<(n)) | (((x))>>(32-(n))))
Simon Josefsson's avatar
Simon Josefsson committed
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73

/* These are the S-Boxes of Serpent.  They are copied from Serpents
   reference implementation (the optimized one, contained in
   `floppy2') and are therefore:

     Copyright (C) 1998 Ross Anderson, Eli Biham, Lars Knudsen.

  To quote the Serpent homepage
  (http://www.cl.cam.ac.uk/~rja14/serpent.html):

  "Serpent is now completely in the public domain, and we impose no
   restrictions on its use.  This was announced on the 21st August at
   the First AES Candidate Conference. The optimised implementations
   in the submission package are now under the GNU PUBLIC LICENSE
   (GPL), although some comments in the code still say otherwise. You
   are welcome to use Serpent for any application."  */

74
75
76
/* FIXME: Except when used within the key schedule, the inputs are not
   used after the substitution, and hence we could allow them to be
   destroyed. Can this freedom be used to optimize the sboxes? */
77
#define SBOX0(type, a, b, c, d, w, x, y, z)	\
78
  do { \
79
80
    type t02, t03, t05, t06, t07, t08, t09; \
    type t11, t12, t13, t14, t15, t17, t01; \
Simon Josefsson's avatar
Simon Josefsson committed
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
    t01 = b   ^ c  ; \
    t02 = a   | d  ; \
    t03 = a   ^ b  ; \
    z   = t02 ^ t01; \
    t05 = c   | z  ; \
    t06 = a   ^ d  ; \
    t07 = b   | c  ; \
    t08 = d   & t05; \
    t09 = t03 & t07; \
    y   = t09 ^ t08; \
    t11 = t09 & y  ; \
    t12 = c   ^ d  ; \
    t13 = t07 ^ t11; \
    t14 = b   & t06; \
    t15 = t06 ^ t13; \
    w   =     ~ t15; \
    t17 = w   ^ t14; \
    x   = t12 ^ t17; \
99
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
100

101
#define SBOX0_INVERSE(type, a, b, c, d, w, x, y, z)	\
102
  do { \
103
104
    type t02, t03, t04, t05, t06, t08, t09, t10;	\
    type t12, t13, t14, t15, t17, t18, t01; \
Simon Josefsson's avatar
Simon Josefsson committed
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
    t01 = c   ^ d  ; \
    t02 = a   | b  ; \
    t03 = b   | c  ; \
    t04 = c   & t01; \
    t05 = t02 ^ t01; \
    t06 = a   | t04; \
    y   =     ~ t05; \
    t08 = b   ^ d  ; \
    t09 = t03 & t08; \
    t10 = d   | y  ; \
    x   = t09 ^ t06; \
    t12 = a   | t05; \
    t13 = x   ^ t12; \
    t14 = t03 ^ t10; \
    t15 = a   ^ c  ; \
    z   = t14 ^ t13; \
    t17 = t05 & t13; \
    t18 = t14 | t17; \
    w   = t15 ^ t18; \
124
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
125

126
#define SBOX1(type, a, b, c, d, w, x, y, z)	\
127
  do { \
128
129
    type t02, t03, t04, t05, t06, t07, t08; \
    type t10, t11, t12, t13, t16, t17, t01; \
Simon Josefsson's avatar
Simon Josefsson committed
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
    t01 = a   | d  ; \
    t02 = c   ^ d  ; \
    t03 =     ~ b  ; \
    t04 = a   ^ c  ; \
    t05 = a   | t03; \
    t06 = d   & t04; \
    t07 = t01 & t02; \
    t08 = b   | t06; \
    y   = t02 ^ t05; \
    t10 = t07 ^ t08; \
    t11 = t01 ^ t10; \
    t12 = y   ^ t11; \
    t13 = b   & d  ; \
    z   =     ~ t10; \
    x   = t13 ^ t12; \
    t16 = t10 | x  ; \
    t17 = t05 & t16; \
    w   = c   ^ t17; \
148
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
149

150
#define SBOX1_INVERSE(type, a, b, c, d, w, x, y, z) \
151
  do { \
152
153
    type t02, t03, t04, t05, t06, t07, t08; \
    type t09, t10, t11, t14, t15, t17, t01; \
Simon Josefsson's avatar
Simon Josefsson committed
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
    t01 = a   ^ b  ; \
    t02 = b   | d  ; \
    t03 = a   & c  ; \
    t04 = c   ^ t02; \
    t05 = a   | t04; \
    t06 = t01 & t05; \
    t07 = d   | t03; \
    t08 = b   ^ t06; \
    t09 = t07 ^ t06; \
    t10 = t04 | t03; \
    t11 = d   & t08; \
    y   =     ~ t09; \
    x   = t10 ^ t11; \
    t14 = a   | y  ; \
    t15 = t06 ^ x  ; \
    z   = t01 ^ t04; \
    t17 = c   ^ t15; \
    w   = t14 ^ t17; \
172
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
173

174
#define SBOX2(type, a, b, c, d, w, x, y, z) \
175
  do {					   \
176
177
    type t02, t03, t05, t06, t07, t08; \
    type t09, t10, t12, t13, t14, t01; \
Simon Josefsson's avatar
Simon Josefsson committed
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
    t01 = a   | c  ; \
    t02 = a   ^ b  ; \
    t03 = d   ^ t01; \
    w   = t02 ^ t03; \
    t05 = c   ^ w  ; \
    t06 = b   ^ t05; \
    t07 = b   | t05; \
    t08 = t01 & t06; \
    t09 = t03 ^ t07; \
    t10 = t02 | t09; \
    x   = t10 ^ t08; \
    t12 = a   | d  ; \
    t13 = t09 ^ x  ; \
    t14 = b   ^ t13; \
    z   =     ~ t09; \
    y   = t12 ^ t14; \
194
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
195

196
#define SBOX2_INVERSE(type, a, b, c, d, w, x, y, z) \
197
  do {						\
198
199
    type t02, t03, t04, t06, t07, t08, t09; \
    type t10, t11, t12, t15, t16, t17, t01; \
Simon Josefsson's avatar
Simon Josefsson committed
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
    t01 = a   ^ d  ; \
    t02 = c   ^ d  ; \
    t03 = a   & c  ; \
    t04 = b   | t02; \
    w   = t01 ^ t04; \
    t06 = a   | c  ; \
    t07 = d   | w  ; \
    t08 =     ~ d  ; \
    t09 = b   & t06; \
    t10 = t08 | t03; \
    t11 = b   & t07; \
    t12 = t06 & t02; \
    z   = t09 ^ t10; \
    x   = t12 ^ t11; \
    t15 = c   & z  ; \
    t16 = w   ^ x  ; \
    t17 = t10 ^ t15; \
    y   = t16 ^ t17; \
218
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
219

220
#define SBOX3(type, a, b, c, d, w, x, y, z) \
221
  do {						\
222
223
    type t02, t03, t04, t05, t06, t07, t08; \
    type t09, t10, t11, t13, t14, t15, t01; \
Simon Josefsson's avatar
Simon Josefsson committed
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
    t01 = a   ^ c  ; \
    t02 = a   | d  ; \
    t03 = a   & d  ; \
    t04 = t01 & t02; \
    t05 = b   | t03; \
    t06 = a   & b  ; \
    t07 = d   ^ t04; \
    t08 = c   | t06; \
    t09 = b   ^ t07; \
    t10 = d   & t05; \
    t11 = t02 ^ t10; \
    z   = t08 ^ t09; \
    t13 = d   | z  ; \
    t14 = a   | t07; \
    t15 = b   & t13; \
    y   = t08 ^ t11; \
    w   = t14 ^ t15; \
    x   = t05 ^ t04; \
242
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
243

244
#define SBOX3_INVERSE(type, a, b, c, d, w, x, y, z) \
245
  do { \
246
247
    type t02, t03, t04, t05, t06, t07, t09; \
    type t11, t12, t13, t14, t16, t01; \
Simon Josefsson's avatar
Simon Josefsson committed
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
    t01 = c   | d  ; \
    t02 = a   | d  ; \
    t03 = c   ^ t02; \
    t04 = b   ^ t02; \
    t05 = a   ^ d  ; \
    t06 = t04 & t03; \
    t07 = b   & t01; \
    y   = t05 ^ t06; \
    t09 = a   ^ t03; \
    w   = t07 ^ t03; \
    t11 = w   | t05; \
    t12 = t09 & t11; \
    t13 = a   & y  ; \
    t14 = t01 ^ t05; \
    x   = b   ^ t12; \
    t16 = b   | t13; \
    z   = t14 ^ t16; \
265
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
266

267
#define SBOX4(type, a, b, c, d, w, x, y, z) \
268
  do { \
269
270
    type t02, t03, t04, t05, t06, t08, t09; \
    type t10, t11, t12, t13, t14, t15, t16, t01; \
Simon Josefsson's avatar
Simon Josefsson committed
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
    t01 = a   | b  ; \
    t02 = b   | c  ; \
    t03 = a   ^ t02; \
    t04 = b   ^ d  ; \
    t05 = d   | t03; \
    t06 = d   & t01; \
    z   = t03 ^ t06; \
    t08 = z   & t04; \
    t09 = t04 & t05; \
    t10 = c   ^ t06; \
    t11 = b   & c  ; \
    t12 = t04 ^ t08; \
    t13 = t11 | t03; \
    t14 = t10 ^ t09; \
    t15 = a   & t05; \
    t16 = t11 | t12; \
    y   = t13 ^ t08; \
    x   = t15 ^ t16; \
    w   =     ~ t14; \
290
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
291

292
#define SBOX4_INVERSE(type, a, b, c, d, w, x, y, z) \
293
  do { \
294
295
    type t02, t03, t04, t05, t06, t07, t09; \
    type t10, t11, t12, t13, t15, t01; \
Simon Josefsson's avatar
Simon Josefsson committed
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
    t01 = b   | d  ; \
    t02 = c   | d  ; \
    t03 = a   & t01; \
    t04 = b   ^ t02; \
    t05 = c   ^ d  ; \
    t06 =     ~ t03; \
    t07 = a   & t04; \
    x   = t05 ^ t07; \
    t09 = x   | t06; \
    t10 = a   ^ t07; \
    t11 = t01 ^ t09; \
    t12 = d   ^ t04; \
    t13 = c   | t10; \
    z   = t03 ^ t12; \
    t15 = a   ^ t04; \
    y   = t11 ^ t13; \
    w   = t15 ^ t09; \
313
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
314

315
#define SBOX5(type, a, b, c, d, w, x, y, z) \
316
  do { \
317
318
    type t02, t03, t04, t05, t07, t08, t09; \
    type t10, t11, t12, t13, t14, t01; \
Simon Josefsson's avatar
Simon Josefsson committed
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
    t01 = b   ^ d  ; \
    t02 = b   | d  ; \
    t03 = a   & t01; \
    t04 = c   ^ t02; \
    t05 = t03 ^ t04; \
    w   =     ~ t05; \
    t07 = a   ^ t01; \
    t08 = d   | w  ; \
    t09 = b   | t05; \
    t10 = d   ^ t08; \
    t11 = b   | t07; \
    t12 = t03 | w  ; \
    t13 = t07 | t10; \
    t14 = t01 ^ t11; \
    y   = t09 ^ t13; \
    x   = t07 ^ t08; \
    z   = t12 ^ t14; \
336
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
337

338
#define SBOX5_INVERSE(type, a, b, c, d, w, x, y, z) \
339
  do { \
340
341
    type t02, t03, t04, t05, t07, t08, t09; \
    type t10, t12, t13, t15, t16, t01; \
Simon Josefsson's avatar
Simon Josefsson committed
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
    t01 = a   & d  ; \
    t02 = c   ^ t01; \
    t03 = a   ^ d  ; \
    t04 = b   & t02; \
    t05 = a   & c  ; \
    w   = t03 ^ t04; \
    t07 = a   & w  ; \
    t08 = t01 ^ w  ; \
    t09 = b   | t05; \
    t10 =     ~ b  ; \
    x   = t08 ^ t09; \
    t12 = t10 | t07; \
    t13 = w   | x  ; \
    z   = t02 ^ t12; \
    t15 = t02 ^ t13; \
    t16 = b   ^ d  ; \
    y   = t16 ^ t15; \
359
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
360

361
#define SBOX6(type, a, b, c, d, w, x, y, z) \
362
  do { \
363
364
    type t02, t03, t04, t05, t07, t08, t09, t10;	\
    type t11, t12, t13, t15, t17, t18, t01; \
Simon Josefsson's avatar
Simon Josefsson committed
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
    t01 = a   & d  ; \
    t02 = b   ^ c  ; \
    t03 = a   ^ d  ; \
    t04 = t01 ^ t02; \
    t05 = b   | c  ; \
    x   =     ~ t04; \
    t07 = t03 & t05; \
    t08 = b   & x  ; \
    t09 = a   | c  ; \
    t10 = t07 ^ t08; \
    t11 = b   | d  ; \
    t12 = c   ^ t11; \
    t13 = t09 ^ t10; \
    y   =     ~ t13; \
    t15 = x   & t03; \
    z   = t12 ^ t07; \
    t17 = a   ^ b  ; \
    t18 = y   ^ t15; \
    w   = t17 ^ t18; \
384
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
385

386
#define SBOX6_INVERSE(type, a, b, c, d, w, x, y, z) \
387
  do { \
388
389
    type t02, t03, t04, t05, t06, t07, t08, t09; \
    type t12, t13, t14, t15, t16, t17, t01;	     \
Simon Josefsson's avatar
Simon Josefsson committed
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
    t01 = a   ^ c  ; \
    t02 =     ~ c  ; \
    t03 = b   & t01; \
    t04 = b   | t02; \
    t05 = d   | t03; \
    t06 = b   ^ d  ; \
    t07 = a   & t04; \
    t08 = a   | t02; \
    t09 = t07 ^ t05; \
    x   = t06 ^ t08; \
    w   =     ~ t09; \
    t12 = b   & w  ; \
    t13 = t01 & t05; \
    t14 = t01 ^ t12; \
    t15 = t07 ^ t13; \
    t16 = d   | t02; \
    t17 = a   ^ x  ; \
    z   = t17 ^ t15; \
    y   = t16 ^ t14; \
409
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
410

411
#define SBOX7(type, a, b, c, d, w, x, y, z) \
412
  do { \
413
414
    type t02, t03, t04, t05, t06, t08, t09, t10;	\
    type t11, t13, t14, t15, t16, t17, t01; \
Simon Josefsson's avatar
Simon Josefsson committed
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
    t01 = a   & c  ; \
    t02 =     ~ d  ; \
    t03 = a   & t02; \
    t04 = b   | t01; \
    t05 = a   & b  ; \
    t06 = c   ^ t04; \
    z   = t03 ^ t06; \
    t08 = c   | z  ; \
    t09 = d   | t05; \
    t10 = a   ^ t08; \
    t11 = t04 & z  ; \
    x   = t09 ^ t10; \
    t13 = b   ^ x  ; \
    t14 = t01 ^ x  ; \
    t15 = c   ^ t05; \
    t16 = t11 | t13; \
    t17 = t02 | t14; \
    w   = t15 ^ t17; \
    y   = a   ^ t16; \
434
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
435

436
#define SBOX7_INVERSE(type, a, b, c, d, w, x, y, z) \
437
  do { \
438
439
    type t02, t03, t04, t06, t07, t08, t09; \
    type t10, t11, t13, t14, t15, t16, t01; \
Simon Josefsson's avatar
Simon Josefsson committed
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
    t01 = a   & b  ; \
    t02 = a   | b  ; \
    t03 = c   | t01; \
    t04 = d   & t02; \
    z   = t03 ^ t04; \
    t06 = b   ^ t04; \
    t07 = d   ^ z  ; \
    t08 =     ~ t07; \
    t09 = t06 | t08; \
    t10 = b   ^ d  ; \
    t11 = a   | d  ; \
    x   = a   ^ t09; \
    t13 = c   ^ t06; \
    t14 = c   & t11; \
    t15 = d   | x  ; \
    t16 = t01 | t10; \
    w   = t13 ^ t15; \
    y   = t14 ^ t16; \
458
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
459

460
461
/* In-place linear transformation.  */
#define LINEAR_TRANSFORMATION(x0,x1,x2,x3)		 \
462
  do {                                                   \
463
464
465
466
467
468
469
470
471
472
    x0 = ROL32 (x0, 13);                    \
    x2 = ROL32 (x2, 3);                     \
    x1 = x1 ^ x0 ^ x2;        \
    x3 = x3 ^ x2 ^ (x0 << 3); \
    x1 = ROL32 (x1, 1);                     \
    x3 = ROL32 (x3, 7);                     \
    x0 = x0 ^ x1 ^ x3;        \
    x2 = x2 ^ x3 ^ (x1 << 7); \
    x0 = ROL32 (x0, 5);                     \
    x2 = ROL32 (x2, 22);                    \
473
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
474

475
476
/* In-place inverse linear transformation.  */
#define LINEAR_TRANSFORMATION_INVERSE(x0,x1,x2,x3)	 \
477
  do {                                                   \
478
479
    x2 = ROL32 (x2, 10);                    \
    x0 = ROL32 (x0, 27);                    \
480
481
    x2 = x2 ^ x3 ^ (x1 << 7); \
    x0 = x0 ^ x1 ^ x3;        \
482
483
    x3 = ROL32 (x3, 25);                     \
    x1 = ROL32 (x1, 31);                     \
484
485
    x3 = x3 ^ x2 ^ (x0 << 3); \
    x1 = x1 ^ x0 ^ x2;        \
486
487
    x2 = ROL32 (x2, 29);                     \
    x0 = ROL32 (x0, 19);                    \
488
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
489

490
491
492
493
494
495
#define KEYXOR(x0,x1,x2,x3, subkey)		       \
  do {						       \
    (x0) ^= (subkey)[0];			       \
    (x1) ^= (subkey)[1];			       \
    (x2) ^= (subkey)[2];			       \
    (x3) ^= (subkey)[3];			       \
496
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
497

498
499
500
501
502
/* Round inputs are x0,x1,x2,x3 (destroyed), and round outputs are
   y0,y1,y2,y3. */
#define ROUND(which, subkey, x0,x1,x2,x3, y0,y1,y2,y3) \
  do {						       \
    KEYXOR(x0,x1,x2,x3, subkey);		       \
503
    SBOX##which(uint32_t, x0,x1,x2,x3, y0,y1,y2,y3);	       \
504
    LINEAR_TRANSFORMATION(y0,y1,y2,y3);		       \
505
  } while (0)
Simon Josefsson's avatar
Simon Josefsson committed
506

507
508
509
510
511
/* Round inputs are x0,x1,x2,x3 (destroyed), and round outputs are
   y0,y1,y2,y3. */
#define ROUND_INVERSE(which, subkey, x0,x1,x2,x3, y0,y1,y2,y3) \
  do {							       \
    LINEAR_TRANSFORMATION_INVERSE (x0,x1,x2,x3);	       \
512
    SBOX##which##_INVERSE(uint32_t, x0,x1,x2,x3, y0,y1,y2,y3);	       \
513
    KEYXOR(y0,y1,y2,y3, subkey);			       \
514
515
  } while (0)

516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
#if HAVE_NATIVE_64_BIT
/* Operate independently on both halves of a 64-bit word. */
#define ROL64(x,n) \
  (((x) << (n) & ~(((1L << (n))-1) << 32)) \
   |(((x) >> (32-(n))) & ~(((1L << (32-(n)))-1) << (n))))

#define KEYXOR64(x0,x1,x2,x3, subkey)		       \
  do {						       \
    uint64_t _sk;				       \
    _sk = (subkey)[0]; _sk |= _sk << 32; (x0) ^= _sk;    \
    _sk = (subkey)[1]; _sk |= _sk << 32; (x1) ^= _sk;    \
    _sk = (subkey)[2]; _sk |= _sk << 32; (x2) ^= _sk;    \
    _sk = (subkey)[3]; _sk |= _sk << 32; (x3) ^= _sk;    \
  } while (0)

#define RSHIFT64(x,n) \
  ( ((x) << (n)) & ~(((1L << n) - 1) << 32))

#define LINEAR_TRANSFORMATION64(x0,x1,x2,x3)		 \
  do {                                                   \
    x0 = ROL64 (x0, 13);                    \
    x2 = ROL64 (x2, 3);                     \
    x1 = x1 ^ x0 ^ x2;        \
    x3 = x3 ^ x2 ^ RSHIFT64(x0, 3);	    \
    x1 = ROL64 (x1, 1);                     \
    x3 = ROL64 (x3, 7);                     \
    x0 = x0 ^ x1 ^ x3;        \
    x2 = x2 ^ x3 ^ RSHIFT64(x1, 7);	    \
    x0 = ROL64 (x0, 5);                     \
    x2 = ROL64 (x2, 22);                    \
  } while (0)

/* In-place inverse linear transformation.  */
#define LINEAR_TRANSFORMATION64_INVERSE(x0,x1,x2,x3)	 \
  do {                                                   \
    x2 = ROL64 (x2, 10);                    \
    x0 = ROL64 (x0, 27);                    \
    x2 = x2 ^ x3 ^ RSHIFT64(x1, 7); \
    x0 = x0 ^ x1 ^ x3;        \
    x3 = ROL64 (x3, 25);                     \
    x1 = ROL64 (x1, 31);                     \
    x3 = x3 ^ x2 ^ RSHIFT64(x0, 3); \
    x1 = x1 ^ x0 ^ x2;        \
    x2 = ROL64 (x2, 29);                     \
    x0 = ROL64 (x0, 19);                    \
  } while (0)

#define ROUND64(which, subkey, x0,x1,x2,x3, y0,y1,y2,y3) \
  do {						       \
    KEYXOR64(x0,x1,x2,x3, subkey);		       \
    SBOX##which(uint64_t, x0,x1,x2,x3, y0,y1,y2,y3);	       \
    LINEAR_TRANSFORMATION64(y0,y1,y2,y3);		       \
  } while (0)

#define ROUND64_INVERSE(which, subkey, x0,x1,x2,x3, y0,y1,y2,y3) \
  do {							       \
    LINEAR_TRANSFORMATION64_INVERSE (x0,x1,x2,x3);	       \
    SBOX##which##_INVERSE(uint64_t, x0,x1,x2,x3, y0,y1,y2,y3);	       \
    KEYXOR64(y0,y1,y2,y3, subkey);			       \
  } while (0)

#endif

579
/* Key schedule */
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
/* Note: Increments k */
#define KS_RECURRENCE(w, i, k)						\
  do {									\
    uint32_t _wn = (w)[(i)] ^ (w)[((i)+3)&7] ^ w[((i)+5)&7]		\
      ^ w[((i)+7)&7] ^ PHI ^ (k)++;					\
    ((w)[(i)] = ROL32(_wn, 11));					\
  } while (0)

/* Note: Increments k four times and keys once */
#define KS(keys, s, w, i, k)					\
  do {								\
    KS_RECURRENCE(w, (i), (k));					\
    KS_RECURRENCE(w, (i)+1, (k));				\
    KS_RECURRENCE(w, (i)+2, (k));				\
    KS_RECURRENCE(w, (i)+3, (k));				\
595
    SBOX##s(uint32_t, w[(i)],w[(i)+1],w[(i)+2],w[(i)+3],		\
596
597
598
599
600
	    (*keys)[0],(*keys)[1],(*keys)[2],(*keys)[3]);	\
    (keys)++;							\
  } while (0)

/* Pad user key and convert to an array of 8 uint32_t. */
Simon Josefsson's avatar
Simon Josefsson committed
601
static void
602
603
serpent_key_pad (const uint8_t *key, unsigned int key_length,
		 uint32_t *w)
Simon Josefsson's avatar
Simon Josefsson committed
604
605
606
{
  unsigned int i;

Niels Möller's avatar
Niels Möller committed
607
608
609
  assert (key_length <= SERPENT_MAX_KEY_SIZE);
  
  for (i = 0; key_length >= 4; key_length -=4, key += 4)
610
    w[i++] = LE_READ_UINT32(key);
611

612
  if (i < 8)
613
    {
Niels Möller's avatar
Niels Möller committed
614
615
616
617
618
619
620
      /* Key must be padded according to the Serpent specification.
         "aabbcc" -> "aabbcc0100...00" -> 0x01ccbbaa. */
      uint32_t pad = 0x01;
      
      while (key_length > 0)
	pad = pad << 8 | key[--key_length];

621
      w[i++] = pad;
Simon Josefsson's avatar
Simon Josefsson committed
622

Niels Möller's avatar
Niels Möller committed
623
      while (i < 8)
624
	w[i++] = 0;
625
    }
Simon Josefsson's avatar
Simon Josefsson committed
626
627
628
}

/* Initialize CONTEXT with the key KEY of KEY_LENGTH bits.  */
Rafael Sevilla's avatar
Rafael Sevilla committed
629
void
Simon Josefsson's avatar
Simon Josefsson committed
630
631
serpent_set_key (struct serpent_ctx *ctx,
		 unsigned length, const uint8_t * key)
Rafael Sevilla's avatar
Rafael Sevilla committed
632
{
633
634
635
636
637
  uint32_t w[8];
  uint32_t (*keys)[4];
  unsigned k;
  
  serpent_key_pad (key, length, w);
638

639
640
641
642
643
644
645
646
  /* Derive the 33 subkeys from KEY and store them in SUBKEYS. We do
     the recurrence in the key schedule using W as a circular buffer
     of just 8 uint32_t. */

  /* FIXME: Would be better to invoke SBOX with scalar variables as
     arguments, no arrays. To do that, unpack w into separate
     variables, use temporary variables as the SBOX destination. */

647
648
649
  keys = ctx->keys;
  k = 0;
  for (;;)
650
651
    {
      KS(keys, 3, w, 0, k);
652
653
      if (k == 132)
	break;
654
655
656
657
658
659
660
661
662
      KS(keys, 2, w, 4, k);
      KS(keys, 1, w, 0, k);
      KS(keys, 0, w, 4, k);
      KS(keys, 7, w, 0, k);
      KS(keys, 6, w, 4, k);
      KS(keys, 5, w, 0, k);
      KS(keys, 4, w, 4, k);
    }
  assert (keys == ctx->keys + 33);
Rafael Sevilla's avatar
Rafael Sevilla committed
663
664
665
}

void
Simon Josefsson's avatar
Simon Josefsson committed
666
667
serpent_encrypt (const struct serpent_ctx *ctx,
		 unsigned length, uint8_t * dst, const uint8_t * src)
Rafael Sevilla's avatar
Rafael Sevilla committed
668
{
669
670
671
672
673
674
675
  assert( !(length % SERPENT_BLOCK_SIZE));
  
#if HAVE_NATIVE_64_BIT
  if (length & SERPENT_BLOCK_SIZE)
#else
  while (length >= SERPENT_BLOCK_SIZE)
#endif
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
    {
      uint32_t x0,x1,x2,x3, y0,y1,y2,y3;
      unsigned k;

      x0 = LE_READ_UINT32 (src);
      x1 = LE_READ_UINT32 (src + 4);
      x2 = LE_READ_UINT32 (src + 8);
      x3 = LE_READ_UINT32 (src + 12);

      for (k = 0; ; k += 8)
	{
	  ROUND (0, ctx->keys[k+0], x0,x1,x2,x3, y0,y1,y2,y3);
	  ROUND (1, ctx->keys[k+1], y0,y1,y2,y3, x0,x1,x2,x3);
	  ROUND (2, ctx->keys[k+2], x0,x1,x2,x3, y0,y1,y2,y3);
	  ROUND (3, ctx->keys[k+3], y0,y1,y2,y3, x0,x1,x2,x3);
	  ROUND (4, ctx->keys[k+4], x0,x1,x2,x3, y0,y1,y2,y3);
	  ROUND (5, ctx->keys[k+5], y0,y1,y2,y3, x0,x1,x2,x3);
	  ROUND (6, ctx->keys[k+6], x0,x1,x2,x3, y0,y1,y2,y3);
	  if (k == 24)
	    break;
	  ROUND (7, ctx->keys[k+7], y0,y1,y2,y3, x0,x1,x2,x3);
	}

      /* Special final round, using two subkeys. */
      KEYXOR (y0,y1,y2,y3, ctx->keys[31]);
701
      SBOX7 (uint32_t, y0,y1,y2,y3, x0,x1,x2,x3);
702
703
704
705
706
707
      KEYXOR (x0,x1,x2,x3, ctx->keys[32]);
    
      LE_WRITE_UINT32 (dst, x0);
      LE_WRITE_UINT32 (dst + 4, x1);
      LE_WRITE_UINT32 (dst + 8, x2);
      LE_WRITE_UINT32 (dst + 12, x3);
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755

      src += SERPENT_BLOCK_SIZE;
      dst += SERPENT_BLOCK_SIZE;
      length -= SERPENT_BLOCK_SIZE;
    }
#if HAVE_NATIVE_64_BIT
  FOR_BLOCKS(length, dst, src, 2*SERPENT_BLOCK_SIZE)
    {
      uint64_t x0,x1,x2,x3, y0,y1,y2,y3;
      unsigned k;

      x0 = LE_READ_UINT32 (src);
      x1 = LE_READ_UINT32 (src + 4);
      x2 = LE_READ_UINT32 (src + 8);
      x3 = LE_READ_UINT32 (src + 12);

      x0 <<= 32; x0 |= LE_READ_UINT32 (src + 16);
      x1 <<= 32; x1 |= LE_READ_UINT32 (src + 20);
      x2 <<= 32; x2 |= LE_READ_UINT32 (src + 24);
      x3 <<= 32; x3 |= LE_READ_UINT32 (src + 28);

      for (k = 0; ; k += 8)
	{
	  ROUND64 (0, ctx->keys[k+0], x0,x1,x2,x3, y0,y1,y2,y3);
	  ROUND64 (1, ctx->keys[k+1], y0,y1,y2,y3, x0,x1,x2,x3);
	  ROUND64 (2, ctx->keys[k+2], x0,x1,x2,x3, y0,y1,y2,y3);
	  ROUND64 (3, ctx->keys[k+3], y0,y1,y2,y3, x0,x1,x2,x3);
	  ROUND64 (4, ctx->keys[k+4], x0,x1,x2,x3, y0,y1,y2,y3);
	  ROUND64 (5, ctx->keys[k+5], y0,y1,y2,y3, x0,x1,x2,x3);
	  ROUND64 (6, ctx->keys[k+6], x0,x1,x2,x3, y0,y1,y2,y3);
	  if (k == 24)
	    break;
	  ROUND64 (7, ctx->keys[k+7], y0,y1,y2,y3, x0,x1,x2,x3);
	}

      /* Special final round, using two subkeys. */
      KEYXOR64 (y0,y1,y2,y3, ctx->keys[31]);
      SBOX7 (uint64_t, y0,y1,y2,y3, x0,x1,x2,x3);
      KEYXOR64 (x0,x1,x2,x3, ctx->keys[32]);
    
      LE_WRITE_UINT32 (dst + 16, x0);
      LE_WRITE_UINT32 (dst + 20, x1);
      LE_WRITE_UINT32 (dst + 24, x2);
      LE_WRITE_UINT32 (dst + 28, x3);
      x0 >>= 32; LE_WRITE_UINT32 (dst, x0);
      x1 >>= 32; LE_WRITE_UINT32 (dst + 4, x1);
      x2 >>= 32; LE_WRITE_UINT32 (dst + 8, x2);
      x3 >>= 32; LE_WRITE_UINT32 (dst + 12, x3);
756
    }
757
#endif /* HAVE_NATIVE_64_BIT */
Simon Josefsson's avatar
Simon Josefsson committed
758
759
760
761
762
763
}

void
serpent_decrypt (const struct serpent_ctx *ctx,
		 unsigned length, uint8_t * dst, const uint8_t * src)
{
764
765
766
767
768
769
770
  assert( !(length % SERPENT_BLOCK_SIZE));

#if HAVE_NATIVE_64_BIT
  if (length & SERPENT_BLOCK_SIZE)
#else
  while (length >= SERPENT_BLOCK_SIZE)
#endif
771
772
773
774
775
776
777
778
779
780
781
    {
      uint32_t x0,x1,x2,x3, y0,y1,y2,y3;
      unsigned k;

      x0 = LE_READ_UINT32 (src);
      x1 = LE_READ_UINT32 (src + 4);
      x2 = LE_READ_UINT32 (src + 8);
      x3 = LE_READ_UINT32 (src + 12);

      /* Inverse of special round */
      KEYXOR (x0,x1,x2,x3, ctx->keys[32]);
782
      SBOX7_INVERSE (uint32_t, x0,x1,x2,x3, y0,y1,y2,y3);
783
784
785
      KEYXOR (y0,y1,y2,y3, ctx->keys[31]);

      k = 24;
786
      goto start32;
787
788
789
790
      while (k > 0)
	{
	  k -= 8;
	  ROUND_INVERSE (7, ctx->keys[k+7], x0,x1,x2,x3, y0,y1,y2,y3);
791
	start32:
792
793
794
795
796
797
798
799
800
801
802
803
804
	  ROUND_INVERSE (6, ctx->keys[k+6], y0,y1,y2,y3, x0,x1,x2,x3);
	  ROUND_INVERSE (5, ctx->keys[k+5], x0,x1,x2,x3, y0,y1,y2,y3);
	  ROUND_INVERSE (4, ctx->keys[k+4], y0,y1,y2,y3, x0,x1,x2,x3);
	  ROUND_INVERSE (3, ctx->keys[k+3], x0,x1,x2,x3, y0,y1,y2,y3);
	  ROUND_INVERSE (2, ctx->keys[k+2], y0,y1,y2,y3, x0,x1,x2,x3);
	  ROUND_INVERSE (1, ctx->keys[k+1], x0,x1,x2,x3, y0,y1,y2,y3);
	  ROUND_INVERSE (0, ctx->keys[k], y0,y1,y2,y3, x0,x1,x2,x3);
	}
      
      LE_WRITE_UINT32 (dst, x0);
      LE_WRITE_UINT32 (dst + 4, x1);
      LE_WRITE_UINT32 (dst + 8, x2);
      LE_WRITE_UINT32 (dst + 12, x3);
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854

      src += SERPENT_BLOCK_SIZE;
      dst += SERPENT_BLOCK_SIZE;
      length -= SERPENT_BLOCK_SIZE;
    }
#if HAVE_NATIVE_64_BIT
  FOR_BLOCKS(length, dst, src, 2*SERPENT_BLOCK_SIZE)
    {
      uint64_t x0,x1,x2,x3, y0,y1,y2,y3;
      unsigned k;

      x0 = LE_READ_UINT32 (src);
      x1 = LE_READ_UINT32 (src + 4);
      x2 = LE_READ_UINT32 (src + 8);
      x3 = LE_READ_UINT32 (src + 12);

      x0 <<= 32; x0 |= LE_READ_UINT32 (src + 16);
      x1 <<= 32; x1 |= LE_READ_UINT32 (src + 20);
      x2 <<= 32; x2 |= LE_READ_UINT32 (src + 24);
      x3 <<= 32; x3 |= LE_READ_UINT32 (src + 28);

      /* Inverse of special round */
      KEYXOR64 (x0,x1,x2,x3, ctx->keys[32]);
      SBOX7_INVERSE (uint64_t, x0,x1,x2,x3, y0,y1,y2,y3);
      KEYXOR64 (y0,y1,y2,y3, ctx->keys[31]);

      k = 24;
      goto start64;
      while (k > 0)
	{
	  k -= 8;
	  ROUND64_INVERSE (7, ctx->keys[k+7], x0,x1,x2,x3, y0,y1,y2,y3);
	start64:
	  ROUND64_INVERSE (6, ctx->keys[k+6], y0,y1,y2,y3, x0,x1,x2,x3);
	  ROUND64_INVERSE (5, ctx->keys[k+5], x0,x1,x2,x3, y0,y1,y2,y3);
	  ROUND64_INVERSE (4, ctx->keys[k+4], y0,y1,y2,y3, x0,x1,x2,x3);
	  ROUND64_INVERSE (3, ctx->keys[k+3], x0,x1,x2,x3, y0,y1,y2,y3);
	  ROUND64_INVERSE (2, ctx->keys[k+2], y0,y1,y2,y3, x0,x1,x2,x3);
	  ROUND64_INVERSE (1, ctx->keys[k+1], x0,x1,x2,x3, y0,y1,y2,y3);
	  ROUND64_INVERSE (0, ctx->keys[k], y0,y1,y2,y3, x0,x1,x2,x3);
	}
    
      LE_WRITE_UINT32 (dst + 16, x0);
      LE_WRITE_UINT32 (dst + 20, x1);
      LE_WRITE_UINT32 (dst + 24, x2);
      LE_WRITE_UINT32 (dst + 28, x3);
      x0 >>= 32; LE_WRITE_UINT32 (dst, x0);
      x1 >>= 32; LE_WRITE_UINT32 (dst + 4, x1);
      x2 >>= 32; LE_WRITE_UINT32 (dst + 8, x2);
      x3 >>= 32; LE_WRITE_UINT32 (dst + 12, x3);
855
    }
856
#endif /* HAVE_NATIVE_64_BIT */  
Rafael Sevilla's avatar
Rafael Sevilla committed
857
}