sm3算法的c实现(代码)
时间: 2024-05-12 16:15:48 浏览: 16
下面是一个简单的 SM3 算法的 C 语言实现代码:
```c
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdint.h>
#define ROTL(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
const uint32_t IV[8] = {
0x7380166F, 0x4914B2B9, 0x172442D7, 0xDA8A0600,
0xA96F30BC, 0x163138AA, 0xE38DEE4D, 0xB0FB0E4E
};
const uint32_t T[64] = {
0x79CC4519, 0xF3988A32, 0xE7311465, 0xCE622A8B,
0x9CC45197, 0x3988A32F, 0x7311465E, 0xE622A8BC,
0xCC451979, 0x988A32F3, 0x311465E7, 0x622A8BCE,
0xC451979C, 0x88A32F39, 0x11465E73, 0x22A8BCE6,
0x9D8A7A87, 0x3B14F50E, 0x7629EA1D, 0xEC53D43A,
0xD8A7A879, 0xB14F50E3, 0x629EA1D7, 0xC53D43AE,
0x8A7A879D, 0x14F50E3B, 0x29EA1D76, 0x53D43AEC,
0xA7A879D8, 0x4F50E3B1, 0x9EA1D762, 0x3D43AEC5,
0x7A879D8A, 0xF50E3B14, 0xEA1D7629, 0xD43AEC53,
0xA879D8A7, 0x50E3B14F, 0xA1D7629E, 0x43AEC53D,
0x879D8A7A, 0x0E3B14F5, 0x1D7629EA, 0x3AEC53D4,
0x79D8A7A8, 0xF0E3B14F, 0xE1D7629E, 0xC3AEC53D,
0x9D8A7A87, 0xB0E3B14F, 0x61D7629E, 0xC3AEC53C,
0x38A7A879, 0x70E3B14F, 0xE1D7629E, 0xC3AEC53D,
0x1D8A7A87, 0x3B0E3B14, 0x762D7629, 0xEC5AEC53,
0x3B14F50E, 0x7629EA1D, 0xEC53D43A, 0xD43AEC53
};
void sm3_compress(uint32_t *state, const unsigned char *block) {
uint32_t A, B, C, D, E, F, G, H;
uint32_t W[68], SS1, SS2, TT1, TT2;
for (int i = 0; i < 16; ++i) {
W[i] = ((uint32_t) block[4 * i + 0] << 24) |
((uint32_t) block[4 * i + 1] << 16) |
((uint32_t) block[4 * i + 2] << 8) |
((uint32_t) block[4 * i + 3] << 0);
}
for (int i = 16; i < 68; ++i) {
W[i] = ROTL(W[i - 16] ^ W[i - 9] ^ ROTL(W[i - 3], 15), 1);
}
for (int i = 0; i < 64; ++i) {
SS1 = ROTL(ROTL(A, 12) + E + ROTL(T[i], i % 32), 7);
SS2 = SS1 ^ ROTL(A, 12);
TT1 = FF0(A, B, C) + D + SS2 + W[i];
TT2 = GG0(E, F, G) + H + SS1 + W[i];
D = C;
C = ROTL(B, 9);
B = A;
A = TT1;
H = G;
G = ROTL(F, 19);
F = E;
E = P0(TT2);
}
for (int i = 0; i < 8; ++i) {
state[i] ^= A;
A = B;
B = C;
C = D;
D = E;
E = F;
F = G;
G = H;
H = state[i];
}
}
void sm3_hash(const unsigned char *data, size_t len, unsigned char *hash) {
uint32_t state[8];
uint64_t n = len * 8;
uint32_t K[4];
unsigned char buffer[64];
int i, off;
state[0] = IV[0];
state[1] = IV[1];
state[2] = IV[2];
state[3] = IV[3];
state[4] = IV[4];
state[5] = IV[5];
state[6] = IV[6];
state[7] = IV[7];
while (len >= 64) {
sm3_compress(state, data);
data += 64;
len -= 64;
}
off = 0;
for (i = 0; i < len; ++i) {
buffer[i] = data[i];
}
buffer[i++] = 0x80;
if (i > 56) {
for (int j = i; j < 64; ++j) {
buffer[j] = 0x00;
}
sm3_compress(state, buffer);
i = 0;
}
for (int j = i; j < 56; ++j) {
buffer[j] = 0x00;
}
K[0] = (uint32_t) ((n >> 32) & 0xFFFFFFFF);
K[1] = (uint32_t) ((n >> 0) & 0xFFFFFFFF);
K[2] = (uint32_t) ((n >> 32) & 0xFFFFFFFF);
K[3] = (uint32_t) ((n >> 0) & 0xFFFFFFFF);
memcpy(buffer + 56, K, 16);
sm3_compress(state, buffer);
for (int i = 0; i < 8; ++i) {
hash[4 * i + 0] = (unsigned char) (state[i] >> 24);
hash[4 * i + 1] = (unsigned char) (state[i] >> 16);
hash[4 * i + 2] = (unsigned char) (state[i] >> 8);
hash[4 * i + 3] = (unsigned char) (state[i] >> 0);
}
}
uint32_t FF0(uint32_t X, uint32_t Y, uint32_t Z) {
return X ^ Y ^ Z;
}
uint32_t FF1(uint32_t X, uint32_t Y, uint32_t Z) {
return (X & Y) | (X & Z) | (Y & Z);
}
uint32_t GG0(uint32_t X, uint32_t Y, uint32_t Z) {
return X ^ Y ^ Z;
}
uint32_t GG1(uint32_t X, uint32_t Y, uint32_t Z) {
return (X & Y) | (~X & Z);
}
uint32_t P0(uint32_t X) {
return X ^ ROTL(X, 9) ^ ROTL(X, 17);
}
uint32_t P1(uint32_t X) {
return X ^ ROTL(X, 15) ^ ROTL(X, 23);
}
```
注意:这只是一个简单的实现,实际应用中需要考虑更多的细节,比如输入数据的字节序、数据长度的处理等。
相关推荐
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)