分享
 
 
 

使用他人的MD5编码类,修改形成密码串

王朝vc·作者佚名  2006-01-09
窄屏简体版  字體: |||超大  

从网上下载一个MD5编码类,感谢Robert Hubley

奇怪的是输入密码,输出编码的函数定义如下

void MD5Update ( unsigned char *input, unsigned int inputLen);

void MD5Final (unsigned char digest[16]);

输入的时候输入字符数组指针及长度,输出一个char[16]

普通MFC输入密码获得的数据类型为CString

只能加以转换

//CString m_Input

char a[100];

strncpy(a,m_Input,sizeof(a));

MD5Update((unsigned char*)a,m_Input.GetLength());

用函数strncpy将m_Input压入a[100]

输出的时候得到char[16],发现程序实际修改了char单元的数值,和字符无关,相当于一个shortint[16]

由于需要得到CString 的数字编码串[字符串用起来不方便,在ini文件中储存后再读取容易出错]

unsigned char pass1[16];

MD5Final(pass1);

CString pass;

pass.Format("%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i",

pass1[0],

pass1[1],pass1[2],pass1[3],pass1[4],pass1[5],

pass1[6],pass1[7],pass1[8],pass1[9],pass1[10],

pass1[11],pass1[12],pass1[13],pass1[14],pass1[15]);

//return pass;

方法比较笨

把上述加入到下载的类中,可得

//md5.h文件

/******************************************************************************

* Copyright (C) 2000 by Robert Hubley. *

* All rights reserved. *

* *

* This software is provided ``AS IS'' and any express or implied *

* warranties, including, but not limited to, the implied warranties of *

* merchantability and fitness for a particular purpose, are disclaimed. *

* In no event shall the authors be liable for any direct, indirect, *

* incidental, special, exemplary, or consequential damages (including, but *

* not limited to, procurement of substitute goods or services; loss of use, *

* data, or profits; or business interruption) however caused and on any *

* theory of liability, whether in contract, strict liability, or tort *

* (including negligence or otherwise) arising in any way out of the use of *

* this software, even if advised of the possibility of such damage. *

* *

******************************************************************************

MD5.H - header file for MD5C.C

Port to Win32 DLL by Robert Hubley 1/5/2000

Original Copyright:

Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. 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.

*/

/******************************************************************************

* Copyright (C) 2000 by Robert Hubley. *

* All rights reserved. *

* *

* This software is provided ``AS IS'' and any express or implied *

* warranties, including, but not limited to, the implied warranties of *

* merchantability and fitness for a particular purpose, are disclaimed. *

* In no event shall the authors be liable for any direct, indirect, *

* incidental, special, exemplary, or consequential damages (including, but *

* not limited to, procurement of substitute goods or services; loss of use, *

* data, or profits; or business interruption) however caused and on any *

* theory of liability, whether in contract, strict liability, or tort *

* (including negligence or otherwise) arising in any way out of the use of *

* this software, even if advised of the possibility of such damage. *

* *

******************************************************************************

*/

/******************************************************************************

* 2002-4-18 Modified by Liguangyi.

*

* struct MD5_CTX ==> class MD5_CTX.

*

* Take off the Globals Functions *

******************************************************************************

*/

#ifndef _LGY_MD5_H

#define _LGY_MD5_H

/* MD5 Class. */

class MD5_CTX {

public:

MD5_CTX();

virtual ~MD5_CTX();

void MD5Update ( unsigned char *input, unsigned int inputLen);

void MD5Final (unsigned char digest[16]);

private:

unsigned long int state[4]; /* state (ABCD) */

unsigned long int count[2]; /* number of bits,

modulo 2^64 (lsb first) */

unsigned char buffer[64]; /* input buffer */

unsigned char PADDING[64]; /* What? */

private:

void MD5Init ();

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

void MD5_memcpy (unsigned char* output, unsigned char* input,unsigned int len);

void Encode (unsigned char *output, unsigned long int *input,unsigned int len);

void Decode (unsigned long int *output, unsigned char *input, unsigned int len);

void MD5_memset (unsigned char* output,int value,unsigned int len);

public:

CString MakePassMD5(CString m_Input);

};

#endif

//md5.cpp文件

