1 /* Modified for SILC. -Pekka */
4 /* This is an independent implementation of the encryption algorithm: */
6 /* RIJNDAEL by Joan Daemen and Vincent Rijmen */
8 /* which is a candidate algorithm in the Advanced Encryption Standard */
9 /* programme of the US National Institute of Standards and Technology. */
11 /* Copyright in this implementation is held by Dr B R Gladman but I */
12 /* hereby give permission for its free direct or derivative use subject */
13 /* to acknowledgment of its origin and compliance with any conditions */
14 /* that the originators of the algorithm place on its exploitation. */
16 /* Dr Brian Gladman (gladman@seven77.demon.co.uk) 14th January 1999 */
18 /* Timing data for Rijndael (rijndael.c)
20 Algorithm: rijndael (rijndael.c)
23 Key Setup: 305/1389 cycles (encrypt/decrypt)
24 Encrypt: 374 cycles = 68.4 mbits/sec
25 Decrypt: 352 cycles = 72.7 mbits/sec
26 Mean: 363 cycles = 70.5 mbits/sec
29 Key Setup: 277/1595 cycles (encrypt/decrypt)
30 Encrypt: 439 cycles = 58.3 mbits/sec
31 Decrypt: 425 cycles = 60.2 mbits/sec
32 Mean: 432 cycles = 59.3 mbits/sec
35 Key Setup: 374/1960 cycles (encrypt/decrypt)
36 Encrypt: 502 cycles = 51.0 mbits/sec
37 Decrypt: 498 cycles = 51.4 mbits/sec
38 Mean: 500 cycles = 51.2 mbits/sec
42 #include "silcincludes.h"
46 * SILC Crypto API for Rijndael
49 /* Sets the key for the cipher. */
51 SILC_CIPHER_API_SET_KEY(rijndael)
53 rijndael_set_key((RijndaelContext *)context, (unsigned int *)key, keylen);
57 /* Sets the string as a new key for the cipher. The string is first
58 hashed and then used as a new key. */
60 SILC_CIPHER_API_SET_KEY_WITH_STRING(rijndael)
62 /* unsigned char key[md5_hash_len];
63 SilcMarsContext *ctx = (SilcMarsContext *)context;
65 make_md5_hash(string, &key);
66 memcpy(&ctx->key, mars_set_key(&key, keylen), keylen);
67 memset(&key, 'F', sizeoof(key));
73 /* Returns the size of the cipher context. */
75 SILC_CIPHER_API_CONTEXT_LEN(rijndael)
77 return sizeof(RijndaelContext);
80 /* Encrypts with the cipher in CBC mode. Source and destination buffers
81 maybe one and same. */
83 SILC_CIPHER_API_ENCRYPT_CBC(rijndael)
85 unsigned int *in, *out, *tiv;
89 in = (unsigned int *)src;
90 out = (unsigned int *)dst;
91 tiv = (unsigned int *)iv;
93 tmp[0] = in[0] ^ tiv[0];
94 tmp[1] = in[1] ^ tiv[1];
95 tmp[2] = in[2] ^ tiv[2];
96 tmp[3] = in[3] ^ tiv[3];
97 rijndael_encrypt((RijndaelContext *)context, tmp, out);
101 for (i = 16; i < len; i += 16) {
102 tmp[0] = in[0] ^ out[0 - 4];
103 tmp[1] = in[1] ^ out[1 - 4];
104 tmp[2] = in[2] ^ out[2 - 4];
105 tmp[3] = in[3] ^ out[3 - 4];
106 rijndael_encrypt((RijndaelContext *)context, tmp, out);
119 /* Decrypts with the cipher in CBC mode. Source and destination buffers
120 maybe one and same. */
122 SILC_CIPHER_API_DECRYPT_CBC(rijndael)
124 unsigned int *tiv, *in, *out;
125 unsigned int tmp[4], tmp2[4];
128 in = (unsigned int *)src;
129 out = (unsigned int *)dst;
130 tiv = (unsigned int *)iv;
136 rijndael_decrypt((RijndaelContext *)context, in, out);
144 for (i = 16; i < len; i += 16) {
153 rijndael_decrypt((RijndaelContext *)context, in, out);
177 u4byte ft_tab[4][256];
178 u4byte it_tab[4][256];
180 u4byte fl_tab[4][256];
181 u4byte il_tab[4][256];
185 #define ff_mult(a,b) (a && b ? pow_tab[(log_tab[a] + log_tab[b]) % 255] : 0)
187 #define f_rn(bo, bi, n, k) \
188 bo[n] = ft_tab[0][byte(bi[n],0)] ^ \
189 ft_tab[1][byte(bi[(n + 1) & 3],1)] ^ \
190 ft_tab[2][byte(bi[(n + 2) & 3],2)] ^ \
191 ft_tab[3][byte(bi[(n + 3) & 3],3)] ^ *(k + n)
193 #define i_rn(bo, bi, n, k) \
194 bo[n] = it_tab[0][byte(bi[n],0)] ^ \
195 it_tab[1][byte(bi[(n + 3) & 3],1)] ^ \
196 it_tab[2][byte(bi[(n + 2) & 3],2)] ^ \
197 it_tab[3][byte(bi[(n + 1) & 3],3)] ^ *(k + n)
202 ( fl_tab[0][byte(x, 0)] ^ \
203 fl_tab[1][byte(x, 1)] ^ \
204 fl_tab[2][byte(x, 2)] ^ \
205 fl_tab[3][byte(x, 3)] )
207 #define f_rl(bo, bi, n, k) \
208 bo[n] = fl_tab[0][byte(bi[n],0)] ^ \
209 fl_tab[1][byte(bi[(n + 1) & 3],1)] ^ \
210 fl_tab[2][byte(bi[(n + 2) & 3],2)] ^ \
211 fl_tab[3][byte(bi[(n + 3) & 3],3)] ^ *(k + n)
213 #define i_rl(bo, bi, n, k) \
214 bo[n] = il_tab[0][byte(bi[n],0)] ^ \
215 il_tab[1][byte(bi[(n + 3) & 3],1)] ^ \
216 il_tab[2][byte(bi[(n + 2) & 3],2)] ^ \
217 il_tab[3][byte(bi[(n + 1) & 3],3)] ^ *(k + n)
222 ((u4byte)sbx_tab[byte(x, 0)] << 0) ^ \
223 ((u4byte)sbx_tab[byte(x, 1)] << 8) ^ \
224 ((u4byte)sbx_tab[byte(x, 2)] << 16) ^ \
225 ((u4byte)sbx_tab[byte(x, 3)] << 24)
227 #define f_rl(bo, bi, n, k) \
228 bo[n] = (u4byte)sbx_tab[byte(bi[n],0)] ^ \
229 rotl(((u4byte)sbx_tab[byte(bi[(n + 1) & 3],1)]), 8) ^ \
230 rotl(((u4byte)sbx_tab[byte(bi[(n + 2) & 3],2)]), 16) ^ \
231 rotl(((u4byte)sbx_tab[byte(bi[(n + 3) & 3],3)]), 24) ^ *(k + n)
233 #define i_rl(bo, bi, n, k) \
234 bo[n] = (u4byte)isb_tab[byte(bi[n],0)] ^ \
235 rotl(((u4byte)isb_tab[byte(bi[(n + 3) & 3],1)]), 8) ^ \
236 rotl(((u4byte)isb_tab[byte(bi[(n + 2) & 3],2)]), 16) ^ \
237 rotl(((u4byte)isb_tab[byte(bi[(n + 1) & 3],3)]), 24) ^ *(k + n)
245 /* log and power tables for GF(2**8) finite field with */
246 /* 0x11b as modular polynomial - the simplest prmitive */
247 /* root is 0x11, used here to generate the tables */
249 for(i = 0,p = 1; i < 256; ++i)
251 pow_tab[i] = (u1byte)p; log_tab[p] = (u1byte)i;
253 p = p ^ (p << 1) ^ (p & 0x80 ? 0x01b : 0);
256 log_tab[1] = 0; p = 1;
258 for(i = 0; i < 10; ++i)
262 p = (p << 1) ^ (p & 0x80 ? 0x1b : 0);
265 /* note that the affine byte transformation matrix in */
266 /* rijndael specification is in big endian format with */
267 /* bit 0 as the most significant bit. In the remainder */
268 /* of the specification the bits are numbered from the */
269 /* least significant end of a byte. */
271 for(i = 0; i < 256; ++i)
273 p = (i ? pow_tab[255 - log_tab[i]] : 0); q = p;
274 q = (q >> 7) | (q << 1); p ^= q;
275 q = (q >> 7) | (q << 1); p ^= q;
276 q = (q >> 7) | (q << 1); p ^= q;
277 q = (q >> 7) | (q << 1); p ^= q ^ 0x63;
278 sbx_tab[i] = (u1byte)p; isb_tab[p] = (u1byte)i;
281 for(i = 0; i < 256; ++i)
287 t = p; fl_tab[0][i] = t;
288 fl_tab[1][i] = rotl(t, 8);
289 fl_tab[2][i] = rotl(t, 16);
290 fl_tab[3][i] = rotl(t, 24);
292 t = ((u4byte)ff_mult(2, p)) |
295 ((u4byte)ff_mult(3, p) << 24);
298 ft_tab[1][i] = rotl(t, 8);
299 ft_tab[2][i] = rotl(t, 16);
300 ft_tab[3][i] = rotl(t, 24);
306 t = p; il_tab[0][i] = t;
307 il_tab[1][i] = rotl(t, 8);
308 il_tab[2][i] = rotl(t, 16);
309 il_tab[3][i] = rotl(t, 24);
311 t = ((u4byte)ff_mult(14, p)) |
312 ((u4byte)ff_mult( 9, p) << 8) |
313 ((u4byte)ff_mult(13, p) << 16) |
314 ((u4byte)ff_mult(11, p) << 24);
317 it_tab[1][i] = rotl(t, 8);
318 it_tab[2][i] = rotl(t, 16);
319 it_tab[3][i] = rotl(t, 24);
325 #define star_x(x) (((x) & 0x7f7f7f7f) << 1) ^ ((((x) & 0x80808080) >> 7) * 0x1b)
327 #define imix_col(y,x) \
333 (y) ^= rotr(u ^ t, 8) ^ \
337 /* initialise the key schedule from the user supplied key */
341 t = ls_box(rotr(t, 8)) ^ rco_tab[i]; \
342 t ^= e_key[4 * i]; e_key[4 * i + 4] = t; \
343 t ^= e_key[4 * i + 1]; e_key[4 * i + 5] = t; \
344 t ^= e_key[4 * i + 2]; e_key[4 * i + 6] = t; \
345 t ^= e_key[4 * i + 3]; e_key[4 * i + 7] = t; \
349 { t = ls_box(rotr(t, 8)) ^ rco_tab[i]; \
350 t ^= e_key[6 * i]; e_key[6 * i + 6] = t; \
351 t ^= e_key[6 * i + 1]; e_key[6 * i + 7] = t; \
352 t ^= e_key[6 * i + 2]; e_key[6 * i + 8] = t; \
353 t ^= e_key[6 * i + 3]; e_key[6 * i + 9] = t; \
354 t ^= e_key[6 * i + 4]; e_key[6 * i + 10] = t; \
355 t ^= e_key[6 * i + 5]; e_key[6 * i + 11] = t; \
359 { t = ls_box(rotr(t, 8)) ^ rco_tab[i]; \
360 t ^= e_key[8 * i]; e_key[8 * i + 8] = t; \
361 t ^= e_key[8 * i + 1]; e_key[8 * i + 9] = t; \
362 t ^= e_key[8 * i + 2]; e_key[8 * i + 10] = t; \
363 t ^= e_key[8 * i + 3]; e_key[8 * i + 11] = t; \
364 t = e_key[8 * i + 4] ^ ls_box(t); \
365 e_key[8 * i + 12] = t; \
366 t ^= e_key[8 * i + 5]; e_key[8 * i + 13] = t; \
367 t ^= e_key[8 * i + 6]; e_key[8 * i + 14] = t; \
368 t ^= e_key[8 * i + 7]; e_key[8 * i + 15] = t; \
371 u4byte *rijndael_set_key(RijndaelContext *ctx,
372 const u4byte in_key[], const u4byte key_len)
374 u4byte i, t, u, v, w;
375 u4byte *e_key = ctx->e_key;
376 u4byte *d_key = ctx->d_key;
382 k_len = ctx->k_len = (key_len + 31) / 32;
384 e_key[0] = in_key[0]; e_key[1] = in_key[1];
385 e_key[2] = in_key[2]; e_key[3] = in_key[3];
389 case 4: t = e_key[3];
390 for(i = 0; i < 10; ++i)
394 case 6: e_key[4] = in_key[4]; t = e_key[5] = in_key[5];
395 for(i = 0; i < 8; ++i)
399 case 8: e_key[4] = in_key[4]; e_key[5] = in_key[5];
400 e_key[6] = in_key[6]; t = e_key[7] = in_key[7];
401 for(i = 0; i < 7; ++i)
406 d_key[0] = e_key[0]; d_key[1] = e_key[1];
407 d_key[2] = e_key[2]; d_key[3] = e_key[3];
409 for(i = 4; i < 4 * k_len + 24; ++i)
411 imix_col(d_key[i], e_key[i]);
417 /* encrypt a block of text */
419 #define f_nround(bo, bi, k) \
420 f_rn(bo, bi, 0, k); \
421 f_rn(bo, bi, 1, k); \
422 f_rn(bo, bi, 2, k); \
423 f_rn(bo, bi, 3, k); \
426 #define f_lround(bo, bi, k) \
427 f_rl(bo, bi, 0, k); \
428 f_rl(bo, bi, 1, k); \
429 f_rl(bo, bi, 2, k); \
432 void rijndael_encrypt(RijndaelContext *ctx,
433 const u4byte in_blk[4], u4byte out_blk[4])
435 u4byte b0[4], b1[4], *kp;
436 u4byte *e_key = ctx->e_key;
437 u4byte k_len = ctx->k_len;
439 b0[0] = in_blk[0] ^ e_key[0]; b0[1] = in_blk[1] ^ e_key[1];
440 b0[2] = in_blk[2] ^ e_key[2]; b0[3] = in_blk[3] ^ e_key[3];
446 f_nround(b1, b0, kp); f_nround(b0, b1, kp);
451 f_nround(b1, b0, kp); f_nround(b0, b1, kp);
454 f_nround(b1, b0, kp); f_nround(b0, b1, kp);
455 f_nround(b1, b0, kp); f_nround(b0, b1, kp);
456 f_nround(b1, b0, kp); f_nround(b0, b1, kp);
457 f_nround(b1, b0, kp); f_nround(b0, b1, kp);
458 f_nround(b1, b0, kp); f_lround(b0, b1, kp);
460 out_blk[0] = b0[0]; out_blk[1] = b0[1];
461 out_blk[2] = b0[2]; out_blk[3] = b0[3];
464 /* decrypt a block of text */
466 #define i_nround(bo, bi, k) \
467 i_rn(bo, bi, 0, k); \
468 i_rn(bo, bi, 1, k); \
469 i_rn(bo, bi, 2, k); \
470 i_rn(bo, bi, 3, k); \
473 #define i_lround(bo, bi, k) \
474 i_rl(bo, bi, 0, k); \
475 i_rl(bo, bi, 1, k); \
476 i_rl(bo, bi, 2, k); \
479 void rijndael_decrypt(RijndaelContext *ctx,
480 const u4byte in_blk[4], u4byte out_blk[4])
482 u4byte b0[4], b1[4], *kp;
483 u4byte *e_key = ctx->e_key;
484 u4byte *d_key = ctx->d_key;
485 u4byte k_len = ctx->k_len;
487 b0[0] = in_blk[0] ^ e_key[4 * k_len + 24]; b0[1] = in_blk[1] ^ e_key[4 * k_len + 25];
488 b0[2] = in_blk[2] ^ e_key[4 * k_len + 26]; b0[3] = in_blk[3] ^ e_key[4 * k_len + 27];
490 kp = d_key + 4 * (k_len + 5);
494 i_nround(b1, b0, kp); i_nround(b0, b1, kp);
499 i_nround(b1, b0, kp); i_nround(b0, b1, kp);
502 i_nround(b1, b0, kp); i_nround(b0, b1, kp);
503 i_nround(b1, b0, kp); i_nround(b0, b1, kp);
504 i_nround(b1, b0, kp); i_nround(b0, b1, kp);
505 i_nround(b1, b0, kp); i_nround(b0, b1, kp);
506 i_nround(b1, b0, kp); i_lround(b0, b1, kp);
508 out_blk[0] = b0[0]; out_blk[1] = b0[1];
509 out_blk[2] = b0[2]; out_blk[3] = b0[3];