#include "aes.h"extern OL_APITABLE_T *AP_interface;typedef struct{ uint32_t eK[44], dK[44]; // encKey, decKey int Nr; // 10 rounds}AesKey;#d_//设定常量 const uint8_t ">
devbox
代码优化者
这个屌丝很懒，什么也没留下！
关注作者
热门标签
热门文章
当前位置:   article > 正文

C语言 AES算法 加密解密_//设定常量 const uint8_t rcon[11]={0x01,0x02,0x04,0x08

作者：代码优化者 | 2024-01-31 19:44:29

赞

踩

//设定常量 const uint8_t rcon[11]={0x01,0x02,0x04,0x08,0x20,0x40,0x80,0x1b,0

C语言 实现 AES 128 位加密解密
1、调用函数

  1. #include "stdio.h"  
  2. #include "stdlib.h"
  3. #include <string.h>
  4.  
  5. #include "aes.h"
  6.  
  7. extern OL_APITABLE_T *AP_interface;
  8.  
  9. typedef struct{
  10.     uint32_t eK[44], dK[44];    // encKey, decKey
  11.     int Nr; // 10 rounds
  12. }AesKey;
  13.  
  14. #define BLOCKSIZE 16  //AES-128分组长度为16字节
  15.  
  16. // uint8_t y[4] -> uint32_t x
  17. #define LOAD32H(x, y) \
  18.   do { (x) = ((uint32_t)((y)[0] & 0xff)<<24) | ((uint32_t)((y)[1] & 0xff)<<16) | \
  19.              ((uint32_t)((y)[2] & 0xff)<<8)  | ((uint32_t)((y)[3] & 0xff));} while(0)
  20.  
  21. // uint32_t x -> uint8_t y[4]
  22. #define STORE32H(x, y) \
  23.   do { (y)[0] = (uint8_t)(((x)>>24) & 0xff); (y)[1] = (uint8_t)(((x)>>16) & 0xff);   \
  24.        (y)[2] = (uint8_t)(((x)>>8) & 0xff); (y)[3] = (uint8_t)((x) & 0xff); } while(0)
  25.  
  26. // 从uint32_t x中提取从低位开始的第n个字节
  27. #define BYTE(x, n) (((x) >> (8 * (n))) & 0xff)
  28.  
  29. /* used for keyExpansion */
  30. // 字节替换然后循环左移1位
  31. #define MIX(x) (((S[BYTE(x, 2)] << 24) & 0xff000000) ^ ((S[BYTE(x, 1)] << 16) & 0xff0000) ^ \
  32.                 ((S[BYTE(x, 0)] << 8) & 0xff00) ^ (S[BYTE(x, 3)] & 0xff))
  33.  
  34. // uint32_t x循环左移n位
  35. #define ROF32(x, n)  (((x) << (n)) | ((x) >> (32-(n))))
  36. // uint32_t x循环右移n位
  37. #define ROR32(x, n)  (((x) >> (n)) | ((x) << (32-(n))))
  38.  
  39. /* for 128-bit blocks, Rijndael never uses more than 10 rcon values */
  40. // AES-128轮常量
  41. static const uint32_t rcon[10] = {
  42.         0x01000000UL, 0x02000000UL, 0x04000000UL, 0x08000000UL, 0x10000000UL,
  43.         0x20000000UL, 0x40000000UL, 0x80000000UL, 0x1B000000UL, 0x36000000UL
  44. };
  45. // S盒
  46. unsigned char S[256] = {
  47.         0x63, 0x7C, 0x77, 0x7B, 0xF2, 0x6B, 0x6F, 0xC5, 0x30, 0x01, 0x67, 0x2B, 0xFE, 0xD7, 0xAB, 0x76,
  48.         0xCA, 0x82, 0xC9, 0x7D, 0xFA, 0x59, 0x47, 0xF0, 0xAD, 0xD4, 0xA2, 0xAF, 0x9C, 0xA4, 0x72, 0xC0,
  49.         0xB7, 0xFD, 0x93, 0x26, 0x36, 0x3F, 0xF7, 0xCC, 0x34, 0xA5, 0xE5, 0xF1, 0x71, 0xD8, 0x31, 0x15,
  50.         0x04, 0xC7, 0x23, 0xC3, 0x18, 0x96, 0x05, 0x9A, 0x07, 0x12, 0x80, 0xE2, 0xEB, 0x27, 0xB2, 0x75,
  51.         0x09, 0x83, 0x2C, 0x1A, 0x1B, 0x6E, 0x5A, 0xA0, 0x52, 0x3B, 0xD6, 0xB3, 0x29, 0xE3, 0x2F, 0x84,
  52.         0x53, 0xD1, 0x00, 0xED, 0x20, 0xFC, 0xB1, 0x5B, 0x6A, 0xCB, 0xBE, 0x39, 0x4A, 0x4C, 0x58, 0xCF,
  53.         0xD0, 0xEF, 0xAA, 0xFB, 0x43, 0x4D, 0x33, 0x85, 0x45, 0xF9, 0x02, 0x7F, 0x50, 0x3C, 0x9F, 0xA8,
  54.         0x51, 0xA3, 0x40, 0x8F, 0x92, 0x9D, 0x38, 0xF5, 0xBC, 0xB6, 0xDA, 0x21, 0x10, 0xFF, 0xF3, 0xD2,
  55.         0xCD, 0x0C, 0x13, 0xEC, 0x5F, 0x97, 0x44, 0x17, 0xC4, 0xA7, 0x7E, 0x3D, 0x64, 0x5D, 0x19, 0x73,
  56.         0x60, 0x81, 0x4F, 0xDC, 0x22, 0x2A, 0x90, 0x88, 0x46, 0xEE, 0xB8, 0x14, 0xDE, 0x5E, 0x0B, 0xDB,
  57.         0xE0, 0x32, 0x3A, 0x0A, 0x49, 0x06, 0x24, 0x5C, 0xC2, 0xD3, 0xAC, 0x62, 0x91, 0x95, 0xE4, 0x79,
  58.         0xE7, 0xC8, 0x37, 0x6D, 0x8D, 0xD5, 0x4E, 0xA9, 0x6C, 0x56, 0xF4, 0xEA, 0x65, 0x7A, 0xAE, 0x08,
  59.         0xBA, 0x78, 0x25, 0x2E, 0x1C, 0xA6, 0xB4, 0xC6, 0xE8, 0xDD, 0x74, 0x1F, 0x4B, 0xBD, 0x8B, 0x8A,
  60.         0x70, 0x3E, 0xB5, 0x66, 0x48, 0x03, 0xF6, 0x0E, 0x61, 0x35, 0x57, 0xB9, 0x86, 0xC1, 0x1D, 0x9E,
  61.         0xE1, 0xF8, 0x98, 0x11, 0x69, 0xD9, 0x8E, 0x94, 0x9B, 0x1E, 0x87, 0xE9, 0xCE, 0x55, 0x28, 0xDF,
  62.         0x8C, 0xA1, 0x89, 0x0D, 0xBF, 0xE6, 0x42, 0x68, 0x41, 0x99, 0x2D, 0x0F, 0xB0, 0x54, 0xBB, 0x16
  63. };
  64.  
  65. //逆S盒
  66. unsigned char inv_S[256] = {
  67.         0x52, 0x09, 0x6A, 0xD5, 0x30, 0x36, 0xA5, 0x38, 0xBF, 0x40, 0xA3, 0x9E, 0x81, 0xF3, 0xD7, 0xFB,
  68.         0x7C, 0xE3, 0x39, 0x82, 0x9B, 0x2F, 0xFF, 0x87, 0x34, 0x8E, 0x43, 0x44, 0xC4, 0xDE, 0xE9, 0xCB,
  69.         0x54, 0x7B, 0x94, 0x32, 0xA6, 0xC2, 0x23, 0x3D, 0xEE, 0x4C, 0x95, 0x0B, 0x42, 0xFA, 0xC3, 0x4E,
  70.         0x08, 0x2E, 0xA1, 0x66, 0x28, 0xD9, 0x24, 0xB2, 0x76, 0x5B, 0xA2, 0x49, 0x6D, 0x8B, 0xD1, 0x25,
  71.         0x72, 0xF8, 0xF6, 0x64, 0x86, 0x68, 0x98, 0x16, 0xD4, 0xA4, 0x5C, 0xCC, 0x5D, 0x65, 0xB6, 0x92,
  72.         0x6C, 0x70, 0x48, 0x50, 0xFD, 0xED, 0xB9, 0xDA, 0x5E, 0x15, 0x46, 0x57, 0xA7, 0x8D, 0x9D, 0x84,
  73.         0x90, 0xD8, 0xAB, 0x00, 0x8C, 0xBC, 0xD3, 0x0A, 0xF7, 0xE4, 0x58, 0x05, 0xB8, 0xB3, 0x45, 0x06,
  74.         0xD0, 0x2C, 0x1E, 0x8F, 0xCA, 0x3F, 0x0F, 0x02, 0xC1, 0xAF, 0xBD, 0x03, 0x01, 0x13, 0x8A, 0x6B,
  75.         0x3A, 0x91, 0x11, 0x41, 0x4F, 0x67, 0xDC, 0xEA, 0x97, 0xF2, 0xCF, 0xCE, 0xF0, 0xB4, 0xE6, 0x73,
  76.         0x96, 0xAC, 0x74, 0x22, 0xE7, 0xAD, 0x35, 0x85, 0xE2, 0xF9, 0x37, 0xE8, 0x1C, 0x75, 0xDF, 0x6E,
  77.         0x47, 0xF1, 0x1A, 0x71, 0x1D, 0x29, 0xC5, 0x89, 0x6F, 0xB7, 0x62, 0x0E, 0xAA, 0x18, 0xBE, 0x1B,
  78.         0xFC, 0x56, 0x3E, 0x4B, 0xC6, 0xD2, 0x79, 0x20, 0x9A, 0xDB, 0xC0, 0xFE, 0x78, 0xCD, 0x5A, 0xF4,
  79.         0x1F, 0xDD, 0xA8, 0x33, 0x88, 0x07, 0xC7, 0x31, 0xB1, 0x12, 0x10, 0x59, 0x27, 0x80, 0xEC, 0x5F,
  80.         0x60, 0x51, 0x7F, 0xA9, 0x19, 0xB5, 0x4A, 0x0D, 0x2D, 0xE5, 0x7A, 0x9F, 0x93, 0xC9, 0x9C, 0xEF,
  81.         0xA0, 0xE0, 0x3B, 0x4D, 0xAE, 0x2A, 0xF5, 0xB0, 0xC8, 0xEB, 0xBB, 0x3C, 0x83, 0x53, 0x99, 0x61,
  82.         0x17, 0x2B, 0x04, 0x7E, 0xBA, 0x77, 0xD6, 0x26, 0xE1, 0x69, 0x14, 0x63, 0x55, 0x21, 0x0C, 0x7D
  83. };
  84.  
  85. /* copy in[16] to state[4][4] */
  86. int loadStateArray(uint8_t (*state)[4], const uint8_t *in) {
  87. 	int i=0,j=0;
  88.  
  89.     for (i = 0; i < 4; ++i) {
  90.         for (j = 0; j < 4; ++j) {
  91.             state[j][i] = *in++;
  92.         }
  93.     }
  94.     return 0;
  95. }
  96.  
  97. /* copy state[4][4] to out[16] */
  98. int storeStateArray(uint8_t (*state)[4], uint8_t *out) {
  99. 	int i=0,j=0;
  100.  
  101.     for (i = 0; i < 4; ++i) {
  102.         for (j = 0; j < 4; ++j) {
  103.             *out++ = state[j][i];
  104.         }
  105.     }
  106.     return 0;
  107. }
  108. //秘钥扩展
  109. int keyExpansion(const uint8_t *key, uint32_t keyLen, AesKey *aesKey) {
  110.  
  111.     uint32_t *w = aesKey->eK;  //加密秘钥
  112.     uint32_t *v = aesKey->dK;  //解密秘钥
  113. 	int i=0,j=0;
  114.  
  115.     if (NULL == key || NULL == aesKey){
  116.         AP_interface->ol_print("keyExpansion param is NULL\n");
  117.         return -1;
  118.     }
  119.  
  120.     if (keyLen != 16){
  121.         AP_interface->ol_print("keyExpansion keyLen = %d, Not support.\n", keyLen);
  122.         return -1;
  123.     }
  124.  
  125.     /* keyLen is 16 Bytes, generate uint32_t W[44]. */
  126.  
  127.     /* W[0-3] */
  128.     for (i = 0; i < 4; ++i) {
  129.         LOAD32H(w[i], key + 4*i);
  130.     }
  131.  
  132.     /* W[4-43] */
  133.     for (i = 0; i < 10; ++i) {
  134.         w[4] = w[0] ^ MIX(w[3]) ^ rcon[i];
  135.         w[5] = w[1] ^ w[4];
  136.         w[6] = w[2] ^ w[5];
  137.         w[7] = w[3] ^ w[6];
  138.         w += 4;
  139.     }
  140.  
  141.     w = aesKey->eK+44 - 4;
  142.     //解密秘钥矩阵为加密秘钥矩阵的倒序，方便使用，把ek的11个矩阵倒序排列分配给dk作为解密秘钥
  143.     //即dk[0-3]=ek[41-44], dk[4-7]=ek[37-40]... dk[41-44]=ek[0-3]
  144.     for (j = 0; j < 11; ++j) {
  145.  
  146.         for (i = 0; i < 4; ++i) {
  147.             v[i] = w[i];
  148.         }
  149.         w -= 4;
  150.         v += 4;
  151.     }
  152.  
  153.     return 0;
  154. }
  155.  
  156. // 轮秘钥加
  157. int addRoundKey(uint8_t (*state)[4], const uint32_t *key) {
  158.     uint8_t k[4][4];
  159. 	int i=0,j=0;
  160.  
  161.     /* i: row, j: col */
  162.     for (i = 0; i < 4; ++i) {
  163.         for (j = 0; j < 4; ++j) {
  164.             k[i][j] = (uint8_t) BYTE(key[j], 3 - i);  /* 把 uint32 key[4] 先转换为矩阵 uint8 k[4][4] */
  165.             state[i][j] ^= k[i][j];
  166.         }
  167.     }
  168.  
  169.     return 0;
  170. }
  171.  
  172. //字节替换
  173. int subBytes(uint8_t (*state)[4]) {
  174.     /* i: row, j: col */
  175. 	int i=0,j=0;
  176.  
  177.     for (i = 0; i < 4; ++i) {
  178.         for (j = 0; j < 4; ++j) {
  179.             state[i][j] = S[state[i][j]]; //直接使用原始字节作为S盒数据下标
  180.         }
  181.     }
  182.  
  183.     return 0;
  184. }
  185.  
  186. //逆字节替换
  187. int invSubBytes(uint8_t (*state)[4]) {
  188.     /* i: row, j: col */
  189. 	int i=0,j=0;
  190.  
  191.     for (i = 0; i < 4; ++i) {
  192.         for (j = 0; j < 4; ++j) {
  193.             state[i][j] = inv_S[state[i][j]];
  194.         }
  195.     }
  196.     return 0;
  197. }
  198.  
  199. //行移位
  200. int shiftRows(uint8_t (*state)[4]) {
  201.     uint32_t block[4] = {0};
  202. 	int i=0,j=0;
  203.  
  204.     /* i: row */
  205.     for (i = 0; i < 4; ++i) {
  206.     //便于行循环移位，先把一行4字节拼成uint_32结构，移位后再转成独立的4个字节uint8_t
  207.         LOAD32H(block[i], state[i]);
  208.         block[i] = ROF32(block[i], 8*i);
  209.         STORE32H(block[i], state[i]);
  210.     }
  211.  
  212.     return 0;
  213. }
  214.  
  215. //逆行移位
  216. int invShiftRows(uint8_t (*state)[4]) {
  217.     uint32_t block[4] = {0};
  218. 	int i=0,j=0;
  219.  
  220.     /* i: row */
  221.     for (i = 0; i < 4; ++i) {
  222.         LOAD32H(block[i], state[i]);
  223.         block[i] = ROR32(block[i], 8*i);
  224.         STORE32H(block[i], state[i]);
  225.     }
  226.  
  227.     return 0;
  228. }
  229.  
  230. /* Galois Field (256) Multiplication of two Bytes */
  231. // 两字节的伽罗华域乘法运算
  232. uint8_t GMul(uint8_t u, uint8_t v) {
  233.     uint8_t p = 0;
  234. 	int i=0,j=0,flag = 0;
  235.  
  236.     for (i = 0; i < 8; ++i) {
  237.         if (u & 0x01) {    //
  238.             p ^= v;
  239.         }
  240.  
  241.         flag = (v & 0x80);
  242.         v <<= 1;
  243.         if (flag) {
  244.             v ^= 0x1B; /* x^8 + x^4 + x^3 + x + 1 */
  245.         }
  246.  
  247.         u >>= 1;
  248.     }
  249.  
  250.     return p;
  251. }
  252.  
  253. // 列混合
  254. int mixColumns(uint8_t (*state)[4]) {
  255.     uint8_t tmp[4][4];
  256.     uint8_t M[4][4] = {{0x02, 0x03, 0x01, 0x01},
  257.                        {0x01, 0x02, 0x03, 0x01},
  258.                        {0x01, 0x01, 0x02, 0x03},
  259.                        {0x03, 0x01, 0x01, 0x02}};
  260. 	int i=0,j=0;
  261.  
  262.     /* copy state[4][4] to tmp[4][4] */
  263.     for (i = 0; i < 4; ++i) {
  264.         for (j = 0; j < 4; ++j){
  265.             tmp[i][j] = state[i][j];
  266.         }
  267.     }
  268.  
  269.     for (i = 0; i < 4; ++i) {
  270.         for (j = 0; j < 4; ++j) {  //伽罗华域加法和乘法
  271.             state[i][j] = GMul(M[i][0], tmp[0][j]) ^ GMul(M[i][1], tmp[1][j])
  272.                         ^ GMul(M[i][2], tmp[2][j]) ^ GMul(M[i][3], tmp[3][j]);
  273.         }
  274.     }
  275.  
  276.     return 0;
  277. }
  278.  
  279. // 逆列混合
  280. int invMixColumns(uint8_t (*state)[4]) {
  281.     uint8_t tmp[4][4];
  282.     uint8_t M[4][4] = {{0x0E, 0x0B, 0x0D, 0x09},
  283.                        {0x09, 0x0E, 0x0B, 0x0D},
  284.                        {0x0D, 0x09, 0x0E, 0x0B},
  285.                        {0x0B, 0x0D, 0x09, 0x0E}};  //使用列混合矩阵的逆矩阵
  286. 	int i=0,j=0;
  287.  
  288.     /* copy state[4][4] to tmp[4][4] */
  289.     for (i = 0; i < 4; ++i) {
  290.         for (j = 0; j < 4; ++j){
  291.             tmp[i][j] = state[i][j];
  292.         }
  293.     }
  294.  
  295.     for (i = 0; i < 4; ++i) {
  296.         for (j = 0; j < 4; ++j) {
  297.             state[i][j] = GMul(M[i][0], tmp[0][j]) ^ GMul(M[i][1], tmp[1][j])
  298.                           ^ GMul(M[i][2], tmp[2][j]) ^ GMul(M[i][3], tmp[3][j]);
  299.         }
  300.     }
  301.  
  302.     return 0;
  303. }
  304.

