消息摘要算法:SHA-1

填充消息，补长度，分组，计算消息摘要

 

#include<iostream>
#include<vector>
#include<string>
using namespace std;

void sha1(string text);

int main()
{
    string text;
    cout << "please input message: ";
    getline(cin, text);
    cout << "The hash of message is :";
    sha1(text);
    return 0;
}

void sha1(string text)
{
    vector<int> X;//8*64=512，每个下标存放8位
    vector<int> W(80);//80个32位字
    int Turn;//加密分组数量

    //初值变量
    int H0 = 0x67452301;
    int H1 = 0xefcdab89;
    int H2 = 0x98badcfe;
    int H3 = 0x10325476;
    int H4 = 0xc3d2e1f0;

    //缓冲区寄存器,产生最后结果
    int A = H0;
    int B = H1;
    int C = H2;
    int D = H3;
    int E = H4;

    //循环左移
    auto ROTL = [](unsigned int x, int n)->int
    {
        return x >> (32 - n) | (x << n);
    };
    //消息填充
    auto append = [&](string m)->void
    {
        Turn = (m.size() + 8) / 64 + 1;   // 相当于  （m.size()*8 + 64)/512 +1;
        X.resize(Turn * 64);
        int i = 0;
        for (; i < m.size(); i++) {
            X[i] = m[i];
        }
        X[i++] = 0x80;     //相当于 X[m.size()] = 0x80; ++i;  0x80 = 10000000
        while (i < X.size() - 8) {   //相当于  X.size()*8 -64 bit
            X[i] = 0;                //一个零 8 bit;
            i++;
        }
        long long int a = m.size() * 8;
        for (i = X.size() - 1; i >= X.size() - 8; i--) {      //倒着补长度
            X[i] = a % 256;        // 256 = pow(2,8);
            a /= 256;
        }
    };

    //W数组的生成
    auto setW = [&](vector<int> m, int n)->void
    {
        n *= 64;
        for (int i = 0; i < 16; i++)
        {
            W[i] = (m[n + 4 * i] << 24) + (m[n + 4 * i + 1] << 16)
                + (m[n + 4 * i + 2] << 8) + m[n + 4 * i + 3];
        }
        for (int i = 16; i < 80; i++) {
            W[i] = ROTL(W[i - 16] ^ W[i - 14] ^ W[i - 8] ^ W[i - 3], 1);
        }
    };

    //常量K
    auto Kt = [](int t)->int
    {
        if (t < 20)
            return 0x5a827999;
        else if (t < 40)
            return 0x6ed9eba1;
        else if (t < 60)
            return 0x8f1bbcdc;
        else
            return 0xca62c1d6;
    };

    //ft(B,C,D)函数
    auto ft = [&](int t)->int
    {
        if (t < 20)
            return (B & C) | ((~B) & D);
        else if (t < 40)
            return B ^ C ^ D;
        else if (t < 60)
            return (B & C) | (B & D) | (C & D);
        else
            return B ^ C ^ D;
    };
     /******计算消息摘要********/
    append(text);
    for (int i = 0; i < Turn; i++) {
        setW(X, i);
        for (int t = 0; t < 80; t++) {
            int temp = E + ft(t) + ROTL(A, 5) + W[t] + Kt(t);
            E = D;
            D = C;
            C = ROTL(B, 30);
            B = A;
            A = temp;
        }
        H0 = A = A + H0;
        H1 = B = B + H1;
        H2 = C = C + H2;
        H3 = D = D + H3;
        H4 = E = E + H4;
    }
    printf("%08x%08x%08x%08x%08x\n\n", A, B, C, D, E);
}