sha256

SHA有如下特性：不可以从消息摘要中复原信息；两个不同的消息不会产生同样的消息摘要。

对于长度小于2^64位的消息，SHA256会产生一个256位（32byte）的消息摘要。

#include <stdio.h>

#include <string.h>
#include <stdlib.h>

#define maxlen 1000000


typedef unsigned int uint;
typedef unsigned char ubyte;
typedef unsigned long long ull;


char instr[maxlen];


const uint k[] = {
0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
};


void declare(){
     printf("--------------------------------------------\n");
     printf("SHA-256 ( Secure Hash Algorithm)\n");
     printf("--------------------------------------------\n");
}


inline uint rrot(uint val, int pos) {
pos %= 32;
return ( val >> pos ) | ( val << (32 - pos) );
}


void get_input_str() {
scanf("%s", instr);
}


void sha_256(char *digest, char *str) {
// 提取字符跟预处理
uint orilen = strlen(str); // 以byte计算长度
uint chunks_count = (orilen+9)/64; // 块数
if( (orilen+9)%64!=0 ) ++chunks_count; // 块数
ull total_count = orilen * 8; // 总字节数
uint *filldata = new uint[ chunks_count*16 ];
memset(filldata, 0, sizeof(uint)*chunks_count*16); // 初始化


ubyte *pdata = (ubyte *)filldata;
uint idx;
for (idx = 0; idx < orilen; ++idx) {
pdata[idx+3-idx%4-idx%4] = str[idx]; // idx:[0..11] --> idx+3-idx%4-idx%4: [3,2,1,0, 7,6,5,4, 11,10,9,8]
}
pdata[idx+3-idx%4-idx%4] = 0x80; // 追加1跟7个0
++idx;
// 追加流的长度
ubyte *pbyte = (ubyte *)&total_count;
for (uint i = 0, j = 64*chunks_count - 4; i < 8; ++i) {
if (i==4) j -= 8;
pdata[j + i] = pbyte[i];
}
// 对每块进行轮换迭代
uint H[8],a,b,c,d,e,f,g,h, w[80], s[2];
H[0] = 0x6a09e667;
H[1] = 0xbb67ae85;
H[2] = 0x3c6ef372;
H[3] = 0xa54ff53a;
H[4] = 0x510e527f;
H[5] = 0x9b05688c;
H[6] = 0x1f83d9ab;
H[7] = 0x5be0cd19;




for (uint i = 0; i < chunks_count*16; i += 16) {
uint *puint = &filldata[i];
printf("chunk: %d\n", i/16);
for (uint j = 0; j < 16; ++j) {
w[j] = puint[j];
printf("%08X ", w[j]);
if ( (j+1)%4==0 ) printf("\n");
}
for (uint j = 16; j < 64; ++j) {
s[0] = ( rrot(w[j - 15], 7) ) ^ ( rrot(w[j - 15], 18) ) ^ ( w[j - 15]>>3 );
s[1] = ( rrot(w[j - 2], 17) ) ^ ( rrot(w[j - 2], 19) ) ^ ( w[j - 2]>>10 );
w[j] = w[j - 16] + s[0] + w[j - 7] + s[1];
}
a = H[0], b = H[1], c = H[2], d = H[3], e = H[4], f = H[5], g = H[6], h = H[7];


for (uint j = 0; j < 64; ++j) {
uint maj, t[3], ch;
s[0] = ( rrot(a,2) ) ^ (rrot(a,13)) ^ (rrot(a,22));
maj = (a & b) ^ (a & c) ^ (b & c);
t[2] = s[0] + maj;
s[1] = rrot(e, 6) ^ rrot(e, 11) ^ rrot(e, 25);
ch = (e & f) ^ ((~e) & g);
t[1] = h + s[1] + ch + k[j] + w[j];


h = g, g = f, f = e, e = d + t[1], d = c, c = b, b = a, a = t[1] + t[2];
printf("%2d: a=%08x b=%08x c=%08x d=%08x\n    e=%08x f=%08x g=%08x h=%08x\n", j, a, b, c, d, e, f, g, h);
}
H[0] += a, H[1] += b, H[2] += c, H[3] += d, H[4] += e, H[5] += f, H[6] += g, H[7] += h;
}
for (int i = 0; i < 8; ++i) {
sprintf(digest+i*8, "%08x", H[i]);
}
delete[] filldata;
}


int main () {
    declare();
while (1){
puts("请输入消息:");
char digest[65];
get_input_str(); 
sha_256(digest, instr);
printf("最终摘要：\n");
puts(digest);
printf("________________________________________________________________________________\n");
}
return 0;
}