C语言 MD5加密

main.cpp

#include <stdio.h>

#include <string.h>

#include <stdlib.h>

#include "md5.c"

int main(int argc, char* argv[])

{

int i

unsigned char encrypt[] = "admin"//21232f297a57a5a743894a0e4a801fc3

unsigned char decrypt[16]

MD5_CTX md5

MD5Init(&md5)

MD5Update(&md5, encrypt, strlen((char*)encrypt))

MD5Final(&md5, decrypt)

printf("加密前:%s\n加密后:", encrypt)

for (i = 0i <16i++)

{

printf("%02x", decrypt[i])

}

getchar()

return 0

}

md5.c

#include <memory.h>

#include "md5.h"

unsigned char PADDING[] = { 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 }

void MD5Init(MD5_CTX* context)

{

    context->count[0] = 0

    context->count[1] = 0

    context->state[0] = 0x67452301

    context->state[1] = 0xEFCDAB89

    context->state[2] = 0x98BADCFE

    context->state[3] = 0x10325476

}

void MD5Update(MD5_CTX* context, unsigned char* input, unsigned int inputlen)

{

    unsigned int i = 0, index = 0, partlen = 0

    index = (context->count[0] >>3) &0x3F

    partlen = 64 - index

    context->count[0] += inputlen <<3

    if (context->count[0] <(inputlen <<3))

        context->count[1]++

    context->count[1] += inputlen >>29

    if (inputlen >= partlen)

    {

        memcpy(&context->buffer[index], input, partlen)

        MD5Transform(context->state, context->buffer)

        for (i = partleni + 64 <= inputleni += 64)

            MD5Transform(context->state, &input[i])

        index = 0

    }

    else

    {

        i = 0

    }

    memcpy(&context->buffer[index], &input[i], inputlen - i)

}

void MD5Final(MD5_CTX* context, unsigned char digest[16])

{

    unsigned int index = 0, padlen = 0

    unsigned char bits[8]

    index = (context->count[0] >>3) &0x3F

    padlen = (index <56) ? (56 - index) : (120 - index)

    MD5Encode(bits, context->count, 8)

    MD5Update(context, PADDING, padlen)

    MD5Update(context, bits, 8)

    MD5Encode(digest, context->state, 16)

}

void MD5Encode(unsigned char* output, unsigned int* input, unsigned int len)

{

    unsigned int i = 0, j = 0

    while (j <len)

    {

        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

        i++

        j += 4

    }

}

void MD5Decode(unsigned int* output, unsigned char* input, unsigned int len)

{

    unsigned int i = 0, j = 0

    while (j <len)

    {

        output[i] = (input[j]) |

            (input[j + 1] <<8) |

            (input[j + 2] <<16) |

            (input[j + 3] <<24)

        i++

        j += 4

    }

}

void MD5Transform(unsigned int state[4], unsigned char block[64])