/******************************************************************************

* Copyright (C) 2000 by Robert Hubley. *

* All rights reserved. *

* *

* This software is provided ``AS IS'' and any express or implied *

* warranties, including, but not limited to, the implied warranties of *

* merchantability and fitness for a particular purpose, are disclaimed. *

* In no event shall the authors be liable for any direct, indirect, *

* incidental, special, exemplary, or consequential damages (including, but *

* not limited to, procurement of substitute goods or services; loss of use, *

* data, or profits; or business interruption) however caused and on any *

* theory of liability, whether in contract, strict liability, or tort *

* (including negligence or otherwise) arising in any way out of the use of *

* this software, even if advised of the possibility of such damage. *

* *

******************************************************************************

MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm

Port to Win32 DLL by Robert Hubley 1/5/2000

Original Copyright:

Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. 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 <stdafx.h>//这句十分重要!!

#include "md5.h"

#include ".\md5.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.

*/

#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.

*/

#define ROTATE_LEFT(x, n) (((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.

*/

#define FF(a, b, c, d, x, s, ac) { (a) += F ((b), (c), (d)) + (x) + (unsigned long int)(ac); (a) = ROTATE_LEFT ((a), (s)); (a) += (b); }

#define GG(a, b, c, d, x, s, ac) { (a) += G ((b), (c), (d)) + (x) + (unsigned long int)(ac); (a) = ROTATE_LEFT ((a), (s)); (a) += (b); }

#define HH(a, b, c, d, x, s, ac) { (a) += H ((b), (c), (d)) + (x) + (unsigned long int)(ac); (a) = ROTATE_LEFT ((a), (s)); (a) += (b); }

#define II(a, b, c, d, x, s, ac) { (a) += I ((b), (c), (d)) + (x) + (unsigned long int)(ac); (a) = ROTATE_LEFT ((a), (s)); (a) += (b); }

/* MD5 initialization. Begins an MD5 operation, writing a new context.

*/

MD5_CTX::MD5_CTX()

{

MD5Init ();

}

MD5_CTX::~MD5_CTX()

{

}

void MD5_CTX::MD5Init ()

{

this->count[0] = this->count[1] = 0;

/* Load magic initialization constants.*/

this->state[0] = 0x67452301;

this->state[1] = 0xefcdab89;

this->state[2] = 0x98badcfe;

this->state[3] = 0x10325476;

/* Add by Liguangyi */

MD5_memset(PADDING, 0, sizeof(PADDING));

*PADDING=0x80;

//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 };

}

/* MD5 block update operation. Continues an MD5 message-digest

operation, processing another message block, and updating the

context.

*/

void MD5_CTX::MD5Update (unsigned char *input,unsigned int inputLen)

{

unsigned int i, index, partLen;

/* Compute number of bytes mod 64 */

index = (unsigned int)((this->count[0] >> 3) & 0x3F);

/* Update number of bits */

if ((this->count[0] += ((unsigned long int)inputLen << 3))

< ((unsigned long int)inputLen << 3))

this->count[1]++;

this->count[1] += ((unsigned long int)inputLen >> 29);

partLen = 64 - index;

/* Transform as many times as possible.

*/

if (inputLen >= partLen) {

MD5_memcpy((unsigned char*)&this->buffer[index],

(unsigned char*)input, partLen);

MD5Transform (this->state, this->buffer);

for (i = partLen; i + 63 < inputLen; i += 64)

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

index = 0;

}

else

i = 0;

/* Buffer remaining input */

MD5_memcpy ((unsigned char*)&this->buffer[index], (unsigned char*)&input[i],

inputLen-i);

}

/* MD5 finalization. Ends an MD5 message-digest operation, writing the

the message digest and zeroizing the context.

*/

void MD5_CTX::MD5Final (unsigned char digest[16])

{

unsigned char bits[8];

unsigned int index, padLen;

/* Save number of bits */

Encode (bits, this->count, 8);

/* Pad out to 56 mod 64.

*/

index = (unsigned int)((this->count[0] >> 3) & 0x3f);

padLen = (index < 56) ? (56 - index) : (120 - index);

MD5Update ( PADDING, padLen);

/* Append length (before padding) */

MD5Update (bits, 8);

/* Store state in digest */

Encode (digest, this->state, 16);

/* Zeroize sensitive information.

*/

MD5_memset ((unsigned char*)this, 0, sizeof (*this));

this->MD5Init();

}

/* MD5 basic transformation. Transforms state based on block.

*/

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

{

unsigned long int a = state[0], b = state[1], c = state[2], d = state[3], x[16];

Decode (x, block, 64);

/* 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.

*/

MD5_memset ((unsigned char*)x, 0, sizeof (x));

}

