1 C
2 C++
3 Windows
4 Linux
5 数据库
- 5.1 SQL
- 5.2 Mysql
- 5.3 Oracle
- 5.5 Sqlite
- 5.6 数据库范式
- 5.7 游标
6 数据结构
7 算法
- 7.1 栈和队列
- 7.2 基本排序算法
- 7.3 合并排序
- 7.4 快速排序
- 7.5 优先级队列与堆排序
- 7.6 符号表及其基本实现
- 7.7 深度优先算法 DFS 和广度优先算法 BFS
- 7.8 桶排序
- 7.9 基数排序
8 Qt
9 AS400
10 Web
- 10.2 JavaScript
- 10.3 简述 cookie 和 session 及 token
- 10.4 Https 双向证书认证
- 10.5 URL 详解
12 C
13 框架
14 协议
15 工具
17 QA
文章来源于网络收集而来，版权归原创者所有，如有侵权请及时联系！
2.8 MD5
md5.h
/*
**********************************************************************
** md5.h -- Header file for implementation of MD5 **
** RSA Data Security, Inc. MD5 Message Digest Algorithm **
** Created: 2/17/90 RLR **
** Revised: 12/27/90 SRD,AJ,BSK,JT Reference C version **
** Revised (for MD5): RLR 4/27/91 **
** -- G modified to have y&~z instead of y&z **
** -- FF, GG, HH modified to add in last register done **
** -- Access pattern: round 2 works mod 5, round 3 works mod 3 **
** -- distinct additive constant for each step **
** -- round 4 added, working mod 7 **
**********************************************************************
*/
/*
**********************************************************************
** Copyright (C) 1990, RSA Data Security, Inc. All rights reserved. **
** **
** License to copy and use this software is granted provided that **
** it is identified as the "RSA Data Security, Inc. MD5 Message **
** Digest Algorithm" in all material mentioning or referencing this **
** software or this function. **
** **
** License is also granted to make and use derivative works **
** provided that such works are identified as "derived from the RSA **
** Data Security, Inc. MD5 Message Digest Algorithm" in all **
** material mentioning or referencing the derived work. **
** **
** RSA Data Security, Inc. makes no representations concerning **
** either the merchantability of this software or the suitability **
** of this software for any particular purpose. It is provided "as **
** is" without express or implied warranty of any kind. **
** **
** These notices must be retained in any copies of any part of this **
** documentation and/or software. **
**********************************************************************
*/
#ifndef __MD5_H_
#define __MD5_H_
#include "Type.h"
#define _MD5_MAX 32
/* Data structure for MD5 (Message Digest) computation */
typedef struct {
DWORD i[2]; /* number of _bits_ handled mod 2^64 */
DWORD buf[4]; /* scratch buffer */
BYTE in[64]; /* input buffer */
BYTE digest[16]; /* actual digest after MD5Final call */
} _MD5_CTX;
/**
* 计算指定字符串的md5值
*@data 待MD5的数据
*@datalen 待md5数据的长度
*@md5Value OUT MD计算结果
*@md5ValueMax md5Value缓冲区大小(
如果小于16字节，则返回失败；
如果小区32字节则返回16字节的编码；
如果大于等于32字节，则返回32字节的bcd编码)
*@return 成功返回md5Value的使用字节数
* 失败返回 -1
*@notes 一般情况下，MD5的结果为16或32字节，32字节为16字节的bcd编码。
*/
int Md5(BYTE* data,int datalen,BYTE* md5Value,int md5ValueMax);
#define _md5 Md5
/**
* 计算指定文件的md5值
*@pcFilePath 待计算MD5的文件路径
*@md5Value OUT MD计算结果
*@md5ValueMax md5Value缓冲区大小(
如果小于16字节，则返回失败；
如果小区32字节则返回16字节的编码；
如果大于等于32字节，则返回32字节的bcd编码)
*@return 成功返回md5Value的使用字节数
* 失败返回 -1
*@notes 一般情况下，MD5的结果为16或32字节，32字节为16字节的bcd编码。
*/
int CalcFileMd5(char* pcFilePath,BYTE* md5Value,int md5ValueMax);
/**
* Md5初始化
*@mdContext md5上下文
*@return 无
*/
void Md5Init (_MD5_CTX *mdContext);
/**
* 执行MD计算
*@mdContext MD5上下文，Md5Init初始化过。
*@inBuf 待MD5计算的内容
*@inLen 内容长度
*/
void Md5Update (_MD5_CTX *mdContext, BYTE *inBuf, DWORD inLen);
/**
* 完成MD计算
*/
void Md5Final (_MD5_CTX *mdContext);
/**
* 随机数Md5加密
*@plaintext 加密前的明文
*@plaintextLen 明文长度
*@randtext 随机内容
*@randtextLen 随机内容长度
*@encryption 存放密文的空间
*@encryptionMax 密文空间最大容量
*@return 成功返回加密后的内容长度
* 失败返回 -1
*/
int RandMd5(char* plaintext,int plaintextLen,char* randtext,int randtextLen,char* encryption,int encryptionMax);
#endif
md5.c
/*
**********************************************************************
** md5.c **
** RSA Data Security, Inc. MD5 Message Digest Algorithm **
** Created: 2/17/90 RLR **
** Revised: 1/91 SRD,AJ,BSK,JT Reference C Version **
**********************************************************************
*/
/*
**********************************************************************
** Copyright (C) 1990, RSA Data Security, Inc. All rights reserved. **
** **
** License to copy and use this software is granted provided that **
** it is identified as the "RSA Data Security, Inc. MD5 Message **
** Digest Algorithm" in all material mentioning or referencing this **
** software or this function. **
** **
** License is also granted to make and use derivative works **
** provided that such works are identified as "derived from the RSA **
** Data Security, Inc. MD5 Message Digest Algorithm" in all **
** material mentioning or referencing the derived work. **
** **
** RSA Data Security, Inc. makes no representations concerning **
** either the merchantability of this software or the suitability **
** of this software for any particular purpose. It is provided "as **
** is" without express or implied warranty of any kind. **
** **
** These notices must be retained in any copies of any part of this **
** documentation and/or software. **
**********************************************************************
*/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "Md5.h"
/* forward declaration */
static void Transform (DWORD *buf, DWORD *in) ;
static unsigned char PADDING[64] = {
0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
};
/* F, G and H are basic MD5 functions: selection, majority, parity */
#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)))
/* ROTATE_LEFT rotates x left n bits */
#if 1// LITTLE_ENDIAN
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
#else
#define ROTATE_LEFT(x, n) (((x) << (32 - (n))) | ((x) >> (n)))
#endif
/* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4 */
/* Rotation is separate from addition to prevent recomputation */
#define FF(a, b, c, d, x, s, ac) \
{(a) += F ((b), (c), (d)) + (x) + (DWORD)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}
#define GG(a, b, c, d, x, s, ac) \
{(a) += G ((b), (c), (d)) + (x) + (DWORD)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}
#define HH(a, b, c, d, x, s, ac) \
{(a) += H ((b), (c), (d)) + (x) + (DWORD)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}
#define II(a, b, c, d, x, s, ac) \
{(a) += I ((b), (c), (d)) + (x) + (DWORD)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}
void Md5Init (_MD5_CTX *mdContext)
{
mdContext->i[0] = mdContext->i[1] = (DWORD)0;
/* Load magic initialization constants.
*/
mdContext->buf[0] = (DWORD)0x67452301;
mdContext->buf[1] = (DWORD)0xefcdab89;
mdContext->buf[2] = (DWORD)0x98badcfe;
mdContext->buf[3] = (DWORD)0x10325476;
}
void Md5Update (_MD5_CTX *mdContext, BYTE *inBuf, DWORD inLen)
{
DWORD in[16];
int mdi;
unsigned int i, ii;
/* compute number of bytes mod 64 */
mdi = (int)((mdContext->i[0] >> 3) & 0x3F);
/* update number of bits */
if ((mdContext->i[0] + ((DWORD)inLen << 3)) < mdContext->i[0])
mdContext->i[1]++;
mdContext->i[0] += ((DWORD)inLen << 3);
mdContext->i[1] += ((DWORD)inLen >> 29);
while (inLen--) {
/* add new character to buffer, increment mdi */
mdContext->in[mdi++] = *inBuf++;
/* transform if necessary */
if (mdi == 0x40) {
for (i = 0, ii = 0; i < 16; i++, ii += 4)
in[i] = (((DWORD)mdContext->in[ii+3]) << 24) |
(((DWORD)mdContext->in[ii+2]) << 16) |
(((DWORD)mdContext->in[ii+1]) << 8) |
((DWORD)mdContext->in[ii]);
Transform (mdContext->buf, in);
mdi = 0;
}
}
}
void Md5Final (_MD5_CTX *mdContext)
{
DWORD in[16];
int mdi;
unsigned int i, ii;
unsigned int padLen;
/* save number of bits */
in[14] = mdContext->i[0];
in[15] = mdContext->i[1];
/* compute number of bytes mod 64 */
mdi = (int)((mdContext->i[0] >> 3) & 0x3F);
/* pad out to 56 mod 64 */
padLen = (mdi < 56) ? (56 - mdi) : (120 - mdi);
Md5Update (mdContext, PADDING, padLen);
/* append length in bits and transform */
for (i = 0, ii = 0; i < 14; i++, ii += 4)
in[i] = (((DWORD)mdContext->in[ii+3]) << 24) |
(((DWORD)mdContext->in[ii+2]) << 16) |
(((DWORD)mdContext->in[ii+1]) << 8) |
((DWORD)mdContext->in[ii]);
Transform (mdContext->buf, in);
/* store buffer in digest */
for (i = 0, ii = 0; i < 4; i++, ii += 4) {
mdContext->digest[ii] = (unsigned char)(mdContext->buf[i] & 0xFF);
mdContext->digest[ii+1] =
(unsigned char)((mdContext->buf[i] >> 8) & 0xFF);
mdContext->digest[ii+2] =
(unsigned char)((mdContext->buf[i] >> 16) & 0xFF);
mdContext->digest[ii+3] =
(unsigned char)((mdContext->buf[i] >> 24) & 0xFF);
}
}
/* Basic MD5 step. Transform buf based on in.
*/
static void Transform (DWORD *buf, DWORD *in)
{
DWORD a = buf[0], b = buf[1], c = buf[2], d = buf[3];
/* Round 1 */
#define S11 7
#define S12 12
#define S13 17
#define S14 22
FF ( a, b, c, d, in[ 0], S11, 3614090360UL); /* 1 */
FF ( d, a, b, c, in[ 1], S12, 3905402710UL); /* 2 */
FF ( c, d, a, b, in[ 2], S13, 606105819UL); /* 3 */
FF ( b, c, d, a, in[ 3], S14, 3250441966UL); /* 4 */
FF ( a, b, c, d, in[ 4], S11, 4118548399UL); /* 5 */
FF ( d, a, b, c, in[ 5], S12, 1200080426UL); /* 6 */
FF ( c, d, a, b, in[ 6], S13, 2821735955UL); /* 7 */
FF ( b, c, d, a, in[ 7], S14, 4249261313UL); /* 8 */
FF ( a, b, c, d, in[ 8], S11, 1770035416UL); /* 9 */
FF ( d, a, b, c, in[ 9], S12, 2336552879UL); /* 10 */
FF ( c, d, a, b, in[10], S13, 4294925233UL); /* 11 */
FF ( b, c, d, a, in[11], S14, 2304563134UL); /* 12 */
FF ( a, b, c, d, in[12], S11, 1804603682UL); /* 13 */
FF ( d, a, b, c, in[13], S12, 4254626195UL); /* 14 */
FF ( c, d, a, b, in[14], S13, 2792965006UL); /* 15 */
FF ( b, c, d, a, in[15], S14, 1236535329UL); /* 16 */
/* Round 2 */
#define S21 5
#define S22 9
#define S23 14
#define S24 20
GG ( a, b, c, d, in[ 1], S21, 4129170786UL); /* 17 */
GG ( d, a, b, c, in[ 6], S22, 3225465664UL); /* 18 */
GG ( c, d, a, b, in[11], S23, 643717713UL); /* 19 */
GG ( b, c, d, a, in[ 0], S24, 3921069994UL); /* 20 */
GG ( a, b, c, d, in[ 5], S21, 3593408605UL); /* 21 */
GG ( d, a, b, c, in[10], S22, 38016083UL); /* 22 */
GG ( c, d, a, b, in[15], S23, 3634488961UL); /* 23 */
GG ( b, c, d, a, in[ 4], S24, 3889429448UL); /* 24 */
GG ( a, b, c, d, in[ 9], S21, 568446438UL); /* 25 */
GG ( d, a, b, c, in[14], S22, 3275163606UL); /* 26 */
GG ( c, d, a, b, in[ 3], S23, 4107603335UL); /* 27 */
GG ( b, c, d, a, in[ 8], S24, 1163531501UL); /* 28 */
GG ( a, b, c, d, in[13], S21, 2850285829UL); /* 29 */
GG ( d, a, b, c, in[ 2], S22, 4243563512UL); /* 30 */
GG ( c, d, a, b, in[ 7], S23, 1735328473UL); /* 31 */
GG ( b, c, d, a, in[12], S24, 2368359562UL); /* 32 */
/* Round 3 */
#define S31 4
#define S32 11
#define S33 16
#define S34 23
HH ( a, b, c, d, in[ 5], S31, 4294588738UL); /* 33 */
HH ( d, a, b, c, in[ 8], S32, 2272392833UL); /* 34 */
HH ( c, d, a, b, in[11], S33, 1839030562UL); /* 35 */
HH ( b, c, d, a, in[14], S34, 4259657740UL); /* 36 */
HH ( a, b, c, d, in[ 1], S31, 2763975236UL); /* 37 */
HH ( d, a, b, c, in[ 4], S32, 1272893353UL); /* 38 */
HH ( c, d, a, b, in[ 7], S33, 4139469664UL); /* 39 */
HH ( b, c, d, a, in[10], S34, 3200236656UL); /* 40 */
HH ( a, b, c, d, in[13], S31, 681279174UL); /* 41 */
HH ( d, a, b, c, in[ 0], S32, 3936430074UL); /* 42 */
HH ( c, d, a, b, in[ 3], S33, 3572445317UL); /* 43 */
HH ( b, c, d, a, in[ 6], S34, 76029189UL); /* 44 */
HH ( a, b, c, d, in[ 9], S31, 3654602809UL); /* 45 */
HH ( d, a, b, c, in[12], S32, 3873151461UL); /* 46 */
HH ( c, d, a, b, in[15], S33, 530742520UL); /* 47 */
HH ( b, c, d, a, in[ 2], S34, 3299628645UL); /* 48 */
/* Round 4 */
#define S41 6
#define S42 10
#define S43 15
#define S44 21
II ( a, b, c, d, in[ 0], S41, 4096336452UL); /* 49 */
II ( d, a, b, c, in[ 7], S42, 1126891415UL); /* 50 */
II ( c, d, a, b, in[14], S43, 2878612391UL); /* 51 */
II ( b, c, d, a, in[ 5], S44, 4237533241UL); /* 52 */
II ( a, b, c, d, in[12], S41, 1700485571UL); /* 53 */
II ( d, a, b, c, in[ 3], S42, 2399980690UL); /* 54 */
II ( c, d, a, b, in[10], S43, 4293915773UL); /* 55 */
II ( b, c, d, a, in[ 1], S44, 2240044497UL); /* 56 */
II ( a, b, c, d, in[ 8], S41, 1873313359UL); /* 57 */
II ( d, a, b, c, in[15], S42, 4264355552UL); /* 58 */
II ( c, d, a, b, in[ 6], S43, 2734768916UL); /* 59 */
II ( b, c, d, a, in[13], S44, 1309151649UL); /* 60 */
II ( a, b, c, d, in[ 4], S41, 4149444226UL); /* 61 */
II ( d, a, b, c, in[11], S42, 3174756917UL); /* 62 */
II ( c, d, a, b, in[ 2], S43, 718787259UL); /* 63 */
II ( b, c, d, a, in[ 9], S44, 3951481745UL); /* 64 */
buf[0] += a;
buf[1] += b;
buf[2] += c;
buf[3] += d;
}
/**
* 计算指定字符串的md5值
*@data 待MD5的数据
*@datalen 待md5数据的长度
*@md5Value OUT MD计算结果
*@md5ValueMax md5Value缓冲区大小(
如果小于16字节，则返回失败；
如果小区32字节则返回16字节的编码；
如果大于等于32字节，则返回32字节的bcd编码)
*@return 成功返回md5Value的使用字节数
* 失败返回 -1
*@notes 一般情况下，MD5的结果为16或32字节，32字节为16字节的bcd编码。
*/
int Md5(BYTE* data,int datalen,BYTE* md5Value,int md5ValueMax)
{
_MD5_CTX mdContext;
Md5Init(&mdContext);
Md5Update(&mdContext, data, datalen);
Md5Final(&mdContext);
if(md5ValueMax < 16)//容量不够
{
return -1;
}
else if(md5ValueMax < 32) //如果小于32
{
for (int i=0;i<16;i++)
{
md5Value[i] = mdContext.digest[i];
}
return 16;
}
else
{
for(int i=0; i<16; i++)
{
sprintf((char*)&md5Value[i*2], "%02x", mdContext.digest[i]);
}
return 32;
}
return -1;
}
/*
**********************************************************************
** End of md5.c **
******************************* (cut) ********************************
*/
/**
* 计算指定文件的md5值
*@pcFilePath 待计算MD5的文件路径
*@md5Value OUT MD计算结果
*@md5ValueMax md5Value缓冲区大小(
如果小于16字节，则返回失败；
如果小区32字节则返回16字节的编码；
如果大于等于32字节，则返回32字节的bcd编码)
*@return 成功返回md5Value的使用字节数
* 失败返回 -1
*@notes 一般情况下，MD5的结果为16或32字节，32字节为16字节的bcd编码。
*/
int CalcFileMd5(char* pcFilePath,BYTE* md5Value,int md5ValueMax)
{
FILE *fp = fopen (pcFilePath, "rb");
_MD5_CTX mdContext;
int bytes;
BYTE data[1024];
if (fp == NULL)
{
return -1;
}
Md5Init (&mdContext);
while ((bytes = fread (data, 1, 1024, fp)) != 0)
{
Md5Update (&mdContext, data, bytes);
}
Md5Final (&mdContext);
fclose(fp);
if(md5ValueMax < 16)//容量不够
{
return -1;
}
else if(md5ValueMax < 32) //如果小于32
{
for (int i=0;i<16;i++)
{
md5Value[i] = mdContext.digest[i];
}
return 16;
}
else
{
for(int i=0; i<16; i++)
{
sprintf((char*)&md5Value[i*2], "%02x", mdContext.digest[i]);
}
return 32;
}
return -1;
}
/**
* 随机数Md5加密
*@plaintext 加密前的明文
*@plaintextLen 明文长度
*@randtext 随机内容
*@randtextLen 随机内容长度
*@encryption 存放密文的空间
*@encryptionMax 密文空间最大容量
*@return 成功返回加密后的内容长度
* 失败返回 -1
*/
int RandMd5(char* plaintext,int plaintextLen,char* randtext,int randtextLen,char* encryption,int encryptionMax)
{
for (int i=0;i<plaintextLen;i++)
{
plaintext[i] = plaintext[i] ^ randtext[i%randtextLen];
}
return Md5((BYTE*)plaintext,plaintextLen,(BYTE*)encryption,encryptionMax);
}
md5Test.cpp
// Md5Test.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include <Md5.h>
#include <string.h>
#include <stdlib.h>
int main(int argc, char* argv[])
{
char *data = "12345678";
char R[] ={'1','2','3','4'};
char md5[_MD5_MAX + 1];
char md5_2[_MD5_MAX + 1];
memset(md5,0,sizeof(md5));
Md5((BYTE*)data.GetBuffer(0),data.GetLength(),(BYTE*)md5,_MD5_MAX);
printf("md5:%s\n",md5);
memset(md5_2,0,sizeof(md5_2));
for (int i=0;i<_MD5_MAX;i++)
{
md5[i] = md5[i]^(R[i%4]);
}
Md5((BYTE*)md5,_MD5_MAX,(BYTE*)md5_2,_MD5_MAX);
printf("md5_2:%s\n",md5_2);
getchar();
return 0;
}
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论