Repository navigation
Expand file tree
/
Copy pathAES.cpp
More file actions
418 lines (367 loc) · 12.1 KB
/
Copy pathAES.cpp
File metadata and controls
418 lines (367 loc) · 12.1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
#include<stdio.h>
#define blockSize 4
// Macro to find the product of x ({02}) and the argument to xtime modulo {1b}
#define xtime(x) ((x<<1) ^ (((x>>7) & 1) * 0x1b))
// Macro to multiply numbers in the Galois Field(2^8)
#define Multiply(x,y) (((y & 1) * x) ^ ((y>>1 & 1) * xtime(x)) ^ ((y>>2 & 1) * xtime(xtime(x))) ^ ((y>>3 & 1) * xtime(xtime(xtime(x)))) ^ ((y>>4 & 1) * xtime(xtime(xtime(xtime(x))))))
int rounds = 0;
int keyLength = 0;
unsigned char plaintext[16], encrypted[16], state[4][4];
unsigned char roundKey[240], Key[32];
// Returns Rijndael S-box value
int get_SBox_Value(int num)
{
// lookup table
int sbox[256] = {
0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5, 0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76,
0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0, 0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0,
0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f, 0xf7, 0xcc, 0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15,
0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a, 0x07, 0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75,
0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0, 0x52, 0x3b, 0xd6, 0xb3, 0x29, 0xe3, 0x2f, 0x84,
0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b, 0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58, 0xcf,
0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85, 0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8,
0x51, 0xa3, 0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5, 0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2,
0xcd, 0x0c, 0x13, 0xec, 0x5f, 0x97, 0x44, 0x17, 0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73,
0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88, 0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb,
0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c, 0xc2, 0xd3, 0xac, 0x62, 0x91, 0x95, 0xe4, 0x79,
0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9, 0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a, 0xae, 0x08,
0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6, 0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a,
0x70, 0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e, 0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e,
0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94, 0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf,
0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68, 0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16
};
return sbox[num];
}
// Returns inverse Rijndael S-box value
int get_SBox_Inverse(int num)
{
// lookup table
int rsbox[256] = {
0x52, 0x09, 0x6a, 0xd5, 0x30, 0x36, 0xa5, 0x38, 0xbf, 0x40, 0xa3, 0x9e, 0x81, 0xf3, 0xd7, 0xfb,
0x7c, 0xe3, 0x39, 0x82, 0x9b, 0x2f, 0xff, 0x87, 0x34, 0x8e, 0x43, 0x44, 0xc4, 0xde, 0xe9, 0xcb,
0x54, 0x7b, 0x94, 0x32, 0xa6, 0xc2, 0x23, 0x3d, 0xee, 0x4c, 0x95, 0x0b, 0x42, 0xfa, 0xc3, 0x4e,
0x08, 0x2e, 0xa1, 0x66, 0x28, 0xd9, 0x24, 0xb2, 0x76, 0x5b, 0xa2, 0x49, 0x6d, 0x8b, 0xd1, 0x25,
0x72, 0xf8, 0xf6, 0x64, 0x86, 0x68, 0x98, 0x16, 0xd4, 0xa4, 0x5c, 0xcc, 0x5d, 0x65, 0xb6, 0x92,
0x6c, 0x70, 0x48, 0x50, 0xfd, 0xed, 0xb9, 0xda, 0x5e, 0x15, 0x46, 0x57, 0xa7, 0x8d, 0x9d, 0x84,
0x90, 0xd8, 0xab, 0x00, 0x8c, 0xbc, 0xd3, 0x0a, 0xf7, 0xe4, 0x58, 0x05, 0xb8, 0xb3, 0x45, 0x06,
0xd0, 0x2c, 0x1e, 0x8f, 0xca, 0x3f, 0x0f, 0x02, 0xc1, 0xaf, 0xbd, 0x03, 0x01, 0x13, 0x8a, 0x6b,
0x3a, 0x91, 0x11, 0x41, 0x4f, 0x67, 0xdc, 0xea, 0x97, 0xf2, 0xcf, 0xce, 0xf0, 0xb4, 0xe6, 0x73,
0x96, 0xac, 0x74, 0x22, 0xe7, 0xad, 0x35, 0x85, 0xe2, 0xf9, 0x37, 0xe8, 0x1c, 0x75, 0xdf, 0x6e,
0x47, 0xf1, 0x1a, 0x71, 0x1d, 0x29, 0xc5, 0x89, 0x6f, 0xb7, 0x62, 0x0e, 0xaa, 0x18, 0xbe, 0x1b,
0xfc, 0x56, 0x3e, 0x4b, 0xc6, 0xd2, 0x79, 0x20, 0x9a, 0xdb, 0xc0, 0xfe, 0x78, 0xcd, 0x5a, 0xf4,
0x1f, 0xdd, 0xa8, 0x33, 0x88, 0x07, 0xc7, 0x31, 0xb1, 0x12, 0x10, 0x59, 0x27, 0x80, 0xec, 0x5f,
0x60, 0x51, 0x7f, 0xa9, 0x19, 0xb5, 0x4a, 0x0d, 0x2d, 0xe5, 0x7a, 0x9f, 0x93, 0xc9, 0x9c, 0xef,
0xa0, 0xe0, 0x3b, 0x4d, 0xae, 0x2a, 0xf5, 0xb0, 0xc8, 0xeb, 0xbb, 0x3c, 0x83, 0x53, 0x99, 0x61,
0x17, 0x2b, 0x04, 0x7e, 0xba, 0x77, 0xd6, 0x26, 0xe1, 0x69, 0x14, 0x63, 0x55, 0x21, 0x0c, 0x7d
};
return rsbox[num];
}
// Lookup Table for round constant word array
// Contains the values given by x to the power (i-1) being powers of x ({02}) in the field Galois Field (28)
int Rcon[255] = {
0x8d, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36, 0x6c, 0xd8, 0xab, 0x4d, 0x9a,
0x2f, 0x5e, 0xbc, 0x63, 0xc6, 0x97, 0x35, 0x6a, 0xd4, 0xb3, 0x7d, 0xfa, 0xef, 0xc5, 0x91, 0x39,
0x72, 0xe4, 0xd3, 0xbd, 0x61, 0xc2, 0x9f, 0x25, 0x4a, 0x94, 0x33, 0x66, 0xcc, 0x83, 0x1d, 0x3a,
0x74, 0xe8, 0xcb, 0x8d, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36, 0x6c, 0xd8,
0xab, 0x4d, 0x9a, 0x2f, 0x5e, 0xbc, 0x63, 0xc6, 0x97, 0x35, 0x6a, 0xd4, 0xb3, 0x7d, 0xfa, 0xef,
0xc5, 0x91, 0x39, 0x72, 0xe4, 0xd3, 0xbd, 0x61, 0xc2, 0x9f, 0x25, 0x4a, 0x94, 0x33, 0x66, 0xcc,
0x83, 0x1d, 0x3a, 0x74, 0xe8, 0xcb, 0x8d, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b,
0x36, 0x6c, 0xd8, 0xab, 0x4d, 0x9a, 0x2f, 0x5e, 0xbc, 0x63, 0xc6, 0x97, 0x35, 0x6a, 0xd4, 0xb3,
0x7d, 0xfa, 0xef, 0xc5, 0x91, 0x39, 0x72, 0xe4, 0xd3, 0xbd, 0x61, 0xc2, 0x9f, 0x25, 0x4a, 0x94,
0x33, 0x66, 0xcc, 0x83, 0x1d, 0x3a, 0x74, 0xe8, 0xcb, 0x8d, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20,
0x40, 0x80, 0x1b, 0x36, 0x6c, 0xd8, 0xab, 0x4d, 0x9a, 0x2f, 0x5e, 0xbc, 0x63, 0xc6, 0x97, 0x35,
0x6a, 0xd4, 0xb3, 0x7d, 0xfa, 0xef, 0xc5, 0x91, 0x39, 0x72, 0xe4, 0xd3, 0xbd, 0x61, 0xc2, 0x9f,
0x25, 0x4a, 0x94, 0x33, 0x66, 0xcc, 0x83, 0x1d, 0x3a, 0x74, 0xe8, 0xcb, 0x8d, 0x01, 0x02, 0x04,
0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36, 0x6c, 0xd8, 0xab, 0x4d, 0x9a, 0x2f, 0x5e, 0xbc, 0x63,
0xc6, 0x97, 0x35, 0x6a, 0xd4, 0xb3, 0x7d, 0xfa, 0xef, 0xc5, 0x91, 0x39, 0x72, 0xe4, 0xd3, 0xbd,
0x61, 0xc2, 0x9f, 0x25, 0x4a, 0x94, 0x33, 0x66, 0xcc, 0x83, 0x1d, 0x3a, 0x74, 0xe8, 0xcb };
// Deduces round keys from the primary Key provided
void Expand_Keys()
{
int i,j;
unsigned char temp[4],k;
// Use the primary Key for first round
for(i = 0; i < keyLength; i++)
{
roundKey[i*4]=Key[i*4];
roundKey[i*4+1]=Key[i*4+1];
roundKey[i*4+2]=Key[i*4+2];
roundKey[i*4+3]=Key[i*4+3];
}
// Each subsequent round key is deduced from previously deduced round keys
while (i < (blockSize * (rounds+1)))
{
for(j=0;j<4;j++)
{
temp[j]=roundKey[(i-1) * 4 + j];
}
if (i % keyLength == 0)
{
// Rotate the bytes in a word to the left.
{
k = temp[0];
temp[0] = temp[1];
temp[1] = temp[2];
temp[2] = temp[3];
temp[3] = k;
}
// Take a four-byte input and apply the S-box to each of the four bytes
{
temp[0]=get_SBox_Value(temp[0]);
temp[1]=get_SBox_Value(temp[1]);
temp[2]=get_SBox_Value(temp[2]);
temp[3]=get_SBox_Value(temp[3]);
}
temp[0] = temp[0] ^ Rcon[i/keyLength];
}
else if (keyLength > 6 && i % keyLength == 4)
{
{
temp[0]=get_SBox_Value(temp[0]);
temp[1]=get_SBox_Value(temp[1]);
temp[2]=get_SBox_Value(temp[2]);
temp[3]=get_SBox_Value(temp[3]);
}
}
roundKey[i*4+0] = roundKey[(i-keyLength)*4+0] ^ temp[0];
roundKey[i*4+1] = roundKey[(i-keyLength)*4+1] ^ temp[1];
roundKey[i*4+2] = roundKey[(i-keyLength)*4+2] ^ temp[2];
roundKey[i*4+3] = roundKey[(i-keyLength)*4+3] ^ temp[3];
i++;
}
}
// Add round key to state by XOR-ing
void Add_Round_Key(int round)
{
int i,j;
for (i = 0; i < 4; i++)
{
for(j = 0; j < 4; j++)
{
state[j][i] ^= roundKey[round * blockSize * 4 + i * blockSize + j];
}
}
}
// Substitute state matrix values with corresponding S-box values
void Sub_Bytes()
{
int i,j;
for(i = 0; i < 4; i++)
{
for(j = 0; j < 4; j++)
{
state[i][j] = get_SBox_Value(state[i][j]);
}
}
}
// Same as Sub_Bytes, but uses reverse SBox
void Inv_Sub_Bytes()
{
int i, j;
for (i = 0; i<4; i++)
{
for (j = 0; j<4; j++)
{
state[i][j] = get_SBox_Inverse(state[i][j]);
}
}
}
// Shift the rows in the state to the left by the row number value
void Shift_Rows()
{
unsigned char temp;
// First row by 1
temp=state[1][0];
state[1][0]=state[1][1];
state[1][1]=state[1][2];
state[1][2]=state[1][3];
state[1][3]=temp;
// Second row by 2
temp=state[2][0];
state[2][0]=state[2][2];
state[2][2]=temp;
temp=state[2][1];
state[2][1]=state[2][3];
state[2][3]=temp;
// Third row by 3
temp=state[3][0];
state[3][0]=state[3][3];
state[3][3]=state[3][2];
state[3][2]=state[3][1];
state[3][1]=temp;
}
// Same as Shift_Rows, but shifts right instead
void Inv_Shift_Rows()
{
unsigned char temp;
temp = state[1][3];
state[1][3] = state[1][2];
state[1][2] = state[1][1];
state[1][1] = state[1][0];
state[1][0] = temp;
temp = state[2][0];
state[2][0] = state[2][2];
state[2][2] = temp;
temp = state[2][1];
state[2][1] = state[2][3];
state[2][3] = temp;
temp = state[3][0];
state[3][0] = state[3][1];
state[3][1] = state[3][2];
state[3][2] = state[3][3];
state[3][3] = temp;
}
// Mixes the columns of the state matrix
void Mix_Columns()
{
int i;
unsigned char x1, x2, x3;
for (i = 0; i < 4; i++)
{
x1 = state[0][i];
x3 = state[0][i] ^ state[1][i] ^ state[2][i] ^ state[3][i];
x2 = state[0][i] ^ state[1][i]; x2 = xtime(x2); state[0][i] ^= x2 ^ x3;
x2 = state[1][i] ^ state[2][i]; x2 = xtime(x2); state[1][i] ^= x2 ^ x3;
x2 = state[2][i] ^ state[3][i]; x2 = xtime(x2); state[2][i] ^= x2 ^ x3;
x2 = state[3][i] ^ x1; x2 = xtime(x2); state[3][i] ^= x2 ^ x3;
}
}
// Inverse mixing of columns
void Inv_Mix_Columns()
{
int i;
unsigned char x1, x2, x3, x4;
for (i = 0; i < 4; i++)
{
x1 = state[0][i];
x2 = state[1][i];
x3 = state[2][i];
x4 = state[3][i];
state[0][i] = Multiply(x1, 0x0e) ^ Multiply(x2, 0x0b) ^ Multiply(x3, 0x0d) ^ Multiply(x4, 0x09);
state[1][i] = Multiply(x1, 0x09) ^ Multiply(x2, 0x0e) ^ Multiply(x3, 0x0b) ^ Multiply(x4, 0x0d);
state[2][i] = Multiply(x1, 0x0d) ^ Multiply(x2, 0x09) ^ Multiply(x3, 0x0e) ^ Multiply(x4, 0x0b);
state[3][i] = Multiply(x1, 0x0b) ^ Multiply(x2, 0x0d) ^ Multiply(x3, 0x09) ^ Multiply(x4, 0x0e);
}
}
void Encrypt()
{
int i,j,round=0;
// Copy plaintext to state array
for (i = 0; i < 4; i++)
{
for (j = 0; j < 4; j++)
{
state[j][i] = plaintext[i * 4 + j];
}
}
// Add the first round key to the state before starting the rounds
Add_Round_Key(0);
// The first rounds-1 rounds are the same
for (round = 1; round < rounds; round++)
{
Sub_Bytes();
Shift_Rows();
Mix_Columns();
Add_Round_Key(round);
}
// Last round has no Mix_Columns()
Sub_Bytes();
Shift_Rows();
Add_Round_Key(rounds);
// Copy the state array to output
for (i = 0; i < 4; i++)
{
for(j = 0; j < 4; j++)
{
encrypted[i * 4 + j] = state[j][i];
}
}
}
void Decrypt()
{
int i, j, round = 0;
// Copy cyphertext to state array
for (i = 0; i<4; i++)
{
for (j = 0; j<4; j++)
{
state[j][i] = encrypted[i * 4 + j];
}
}
Add_Round_Key(rounds);
for (round = rounds - 1; round>0; round--)
{
Inv_Shift_Rows();
Inv_Sub_Bytes();
Add_Round_Key(round);
Inv_Mix_Columns();
}
Inv_Shift_Rows();
Inv_Sub_Bytes();
Add_Round_Key(0);
// Copy the state array to output
for (i = 0; i<4; i++)
{
for (j = 0; j<4; j++)
{
plaintext[i * 4 + j] = state[j][i];
}
}
}
void main()
{
int i;
// Ask user for key length
while(rounds!=128 && rounds!=192 && rounds!=256)
{
printf("Length of Key? (128, 192 or 256): ");
scanf_s("%d",&rounds);
}
// Calculate actual keyLength and rounds from the user input
keyLength = rounds / 32;
rounds = keyLength + 6;
// Clear input buffer
_flushall();
// Ask user for the key in HEX
printf("Key in HEX: ");
for(i = 0; i < keyLength * 4; i++)
{
scanf_s("%x", &Key[i]);
}
// Ask user for the plaintext to be encrypted in HEX
printf("Plaintext in HEX: ");
for(i = 0 ; i < blockSize * 4; i++)
{
scanf_s("%x", &plaintext[i]);
}
// Expand_Keys before encryption
Expand_Keys();
Encrypt();
// Output the encrypted text
printf("\nEncrypted: \n");
for(i = 0; i < keyLength * blockSize; i++)
{
printf("%02x ", encrypted[i]);
}
printf("\n\n");
_flushall();
// Ask user for the decryption key in HEX
printf("Key in HEX: ");
for (i = 0; i < keyLength * 4; i++)
{
scanf_s("%x", &Key[i]);
}
printf("Ciphertext in HEX: ");
for (i = 0; i < blockSize * 4; i++)
{
scanf_s("%x", &encrypted[i]);
}
Expand_Keys();
Decrypt();
printf("\nDecrypted: \n");
for (i = 0; i < blockSize * 4; i++)
{
printf("%02x ", plaintext[i]);
}
printf("\n\n");
}