C++ MD5加密实现

转自:http://blog.csdn.net/gf771115/article/details/24584199

#pragma once 

#ifndef BZF_MD5_H  
#define BZF_MD5_H  

#include <string>  
#include <iostream>  


// a small class for calculating MD5 hashes of strings or byte arrays  
// it is not meant to be fast or secure  
//  
// usage: 1) feed it blocks of uchars with update()  
//      2) finalize()  
//      3) get hexdigest() string  
//      or  
//      MD5(std::string).hexdigest()  
//  
// assumes that char is 8 bit and int is 32 bit  
class MD5  
{  
public:  
    typedef unsigned int size_type; // must be 32bit  

    MD5();  
    MD5(const std::string& text);  
    void update(const unsigned char *buf, size_type length);  
    void update(const char *buf, size_type length);  
    MD5& finalize();  
    std::string hexdigest() const;  
    friend std::ostream& operator<<(std::ostream&, MD5 md5);  

private:  
    void init();  
    typedef unsigned char uint1; //  8bit  
    typedef unsigned int uint4;  // 32bit  
    enum {blocksize = 64}; // VC6 won't eat a const static int here  

    void transform(const uint1 block[blocksize]);  
    static void decode(uint4 output[], const uint1 input[], size_type len);  
    static void encode(uint1 output[], const uint4 input[], size_type len);  

    bool finalized;  
    uint1 buffer[blocksize]; // bytes that didn't fit in last 64 byte chunk  
    uint4 count[2];   // 64bit counter for number of bits (lo, hi)  
    uint4 state[4];   // digest so far  
    uint1 digest[16]; // the result  

    // low level logic operations  
    static inline uint4 F(uint4 x, uint4 y, uint4 z);  
    static inline uint4 G(uint4 x, uint4 y, uint4 z);  
    static inline uint4 H(uint4 x, uint4 y, uint4 z);  
    static inline uint4 I(uint4 x, uint4 y, uint4 z);  
    static inline uint4 rotate_left(uint4 x, int n);  
    static inline void FF(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac);  
    static inline void GG(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac);  
    static inline void HH(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac);  
    static inline void II(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac);  
};  

std::string md5(const std::string str);  

#endif  
#include "stdafx.h"
#include "md5.h"  

/* system implementation headers */  
#include <stdio.h>  


// Constants for MD5Transform routine.  
#define S11 7  
#define S12 12  
#define S13 17  
#define S14 22  
#define S21 5  
#define S22 9  
#define S23 14  
#define S24 20  
#define S31 4  
#define S32 11  
#define S33 16  
#define S34 23  
#define S41 6  
#define S42 10  
#define S43 15  
#define S44 21  

///////////////////////////////////////////////  

// F, G, H and I are basic MD5 functions.  
inline MD5::uint4 MD5::F(uint4 x, uint4 y, uint4 z) {  
    return x&y | ~x&z;  
}  

inline MD5::uint4 MD5::G(uint4 x, uint4 y, uint4 z) {  
    return x&z | y&~z;  
}  

inline MD5::uint4 MD5::H(uint4 x, uint4 y, uint4 z) {  
    return x^y^z;  
}  

inline MD5::uint4 MD5::I(uint4 x, uint4 y, uint4 z) {  
    return y ^ (x | ~z);  
}  

// rotate_left rotates x left n bits.  
inline MD5::uint4 MD5::rotate_left(uint4 x, int n) {  
    return (x << n) | (x >> (32-n));  
}  

// FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.  
// Rotation is separate from addition to prevent recomputation.  
inline void MD5::FF(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac) {  
    a = rotate_left(a+ F(b,c,d) + x + ac, s) + b;  
}  

inline void MD5::GG(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac) {  
    a = rotate_left(a + G(b,c,d) + x + ac, s) + b;  
}  

inline void MD5::HH(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac) {  
    a = rotate_left(a + H(b,c,d) + x + ac, s) + b;  
}  

inline void MD5::II(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac) {  
    a = rotate_left(a + I(b,c,d) + x + ac, s) + b;  
}  

//////////////////////////////////////////////  

// default ctor, just initailize  
MD5::MD5()  
{  
    init();  
}  

//////////////////////////////////////////////  

// nifty shortcut ctor, compute MD5 for string and finalize it right away  
MD5::MD5(const std::string &text)  
{  
    init();  
    update(text.c_str(), text.length());  
    finalize();  
}  

//////////////////////////////  

void MD5::init()  
{  
    finalized=false;  

    count[0] = 0;  
    count[1] = 0;  

    // load magic initialization constants.  
    state[0] = 0x67452301;  
    state[1] = 0xefcdab89;  
    state[2] = 0x98badcfe;  
    state[3] = 0x10325476;  
}  