/* Encodes input (unsigned long int) into output (unsigned char). Assumes len is

a multiple of 4.

*/

void MD5_CTX::Encode (unsigned char *output, unsigned long int *input,unsigned int len)

{

unsigned int i, j;

for (i = 0, j = 0; j < len; i++, j += 4) {

output[j] = (unsigned char)(input[i] & 0xff);

output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);

output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);

output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);

}

}

/* Decodes input (unsigned char) into output (unsigned long int). Assumes len is

a multiple of 4.

*/

void MD5_CTX::Decode (unsigned long int *output, unsigned char *input, unsigned int len)

{

unsigned int i, j;

for (i = 0, j = 0; j < len; i++, j += 4)

output[i] = ((unsigned long int)input[j]) | (((unsigned long int)input[j+1])

<< 8) |

(((unsigned long int)input[j+2]) << 16) | (((unsigned long int)input[j+3])

<< 24);

}

/* Note: Replace "for loop" with standard memcpy if possible.

*/

void MD5_CTX::MD5_memcpy (unsigned char* output, unsigned char* input,unsigned int len)

{

unsigned int i;

for (i = 0; i < len; i++)

output[i] = input[i];

}

/* Note: Replace "for loop" with standard memset if possible.

*/

void MD5_CTX::MD5_memset (unsigned char* output,int value,unsigned int len)

{

unsigned int i;

for (i = 0; i < len; i++)

((char *)output)[i] = (char)value;

}

CString MD5_CTX::MakePassMD5(CString m_Input)

{

char a[100];

strncpy(a,m_Input,sizeof(a));

MD5Update((unsigned char*)a,m_Input.GetLength());

unsigned char pass1[16];

MD5Final(pass1);

CString pass;

pass.Format("%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i",

pass1[0],

pass1[1],pass1[2],pass1[3],pass1[4],pass1[5],

pass1[6],pass1[7],pass1[8],pass1[9],pass1[10],

pass1[11],pass1[12],pass1[13],pass1[14],pass1[15]);

//pass

return pass;

}

调用使用方法为

CString num=MD5_CTX::MakePassMD5("Password")

 
 
 
免责声明:本文为网络用户发布,其观点仅代表作者个人观点,与本站无关,本站仅提供信息存储服务。文中陈述内容未经本站证实,其真实性、完整性、及时性本站不作任何保证或承诺,请读者仅作参考,并请自行核实相关内容。
2023年上半年GDP全球前十五强
 百态   2023-10-24
美众议院议长启动对拜登的弹劾调查
 百态   2023-09-13
上海、济南、武汉等多地出现不明坠落物
 探索   2023-09-06
印度或要将国名改为“巴拉特”
 百态   2023-09-06
男子为女友送行,买票不登机被捕
 百态   2023-08-20
手机地震预警功能怎么开?
 干货   2023-08-06
女子4年卖2套房花700多万做美容:不但没变美脸,面部还出现变形
 百态   2023-08-04
住户一楼被水淹 还冲来8头猪
 百态   2023-07-31
女子体内爬出大量瓜子状活虫
 百态   2023-07-25
地球连续35年收到神秘规律性信号,网友:不要回答!
 探索   2023-07-21
全球镓价格本周大涨27%
 探索   2023-07-09
钱都流向了那些不缺钱的人,苦都留给了能吃苦的人
 探索   2023-07-02
倩女手游刀客魅者强控制(强混乱强眩晕强睡眠)和对应控制抗性的关系
 百态   2020-08-20
美国5月9日最新疫情:美国确诊人数突破131万
 百态   2020-05-09
荷兰政府宣布将集体辞职
 干货   2020-04-30
倩女幽魂手游师徒任务情义春秋猜成语答案逍遥观:鹏程万里
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案神机营:射石饮羽
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案昆仑山:拔刀相助
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案天工阁:鬼斧神工
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案丝路古道:单枪匹马
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案镇郊荒野:与虎谋皮
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案镇郊荒野:李代桃僵
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案镇郊荒野:指鹿为马
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案金陵:小鸟依人
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案金陵:千金买邻
 干货   2019-11-12
 
推荐阅读
 
 
 
>>返回首頁<<
 
靜靜地坐在廢墟上,四周的荒凉一望無際,忽然覺得,淒涼也很美
© 2005- 王朝網路 版權所有