2、加密方法

  1. // AES-128加密接口，输入key应为16字节长度，输入长度应该是16字节整倍数，
  2. // 这样输出长度与输入长度相同，函数调用外部为输出数据分配内存
  3. int aesEncrypt(const uint8_t *key, uint32_t keyLen, const uint8_t *pt, uint8_t *ct, uint32_t len) {
  4.  
  5.     AesKey aesKey;
  6.     uint8_t *pos = ct;
  7.     const uint32_t *rk = aesKey.eK;  //解密秘钥指针
  8.     uint8_t out[BLOCKSIZE] = {0};
  9.     uint8_t actualKey[16] = {0};
  10.     uint8_t state[4][4] = {0};
  11. 	int i=0,j=0;
  12.  
  13.     if (NULL == key || NULL == pt || NULL == ct){
  14.         AP_interface->ol_print("param err.\n");
  15.         return -1;
  16.     }
  17.  
  18.     if (keyLen > 16){
  19.         AP_interface->ol_print("keyLen must be 16.\n");
  20.         return -1;
  21.     }
  22.  
  23.     if (len % BLOCKSIZE){
  24.         AP_interface->ol_print("inLen is invalid.\n");
  25.         return -1;
  26.     }
  27.  
  28.     memcpy(actualKey, key, keyLen);
  29.     keyExpansion(actualKey, 16, &aesKey);  // 秘钥扩展
  30.  
  31. 	// 使用ECB模式循环加密多个分组长度的数据
  32.     for (i = 0; i < len; i += BLOCKSIZE) {
  33. 		// 把16字节的明文转换为4x4状态矩阵来进行处理
  34.         loadStateArray(state, pt);
  35.         // 轮秘钥加
  36.         addRoundKey(state, rk);
  37.  
  38.         for (j = 1; j < 10; ++j) {
  39.             rk += 4;
  40.             subBytes(state);   // 字节替换
  41.             shiftRows(state);  // 行移位
  42.             mixColumns(state); // 列混合
  43.             addRoundKey(state, rk); // 轮秘钥加
  44.         }
  45.  
  46.         subBytes(state);    // 字节替换
  47.         shiftRows(state);  // 行移位
  48.         // 此处不进行列混合
  49.         addRoundKey(state, rk+4); // 轮秘钥加
  50. 		
  51. 		// 把4x4状态矩阵转换为uint8_t一维数组输出保存
  52.         storeStateArray(state, pos);
  53.  
  54.         pos += BLOCKSIZE;  // 加密数据内存指针移动到下一个分组
  55.         pt += BLOCKSIZE;   // 明文数据指针移动到下一个分组
  56.         rk = aesKey.eK;    // 恢复rk指针到秘钥初始位置
  57.     }
  58.     return 0;
  59. }