//////////////////////////////  

// decodes input (unsigned char) into output (uint4). Assumes len is a multiple of 4.  
void MD5::decode(uint4 output[], const uint1 input[], size_type len)  
{  
    for (unsigned int i = 0, j = 0; j < len; i++, j += 4)  
        output[i] = ((uint4)input[j]) | (((uint4)input[j+1]) << 8) |  
        (((uint4)input[j+2]) << 16) | (((uint4)input[j+3]) << 24);  
}  

//////////////////////////////  

// encodes input (uint4) into output (unsigned char). Assumes len is  
// a multiple of 4.  
void MD5::encode(uint1 output[], const uint4 input[], size_type len)  
{  
    for (size_type i = 0, j = 0; j < len; i++, j += 4) {  
        output[j] = input[i] & 0xff;  
        output[j+1] = (input[i] >> 8) & 0xff;  
        output[j+2] = (input[i] >> 16) & 0xff;  
        output[j+3] = (input[i] >> 24) & 0xff;  
    }  
}  

//////////////////////////////  

// apply MD5 algo on a block  
void MD5::transform(const uint1 block[blocksize])  
{  
    uint4 a = state[0], b = state[1], c = state[2], d = state[3], x[16];  
    decode (x, block, blocksize);  

    /* Round 1 */  
    FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */  
    FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */  
    FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */  
    FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */  
    FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */  
    FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */  
    FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */  
    FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */  
    FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */  
    FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */  
    FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */  
    FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */  
    FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */  
    FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */  
    FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */  
    FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */  

    /* Round 2 */  
    GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */  
    GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */  
    GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */  
    GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */  
    GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */  
    GG (d, a, b, c, x[10], S22,  0x2441453); /* 22 */  
    GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */  
    GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */  
    GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */  
    GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */  
    GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */  
    GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */  
    GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */  
    GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */  
    GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */  
    GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */  

    /* Round 3 */  
    HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */  
    HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */  
    HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */  
    HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */  
    HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */  
    HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */  
    HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */  
    HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */  
    HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */  
    HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */  
    HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */  
    HH (b, c, d, a, x[ 6], S34,  0x4881d05); /* 44 */  
    HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */  
    HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */  
    HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */  
    HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */  

    /* Round 4 */  
    II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */  
    II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */  
    II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */  
    II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */  
    II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */  
    II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */  
    II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */  
    II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */  
    II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */  
    II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */  
    II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */  
    II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */  
    II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */  
    II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */  
    II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */  
    II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */  

    state[0] += a;  
    state[1] += b;  
    state[2] += c;  
    state[3] += d;  

    // Zeroize sensitive information.  
    memset(x, 0, sizeof x);  
}  

//////////////////////////////  

// MD5 block update operation. Continues an MD5 message-digest  
// operation, processing another message block  
void MD5::update(const unsigned char input[], size_type length)  
{  
    // compute number of bytes mod 64  
    size_type index = count[0] / 8 % blocksize;  

    // Update number of bits  
    if ((count[0] += (length << 3)) < (length << 3))  
        count[1]++;  
    count[1] += (length >> 29);  

    // number of bytes we need to fill in buffer  
    size_type firstpart = 64 - index;  

    size_type i;  

    // transform as many times as possible.  
    if (length >= firstpart)  
    {  
        // fill buffer first, transform  
        memcpy(&buffer[index], input, firstpart);  
        transform(buffer);  

        // transform chunks of blocksize (64 bytes)  
        for (i = firstpart; i + blocksize <= length; i += blocksize)  
            transform(&input[i]);  

        index = 0;  
    }  
    else  
        i = 0;  

    // buffer remaining input  
    memcpy(&buffer[index], &input[i], length-i);  
}  

//////////////////////////////  

// for convenience provide a verson with signed char  
void MD5::update(const char input[], size_type length)  
{  
    update((const unsigned char*)input, length);  
}  

//////////////////////////////  

// MD5 finalization. Ends an MD5 message-digest operation, writing the  
// the message digest and zeroizing the context.  
MD5& MD5::finalize()  
{  
    static unsigned char padding[64] = {  
        0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,  
        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,  
        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0  
    };  

    if (!finalized) {  
        // Save number of bits  
        unsigned char bits[8];  
        encode(bits, count, 8);  

        // pad out to 56 mod 64.  
        size_type index = count[0] / 8 % 64;  
        size_type padLen = (index < 56) ? (56 - index) : (120 - index);  
        update(padding, padLen);  

        // Append length (before padding)  
        update(bits, 8);  

        // Store state in digest  
        encode(digest, state, 16);  

        // Zeroize sensitive information.  
        memset(buffer, 0, sizeof buffer);  
        memset(count, 0, sizeof count);  

        finalized=true;  
    }  

    return *this;  
}  

