AES128-CAMC算法

本文章已经生成可运行项目,

在线进行AES-CMAC的算法网站:

CryptoJS extension by artjomb

#include <stdio.h>
#include <string.h>

#define AES_BLOCK_SIZE 16
#define AES_ROUNDS 10

// S盒
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
};

// 轮常数
const unsigned char rcon[11] = {0x8d, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36};

// 字节替换
void sub_bytes(unsigned char *state) {
    for (int i = 0; i < AES_BLOCK_SIZE; i++) {
        state[i] = sbox[state[i]];
    }
}

// 行移位
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;
}

// 列混合中的乘法操作
unsigned char xtime(unsigned char x) {
    return (x & 0x80) ? ((x << 1) ^ 0x1b) : (x << 1);
}

// 列混合
void mix_columns(unsigned char *state) {
    unsigned char Tmp, Tm, t;
    for (int i = 0; i < 4; ++i) {
        t = state[i * 4];
        Tmp = state[i * 4] ^ state[i * 4 + 1] ^ state[i * 4 + 2] ^ state[i * 4 + 3];
        Tm = state[i * 4] ^ state[i * 4 + 1];
        Tm = xtime(Tm);
        state[i * 4] ^= Tm ^ Tmp;
        Tm = state[i * 4 + 1] ^ state[i * 4 + 2];
        Tm = xtime(Tm);
        state[i * 4 + 1] ^= Tm ^ Tmp;
        Tm = state[i * 4 + 2] ^ state[i * 4 + 3];
        Tm = xtime(Tm);
        state[i * 4 + 2] ^= Tm ^ Tmp;
        Tm = state[i * 4 + 3] ^ t;
        Tm = xtime(Tm);
        state[i * 4 + 3] ^= Tm ^ Tmp;
    }
}

// 轮密钥加
void add_round_key(unsigned char *state, unsigned char *round_key) {
    for (int i = 0; i < AES_BLOCK_SIZE; i++) {
        state[i] ^= round_key[i];
    }
}

// 密钥扩展中的字循环
void rot_word(unsigned char *word) {
    unsigned char temp = word[0];
    for (int i = 0; i < 3; i++) {
        word[i] = word[i + 1];
    }
    word[3] = temp;
}

// 密钥扩展中的字节替换
void sub_word(unsigned char *word) {
    for (int i = 0; i < 4; i++) {
        word[i] = sbox[word[i]];
    }
}

// 密钥扩展
void key_expansion(unsigned char *key, unsigned char *round_keys) {
    for (int i = 0; i < AES_BLOCK_SIZE; i++) {
        round_keys[i] = key[i];
    }
    for (int i = 4; i < (AES_ROUNDS + 1) * 4; i++) {
        unsigned char temp[4];
        for (int j = 0; j < 4; j++) {
            temp[j] = round_keys[(i - 1) * 4 + j];
        }
        if (i % 4 == 0) {
            rot_word(temp);
            sub_word(temp);
            temp[0] ^= rcon[i / 4];
        }
        for (int j = 0; j < 4; j++) {
            round_keys[i * 4 + j] = round_keys[(i - 4) * 4 + j] ^ temp[j];
        }
    }
}

// AES加密
void aes_encrypt(unsigned char *plaintext, unsigned char *key, unsigned char *ciphertext) {
    unsigned char state[AES_BLOCK_SIZE];
    unsigned char round_keys[(AES_ROUNDS + 1) * AES_BLOCK_SIZE];
    memcpy(state, plaintext, AES_BLOCK_SIZE);
    key_expansion(key, round_keys);
    add_round_key(state, round_keys);
    for (int round = 1; round < AES_ROUNDS; round++) {
        sub_bytes(state);
        shift_rows(state);
        mix_columns(state);
        add_round_key(state, round_keys + round * AES_BLOCK_SIZE);
    }
    sub_bytes(state);
    shift_rows(state);
    add_round_key(state, round_keys + AES_ROUNDS * AES_BLOCK_SIZE);
    memcpy(ciphertext, state, AES_BLOCK_SIZE);
}

// 生成子密钥
void generate_subkeys(unsigned char *key, unsigned char *K1, unsigned char *K2) {
    unsigned char zero_block[AES_BLOCK_SIZE] = {0};
    unsigned char L[AES_BLOCK_SIZE];
    aes_encrypt(zero_block, key, L);
    int msb = L[0] & 0x80;
    for (int i = 0; i < AES_BLOCK_SIZE - 1; i++) {
        K1[i] = (L[i] << 1) | ((L[i + 1] >> 7) & 0x01);
    }
    K1[AES_BLOCK_SIZE - 1] = L[AES_BLOCK_SIZE - 1] << 1;
    if (msb) {
        K1[AES_BLOCK_SIZE - 1] ^= 0x87;
    }
    msb = K1[0] & 0x80;
    for (int i = 0; i < AES_BLOCK_SIZE - 1; i++) {
        K2[i] = (K1[i] << 1) | ((K1[i + 1] >> 7) & 0x01);
    }
    K2[AES_BLOCK_SIZE - 1] = K1[AES_BLOCK_SIZE - 1] << 1;
    if (msb) {
        K2[AES_BLOCK_SIZE - 1] ^= 0x87;
    }
}

