找回密码
 立即注册
查看: 95|回复: 1

AES-128-CMAC加密算法

[复制链接]
  • 打卡等级:初来乍到
  • 打卡总天数:8
  • 最近打卡:2026-07-04 16:05:42
已绑定手机

1

主题

3

回帖

63

积分

注册会员

积分
63
发表于 2026-6-5 10:41:38 | 显示全部楼层 |阅读模式
用stc8h8k+网络芯片,用于网络数据合法验证,处理速度:24Mzh主频下,大约十几ms。
使用:
void main(void){

   unsigned char key[16] = {0x2b,0x7e,0x15,0x16,0x28,0xae,0xd2,0xa6,0xab,0xf7,0x15,0x88,0x09,0xcf,0x4f,0x3c};

    unsigned char msg[] = "Hello STC8H";
    unsigned char mac[16];
    aes_cmac(key, msg, sizeof(msg)-1, mac);
}

直接上源码:
cmac_aes.h内容


#ifndef _CMAC_AES_H_
#define _CMAC_AES_H_

void aes_cmac(unsigned char *key, unsigned char *msg, unsigned int msg_len, unsigned char *mac);

#endif


cmac_aes.c内容


#include "cmac_aes.h"
#include <string.h>

// ---------- AES-128 加密核心----------
static const unsigned char 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
};

static const unsigned char inv_sbox[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
};

static void add_round_key(unsigned char *state, unsigned char *key) {
    unsigned char i;
    for (i = 0; i < 16; i++) state[i] ^= key[i];
}

static void sub_bytes(unsigned char *state) {
    unsigned char i;
    for (i = 0; i < 16; i++) state[i] = sbox[state[i]];
}

static void inv_sub_bytes(unsigned char *state) {
    unsigned char i;
    for (i = 0; i < 16; i++) state[i] = inv_sbox[state[i]];
}

static void shift_rows(unsigned char *state) {
    unsigned char temp;
    temp = state[1]; state[1] = state[5]; state[5] = state[9]; state[9] = state[13]; state[13] = temp;
    temp = state[2]; state[2] = state[10]; state[10] = temp;
    temp = state[6]; state[6] = state[14]; state[14] = temp;
    temp = state[3]; state[3] = state[15]; state[15] = state[11]; state[11] = state[7]; state[7] = temp;
}

static void inv_shift_rows(unsigned char *state) {
    unsigned char temp;
    temp = state[13]; state[13] = state[9]; state[9] = state[5]; state[5] = state[1]; state[1] = temp;
    temp = state[10]; state[10] = state[2]; state[2] = temp;
    temp = state[14]; state[14] = state[6]; state[6] = temp;
    temp = state[7]; state[7] = state[11]; state[11] = state[15]; state[15] = state[3]; state[3] = temp;
}

static unsigned char xtime(unsigned char x) {
    return ((x << 1) ^ ((x & 0x80) ? 0x1b : 0));
}

static void mix_columns(unsigned char *state) {
    unsigned char a[4], b[4];
    unsigned char i, j;
    for (i = 0; i < 4; i++) {
        for (j = 0; j < 4; j++) {
            a[j] = state[i*4 + j];
            b[j] = xtime(a[j]);
        }
        state[i*4] = b[0] ^ a[1] ^ b[1] ^ a[2] ^ a[3];
        state[i*4+1] = a[0] ^ b[1] ^ a[2] ^ b[2] ^ a[3];
        state[i*4+2] = a[0] ^ a[1] ^ b[2] ^ a[3] ^ b[3];
        state[i*4+3] = a[0] ^ b[0] ^ a[1] ^ a[2] ^ b[3];
    }
}

static void inv_mix_columns(unsigned char *state) {
    unsigned char a[4];
    unsigned char i, j;
    for (i = 0; i < 4; i++) {
        for (j = 0; j < 4; j++) a[j] = state[i*4 + j];
        state[i*4] = xtime(xtime(a[0] ^ a[2])) ^ xtime(a[1] ^ a[3]) ^ a[0] ^ a[1] ^ a[2] ^ a[3];
        state[i*4+1] = xtime(xtime(a[1] ^ a[3])) ^ xtime(a[2] ^ a[0]) ^ a[1] ^ a[2] ^ a[3] ^ a[0];
        state[i*4+2] = xtime(xtime(a[2] ^ a[0])) ^ xtime(a[3] ^ a[1]) ^ a[2] ^ a[3] ^ a[0] ^ a[1];
        state[i*4+3] = xtime(xtime(a[3] ^ a[1])) ^ xtime(a[0] ^ a[2]) ^ a[3] ^ a[0] ^ a[1] ^ a[2];
    }
}

