发表时间:2007-8-7 13:22:00

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

C++ MD5类源文件相关推荐

  1. 封装好的C++ md5类

    博客转载自:http://blog.csdn.net/lindexi_gd/article/details/47005093 在网上看到很多md5类,不过封好的很少,我就在网上看到一篇把他写的封装 头 ...

  2. java md5类_java的md5加密类

    MD5算法是将数据进行不可逆加密的算法有较好的安全性,在国内如寿信的安全支付平台就采用此算法. 源代码如下 /********************************************* ...

  3. php.ini maxfileuploads,细说PHP高洛峰文件上传类源文件

    以下是兄弟连php视频教程中高洛峰老师所教授的文件上传类的源代码,尚没有完全理解精髓,在这里记录一下,供日后有需要时查看: $value){ $key=strtolower($key); if(!in ...

  4. [CTF] 关于php代码审计的MD5类的练习

    题目环境 练习1 PHP代码: <?phperror_reporting(0);highlight_file("pass-01.php");if(isset($_GET[&q ...

  5. java产生字符函数_java生成字符串md5函数类(javaSE)

    //实现生成MD5值 import java.io.BufferedInputStream; import java.io.ByteArrayInputStream; import java.io.B ...

  6. 使用maven根据JSON文件自动生成Java POJO类(Java Bean)源文件

    根据JSON文件自动生成Java POJO类(Java Bean)源文件 本文介绍使用程序jsonschema2pojo来自动生成Java的POJO类源文件,本文主要使用maven,其他构建工具请参考 ...

  7. C# 使用MD5加密工具类(MD5CryptoServiceProvider)

    提示:开放环境在Windows,使用Winform. 文章目录 前言 一.MD5是什么? 二.使用步骤 1.引入库 2.读入数据 总结 前言 因为有安全隐患,所以都会考虑加密密码或者其它的信息,所以今 ...

  8. java md5 decode_Java MD5加密类

    1 /*************************************************2 md5 类实现了RSA Data Security, Inc.在提交给IETF3 的RFC1 ...

  9. Java经典代码工具类2

    转自: https://www.iteye.com/blog/wuhaidong-1668689 package com.common.file; import java.io.File; impor ...

最新文章

  1. 苹果文档 UISearchController的介绍
  2. Android开发--Input/OutputStream操作
  3. python列表按照指定顺序排序-python列表排序、字典排序、列表中字典排序
  4. hdu 2454 Degree Sequence of Graph G(可简单图化判定)
  5. Modbus协议栈开发笔记之八:Modbus ASCII Master开发
  6. websocket的加密和解密过程
  7. 昨天凌晨故宫网站崩了,被众多人“围攻”!留言亮了...
  8. java证明角谷猜想_Java 代码界 3% 的王者?看我是如何解错这 5 道题的
  9. python是免费的、开源的、跨平台的_NovalIDE是一款开源,跨平台,而且免费的国产Python IDE。...
  10. 《穿越计算机的迷雾》读书笔记九
  11. 一小时搞定 简单VBA编程 Excel宏编程快速扫盲
  12. (黑)群晖系统 ds photo 相机自动备份 无法识别DICM下的Camera解决方案
  13. localhost拒绝连接解决办法
  14. 程序人生 - 水的TDS值是什么意思?多少才算健康?
  15. 5个免费的AI智能抠图工具,一键去除图片背景!
  16. 科拉茨猜想c语言编写,辽宁省沈阳市第一七O中学2019-2020学年高二数学上学期阶段性测试试题(2)文...
  17. 如何将网易云音乐的歌单同步到spotify
  18. OBS 进阶 之 高分屏下 屏幕采集不全问题解决
  19. 8家公司笔面试经历-百度-联发科-瑞晟
  20. 2016年蓝桥杯A组 第九题 密码脱落

热门文章

  1. 如何正确运用计算机,如何正确使用电脑
  2. kali64位下载怎么是AMD_AMD平台虚拟机安装macOS Sierra方法
  3. .bak 服务器备份文件,如何从SQL Server Management Studio中的多个备份(bak)文件还原数据库...
  4. 【C++】46.宏定义##连接符和符#的使用
  5. SVM学习(一):SVM概念
  6. 图像分割之(三)从Graph Cut到Grab Cut
  7. JQuery 总结(7) index() data() each() 选项卡 表单验证
  8. git add -u与-A .三者的区别
  9. 通过索引优化含ORDER BY的MySQL语句
  10. matlab连接字符串