Nevar pievienot vairāk kā 25 tēmas Tēmai ir jāsākas ar burtu vai ciparu, tā var saturēt domu zīmes ('-') un var būt līdz 35 simboliem gara.

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476
  1. /*
  2. * Copyright(C) 2006 Cameron Rich
  3. *
  4. * This library is free software; you can redistribute it and/or modify
  5. * it under the terms of the GNU Lesser General Public License as published by
  6. * the Free Software Foundation; either version 2 of the License, or
  7. * (at your option) any later version.
  8. *
  9. * This library is distributed in the hope that it will be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. * GNU Lesser General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU Lesser General Public License
  15. * along with this library; if not, write to the Free Software
  16. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  17. */
  18. /**
  19. * AES implementation - this is a small code version. There are much faster
  20. * versions around but they are much larger in size (i.e. they use large
  21. * submix tables).
  22. */
  23. #include <string.h>
  24. #include "crypto.h"
  25. /* all commented out in skeleton mode */
  26. #ifndef CONFIG_SSL_SKELETON_MODE
  27. #define rot1(x) (((x) << 24) | ((x) >> 8))
  28. #define rot2(x) (((x) << 16) | ((x) >> 16))
  29. #define rot3(x) (((x) << 8) | ((x) >> 24))
  30. /*
  31. * This cute trick does 4 'mul by two' at once. Stolen from
  32. * Dr B. R. Gladman <brg@gladman.uk.net> but I'm sure the u-(u>>7) is
  33. * a standard graphics trick
  34. * The key to this is that we need to xor with 0x1b if the top bit is set.
  35. * a 1xxx xxxx 0xxx 0xxx First we mask the 7bit,
  36. * b 1000 0000 0000 0000 then we shift right by 7 putting the 7bit in 0bit,
  37. * c 0000 0001 0000 0000 we then subtract (c) from (b)
  38. * d 0111 1111 0000 0000 and now we and with our mask
  39. * e 0001 1011 0000 0000
  40. */
  41. #define mt 0x80808080
  42. #define ml 0x7f7f7f7f
  43. #define mh 0xfefefefe
  44. #define mm 0x1b1b1b1b
  45. #define mul2(x,t) ((t)=((x)&mt), \
  46. ((((x)+(x))&mh)^(((t)-((t)>>7))&mm)))
  47. #define inv_mix_col(x,f2,f4,f8,f9) (\
  48. (f2)=mul2(x,f2), \
  49. (f4)=mul2(f2,f4), \
  50. (f8)=mul2(f4,f8), \
  51. (f9)=(x)^(f8), \
  52. (f8)=((f2)^(f4)^(f8)), \
  53. (f2)^=(f9), \
  54. (f4)^=(f9), \
  55. (f8)^=rot3(f2), \
  56. (f8)^=rot2(f4), \
  57. (f8)^rot1(f9))
  58. /* some macros to do endian independent byte extraction */
  59. #define n2l(c,l) l=ntohl(*c); c++
  60. #define l2n(l,c) *c++=htonl(l)
  61. /*
  62. * AES S-box
  63. */
  64. static const uint8_t aes_sbox[256] =
  65. {
  66. 0x63,0x7C,0x77,0x7B,0xF2,0x6B,0x6F,0xC5,
  67. 0x30,0x01,0x67,0x2B,0xFE,0xD7,0xAB,0x76,
  68. 0xCA,0x82,0xC9,0x7D,0xFA,0x59,0x47,0xF0,
  69. 0xAD,0xD4,0xA2,0xAF,0x9C,0xA4,0x72,0xC0,
  70. 0xB7,0xFD,0x93,0x26,0x36,0x3F,0xF7,0xCC,
  71. 0x34,0xA5,0xE5,0xF1,0x71,0xD8,0x31,0x15,
  72. 0x04,0xC7,0x23,0xC3,0x18,0x96,0x05,0x9A,
  73. 0x07,0x12,0x80,0xE2,0xEB,0x27,0xB2,0x75,
  74. 0x09,0x83,0x2C,0x1A,0x1B,0x6E,0x5A,0xA0,
  75. 0x52,0x3B,0xD6,0xB3,0x29,0xE3,0x2F,0x84,
  76. 0x53,0xD1,0x00,0xED,0x20,0xFC,0xB1,0x5B,
  77. 0x6A,0xCB,0xBE,0x39,0x4A,0x4C,0x58,0xCF,
  78. 0xD0,0xEF,0xAA,0xFB,0x43,0x4D,0x33,0x85,
  79. 0x45,0xF9,0x02,0x7F,0x50,0x3C,0x9F,0xA8,
  80. 0x51,0xA3,0x40,0x8F,0x92,0x9D,0x38,0xF5,
  81. 0xBC,0xB6,0xDA,0x21,0x10,0xFF,0xF3,0xD2,
  82. 0xCD,0x0C,0x13,0xEC,0x5F,0x97,0x44,0x17,
  83. 0xC4,0xA7,0x7E,0x3D,0x64,0x5D,0x19,0x73,
  84. 0x60,0x81,0x4F,0xDC,0x22,0x2A,0x90,0x88,
  85. 0x46,0xEE,0xB8,0x14,0xDE,0x5E,0x0B,0xDB,
  86. 0xE0,0x32,0x3A,0x0A,0x49,0x06,0x24,0x5C,
  87. 0xC2,0xD3,0xAC,0x62,0x91,0x95,0xE4,0x79,
  88. 0xE7,0xC8,0x37,0x6D,0x8D,0xD5,0x4E,0xA9,
  89. 0x6C,0x56,0xF4,0xEA,0x65,0x7A,0xAE,0x08,
  90. 0xBA,0x78,0x25,0x2E,0x1C,0xA6,0xB4,0xC6,
  91. 0xE8,0xDD,0x74,0x1F,0x4B,0xBD,0x8B,0x8A,
  92. 0x70,0x3E,0xB5,0x66,0x48,0x03,0xF6,0x0E,
  93. 0x61,0x35,0x57,0xB9,0x86,0xC1,0x1D,0x9E,
  94. 0xE1,0xF8,0x98,0x11,0x69,0xD9,0x8E,0x94,
  95. 0x9B,0x1E,0x87,0xE9,0xCE,0x55,0x28,0xDF,
  96. 0x8C,0xA1,0x89,0x0D,0xBF,0xE6,0x42,0x68,
  97. 0x41,0x99,0x2D,0x0F,0xB0,0x54,0xBB,0x16,
  98. };
  99. /*
  100. * AES is-box
  101. */
  102. static const uint8_t aes_isbox[256] =
  103. {
  104. 0x52,0x09,0x6a,0xd5,0x30,0x36,0xa5,0x38,
  105. 0xbf,0x40,0xa3,0x9e,0x81,0xf3,0xd7,0xfb,
  106. 0x7c,0xe3,0x39,0x82,0x9b,0x2f,0xff,0x87,
  107. 0x34,0x8e,0x43,0x44,0xc4,0xde,0xe9,0xcb,
  108. 0x54,0x7b,0x94,0x32,0xa6,0xc2,0x23,0x3d,
  109. 0xee,0x4c,0x95,0x0b,0x42,0xfa,0xc3,0x4e,
  110. 0x08,0x2e,0xa1,0x66,0x28,0xd9,0x24,0xb2,
  111. 0x76,0x5b,0xa2,0x49,0x6d,0x8b,0xd1,0x25,
  112. 0x72,0xf8,0xf6,0x64,0x86,0x68,0x98,0x16,
  113. 0xd4,0xa4,0x5c,0xcc,0x5d,0x65,0xb6,0x92,
  114. 0x6c,0x70,0x48,0x50,0xfd,0xed,0xb9,0xda,
  115. 0x5e,0x15,0x46,0x57,0xa7,0x8d,0x9d,0x84,
  116. 0x90,0xd8,0xab,0x00,0x8c,0xbc,0xd3,0x0a,
  117. 0xf7,0xe4,0x58,0x05,0xb8,0xb3,0x45,0x06,
  118. 0xd0,0x2c,0x1e,0x8f,0xca,0x3f,0x0f,0x02,
  119. 0xc1,0xaf,0xbd,0x03,0x01,0x13,0x8a,0x6b,
  120. 0x3a,0x91,0x11,0x41,0x4f,0x67,0xdc,0xea,
  121. 0x97,0xf2,0xcf,0xce,0xf0,0xb4,0xe6,0x73,
  122. 0x96,0xac,0x74,0x22,0xe7,0xad,0x35,0x85,
  123. 0xe2,0xf9,0x37,0xe8,0x1c,0x75,0xdf,0x6e,
  124. 0x47,0xf1,0x1a,0x71,0x1d,0x29,0xc5,0x89,
  125. 0x6f,0xb7,0x62,0x0e,0xaa,0x18,0xbe,0x1b,
  126. 0xfc,0x56,0x3e,0x4b,0xc6,0xd2,0x79,0x20,
  127. 0x9a,0xdb,0xc0,0xfe,0x78,0xcd,0x5a,0xf4,
  128. 0x1f,0xdd,0xa8,0x33,0x88,0x07,0xc7,0x31,
  129. 0xb1,0x12,0x10,0x59,0x27,0x80,0xec,0x5f,
  130. 0x60,0x51,0x7f,0xa9,0x19,0xb5,0x4a,0x0d,
  131. 0x2d,0xe5,0x7a,0x9f,0x93,0xc9,0x9c,0xef,
  132. 0xa0,0xe0,0x3b,0x4d,0xae,0x2a,0xf5,0xb0,
  133. 0xc8,0xeb,0xbb,0x3c,0x83,0x53,0x99,0x61,
  134. 0x17,0x2b,0x04,0x7e,0xba,0x77,0xd6,0x26,
  135. 0xe1,0x69,0x14,0x63,0x55,0x21,0x0c,0x7d
  136. };
  137. static const unsigned char Rcon[30]=
  138. {
  139. 0x01,0x02,0x04,0x08,0x10,0x20,0x40,0x80,
  140. 0x1b,0x36,0x6c,0xd8,0xab,0x4d,0x9a,0x2f,
  141. 0x5e,0xbc,0x63,0xc6,0x97,0x35,0x6a,0xd4,
  142. 0xb3,0x7d,0xfa,0xef,0xc5,0x91,
  143. };
  144. /* Perform doubling in Galois Field GF(2^8) using the irreducible polynomial
  145. x^8+x^4+x^3+x+1 */
  146. static unsigned char AES_xtime(uint32_t x)
  147. {
  148. return x = (x&0x80) ? (x<<1)^0x1b : x<<1;
  149. }
  150. /**
  151. * Set up AES with the key/iv and cipher size.
  152. */
  153. void AES_set_key(AES_CTX *ctx, const uint8_t *key,
  154. const uint8_t *iv, AES_MODE mode)
  155. {
  156. int i, ii;
  157. uint32_t *W, tmp, tmp2;
  158. const unsigned char *ip;
  159. int words;
  160. switch (mode)
  161. {
  162. case AES_MODE_128:
  163. i = 10;
  164. words = 4;
  165. break;
  166. case AES_MODE_256:
  167. i = 14;
  168. words = 8;
  169. break;
  170. default: /* fail silently */
  171. return;
  172. }
  173. ctx->rounds = i;
  174. ctx->key_size = words;
  175. W = ctx->ks;
  176. for (i = 0; i < words; i+=2)
  177. {
  178. W[i+0]= ((uint32_t)key[ 0]<<24)|
  179. ((uint32_t)key[ 1]<<16)|
  180. ((uint32_t)key[ 2]<< 8)|
  181. ((uint32_t)key[ 3] );
  182. W[i+1]= ((uint32_t)key[ 4]<<24)|
  183. ((uint32_t)key[ 5]<<16)|
  184. ((uint32_t)key[ 6]<< 8)|
  185. ((uint32_t)key[ 7] );
  186. key += 8;
  187. }
  188. ip = Rcon;
  189. ii = 4 * (ctx->rounds+1);
  190. for (i = words; i<ii; i++)
  191. {
  192. tmp = W[i-1];
  193. if ((i % words) == 0)
  194. {
  195. tmp2 =(uint32_t)aes_sbox[(tmp )&0xff]<< 8;
  196. tmp2|=(uint32_t)aes_sbox[(tmp>> 8)&0xff]<<16;
  197. tmp2|=(uint32_t)aes_sbox[(tmp>>16)&0xff]<<24;
  198. tmp2|=(uint32_t)aes_sbox[(tmp>>24) ];
  199. tmp=tmp2^(((unsigned int)*ip)<<24);
  200. ip++;
  201. }
  202. if ((words == 8) && ((i % words) == 4))
  203. {
  204. tmp2 =(uint32_t)aes_sbox[(tmp )&0xff] ;
  205. tmp2|=(uint32_t)aes_sbox[(tmp>> 8)&0xff]<< 8;
  206. tmp2|=(uint32_t)aes_sbox[(tmp>>16)&0xff]<<16;
  207. tmp2|=(uint32_t)aes_sbox[(tmp>>24) ]<<24;
  208. tmp=tmp2;
  209. }
  210. W[i]=W[i-words]^tmp;
  211. }
  212. /* copy the iv across */
  213. memcpy(ctx->iv, iv, 16);
  214. }
  215. /**
  216. * Change a key for decryption.
  217. */
  218. void AES_convert_key(AES_CTX *ctx)
  219. {
  220. int i;
  221. uint32_t *k,w,t1,t2,t3,t4;
  222. k = ctx->ks;
  223. k += 4;
  224. for (i=ctx->rounds*4; i>4; i--)
  225. {
  226. w= *k;
  227. w = inv_mix_col(w,t1,t2,t3,t4);
  228. *k++ =w;
  229. }
  230. }
  231. #if 0
  232. /**
  233. * Encrypt a byte sequence (with a block size 16) using the AES cipher.
  234. */
  235. void AES_cbc_encrypt(AES_CTX *ctx, const uint8_t *msg, uint8_t *out, int length)
  236. {
  237. uint32_t tin0, tin1, tin2, tin3;
  238. uint32_t tout0, tout1, tout2, tout3;
  239. uint32_t tin[4];
  240. uint32_t *iv = (uint32_t *)ctx->iv;
  241. uint32_t *msg_32 = (uint32_t *)msg;
  242. uint32_t *out_32 = (uint32_t *)out;
  243. n2l(iv, tout0);
  244. n2l(iv, tout1);
  245. n2l(iv, tout2);
  246. n2l(iv, tout3);
  247. iv -= 4;
  248. for (length -= 16; length >= 0; length -= 16)
  249. {
  250. n2l(msg_32, tin0);
  251. n2l(msg_32, tin1);
  252. n2l(msg_32, tin2);
  253. n2l(msg_32, tin3);
  254. tin[0] = tin0^tout0;
  255. tin[1] = tin1^tout1;
  256. tin[2] = tin2^tout2;
  257. tin[3] = tin3^tout3;
  258. AES_encrypt(ctx, tin);
  259. tout0 = tin[0];
  260. l2n(tout0, out_32);
  261. tout1 = tin[1];
  262. l2n(tout1, out_32);
  263. tout2 = tin[2];
  264. l2n(tout2, out_32);
  265. tout3 = tin[3];
  266. l2n(tout3, out_32);
  267. }
  268. l2n(tout0, iv);
  269. l2n(tout1, iv);
  270. l2n(tout2, iv);
  271. l2n(tout3, iv);
  272. }
  273. /**
  274. * Decrypt a byte sequence (with a block size 16) using the AES cipher.
  275. */
  276. void AES_cbc_decrypt(AES_CTX *ctx, const uint8_t *msg, uint8_t *out, int length)
  277. {
  278. uint32_t tin0, tin1, tin2, tin3;
  279. uint32_t xor0,xor1,xor2,xor3;
  280. uint32_t tout0,tout1,tout2,tout3;
  281. uint32_t data[4];
  282. uint32_t *iv = (uint32_t *)ctx->iv;
  283. uint32_t *msg_32 = (uint32_t *)msg;
  284. uint32_t *out_32 = (uint32_t *)out;
  285. n2l(iv ,xor0);
  286. n2l(iv, xor1);
  287. n2l(iv, xor2);
  288. n2l(iv, xor3);
  289. iv -= 4;
  290. for (length-=16; length >= 0; length -= 16)
  291. {
  292. n2l(msg_32, tin0);
  293. n2l(msg_32, tin1);
  294. n2l(msg_32, tin2);
  295. n2l(msg_32, tin3);
  296. data[0] = tin0;
  297. data[1] = tin1;
  298. data[2] = tin2;
  299. data[3] = tin3;
  300. AES_decrypt(ctx, data);
  301. tout0 = data[0]^xor0;
  302. tout1 = data[1]^xor1;
  303. tout2 = data[2]^xor2;
  304. tout3 = data[3]^xor3;
  305. xor0 = tin0;
  306. xor1 = tin1;
  307. xor2 = tin2;
  308. xor3 = tin3;
  309. l2n(tout0, out_32);
  310. l2n(tout1, out_32);
  311. l2n(tout2, out_32);
  312. l2n(tout3, out_32);
  313. }
  314. l2n(xor0, iv);
  315. l2n(xor1, iv);
  316. l2n(xor2, iv);
  317. l2n(xor3, iv);
  318. }
  319. #endif
  320. /**
  321. * Encrypt a single block (16 bytes) of data
  322. */
  323. void AES_encrypt(const AES_CTX *ctx, uint32_t *data)
  324. {
  325. /* To make this code smaller, generate the sbox entries on the fly.
  326. * This will have a really heavy effect upon performance.
  327. */
  328. uint32_t tmp[4];
  329. uint32_t tmp1, old_a0, a0, a1, a2, a3, row;
  330. int curr_rnd;
  331. int rounds = ctx->rounds;
  332. const uint32_t *k = ctx->ks;
  333. /* Pre-round key addition */
  334. for (row = 0; row < 4; row++)
  335. {
  336. data[row] ^= *(k++);
  337. }
  338. /* Encrypt one block. */
  339. for (curr_rnd = 0; curr_rnd < rounds; curr_rnd++)
  340. {
  341. /* Perform ByteSub and ShiftRow operations together */
  342. for (row = 0; row < 4; row++)
  343. {
  344. a0 = (uint32_t)aes_sbox[(data[row%4]>>24)&0xFF];
  345. a1 = (uint32_t)aes_sbox[(data[(row+1)%4]>>16)&0xFF];
  346. a2 = (uint32_t)aes_sbox[(data[(row+2)%4]>>8)&0xFF];
  347. a3 = (uint32_t)aes_sbox[(data[(row+3)%4])&0xFF];
  348. /* Perform MixColumn iff not last round */
  349. if (curr_rnd < (rounds - 1))
  350. {
  351. tmp1 = a0 ^ a1 ^ a2 ^ a3;
  352. old_a0 = a0;
  353. a0 ^= tmp1 ^ AES_xtime(a0 ^ a1);
  354. a1 ^= tmp1 ^ AES_xtime(a1 ^ a2);
  355. a2 ^= tmp1 ^ AES_xtime(a2 ^ a3);
  356. a3 ^= tmp1 ^ AES_xtime(a3 ^ old_a0);
  357. }
  358. tmp[row] = ((a0 << 24) | (a1 << 16) | (a2 << 8) | a3);
  359. }
  360. /* KeyAddition - note that it is vital that this loop is separate from
  361. the MixColumn operation, which must be atomic...*/
  362. for (row = 0; row < 4; row++)
  363. {
  364. data[row] = tmp[row] ^ *(k++);
  365. }
  366. }
  367. }
  368. /**
  369. * Decrypt a single block (16 bytes) of data
  370. */
  371. void AES_decrypt(const AES_CTX *ctx, uint32_t *data)
  372. {
  373. uint32_t tmp[4];
  374. uint32_t xt0,xt1,xt2,xt3,xt4,xt5,xt6;
  375. uint32_t a0, a1, a2, a3, row;
  376. int curr_rnd;
  377. int rounds = ctx->rounds;
  378. uint32_t *k = (uint32_t*)ctx->ks + ((rounds+1)*4);
  379. /* pre-round key addition */
  380. for (row=4; row > 0;row--)
  381. {
  382. data[row-1] ^= *(--k);
  383. }
  384. /* Decrypt one block */
  385. for (curr_rnd=0; curr_rnd < rounds; curr_rnd++)
  386. {
  387. /* Perform ByteSub and ShiftRow operations together */
  388. for (row = 4; row > 0; row--)
  389. {
  390. a0 = aes_isbox[(data[(row+3)%4]>>24)&0xFF];
  391. a1 = aes_isbox[(data[(row+2)%4]>>16)&0xFF];
  392. a2 = aes_isbox[(data[(row+1)%4]>>8)&0xFF];
  393. a3 = aes_isbox[(data[row%4])&0xFF];
  394. /* Perform MixColumn iff not last round */
  395. if (curr_rnd<(rounds-1))
  396. {
  397. /* The MDS cofefficients (0x09, 0x0B, 0x0D, 0x0E)
  398. are quite large compared to encryption; this
  399. operation slows decryption down noticeably. */
  400. xt0 = AES_xtime(a0^a1);
  401. xt1 = AES_xtime(a1^a2);
  402. xt2 = AES_xtime(a2^a3);
  403. xt3 = AES_xtime(a3^a0);
  404. xt4 = AES_xtime(xt0^xt1);
  405. xt5 = AES_xtime(xt1^xt2);
  406. xt6 = AES_xtime(xt4^xt5);
  407. xt0 ^= a1^a2^a3^xt4^xt6;
  408. xt1 ^= a0^a2^a3^xt5^xt6;
  409. xt2 ^= a0^a1^a3^xt4^xt6;
  410. xt3 ^= a0^a1^a2^xt5^xt6;
  411. tmp[row-1] = ((xt0<<24)|(xt1<<16)|(xt2<<8)|xt3);
  412. }
  413. else
  414. tmp[row-1] = ((a0<<24)|(a1<<16)|(a2<<8)|a3);
  415. }
  416. for (row = 4; row > 0; row--)
  417. {
  418. data[row-1] = tmp[row-1] ^ *(--k);
  419. }
  420. }
  421. }
  422. #endif