3、解密方法

  1. // AES128解密， 参数要求同加密
  2. int aesDecrypt(const uint8_t *key, uint32_t keyLen, const uint8_t *ct, uint8_t *pt, uint32_t len) {
  3.     AesKey aesKey;
  4.     uint8_t *pos = pt;
  5.     const uint32_t *rk = aesKey.dK;  //解密秘钥指针
  6.     uint8_t out[BLOCKSIZE] = {0};
  7.     uint8_t actualKey[16] = {0};
  8.     uint8_t state[4][4] = {0};
  9. 	int i=0,j=0;
  10.  
  11.     if (NULL == key || NULL == ct || NULL == pt){
  12.         AP_interface->ol_print("param err.\n");
  13.         return -1;
  14.     }
  15.  
  16.     if (keyLen > 16){
  17.         AP_interface->ol_print("keyLen must be 16.\n");
  18.         return -1;
  19.     }
  20.  
  21.     if (len % BLOCKSIZE){
  22.         AP_interface->ol_print("inLen is invalid.\n");
  23.         return -1;
  24.     }
  25.  
  26.     memcpy(actualKey, key, keyLen);
  27.     keyExpansion(actualKey, 16, &aesKey);  //秘钥扩展，同加密
  28.  
  29.     for (i = 0; i < len; i += BLOCKSIZE) {
  30.         // 把16字节的密文转换为4x4状态矩阵来进行处理
  31.         loadStateArray(state, ct);
  32.         // 轮秘钥加，同加密
  33.         addRoundKey(state, rk);
  34.  
  35.         for (j = 1; j < 10; ++j) {
  36.             rk += 4;
  37.             invShiftRows(state);    // 逆行移位
  38.             invSubBytes(state);     // 逆字节替换，这两步顺序可以颠倒
  39.             addRoundKey(state, rk); // 轮秘钥加，同加密
  40.             invMixColumns(state);   // 逆列混合
  41.         }
  42.  
  43.         invSubBytes(state);   // 逆字节替换
  44.         invShiftRows(state);  // 逆行移位
  45.         // 此处没有逆列混合
  46.         addRoundKey(state, rk+4);  // 轮秘钥加，同加密
  47.  
  48.         storeStateArray(state, pos);  // 保存明文数据
  49.         pos += BLOCKSIZE;  // 输出数据内存指针移位分组长度
  50.         ct += BLOCKSIZE;   // 输入数据内存指针移位分组长度
  51.         rk = aesKey.dK;    // 恢复rk指针到秘钥初始位置
  52.     }
  53.     return 0;
  54. }

 

声明：本文内容由网友自发贡献，不代表【wpsshop博客】立场，版权归原作者所有，本站不承担相应法律责任。如您发现有侵权的内容，请联系我们。转载请注明出处：https://www.wpsshop.cn/article/detail/51807
推荐阅读
相关标签

Copyright © 2003-2013 www.wpsshop.cn 版权所有，并保留所有权利。

  

闽ICP备14008679号