// AES128 - CMAC
void aes128_cmac(unsigned char *key, unsigned char *message, size_t message_len, unsigned char *cmac) {
    unsigned char K1[AES_BLOCK_SIZE], K2[AES_BLOCK_SIZE];
    unsigned char state[AES_BLOCK_SIZE] = {0};
    size_t num_blocks = message_len / AES_BLOCK_SIZE;
    size_t remaining = message_len % AES_BLOCK_SIZE;
    generate_subkeys(key, K1, K2);
    for (size_t i = 0; i < num_blocks; i++) {
        for (int j = 0; j < AES_BLOCK_SIZE; j++) {
            state[j] ^= message[i * AES_BLOCK_SIZE + j];
        }
        aes_encrypt(state, key, state);
    }
    if (remaining == 0) {
        for (int j = 0; j < AES_BLOCK_SIZE; j++) {
            state[j] ^= K1[j];
        }
    } else {
        unsigned char last_block[AES_BLOCK_SIZE] = {0};
        memcpy(last_block, message + num_blocks * AES_BLOCK_SIZE, remaining);
        last_block[remaining] = 0x80;
        for (int j = 0; j < AES_BLOCK_SIZE; j++) {
            state[j] ^= last_block[j] ^ K2[j];
        }
    }
    aes_encrypt(state, key, cmac);
}

// 示例使用
int main() {
    unsigned char key[AES_BLOCK_SIZE] = {0x2b, 0x7e, 0x15, 0x16, 0x28, 0xae, 0xd2, 0xa6, 0xab, 0xf7, 0x15, 0x88, 0x09, 0xcf, 0x4f, 0x3c};
    unsigned char message[] = "Hello, World!";
    unsigned char cmac[AES_BLOCK_SIZE];
    aes128_cmac(key, message, sizeof(message) - 1, cmac);
    printf("CMAC: ");
    for (int i = 0; i < AES_BLOCK_SIZE; i++) {
        printf("%02x", cmac[i]);
    }
    printf("\n");
    return 0;
}
实现逻辑解释
1. AES基础操作
S盒(sbox):是一个固定的256字节的查找表,用于字节替换操作。
轮常数(rcon):在密钥扩展过程中使用。
字节替换(sub_bytes):通过S盒将状态中的每个字节替换为另一个字节。
行移位(shift_rows):对状态的每一行进行循环移位。
列混合(mix_columns):对状态的每一列进行线性变换,使用xtime函数进行乘法操作。
轮密钥加(add_round_key):将状态与当前轮的轮密钥进行异或操作。
2. 密钥扩展(key_expansion)
首先将原始的128位密钥复制到轮密钥数组的前16个字节。
然后根据轮常数和S盒对后续的轮密钥进行扩展,每4个字节为一组,进行字循环、字节替换和异或操作。
3. AES加密(aes_encrypt)
初始化状态为明文。
进行密钥扩展。
执行初始的轮密钥加操作。
进行9轮的字节替换、行移位、列混合和轮密钥加操作。
最后一轮不进行列混合操作。
将最终的状态复制到密文数组。
4. 子密钥生成(generate_subkeys)
对全零块进行AES加密,得到中间结果L。
根据L的最高位生成子密钥K1,如果最高位为1,则对K1的最后一个字节进行异或操作。
根据K1的最高位生成子密钥K2,同样如果最高位为1,则对K2的最后一个字节进行异或操作。
5. AES128 - CMAC(aes128_cmac)
生成子密钥K1和K2。
将消息按16字节分块处理,对每个块与当前状态进行异或操作,然后进行AES加密。
如果消息长度是16的整数倍,则使用子密钥K1与最后一个块进行异或操作;否则,对最后一个不完整的块进行填充(填充一个0x80和若干个0x00),然后使用子密钥K2进行异或操作。
对最终的状态进行AES加密,得到CMAC值。
6. 示例使用(main)
定义一个128位的密钥和一个消息。
调用aes128_cmac函数计算CMAC值。
打印CMAC值。
通过以上步骤,我们实现了AES128 - CMAC算法,用于生成消息的认证码。

本文已生成可运行项目
详细介绍了AES-CMAC算法的原理与实现,附有C语言写的样例程序。 以下是原文的introduction: The National Institute of Standards and Technology (NIST) has recently specified the Cipher-based Message Authentication Code(CMAC). CMAC [NIST-CMAC] is a keyed hash function that is based on a symmetric key block cipher, such as the Advanced Encryption Standard [NIST-AES]. CMAC is equivalent to the One-Key CBC MAC1 (OMAC1) submitted by Iwata and Kurosawa [OMAC1a, OMAC1b]. OMAC1 is an improvement of the eXtended Cipher Block Chaining mode (XCBC) submitted by Black and Rogaway [XCBCa, XCBCb], which itself is an improvement of the basic Cipher Block Chaining-Message Authentication Code (CBC-MAC). XCBC efficiently addresses the security deficiencies of CBC-MAC, and OMAC1 efficiently reduces the key size of XCBC. AES-CMAC provides stronger assurance of data integrity than a checksum or an error-detecting code. The verification of a checksum or an error-detecting code detects only accidental modifications of the data, while CMAC is designed to detect intentional, unauthorized modifications of the data, as well as accidental modifications. AES-CMAC achieves a security goal similar to that of HMAC [RFC-HMAC]. Since AES-CMAC is based on a symmetric key block cipher, AES, and HMAC is based on a hash function, such as SHA-1, AES-CMAC is appropriate for information systems in which AES is more readily available than a hash function. This memo specifies the authentication algorithm based on CMAC with AES-128. This new authentication algorithm is named AES-CMAC.
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值