{

    unsigned int a = state[0]

    unsigned int b = state[1]

    unsigned int c = state[2]

    unsigned int d = state[3]

    unsigned int x[64]

    MD5Decode(x, block, 64)

    FF(a, b, c, d, x[0], 7, 0xd76aa478)/* 1 */

    FF(d, a, b, c, x[1], 12, 0xe8c7b756)/* 2 */

    FF(c, d, a, b, x[2], 17, 0x242070db)/* 3 */

    FF(b, c, d, a, x[3], 22, 0xc1bdceee)/* 4 */

    FF(a, b, c, d, x[4], 7, 0xf57c0faf)/* 5 */

    FF(d, a, b, c, x[5], 12, 0x4787c62a)/* 6 */

    FF(c, d, a, b, x[6], 17, 0xa8304613)/* 7 */

    FF(b, c, d, a, x[7], 22, 0xfd469501)/* 8 */

    FF(a, b, c, d, x[8], 7, 0x698098d8)/* 9 */

    FF(d, a, b, c, x[9], 12, 0x8b44f7af)/* 10 */

    FF(c, d, a, b, x[10], 17, 0xffff5bb1)/* 11 */

    FF(b, c, d, a, x[11], 22, 0x895cd7be)/* 12 */

    FF(a, b, c, d, x[12], 7, 0x6b901122)/* 13 */

    FF(d, a, b, c, x[13], 12, 0xfd987193)/* 14 */

    FF(c, d, a, b, x[14], 17, 0xa679438e)/* 15 */

    FF(b, c, d, a, x[15], 22, 0x49b40821)/* 16 */

    /* Round 2 */

    GG(a, b, c, d, x[1], 5, 0xf61e2562)/* 17 */

    GG(d, a, b, c, x[6], 9, 0xc040b340)/* 18 */

    GG(c, d, a, b, x[11], 14, 0x265e5a51)/* 19 */

    GG(b, c, d, a, x[0], 20, 0xe9b6c7aa)/* 20 */

    GG(a, b, c, d, x[5], 5, 0xd62f105d)/* 21 */

    GG(d, a, b, c, x[10], 9, 0x2441453)/* 22 */

    GG(c, d, a, b, x[15], 14, 0xd8a1e681)/* 23 */

    GG(b, c, d, a, x[4], 20, 0xe7d3fbc8)/* 24 */

    GG(a, b, c, d, x[9], 5, 0x21e1cde6)/* 25 */

    GG(d, a, b, c, x[14], 9, 0xc33707d6)/* 26 */

    GG(c, d, a, b, x[3], 14, 0xf4d50d87)/* 27 */

    GG(b, c, d, a, x[8], 20, 0x455a14ed)/* 28 */

    GG(a, b, c, d, x[13], 5, 0xa9e3e905)/* 29 */

    GG(d, a, b, c, x[2], 9, 0xfcefa3f8)/* 30 */

    GG(c, d, a, b, x[7], 14, 0x676f02d9)/* 31 */

    GG(b, c, d, a, x[12], 20, 0x8d2a4c8a)/* 32 */

    /* Round 3 */

    HH(a, b, c, d, x[5], 4, 0xfffa3942)/* 33 */

    HH(d, a, b, c, x[8], 11, 0x8771f681)/* 34 */

    HH(c, d, a, b, x[11], 16, 0x6d9d6122)/* 35 */

    HH(b, c, d, a, x[14], 23, 0xfde5380c)/* 36 */

    HH(a, b, c, d, x[1], 4, 0xa4beea44)/* 37 */

    HH(d, a, b, c, x[4], 11, 0x4bdecfa9)/* 38 */

    HH(c, d, a, b, x[7], 16, 0xf6bb4b60)/* 39 */

    HH(b, c, d, a, x[10], 23, 0xbebfbc70)/* 40 */

    HH(a, b, c, d, x[13], 4, 0x289b7ec6)/* 41 */

    HH(d, a, b, c, x[0], 11, 0xeaa127fa)/* 42 */

    HH(c, d, a, b, x[3], 16, 0xd4ef3085)/* 43 */

    HH(b, c, d, a, x[6], 23, 0x4881d05)/* 44 */

    HH(a, b, c, d, x[9], 4, 0xd9d4d039)/* 45 */

    HH(d, a, b, c, x[12], 11, 0xe6db99e5)/* 46 */

    HH(c, d, a, b, x[15], 16, 0x1fa27cf8)/* 47 */

    HH(b, c, d, a, x[2], 23, 0xc4ac5665)/* 48 */

    /* Round 4 */

    II(a, b, c, d, x[0], 6, 0xf4292244)/* 49 */

    II(d, a, b, c, x[7], 10, 0x432aff97)/* 50 */

    II(c, d, a, b, x[14], 15, 0xab9423a7)/* 51 */

    II(b, c, d, a, x[5], 21, 0xfc93a039)/* 52 */

    II(a, b, c, d, x[12], 6, 0x655b59c3)/* 53 */

    II(d, a, b, c, x[3], 10, 0x8f0ccc92)/* 54 */

    II(c, d, a, b, x[10], 15, 0xffeff47d)/* 55 */

    II(b, c, d, a, x[1], 21, 0x85845dd1)/* 56 */

    II(a, b, c, d, x[8], 6, 0x6fa87e4f)/* 57 */

    II(d, a, b, c, x[15], 10, 0xfe2ce6e0)/* 58 */

    II(c, d, a, b, x[6], 15, 0xa3014314)/* 59 */

    II(b, c, d, a, x[13], 21, 0x4e0811a1)/* 60 */

    II(a, b, c, d, x[4], 6, 0xf7537e82)/* 61 */

    II(d, a, b, c, x[11], 10, 0xbd3af235)/* 62 */

    II(c, d, a, b, x[2], 15, 0x2ad7d2bb)/* 63 */

    II(b, c, d, a, x[9], 21, 0xeb86d391)/* 64 */

    state[0] += a

    state[1] += b

    state[2] += c

    state[3] += d

}

md5.h

#ifndef MD5_H

#define MD5_H

typedef struct

{

    unsigned int count[2]

    unsigned int state[4]

    unsigned char buffer[64]

}MD5_CTX

#define F(x,y,z) ((x &y) | (~x &z))

#define G(x,y,z) ((x &z) | (y &~z))

#define H(x,y,z) (x^y^z)

#define I(x,y,z) (y ^ (x | ~z))

#define ROTATE_LEFT(x,n) ((x <<n) | (x >>(32-n)))

#define FF(a,b,c,d,x,s,ac) \

          { \

          a += F(b,c,d) + x + ac\

          a = ROTATE_LEFT(a,s)\

          a += b\

          }

