Mercurial > libavutil.hg
annotate aes.c @ 210:dd27616bb3fe libavutil
unused variable
author | michael |
---|---|
date | Tue, 16 Jan 2007 16:24:43 +0000 |
parents | 42e62ac3b2ba |
children | 3ef3f2ad70a4 |
rev | line source |
---|---|
164 | 1 /* |
194
3d5efe2de0ae
seems i didnt copy anything from aes128.c so this should be more correct ?
michael
parents:
193
diff
changeset
|
2 * copyright (c) 2007 Michael Niedermayer <michaelni@gmx.at> |
164 | 3 * |
4 * This file is part of FFmpeg. | |
5 * | |
6 * FFmpeg is free software; you can redistribute it and/or | |
7 * modify it under the terms of the GNU Lesser General Public | |
8 * License as published by the Free Software Foundation; either | |
9 * version 2.1 of the License, or (at your option) any later version. | |
10 * | |
11 * FFmpeg is distributed in the hope that it will be useful, | |
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
14 * Lesser General Public License for more details. | |
15 * | |
16 * You should have received a copy of the GNU Lesser General Public | |
17 * License along with FFmpeg; if not, write to the Free Software | |
18 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA | |
194
3d5efe2de0ae
seems i didnt copy anything from aes128.c so this should be more correct ?
michael
parents:
193
diff
changeset
|
19 * |
3d5efe2de0ae
seems i didnt copy anything from aes128.c so this should be more correct ?
michael
parents:
193
diff
changeset
|
20 * some optimization ideas from aes128.c by Reimar Doeffinger |
164 | 21 */ |
22 | |
23 #include "common.h" | |
24 #include "aes.h" | |
25 | |
26 typedef struct AVAES{ | |
189 | 27 uint8_t round_key[15][4][4]; |
164 | 28 uint8_t state[4][4]; |
29 int rounds; | |
30 }AVAES; | |
31 | |
206 | 32 const int av_aes_size= sizeof(AVAES); |
33 | |
192 | 34 static const uint8_t rcon[10] = { |
35 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36 | |
164 | 36 }; |
37 | |
38 static uint8_t sbox[256]; | |
39 static uint8_t inv_sbox[256]; | |
169 | 40 #ifdef CONFIG_SMALL |
41 static uint32_t enc_multbl[1][256]; | |
42 static uint32_t dec_multbl[1][256]; | |
43 #else | |
44 static uint32_t enc_multbl[4][256]; | |
45 static uint32_t dec_multbl[4][256]; | |
46 #endif | |
164 | 47 |
168 | 48 static inline void addkey(uint64_t state[2], uint64_t round_key[2]){ |
49 state[0] ^= round_key[0]; | |
50 state[1] ^= round_key[1]; | |
164 | 51 } |
52 | |
209 | 53 static void subshift(uint8_t s0[4], uint8_t s1[4], uint8_t s2[4], uint8_t s3[4], uint8_t *box){ |
54 int t; | |
55 s0[0]=box[s0[ 0]]; s0[ 4]=box[s0[ 4]]; s0[ 8]=box[s0[ 8]]; s0[12]=box[s0[12]]; | |
56 t=s1[0]; s1[0]=box[s1[ 4]]; s1[ 4]=box[s1[ 8]]; s1[ 8]=box[s1[12]]; s1[12]=box[t]; | |
57 t=s2[0]; s2[0]=box[s2[ 8]]; s2[ 8]=box[ t]; t=s2[ 4]; s2[ 4]=box[s2[12]]; s2[12]=box[t]; | |
58 t=s3[0]; s3[0]=box[s3[12]]; s3[12]=box[s3[ 8]]; s3[ 8]=box[s3[ 4]]; s3[ 4]=box[t]; | |
59 } | |
183 | 60 |
181 | 61 #define ROT(x,s) ((x<<s)|(x>>(32-s))) |
209 | 62 #if 0 |
169 | 63 static inline void mix(uint8_t state[4][4], uint32_t multbl[4][256]){ |
64 int i; | |
65 for(i=0; i<4; i++) | |
66 #ifdef CONFIG_SMALL | |
67 ((uint32_t *)(state))[i] = multbl[0][state[i][0]] ^ ROT(multbl[0][state[i][1]], 8) | |
68 ^ROT(multbl[0][state[i][2]],16) ^ ROT(multbl[0][state[i][3]],24); | |
69 #else | |
70 ((uint32_t *)(state))[i] = multbl[0][state[i][0]] ^ multbl[1][state[i][1]] | |
71 ^multbl[2][state[i][2]] ^ multbl[3][state[i][3]]; | |
72 #endif | |
164 | 73 } |
209 | 74 #endif |
75 static inline void mix2(uint8_t state[4][4], uint32_t multbl[4][256], int s1, int s3){ | |
76 int a = multbl[0][state[0][0]] ^ multbl[1][state[s1 ][1]] | |
77 ^multbl[2][state[2][2]] ^ multbl[3][state[s3 ][3]]; | |
78 int b = multbl[0][state[1][0]] ^ multbl[1][state[s3-1][1]] | |
79 ^multbl[2][state[3][2]] ^ multbl[3][state[s1-1][3]]; | |
80 int c = multbl[0][state[2][0]] ^ multbl[1][state[s3 ][1]] | |
81 ^multbl[2][state[0][2]] ^ multbl[3][state[s1 ][3]]; | |
82 int d = multbl[0][state[3][0]] ^ multbl[1][state[s1-1][1]] | |
83 ^multbl[2][state[1][2]] ^ multbl[3][state[s3-1][3]]; | |
84 | |
85 ((uint32_t *)(state))[0]=a; | |
86 ((uint32_t *)(state))[1]=b; | |
87 ((uint32_t *)(state))[2]=c; | |
88 ((uint32_t *)(state))[3]=d; | |
89 } | |
164 | 90 |
191
a2a3c80706e5
merge encrypt and decrypt so the source is simpler and the compiler can choose with inlining if it wants speed or small size
michael
parents:
190
diff
changeset
|
91 static inline void crypt(AVAES *a, int s, uint8_t *sbox, uint32_t *multbl){ |
210 | 92 int r; |
164 | 93 |
188 | 94 for(r=a->rounds; r>1; r--){ |
189 | 95 addkey(a->state, a->round_key[r]); |
209 | 96 mix2(a->state, multbl, 3-s, 1+s); |
164 | 97 } |
189 | 98 addkey(a->state, a->round_key[1]); |
209 | 99 subshift(a->state[0], a->state[0]+3-s, a->state[0]+2, a->state[0]+1+s, sbox); |
189 | 100 addkey(a->state, a->round_key[0]); |
164 | 101 } |
102 | |
208
d846d66f99e9
make aes_en/decrypt() static until we decided on the public API
michael
parents:
207
diff
changeset
|
103 static void aes_decrypt(AVAES *a){ |
191
a2a3c80706e5
merge encrypt and decrypt so the source is simpler and the compiler can choose with inlining if it wants speed or small size
michael
parents:
190
diff
changeset
|
104 crypt(a, 0, inv_sbox, dec_multbl); |
a2a3c80706e5
merge encrypt and decrypt so the source is simpler and the compiler can choose with inlining if it wants speed or small size
michael
parents:
190
diff
changeset
|
105 } |
a2a3c80706e5
merge encrypt and decrypt so the source is simpler and the compiler can choose with inlining if it wants speed or small size
michael
parents:
190
diff
changeset
|
106 |
208
d846d66f99e9
make aes_en/decrypt() static until we decided on the public API
michael
parents:
207
diff
changeset
|
107 static void aes_encrypt(AVAES *a){ |
191
a2a3c80706e5
merge encrypt and decrypt so the source is simpler and the compiler can choose with inlining if it wants speed or small size
michael
parents:
190
diff
changeset
|
108 crypt(a, 2, sbox, enc_multbl); |
178 | 109 } |
110 | |
195 | 111 static void init_multbl2(uint8_t tbl[1024], int c[4], uint8_t *log8, uint8_t *alog8, uint8_t *sbox){ |
200 | 112 int i, j; |
183 | 113 for(i=0; i<1024; i++){ |
204
b7ac7733b2f4
replace / by >> this makes the .o ~150 bytes smaller
michael
parents:
203
diff
changeset
|
114 int x= sbox[i>>2]; |
183 | 115 if(x) tbl[i]= alog8[ log8[x] + log8[c[i&3]] ]; |
116 } | |
199 | 117 #ifndef CONFIG_SMALL |
200 | 118 for(j=256; j<1024; j++) |
119 for(i=0; i<4; i++) | |
120 tbl[4*j+i]= tbl[4*j + ((i-1)&3) - 1024]; | |
199 | 121 #endif |
183 | 122 } |
123 | |
164 | 124 // this is based on the reference AES code by Paulo Barreto and Vincent Rijmen |
206 | 125 int av_aes_init(AVAES *a, uint8_t *key, int key_bits, int decrypt) { |
164 | 126 int i, j, t, rconpointer = 0; |
127 uint8_t tk[8][4]; | |
204
b7ac7733b2f4
replace / by >> this makes the .o ~150 bytes smaller
michael
parents:
203
diff
changeset
|
128 int KC= key_bits>>5; |
167 | 129 int rounds= KC + 6; |
169 | 130 uint8_t log8[256]; |
131 uint8_t alog8[512]; | |
164 | 132 |
205
0723fdb8d7a8
check the last? entry written for detecting already initalized tables
michael
parents:
204
diff
changeset
|
133 if(!enc_multbl[4][1023]){ |
164 | 134 j=1; |
135 for(i=0; i<255; i++){ | |
136 alog8[i]= | |
137 alog8[i+255]= j; | |
138 log8[j]= i; | |
139 j^= j+j; | |
140 if(j>255) j^= 0x11B; | |
141 } | |
142 for(i=0; i<256; i++){ | |
143 j= i ? alog8[255-log8[i]] : 0; | |
165 | 144 j ^= (j<<1) ^ (j<<2) ^ (j<<3) ^ (j<<4); |
145 j = (j ^ (j>>8) ^ 99) & 255; | |
164 | 146 inv_sbox[j]= i; |
147 sbox [i]= j; | |
148 } | |
184 | 149 init_multbl2(dec_multbl[0], (int[4]){0xe, 0x9, 0xd, 0xb}, log8, alog8, inv_sbox); |
183 | 150 init_multbl2(enc_multbl[0], (int[4]){0x2, 0x1, 0x1, 0x3}, log8, alog8, sbox); |
164 | 151 } |
152 | |
167 | 153 if(key_bits!=128 && key_bits!=192 && key_bits!=256) |
206 | 154 return -1; |
164 | 155 |
167 | 156 a->rounds= rounds; |
166 | 157 |
164 | 158 memcpy(tk, key, KC*4); |
159 | |
174
263bbdc10c1e
simplify round_key generation by writing over the end but ensuring that theres some irrelevant stuff afterwards
michael
parents:
173
diff
changeset
|
160 for(t= 0; t < (rounds+1)*4;) { |
197 | 161 memcpy(a->round_key[0][t], tk, KC*4); |
174
263bbdc10c1e
simplify round_key generation by writing over the end but ensuring that theres some irrelevant stuff afterwards
michael
parents:
173
diff
changeset
|
162 t+= KC; |
164 | 163 |
164 for(i = 0; i < 4; i++) | |
173 | 165 tk[0][i] ^= sbox[tk[KC-1][(i+1)&3]]; |
164 | 166 tk[0][0] ^= rcon[rconpointer++]; |
167 | |
168 for(j = 1; j < KC; j++){ | |
204
b7ac7733b2f4
replace / by >> this makes the .o ~150 bytes smaller
michael
parents:
203
diff
changeset
|
169 if(KC != 8 || j != KC>>1) |
175 | 170 for(i = 0; i < 4; i++) tk[j][i] ^= tk[j-1][i]; |
164 | 171 else |
175 | 172 for(i = 0; i < 4; i++) tk[j][i] ^= sbox[tk[j-1][i]]; |
164 | 173 } |
174 } | |
184 | 175 |
189 | 176 if(decrypt){ |
190 | 177 for(i=1; i<rounds; i++){ |
209 | 178 subshift(a->round_key[i][0], a->round_key[i][0]+3, a->round_key[i][0]+2, a->round_key[i][0]+1, sbox); |
179 mix2(a->round_key[i], dec_multbl, 1, 3); | |
190 | 180 } |
197 | 181 }else{ |
204
b7ac7733b2f4
replace / by >> this makes the .o ~150 bytes smaller
michael
parents:
203
diff
changeset
|
182 for(i=0; i<(rounds+1)>>1; i++){ |
197 | 183 for(j=0; j<16; j++) |
184 FFSWAP(int, a->round_key[i][0][j], a->round_key[rounds-i][0][j]); | |
185 } | |
187 | 186 } |
184 | 187 |
206 | 188 return 0; |
164 | 189 } |
190 | |
191 #ifdef TEST | |
207
b5ff46799eea
move #include log.h into the selftesting code where it belongs
michael
parents:
206
diff
changeset
|
192 #include "log.h" |
164 | 193 |
194 int main(){ | |
195 | 195 int i,j; |
206 | 196 AVAES ae, ad, b; |
198 | 197 uint8_t rkey[2][16]= { |
198 {0}, | |
199 {0x10, 0xa5, 0x88, 0x69, 0xd7, 0x4b, 0xe5, 0xa3, 0x74, 0xcf, 0x86, 0x7c, 0xfb, 0x47, 0x38, 0x59}}; | |
200 uint8_t pt[16], rpt[2][16]= { | |
201 {0x6a, 0x84, 0x86, 0x7c, 0xd7, 0x7e, 0x12, 0xad, 0x07, 0xea, 0x1b, 0xe8, 0x95, 0xc5, 0x3f, 0xa3}, | |
202 {0}}; | |
203 uint8_t rct[2][16]= { | |
204 {0x73, 0x22, 0x81, 0xc0, 0xa0, 0xaa, 0xb8, 0xf7, 0xa5, 0x4a, 0x0c, 0x67, 0xa0, 0xc4, 0x5e, 0xcf}, | |
205 {0x6d, 0x25, 0x1e, 0x69, 0x44, 0xb0, 0x51, 0xe0, 0x4e, 0xaa, 0x6f, 0xb4, 0xdb, 0xf7, 0x84, 0x65}}; | |
164 | 206 |
206 | 207 av_aes_init(&ae, "PI=3.141592654..", 128, 0); |
208 av_aes_init(&ad, "PI=3.141592654..", 128, 1); | |
179 | 209 av_log_level= AV_LOG_DEBUG; |
210 | |
198 | 211 for(i=0; i<2; i++){ |
206 | 212 av_aes_init(&b, rkey[i], 128, 1); |
213 memcpy(b.state, rct[i], 16); | |
208
d846d66f99e9
make aes_en/decrypt() static until we decided on the public API
michael
parents:
207
diff
changeset
|
214 aes_decrypt(&b); |
198 | 215 for(j=0; j<16; j++) |
206 | 216 if(rpt[i][j] != b.state[0][j]) |
217 av_log(NULL, AV_LOG_ERROR, "%d %02X %02X\n", j, rpt[i][j], b.state[0][j]); | |
198 | 218 } |
183 | 219 |
164 | 220 for(i=0; i<10000; i++){ |
178 | 221 for(j=0; j<16; j++){ |
222 pt[j]= random(); | |
223 } | |
206 | 224 memcpy(ae.state, pt, 16); |
179 | 225 {START_TIMER |
208
d846d66f99e9
make aes_en/decrypt() static until we decided on the public API
michael
parents:
207
diff
changeset
|
226 aes_encrypt(&ae); |
178 | 227 if(!(i&(i-1))) |
206 | 228 av_log(NULL, AV_LOG_ERROR, "%02X %02X %02X %02X\n", ae.state[0][0], ae.state[1][1], ae.state[2][2], ae.state[3][3]); |
229 memcpy(ad.state, ae.state, 16); | |
208
d846d66f99e9
make aes_en/decrypt() static until we decided on the public API
michael
parents:
207
diff
changeset
|
230 aes_decrypt(&ad); |
179 | 231 STOP_TIMER("aes")} |
178 | 232 for(j=0; j<16; j++){ |
206 | 233 if(pt[j] != ad.state[0][j]){ |
234 av_log(NULL, AV_LOG_ERROR, "%d %d %02X %02X\n", i,j, pt[j], ad.state[0][j]); | |
178 | 235 } |
236 } | |
164 | 237 } |
238 return 0; | |
239 } | |
240 #endif |