2 * AES (Rijndael) cipher - encrypt
4 * Modifications to public domain implementation:
6 * - use C pre-processor to make it easier to change S table access
7 * - added option (AES_SMALL_TABLES) for reducing code size by about 8 kB at
8 * cost of reduced throughput (quite small difference on Pentium 4,
9 * 10-25% when using -O1 or -O2 optimization)
11 * Copyright (c) 2003-2012, Jouni Malinen <j@w1.fi>
13 * This software may be distributed under the terms of the BSD license.
14 * See README for more details.
23 static void rijndaelEncrypt(const u32 rk[], int Nr, const u8 pt[16], u8 ct[16])
25 u32 s0, s1, s2, s3, t0, t1, t2, t3;
28 #endif /* ?FULL_UNROLL */
31 * map byte array block to cipher state
32 * and add initial round key:
34 s0 = GETU32(pt ) ^ rk[0];
35 s1 = GETU32(pt + 4) ^ rk[1];
36 s2 = GETU32(pt + 8) ^ rk[2];
37 s3 = GETU32(pt + 12) ^ rk[3];
39 #define ROUND(i,d,s) \
40 d##0 = TE0(s##0) ^ TE1(s##1) ^ TE2(s##2) ^ TE3(s##3) ^ rk[4 * i]; \
41 d##1 = TE0(s##1) ^ TE1(s##2) ^ TE2(s##3) ^ TE3(s##0) ^ rk[4 * i + 1]; \
42 d##2 = TE0(s##2) ^ TE1(s##3) ^ TE2(s##0) ^ TE3(s##1) ^ rk[4 * i + 2]; \
43 d##3 = TE0(s##3) ^ TE1(s##0) ^ TE2(s##1) ^ TE3(s##2) ^ rk[4 * i + 3]
67 #else /* !FULL_UNROLL */
69 /* Nr - 1 full rounds: */
79 #endif /* ?FULL_UNROLL */
84 * apply last round and
85 * map cipher state to byte array block:
87 s0 = TE41(t0) ^ TE42(t1) ^ TE43(t2) ^ TE44(t3) ^ rk[0];
89 s1 = TE41(t1) ^ TE42(t2) ^ TE43(t3) ^ TE44(t0) ^ rk[1];
91 s2 = TE41(t2) ^ TE42(t3) ^ TE43(t0) ^ TE44(t1) ^ rk[2];
93 s3 = TE41(t3) ^ TE42(t0) ^ TE43(t1) ^ TE44(t2) ^ rk[3];
98 void * aes_encrypt_init(const u8 *key, size_t len)
102 rk = os_malloc(AES_PRIV_SIZE);
105 res = rijndaelKeySetupEnc(rk, key, len * 8);
110 rk[AES_PRIV_NR_POS] = res;
115 void aes_encrypt(void *ctx, const u8 *plain, u8 *crypt)
118 rijndaelEncrypt(ctx, rk[AES_PRIV_NR_POS], plain, crypt);
122 void aes_encrypt_deinit(void *ctx)
124 os_memset(ctx, 0, AES_PRIV_SIZE);