#define GG(a,b,c,d,x,s,ac) \

          { \

          a += G(b,c,d) + x + ac\

          a = ROTATE_LEFT(a,s)\

          a += b\

          }

#define HH(a,b,c,d,x,s,ac) \

          { \

          a += H(b,c,d) + x + ac\

          a = ROTATE_LEFT(a,s)\

          a += b\

          }

#define II(a,b,c,d,x,s,ac) \

          { \

          a += I(b,c,d) + x + ac\

          a = ROTATE_LEFT(a,s)\

          a += b\

          }

void MD5Init(MD5_CTX* context)

void MD5Update(MD5_CTX* context, unsigned char* input, unsigned int inputlen)

void MD5Final(MD5_CTX* context, unsigned char digest[16])

void MD5Transform(unsigned int state[4], unsigned char block[64])

void MD5Encode(unsigned char* output, unsigned int* input, unsigned int len)

void MD5Decode(unsigned int* output, unsigned char* input, unsigned int len)

#endif

（转载） #include <stdio.h> #include <stdlib.h> #include <memory.h> #include <time.h> #include <errno.h> #include <string.h> #include <sys/socket.h> #include <sys/types.h> #include <netinet/in.h> #include <arpa/inet.h> #include <netdb.h> #include "../md5/md5.h" #define T1 0xd76aa478 #define T2 0xe8c7b756 #define T3 0x242070db #define T4 0xc1bdceee #define T5 0xf57c0faf #define T6 0x4787c62a #define T7 0xa8304613 #define T8 0xfd469501 #define T9 0x698098d8 #define T10 0x8b44f7af #define T11 0xffff5bb1 #define T12 0x895cd7be #define T13 0x6b901122 #define T14 0xfd987193 #define T15 0xa679438e #define T16 0x49b40821 #define T17 0xf61e2562 #define T18 0xc040b340 #define T19 0x265e5a51 #define T20 0xe9b6c7aa #define T21 0xd62f105d #define T22 0x02441453 #define T23 0xd8a1e681 #define T24 0xe7d3fbc8 #define T25 0x21e1cde6 #define T26 0xc33707d6 #define T27 0xf4d50d87 #define T28 0x455a14ed #define T29 0xa9e3e905 #define T30 0xfcefa3f8 #define T31 0x676f02d9 #define T32 0x8d2a4c8a #define T33 0xfffa3942 #define T34 0x8771f681 #define T35 0x6d9d6122 #define T36 0xfde5380c #define T37 0xa4beea44 #define T38 0x4bdecfa9 #define T39 0xf6bb4b60 #define T40 0xbebfbc70 #define T41 0x289b7ec6 #define T42 0xeaa127fa #define T43 0xd4ef3085 #define T44 0x04881d05 #define T45 0xd9d4d039 #define T46 0xe6db99e5 #define T47 0x1fa27cf8 #define T48 0xc4ac5665 #define T49 0xf4292244 #define T50 0x432aff97 #define T51 0xab9423a7 #define T52 0xfc93a039 #define T53 0x655b59c3 #define T54 0x8f0ccc92 #define T55 0xffeff47d #define T56 0x85845dd1 #define T57 0x6fa87e4f #define T58 0xfe2ce6e0 #define T59 0xa3014314 #define T60 0x4e0811a1 #define T61 0xf7537e82 #define T62 0xbd3af235 #define T63 0x2ad7d2bb #define T64 0xeb86d391 static void md5_process(md5_state_t *pms, const md5_byte_t *data /*[64]*/) { md5_word_t a = pms->abcd[0], b = pms->abcd[1], c = pms->abcd[2], d = pms->abcd[3] md5_word_t t #ifndef ARCH_IS_BIG_ENDIAN # define ARCH_IS_BIG_ENDIAN 1 /* slower, default implementation */ #endif #if ARCH_IS_BIG_ENDIAN /* * On big-endian machines, we must arrange the bytes in the right * order. (This also works on machines of unknown byte order.) */ md5_word_t X[16] const md5_byte_t *xp = data int i for (i = 0i <16i, xp = 4) X[i] = xp[0] (xp[1] <<8) (xp[2] <<16) (xp[3] <<24) #else /* !ARCH_IS_BIG_ENDIAN */ /* * On little-endian machines, we can process properly aligned data * without copying it. */ md5_word_t xbuf[16] const md5_word_t *X if (!((data - (const md5_byte_t *)0) &3)) { /* data are properly aligned */ X = (const md5_word_t *)data } else { /* not aligned */ memcpy(xbuf, data, 64) X = xbuf } #endif #define ROTATE_LEFT(x, n) (((x) <<(n)) | ((x) >>(32 - (n)))) /* Round 1. */ /* Let [abcd k s i] denote the operation a = b ((a F(b,c,d) X[k] T[i]) <<<s). */ #define F(x, y, z) (((x) &(y)) | (~(x) &(z))) #define SET(a, b, c, d, k, s, Ti)\ t = a F(b,c,d) X[k] Ti\ a = ROTATE_LEFT(t, s) b /* Do the following 16 operations. */ SET(a, b, c, d, 0, 7, T1) SET(d, a, b, c, 1, 12, T2) SET(c, d, a, b, 2, 17, T3) SET(b, c, d, a, 3, 22, T4) SET(a, b, c, d, 4, 7, T5) SET(d, a, b, c, 5, 12, T6) SET(c, d, a, b, 6, 17, T7) SET(b, c, d, a, 7, 22, T8) SET(a, b, c, d, 8, 7, T9) SET(d, a, b, c, 9, 12, T10) SET(c, d, a, b, 10, 17, T11) SET(b, c, d, a, 11, 22, T12) SET(a, b, c, d, 12, 7, T13) SET(d, a, b, c, 13, 12, T14) SET(c, d, a, b, 14, 17, T15) SET(b, c, d, a, 15, 22, T16) #undef SET /* Round 2. */ /* Let [abcd k s i] denote the operation a = b ((a G(b,c,d) X[k] T[i]) <<<s). */ #define G(x, y, z) (((x) &(z)) | ((y) &~(z))) #define SET(a, b, c, d, k, s, Ti)\ t = a G(b,c,d) X[k] Ti\ a = ROTATE_LEFT(t, s) b /* Do the following 16 operations. */ SET(a, b, c, d, 1, 5, T17) SET(d, a, b, c, 6, 9, T18) SET(c, d, a, b, 11, 14, T19) SET(b, c, d, a, 0, 20, T20) SET(a, b, c, d, 5, 5, T21) SET(d, a, b, c, 10, 9, T22) SET(c, d, a, b, 15, 14, T23) SET(b, c, d, a, 4, 20, T24) SET(a, b, c, d, 9, 5, T25) SET(d, a, b, c, 14, 9, T26) SET(c, d, a, b, 3, 14, T27) SET(b, c, d, a, 8, 20, T28) SET(a, b, c, d, 13, 5, T29) SET(d, a, b, c, 2, 9, T30) SET(c, d, a, b, 7, 14, T31) SET(b, c, d, a, 12, 20, T32) #undef SET

