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"
43 #include "rijndael_internal.h"
47 * SILC Crypto API for Rijndael
50 /* Sets the key for the cipher. */
52 SILC_CIPHER_API_SET_KEY(aes)
56 SILC_GET_WORD_KEY(key, k, keylen);
57 rijndael_set_key((RijndaelContext *)context, k, keylen);
62 /* Sets the string as a new key for the cipher. The string is first
63 hashed and then used as a new key. */
65 SILC_CIPHER_API_SET_KEY_WITH_STRING(aes)
67 /* unsigned char key[md5_hash_len];
68 SilcMarsContext *ctx = (SilcMarsContext *)context;
70 make_md5_hash(string, &key);
71 memcpy(&ctx->key, mars_set_key(&key, keylen), keylen);
72 memset(&key, 'F', sizeoof(key));
78 /* Returns the size of the cipher context. */
80 SILC_CIPHER_API_CONTEXT_LEN(aes)
82 return sizeof(RijndaelContext);
85 /* Encrypts with the cipher in CBC mode. Source and destination buffers
86 maybe one and same. */
88 SILC_CIPHER_API_ENCRYPT_CBC(aes)
93 SILC_CBC_GET_IV(tiv, iv);
95 SILC_CBC_ENC_PRE(tiv, src);
96 rijndael_encrypt((RijndaelContext *)context, tiv, tiv);
97 SILC_CBC_ENC_POST(tiv, dst, src);
99 for (i = 16; i < len; i += 16) {
100 SILC_CBC_ENC_PRE(tiv, src);
101 rijndael_encrypt((RijndaelContext *)context, tiv, tiv);
102 SILC_CBC_ENC_POST(tiv, dst, src);
105 SILC_CBC_PUT_IV(tiv, iv);
110 /* Decrypts with the cipher in CBC mode. Source and destination buffers
111 maybe one and same. */
113 SILC_CIPHER_API_DECRYPT_CBC(aes)
115 SilcUInt32 tmp[4], tmp2[4], tiv[4];
118 SILC_CBC_GET_IV(tiv, iv);
120 SILC_CBC_DEC_PRE(tmp, src);
121 rijndael_decrypt((RijndaelContext *)context, tmp, tmp2);
122 SILC_CBC_DEC_POST(tmp2, dst, src, tmp, tiv);
124 for (i = 16; i < len; i += 16) {
125 SILC_CBC_DEC_PRE(tmp, src);
126 rijndael_decrypt((RijndaelContext *)context, tmp, tmp2);
127 SILC_CBC_DEC_POST(tmp2, dst, src, tmp, tiv);
130 SILC_CBC_PUT_IV(tiv, iv);
142 u4byte ft_tab[4][256];
143 u4byte it_tab[4][256];
145 u4byte fl_tab[4][256];
146 u4byte il_tab[4][256];
150 #define ff_mult(a,b) (a && b ? pow_tab[(log_tab[a] + log_tab[b]) % 255] : 0)
152 #define f_rn(bo, bi, n, k) \
153 bo[n] = ft_tab[0][byte(bi[n],0)] ^ \
154 ft_tab[1][byte(bi[(n + 1) & 3],1)] ^ \
155 ft_tab[2][byte(bi[(n + 2) & 3],2)] ^ \
156 ft_tab[3][byte(bi[(n + 3) & 3],3)] ^ *(k + n)
158 #define i_rn(bo, bi, n, k) \
159 bo[n] = it_tab[0][byte(bi[n],0)] ^ \
160 it_tab[1][byte(bi[(n + 3) & 3],1)] ^ \
161 it_tab[2][byte(bi[(n + 2) & 3],2)] ^ \
162 it_tab[3][byte(bi[(n + 1) & 3],3)] ^ *(k + n)
167 ( fl_tab[0][byte(x, 0)] ^ \
168 fl_tab[1][byte(x, 1)] ^ \
169 fl_tab[2][byte(x, 2)] ^ \
170 fl_tab[3][byte(x, 3)] )
172 #define f_rl(bo, bi, n, k) \
173 bo[n] = fl_tab[0][byte(bi[n],0)] ^ \
174 fl_tab[1][byte(bi[(n + 1) & 3],1)] ^ \
175 fl_tab[2][byte(bi[(n + 2) & 3],2)] ^ \
176 fl_tab[3][byte(bi[(n + 3) & 3],3)] ^ *(k + n)
178 #define i_rl(bo, bi, n, k) \
179 bo[n] = il_tab[0][byte(bi[n],0)] ^ \
180 il_tab[1][byte(bi[(n + 3) & 3],1)] ^ \
181 il_tab[2][byte(bi[(n + 2) & 3],2)] ^ \
182 il_tab[3][byte(bi[(n + 1) & 3],3)] ^ *(k + n)
187 ((u4byte)sbx_tab[byte(x, 0)] << 0) ^ \
188 ((u4byte)sbx_tab[byte(x, 1)] << 8) ^ \
189 ((u4byte)sbx_tab[byte(x, 2)] << 16) ^ \
190 ((u4byte)sbx_tab[byte(x, 3)] << 24)
192 #define f_rl(bo, bi, n, k) \
193 bo[n] = (u4byte)sbx_tab[byte(bi[n],0)] ^ \
194 rotl(((u4byte)sbx_tab[byte(bi[(n + 1) & 3],1)]), 8) ^ \
195 rotl(((u4byte)sbx_tab[byte(bi[(n + 2) & 3],2)]), 16) ^ \
196 rotl(((u4byte)sbx_tab[byte(bi[(n + 3) & 3],3)]), 24) ^ *(k + n)
198 #define i_rl(bo, bi, n, k) \
199 bo[n] = (u4byte)isb_tab[byte(bi[n],0)] ^ \
200 rotl(((u4byte)isb_tab[byte(bi[(n + 3) & 3],1)]), 8) ^ \
201 rotl(((u4byte)isb_tab[byte(bi[(n + 2) & 3],2)]), 16) ^ \
202 rotl(((u4byte)isb_tab[byte(bi[(n + 1) & 3],3)]), 24) ^ *(k + n)
210 /* log and power tables for GF(2**8) finite field with */
211 /* 0x11b as modular polynomial - the simplest prmitive */
212 /* root is 0x11, used here to generate the tables */
214 for(i = 0,p = 1; i < 256; ++i)
216 pow_tab[i] = (u1byte)p; log_tab[p] = (u1byte)i;
218 p = p ^ (p << 1) ^ (p & 0x80 ? 0x01b : 0);
221 log_tab[1] = 0; p = 1;
223 for(i = 0; i < 10; ++i)
227 p = (p << 1) ^ (p & 0x80 ? 0x1b : 0);
230 /* note that the affine byte transformation matrix in */
231 /* rijndael specification is in big endian format with */
232 /* bit 0 as the most significant bit. In the remainder */
233 /* of the specification the bits are numbered from the */
234 /* least significant end of a byte. */
236 for(i = 0; i < 256; ++i)
238 p = (i ? pow_tab[255 - log_tab[i]] : 0); q = p;
239 q = (q >> 7) | (q << 1); p ^= q;
240 q = (q >> 7) | (q << 1); p ^= q;
241 q = (q >> 7) | (q << 1); p ^= q;
242 q = (q >> 7) | (q << 1); p ^= q ^ 0x63;
243 sbx_tab[i] = (u1byte)p; isb_tab[p] = (u1byte)i;
246 for(i = 0; i < 256; ++i)
252 t = p; fl_tab[0][i] = t;
253 fl_tab[1][i] = rotl(t, 8);
254 fl_tab[2][i] = rotl(t, 16);
255 fl_tab[3][i] = rotl(t, 24);
257 t = ((u4byte)ff_mult(2, p)) |
260 ((u4byte)ff_mult(3, p) << 24);
263 ft_tab[1][i] = rotl(t, 8);
264 ft_tab[2][i] = rotl(t, 16);
265 ft_tab[3][i] = rotl(t, 24);
271 t = p; il_tab[0][i] = t;
272 il_tab[1][i] = rotl(t, 8);
273 il_tab[2][i] = rotl(t, 16);
274 il_tab[3][i] = rotl(t, 24);
276 t = ((u4byte)ff_mult(14, p)) |
277 ((u4byte)ff_mult( 9, p) << 8) |
278 ((u4byte)ff_mult(13, p) << 16) |
279 ((u4byte)ff_mult(11, p) << 24);
282 it_tab[1][i] = rotl(t, 8);
283 it_tab[2][i] = rotl(t, 16);
284 it_tab[3][i] = rotl(t, 24);
290 #define star_x(x) (((x) & 0x7f7f7f7f) << 1) ^ ((((x) & 0x80808080) >> 7) * 0x1b)
292 #define imix_col(y,x) \
298 (y) ^= rotr(u ^ t, 8) ^ \
302 /* initialise the key schedule from the user supplied key */
306 t = ls_box(rotr(t, 8)) ^ rco_tab[i]; \
307 t ^= e_key[4 * i]; e_key[4 * i + 4] = t; \
308 t ^= e_key[4 * i + 1]; e_key[4 * i + 5] = t; \
309 t ^= e_key[4 * i + 2]; e_key[4 * i + 6] = t; \
310 t ^= e_key[4 * i + 3]; e_key[4 * i + 7] = t; \
314 { t = ls_box(rotr(t, 8)) ^ rco_tab[i]; \
315 t ^= e_key[6 * i]; e_key[6 * i + 6] = t; \
316 t ^= e_key[6 * i + 1]; e_key[6 * i + 7] = t; \
317 t ^= e_key[6 * i + 2]; e_key[6 * i + 8] = t; \
318 t ^= e_key[6 * i + 3]; e_key[6 * i + 9] = t; \
319 t ^= e_key[6 * i + 4]; e_key[6 * i + 10] = t; \
320 t ^= e_key[6 * i + 5]; e_key[6 * i + 11] = t; \
324 { t = ls_box(rotr(t, 8)) ^ rco_tab[i]; \
325 t ^= e_key[8 * i]; e_key[8 * i + 8] = t; \
326 t ^= e_key[8 * i + 1]; e_key[8 * i + 9] = t; \
327 t ^= e_key[8 * i + 2]; e_key[8 * i + 10] = t; \
328 t ^= e_key[8 * i + 3]; e_key[8 * i + 11] = t; \
329 t = e_key[8 * i + 4] ^ ls_box(t); \
330 e_key[8 * i + 12] = t; \
331 t ^= e_key[8 * i + 5]; e_key[8 * i + 13] = t; \
332 t ^= e_key[8 * i + 6]; e_key[8 * i + 14] = t; \
333 t ^= e_key[8 * i + 7]; e_key[8 * i + 15] = t; \
336 u4byte *rijndael_set_key(RijndaelContext *ctx,
337 const u4byte in_key[], const u4byte key_len)
339 u4byte i, t, u, v, w;
340 u4byte *e_key = ctx->e_key;
341 u4byte *d_key = ctx->d_key;
347 k_len = ctx->k_len = (key_len + 31) / 32;
349 e_key[0] = in_key[0]; e_key[1] = in_key[1];
350 e_key[2] = in_key[2]; e_key[3] = in_key[3];
354 case 4: t = e_key[3];
355 for(i = 0; i < 10; ++i)
359 case 6: e_key[4] = in_key[4]; t = e_key[5] = in_key[5];
360 for(i = 0; i < 8; ++i)
364 case 8: e_key[4] = in_key[4]; e_key[5] = in_key[5];
365 e_key[6] = in_key[6]; t = e_key[7] = in_key[7];
366 for(i = 0; i < 7; ++i)
371 d_key[0] = e_key[0]; d_key[1] = e_key[1];
372 d_key[2] = e_key[2]; d_key[3] = e_key[3];
374 for(i = 4; i < 4 * k_len + 24; ++i)
376 imix_col(d_key[i], e_key[i]);
382 /* encrypt a block of text */
384 #define f_nround(bo, bi, k) \
385 f_rn(bo, bi, 0, k); \
386 f_rn(bo, bi, 1, k); \
387 f_rn(bo, bi, 2, k); \
388 f_rn(bo, bi, 3, k); \
391 #define f_lround(bo, bi, k) \
392 f_rl(bo, bi, 0, k); \
393 f_rl(bo, bi, 1, k); \
394 f_rl(bo, bi, 2, k); \
397 void rijndael_encrypt(RijndaelContext *ctx,
398 const u4byte in_blk[4], u4byte out_blk[4])
400 u4byte b0[4], b1[4], *kp;
401 u4byte *e_key = ctx->e_key;
402 u4byte k_len = ctx->k_len;
404 b0[0] = in_blk[0] ^ e_key[0]; b0[1] = in_blk[1] ^ e_key[1];
405 b0[2] = in_blk[2] ^ e_key[2]; b0[3] = in_blk[3] ^ e_key[3];
411 f_nround(b1, b0, kp); f_nround(b0, b1, kp);
416 f_nround(b1, b0, kp); f_nround(b0, b1, kp);
419 f_nround(b1, b0, kp); f_nround(b0, b1, kp);
420 f_nround(b1, b0, kp); f_nround(b0, b1, kp);
421 f_nround(b1, b0, kp); f_nround(b0, b1, kp);
422 f_nround(b1, b0, kp); f_nround(b0, b1, kp);
423 f_nround(b1, b0, kp); f_lround(b0, b1, kp);
425 out_blk[0] = b0[0]; out_blk[1] = b0[1];
426 out_blk[2] = b0[2]; out_blk[3] = b0[3];
429 /* decrypt a block of text */
431 #define i_nround(bo, bi, k) \
432 i_rn(bo, bi, 0, k); \
433 i_rn(bo, bi, 1, k); \
434 i_rn(bo, bi, 2, k); \
435 i_rn(bo, bi, 3, k); \
438 #define i_lround(bo, bi, k) \
439 i_rl(bo, bi, 0, k); \
440 i_rl(bo, bi, 1, k); \
441 i_rl(bo, bi, 2, k); \
444 void rijndael_decrypt(RijndaelContext *ctx,
445 const u4byte in_blk[4], u4byte out_blk[4])
447 u4byte b0[4], b1[4], *kp;
448 u4byte *e_key = ctx->e_key;
449 u4byte *d_key = ctx->d_key;
450 u4byte k_len = ctx->k_len;
452 b0[0] = in_blk[0] ^ e_key[4 * k_len + 24]; b0[1] = in_blk[1] ^ e_key[4 * k_len + 25];
453 b0[2] = in_blk[2] ^ e_key[4 * k_len + 26]; b0[3] = in_blk[3] ^ e_key[4 * k_len + 27];
455 kp = d_key + 4 * (k_len + 5);
459 i_nround(b1, b0, kp); i_nround(b0, b1, kp);
464 i_nround(b1, b0, kp); i_nround(b0, b1, kp);
467 i_nround(b1, b0, kp); i_nround(b0, b1, kp);
468 i_nround(b1, b0, kp); i_nround(b0, b1, kp);
469 i_nround(b1, b0, kp); i_nround(b0, b1, kp);
470 i_nround(b1, b0, kp); i_nround(b0, b1, kp);
471 i_nround(b1, b0, kp); i_lround(b0, b1, kp);
473 out_blk[0] = b0[0]; out_blk[1] = b0[1];
474 out_blk[2] = b0[2]; out_blk[3] = b0[3];