//////////////////////////////  

// return hex representation of digest as string  
std::string MD5::hexdigest() const  
{  
    if (!finalized)  
        return "";  

    char buf[33];  
    for (int i=0; i<16; i++)  
        sprintf(buf+i*2, "%02x", digest[i]);  
    buf[32]=0;  

    return std::string(buf);  
}  

//////////////////////////////  

std::ostream& operator<<(std::ostream& out, MD5 md5)  
{  
    return out << md5.hexdigest();  
}  

//////////////////////////////  

std::string md5(const std::string str)  
{  
    MD5 md5 = MD5(str);  

    return md5.hexdigest();  
}  

使用示例

#include "stdafx.h"
#include <stdlib.h>
#include <iostream>
using namespace std;
#include "MD5.h"



int _tmain(int argc, _TCHAR* argv[])
{
    cout << "md5 of 'grape': " << md5("grape")<<endl;

    system("pause");
    return 0;
}
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
md5 用c++实现md5算法. 开发平台 Ubuntu14.04 运行 sudo get-apt install g++ make ./md5_test md5简介 消息摘要算法第五版(英语:Message-Digest Algorithm 5,缩写为MD5),是当前计算机领域用于确保信息传输完整一致而广泛使用的散列算法之一(又译哈希算法、摘要算法等),主流编程语言普遍已有MD5的实现。将数据 (如一段文字)运算变为另一固定长度值,是散列算法的基础原理,MD5的前身有MD2、MD3和MD4。MD5由MD4、MD3、MD2改进而来,主要增强算法复杂度和不可逆性。目前,MD5算法因其普遍、稳定、快速的特点,仍广泛应用于普通 数据的错误检查领域。例如在一些BitTorrent下载中,软件将通过计算MD5检验下载到的文件片段的完整性。MD5已经广泛使用在为文件传输提供一定的可靠性方面。例如,服务器预先提供一个MD5校验和,用户下载完文件以后, 用MD5算法计算下载文件的MD5校验和,然后通过检查这两个校验和是否一致,就能判断下载的文件是否出错。MD5是输入不定长度信息,输出固定长度128-bits的算法。经过程序流程,生成四个32位数据,最后联合起来成为一个 128-bits散列。基本方式为,求余、取余、调整长度、与链接变量进行循环运算。得出结果。 md5算法描述 假设输入信息(input message)的长度为b(bit),我们想要产生它的报文摘要,在此处b为任意的非负整数:b也可能为0,也不一定为8的整数倍,且可能是任意大的长度。设该信息的比特流表示如下: M[0] M[1] M[2] ... M[b-1] 计算此信息的报文摘要需要如下5步: 1.补位 信息计算前先要进行位补位,设补位后信息的长度为LEN(bit),则LEN%512 = 448(bit),即数据扩展至 K * 512 + 448(bit)。即K * 64+56(byte),K为整数。补位操作始终要执行,即使补位前信息的长度对512求余的结果是448。具体补位操作:补一个1,然后补0至满足上述要求。总共最少要补1bit,最多补512bit。 2.尾部加上信息长度 将输入信息的原始长度b(bit)表示成一个64-bit的数字,把它添加到上一步的结果后面(在32位的机器上,这64位将用2个字来表示并且低位在前)。当遇到b大于2^64这种极少的情况时,b的高位被截去,仅使用b的低64位。经过上面两步,数据就被填补成长度为512(bit)的倍数。也就是说,此时的数据长度是16个字(32byte)的整数倍。此时的数据表示为: M[0 ... N-1] 其中的N是16的倍数。 3.初始化缓存区 用一个四个字的缓冲器(A,B,C,D)来计算报文摘要,A,B,C,D分别是32位的寄存器,初始化使用的是十六进制表示的数字,注意低字节在前: word A: 01 23 45 67 word B: 89 ab cd ef word C: fe dc ba 98 word D: 76 54 32 10 4.转换 首先定义4个辅助函数,每个函数的输入是三个32位的字,输出是一个32位的字: F(X,Y,Z) = XY v not(X) Z G(X,Y,Z) = XZ v Y not(Z) H(X,Y,Z) = X xor Y xor Z I(X,Y,Z) = Y xor (X v not(Z)) FF(a,b,c,d,Mj,s,ti)表示 a = b + ((a + F(b,c,d) + Mj + ti) << s) GG(a,b,c,d,Mj,s,ti)表示 a = b + ((a + G(b,c,d) + Mj + ti) << s) HH(a,b,c,d,Mj,s,ti)表示 a = b + ((a + H(b,c,d) + Mj + ti) << s) Ⅱ(a,b,c,d,Mj,s,ti)表示 a = b + ((a + I(b,c,d) + Mj + ti) << s) 这四轮(64步)是: 第一轮 FF(a,b,c,d,M0,7,0xd76aa478) FF(d,a,b,c,M1,12,0xe8c7b756) FF(c,d,a,b,M2,17,0x242070db) FF(b,c,d,a,M3,22,0xc1bdceee) FF(a,b,c,d,M4,7,0xf57c0faf) FF(d,a,b,c,M5,12,0x4787c62a) FF(c,d,a,b,M6,17,0xa8304613) FF(b,c,d,a,M7,22,0xfd469501) FF(a,b,c,d,M8,7,0x698098d8) FF(d,a,b,c,M9,12,0x8b44f7af) FF(c,d,a,b,M10,17,0xffff5bb1) FF(b,c,d,a,M11,22,0x895cd7be) FF(a,b,c,d,M12,7,0x6b901122) FF(d,a,b,c,M13,12,0xfd987193) FF(c,d,a,b,M14,17,0xa679438e) FF(b,c,d,a,M15,22,0x49b40821) 第二轮 GG(a,b,c,d,M1,5,0xf61e2562) GG(d,a,b,c,M6,9,0xc040b340) GG(c,d,a,b,M11,14,0x265e5a51) GG(b,c,d,a,M0,20,0xe9b6c7aa) GG(a,b,c,d,M5,5,0xd62f105d) GG(d,a,b,c,M10,9,0x02441453) GG(c,d,a,b,M15,14,0xd8a1e681) GG(b,c,d,a,M4,20,0xe7d3fbc8) GG(a,b,c,d,M9,5,0x21e1cde6) GG(d,a,b,c,M14,9,0xc33707d6) GG(c,d,a,b,M3,14,0xf4d50d87) GG(b,c,d,a,M8,20,0x455a14ed) GG(a,b,c,d,M13,5,0xa9e3e905) GG(d,a,b,c,M2,9,0xfcefa3f8) GG(c,d,a,b,M7,14,0x676f02d9) GG(b,c,d,a,M12,20,0x8d2a4c8a) 第三轮 HH(a,b,c,d,M5,4,0xfffa3942) HH(d,a,b,c,M8,11,0x8771f681) HH(c,d,a,b,M11,16,0x6d9d6122) HH(b,c,d,a,M14,23,0xfde5380c) HH(a,b,c,d,M1,4,0xa4beea44) HH(d,a,b,c,M4,11,0x4bdecfa9) HH(c,d,a,b,M7,16,0xf6bb4b60) HH(b,c,d,a,M10,23,0xbebfbc70) HH(a,b,c,d,M13,4,0x289b7ec6) HH(d,a,b,c,M0,11,0xeaa127fa) HH(c,d,a,b,M3,16,0xd4ef3085) HH(b,c,d,a,M6,23,0x04881d05) HH(a,b,c,d,M9,4,0xd9d4d039) HH(d,a,b,c,M12,11,0xe6db99e5) HH(c,d,a,b,M15,16,0x1fa27cf8) HH(b,c,d,a,M2,23,0xc4ac5665) 第四轮 Ⅱ(a,b,c,d,M0,6,0xf4292244) Ⅱ(d,a,b,c,M7,10,0x432aff97) Ⅱ(c,d,a,b,M14,15,0xab9423a7) Ⅱ(b,c,d,a,M5,21,0xfc93a039) Ⅱ(a,b,c,d,M12,6,0x655b59c3) Ⅱ(d,a,b,c,M3,10,0x8f0ccc92) Ⅱ(c,d,a,b,M10,15,0xffeff47d) Ⅱ(b,c,d,a,M1,21,0x85845dd1) Ⅱ(a,b,c,d,M8,6,0x6fa87e4f) Ⅱ(d,a,b,c,M15,10,0xfe2ce6e0) Ⅱ(c,d,a,b,M6,15,0xa3014314) Ⅱ(b,c,d,a,M13,21,0x4e0811a1) Ⅱ(a,b,c,d,M4,6,0xf7537e82) Ⅱ(d,a,b,c,M11,10,0xbd3af235) Ⅱ(c,d,a,b,M2,15,0x2ad7d2bb) Ⅱ(b,c,d,a,M9,21,0xeb86d391)

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值