#include <stdio.h>

#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

#define R_memset(x, y, z) memset(x, y, z)

#define R_memcpy(x, y, z) memcpy(x, y, z)

#define R_memcmp(x, y, z) memcmp(x, y, z)

typedef unsigned long UINT4

typedef unsigned char *POINTER

typedef struct {

/*四个32bits数,用于存放最终计算得到的消息摘要.当消息长度>512bits时,也用于存放每个512bits的中间结果*/

UINT4 state[4]

/*存储原始信息的bits数长度,不包括填充的bits,最长为2^64 bits*/

UINT4 count[2]

/*存放输入的信息的缓冲区,512bits*/

unsigned char buffer[64]

} MD5_CTX

static void MD5Transform(UINT4[4], unsigned char[64])

static void Encode(unsigned char *, UINT4 *, unsigned int)

static void Decode(UINT4 *, unsigned char *, unsigned int)

/*

用于bits填充的缓冲区,当欲加密的信息的bits数被512除其余数为448时,需要填充的bits的最大值为512=64*8*/

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

}

/*接下来的这几个宏定义是md5算法规定的,就是对信息进行md5加密都要做的运算*/

#define F(x, y, z) (((x) &(y)) | ((~x) &(z)))

#define G(x, y, z) (((x) &(z)) | ((y) &(~z)))

#define H(x, y, z) ((x) ^ (y) ^ (z))

#define I(x, y, z) ((y) ^ ((x) | (~z)))

#define ROTATE_LEFT(x, n) (((x) <<(n)) | ((x) >>(32-(n))))

#define FF(a, b, c, d, x, s, ac) {\

(a) += F ((b), (c), (d)) + (x) + (UINT4)(ac)\

(a) = ROTATE_LEFT ((a), (s))\

(a) += (b)\

}

#define GG(a, b, c, d, x, s, ac) {\

(a) += G ((b), (c), (d)) + (x) + (UINT4)(ac)\

(a) = ROTATE_LEFT ((a), (s))\

(a) += (b)\

}

#define HH(a, b, c, d, x, s, ac) {\

(a) += H ((b), (c), (d)) + (x) + (UINT4)(ac)\

(a) = ROTATE_LEFT ((a), (s))\

(a) += (b)\

}

#define II(a, b, c, d, x, s, ac) {\

(a) += I ((b), (c), (d)) + (x) + (UINT4)(ac)\

(a) = ROTATE_LEFT ((a), (s))\

(a) += (b)\

}

---