md5算法库函数c语言 c++md5

C语言求文件MD5的函数用法

#ifndef MD5_H

创新互联公司是专业的瀍河网站建设公司，瀍河接单;提供成都网站设计、做网站,网页设计,网站设计,建网站,PHP网站建设等专业做网站服务;采用PHP框架,可快速的进行瀍河网站开发网页制作和功能扩展;专业做搜索引擎喜爱的网站,专业的做网站团队,希望更多企业前来合作!

#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

源文件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 = partlen;i+64 = inputlen;i+=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 */

请教MD5算法 用C语言实现

#include stdio.h

#include stdlib.h

#include string.h

#if defined(__APPLE__)

#  define COMMON_DIGEST_FOR_OPENSSL

#  include CommonCrypto/CommonDigest.h

#  define SHA1 CC_SHA1

#else

#  include openssl/md5.h

#endif

// 这是我自己写的函数，用于计算MD5

// 参数 str：要转换的字符串

// 参数 lengthL: 字符串的长度 可以用 strlen(str) 直接获取参数str的长度

// 返回值：MD5字符串

char *str2md5(const char * str, int length) {

int n;

MD5_CTX c;

unsigned char digest[16];

char *out = (char*)malloc(33);

MD5_Init(c);

while (length  0) {

if (length  512) {

MD5_Update(c, str, 512);

} else {

MD5_Update(c, str, length);

}

length -= 512;

str += 512;

}

MD5_Final(digest, c);

for (n = 0; n  16; ++n) {

snprintf((out[n*2]), 16*2, "%02x", (unsigned int)digest[n]);

}

return out;

}

int main(int argc, char **argv) {

char *output = str2md5("hello", strlen("hello"));

printf("%s\n", output);

// 上面会输出 hello的MD5字符串：

// 5d41402abc4b2a76b9719d911017c592

free(output);

return 0;

}

VS2013中c语言md5加密函数怎么调用?

1、主要就是调用库函数，MD5加密说到底也是函数计算，没有什么思路的问题，了解md5的发明算法，本质是一个数学问题。

2、例程：

#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

源文件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 = partlen;i+64 = inputlen;i+=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 */

求MD5加密算法的C语言源码

（转载） #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 = 0; i 16; i, 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