static void key_expansion(unsigned char *key, unsigned char *round_keys) {
    unsigned char i, j, t;
    unsigned char rc[10] = {0x01,0x02,0x04,0x08,0x10,0x20,0x40,0x80,0x1b,0x36};
    unsigned char key_exp_temp[4];

    for (i = 0; i < 16; i++) round_keys[i] = key[i];
    for (i = 1; i <= 10; i++) {
        for (j = 0; j < 4; j++) key_exp_temp[j] = round_keys[(i-1)*16 + 12 + j];
        t = key_exp_temp[0];
        for (j = 0; j < 3; j++) key_exp_temp[j] = key_exp_temp[j+1];
        key_exp_temp[3] = t;
        for (j = 0; j < 4; j++) key_exp_temp[j] = sbox[key_exp_temp[j]];
        key_exp_temp[0] ^= rc[i-1];
        for (j = 0; j < 4; j++) round_keys[i*16 + j] = round_keys[(i-1)*16 + j] ^ key_exp_temp[j];
        for (j = 4; j < 16; j++) round_keys[i*16 + j] = round_keys[(i-1)*16 + j] ^ round_keys[i*16 + j-4];
    }
}

static void aes_encrypt(unsigned char *key, unsigned char *in, unsigned char *out) {
    unsigned char i;
    unsigned char state[16];
    unsigned char round_keys[176];

    key_expansion(key, round_keys);
    for (i = 0; i < 16; i++) state[i] = in[i];
    add_round_key(state, round_keys);
    for (i = 1; i <= 9; i++) {
        sub_bytes(state);
        shift_rows(state);
        mix_columns(state);
        add_round_key(state, round_keys + i*16);
    }
    sub_bytes(state);
    shift_rows(state);
    add_round_key(state, round_keys + 10*16);
    for (i = 0; i < 16; i++) out[i] = state[i];
}

// ---------- CMAC 辅助函数:大端左移一位 ----------
static void left_shift_one(unsigned char *in, unsigned char *out) {
    unsigned char carry = 0;
    unsigned char i;
    for (i = 15; i != 255; i--) {
        unsigned char next_carry = (in[i] & 0x80) ? 1 : 0;
        out[i] = (in[i] << 1) | carry;
        carry = next_carry;
    }
    // 如果最高位(in[0]的最高位)为1,则结果异或0x87到最低字节(out[15])
    if (carry) out[15] ^= 0x87;
}

// ---------- CMAC 主函数 ----------
void aes_cmac(unsigned char *key, unsigned char *msg, unsigned int msg_len, unsigned char *mac) {
    unsigned char L[16];
    unsigned char K1[16];
    unsigned char K2[16];
    unsigned char temp[16];
    unsigned char last_block[16];
    unsigned char zero[16] = {0};
    unsigned int i;
    unsigned char j;
    unsigned int n = msg_len / 16;
    unsigned int r = msg_len % 16;

    // 1. 计算 L = AES_K(0)
    aes_encrypt(key, zero, L);

    // 2. 生成 K1 = (L << 1)
    left_shift_one(L, K1);
    // 3. 生成 K2 = (K1 << 1)
    left_shift_one(K1, K2);

    // 4. 初始化 temp = 0
    for (j = 0; j < 16; j++) temp[j] = 0;

    if (n == 0) {
        // 消息长度 < 16
        for (j = 0; j < r; j++) last_block[j] = msg[j];
        last_block[r] = 0x80;
        for (j = r + 1; j < 16; j++) last_block[j] = 0x00;
        for (j = 0; j < 16; j++) last_block[j] ^= K2[j];
        for (j = 0; j < 16; j++) temp[j] ^= last_block[j];
        aes_encrypt(key, temp, mac);
    } else {
        // 处理前 n-1 个完整块
        for (i = 0; i < n - 1; i++) {
            for (j = 0; j < 16; j++) temp[j] ^= msg[i * 16 + j];
            aes_encrypt(key, temp, temp);
        }
        // 处理最后一个块
        if (r == 0) {
            for (j = 0; j < 16; j++)
                last_block[j] = msg[(n - 1) * 16 + j] ^ K1[j];
        } else {
            for (j = 0; j < r; j++) last_block[j] = msg[n * 16 + j];
            last_block[r] = 0x80;
            for (j = r + 1; j < 16; j++) last_block[j] = 0x00;
            for (j = 0; j < 16; j++) last_block[j] ^= K2[j];
        }
        for (j = 0; j < 16; j++) temp[j] ^= last_block[j];
        aes_encrypt(key, temp, mac);
    }
}


回复

使用道具 举报 送花

  • 打卡等级:以坛为家I
  • 打卡总天数:299
  • 最近打卡:2026-07-04 00:01:55
已绑定手机

66

主题

808

回帖

3037

积分

论坛元老

DIY玩家

积分
3037
发表于 2026-6-5 10:58:47 | 显示全部楼层
了解过mqtts
订阅轻量级带加密
永怀这学徒心
回复

使用道具 举报 送花

您需要登录后才可以回帖 登录 | 立即注册

本版积分规则

QQ|手机版|深圳国芯人工智能有限公司 ( 粤ICP备2022108929号-2 )

GMT+8, 2026-7-5 14:04 , Processed in 0.066899 second(s), 48 queries .

Powered by Discuz! X3.5

© 2001-2026 Discuz! Team.

快速回复 返回顶部 返回列表