Java与C++实现相同的MD5加密算法

转载请注明出处:http://blog.csdn.net/l1028386804/article/details/47025267
1、Java版

package com.lyz.utils.common;

import java.io.UnsupportedEncodingException;
import java.security.MessageDigest;
import java.security.NoSuchAlgorithmException;
/**
 * MD5加密
 * @author liuyazhuang
 */
public class MD5Hash {

    public static String md5Java(String message) {
        String digest = null;
        try {
            MessageDigest md = MessageDigest.getInstance("MD5");
            byte[] hash = md.digest(message.getBytes("UTF-8"));

            //converting byte array to Hexadecimal String
            StringBuilder sb = new StringBuilder(2 * hash.length);
            for (byte b : hash) {
                sb.append(String.format("%02x", b & 0xff));
            }

            digest = sb.toString();

        } catch (UnsupportedEncodingException ex) {
            //Logger.getLogger(StringReplace.class.getName()).log(Level.SEVERE, null, ex);
        } catch (NoSuchAlgorithmException ex) {
            //Logger.getLogger(StringReplace.class.getName()).log(Level.SEVERE, null, ex);
        }
        return digest;
    }
    public static void main(String[] args) {
		System.out.println(md5Java("admin").toUpperCase());
	}
}
2、C++代码
(1)md5.h
#include   <stdio.h>  
#include   <stdlib.h>
#include   <time.h>  
#include   <string.h>  
void   MD5Digest(char   *pszInput,   unsigned   long   nInputSize,   char   *pszOutPut);
(2)md5.cpp

#include   <stdio.h>  
#include   <stdlib.h>
#include   <time.h>  
#include   <string.h>  
#include   "md5.h"

typedef   unsigned   char   *POINTER;  
typedef   unsigned   short   int   UINT2;  
typedef   unsigned   long   int   UINT4;  

typedef   struct    
{  
  UINT4   state[4];  
  UINT4   count[2];  
  unsigned   char   buffer[64];  
}   MD5_CTX;  

void   MD5Init(MD5_CTX   *);  
void   MD5Update(MD5_CTX   *,   unsigned   char   *,   unsigned   int);  
void   MD5Final(unsigned   char   [16],   MD5_CTX   *);  

#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  

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

#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);   }  


inline   void   Encode(unsigned   char   *output,   UINT4   *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);  
  }  
}  

inline   void   Decode(UINT4   *output,   unsigned   char   *input,   unsigned   int   len)  
{  
  unsigned   int   i,   j;  
 
  for   (i   =   0,   j   =   0;   j   <   len;   i++,   j   +=   4)  
    output[i]   =   ((UINT4)input[j])   |   (((UINT4)input[j+1])   <<   8)   |  
  (((UINT4)input[j+2])   <<   16)   |   (((UINT4)input[j+3])   <<   24);  
}  

inline   void   MD5Transform   (UINT4   state[4],   unsigned   char   block[64])  
{  
  UINT4   a   =   state[0],   b   =   state[1],   c   =   state[2],   d   =   state[3],   x[16];  
  Decode   (x,   block,   64);  
  FF   (a,   b,   c,   d,   x[   0],   S11,   0xd76aa478);    
  FF   (d,   a,   b,   c,   x[   1],   S12,   0xe8c7b756);    
  FF   (c,   d,   a,   b,   x[   2],   S13,   0x242070db);    
  FF   (b,   c,   d,   a,   x[   3],   S14,   0xc1bdceee);   
  FF   (a,   b,   c,   d,   x[   4],   S11,   0xf57c0faf);   
  FF   (d,   a,   b,   c,   x[   5],   S12,   0x4787c62a);   
  FF   (c,   d,   a,   b,   x[   6],   S13,   0xa8304613);   
  FF   (b,   c,   d,   a,   x[   7],   S14,   0xfd469501);   
  FF   (a,   b,   c,   d,   x[   8],   S11,   0x698098d8);  
  FF   (d,   a,   b,   c,   x[   9],   S12,   0x8b44f7af);   
  FF   (c,   d,   a,   b,   x[10],   S13,   0xffff5bb1);   
  FF   (b,   c,   d,   a,   x[11],   S14,   0x895cd7be);  
  FF   (a,   b,   c,   d,   x[12],   S11,   0x6b901122);   
  FF   (d,   a,   b,   c,   x[13],   S12,   0xfd987193);  
  FF   (c,   d,   a,   b,   x[14],   S13,   0xa679438e);  
  FF   (b,   c,   d,   a,   x[15],   S14,   0x49b40821);  
  GG   (a,   b,   c,   d,   x[   1],   S21,   0xf61e2562); 
  GG   (d,   a,   b,   c,   x[   6],   S22,   0xc040b340);   
  GG   (c,   d,   a,   b,   x[11],   S23,   0x265e5a51);    
  GG   (b,   c,   d,   a,   x[   0],   S24,   0xe9b6c7aa);    
  GG   (a,   b,   c,   d,   x[   5],   S21,   0xd62f105d);   
  GG   (d,   a,   b,   c,   x[10],   S22,     0x2441453);  
  GG   (c,   d,   a,   b,   x[15],   S23,   0xd8a1e681);   
  GG   (b,   c,   d,   a,   x[   4],   S24,   0xe7d3fbc8);  
  GG   (a,   b,   c,   d,   x[   9],   S21,   0x21e1cde6);   
  GG   (d,   a,   b,   c,   x[14],   S22,   0xc33707d6);  
  GG   (c,   d,   a,   b,   x[   3],   S23,   0xf4d50d87);  
  GG   (b,   c,   d,   a,   x[   8],   S24,   0x455a14ed);  
  GG   (a,   b,   c,   d,   x[13],   S21,   0xa9e3e905);   
  GG   (d,   a,   b,   c,   x[   2],   S22,   0xfcefa3f8);  
  GG   (c,   d,   a,   b,   x[   7],   S23,   0x676f02d9); 
  GG   (b,   c,   d,   a,   x[12],   S24,   0x8d2a4c8a);   
  HH   (a,   b,   c,   d,   x[   5],   S31,   0xfffa3942);  
  HH   (d,   a,   b,   c,   x[   8],   S32,   0x8771f681);  
  HH   (c,   d,   a,   b,   x[11],   S33,   0x6d9d6122);  
  HH   (b,   c,   d,   a,   x[14],   S34,   0xfde5380c);    
  HH   (a,   b,   c,   d,   x[   1],   S31,   0xa4beea44);    
  HH   (d,   a,   b,   c,   x[   4],   S32,   0x4bdecfa9);   
  HH   (c,   d,   a,   b,   x[   7],   S33,   0xf6bb4b60);    
  HH   (b,   c,   d,   a,   x[10],   S34,   0xbebfbc70);   
  HH   (a,   b,   c,   d,   x[13],   S31,   0x289b7ec6);   
  HH   (d,   a,   b,   c,   x[   0],   S32,   0xeaa127fa);  
  HH   (c,   d,   a,   b,   x[   3],   S33,   0xd4ef3085);  
  HH   (b,   c,   d,   a,   x[   6],   S34,     0x4881d05);  
  HH   (a,   b,   c,   d,   x[   9],   S31,   0xd9d4d039);    
  HH   (d,   a,   b,   c,   x[12],   S32,   0xe6db99e5);  
  HH   (c,   d,   a,   b,   x[15],   S33,   0x1fa27cf8);   
  HH   (b,   c,   d,   a,   x[   2],   S34,   0xc4ac5665);  
  II   (a,   b,   c,   d,   x[   0],   S41,   0xf4292244);  
  II   (d,   a,   b,   c,   x[   7],   S42,   0x432aff97);  
  II   (c,   d,   a,   b,   x[14],   S43,   0xab9423a7);   
  II   (b,   c,   d,   a,   x[   5],   S44,   0xfc93a039);   
  II   (a,   b,   c,   d,   x[12],   S41,   0x655b59c3);  
  II   (d,   a,   b,   c,   x[   3],   S42,   0x8f0ccc92);   
  II   (c,   d,   a,   b,   x[10],   S43,   0xffeff47d);   
  II   (b,   c,   d,   a,   x[   1],   S44,   0x85845dd1);   
  II   (a,   b,   c,   d,   x[   8],   S41,   0x6fa87e4f);    
  II   (d,   a,   b,   c,   x[15],   S42,   0xfe2ce6e0);  
  II   (c,   d,   a,   b,   x[   6],   S43,   0xa3014314);  
  II   (b,   c,   d,   a,   x[13],   S44,   0x4e0811a1);  
  II   (a,   b,   c,   d,   x[   4],   S41,   0xf7537e82);  
  II   (d,   a,   b,   c,   x[11],   S42,   0xbd3af235);  
  II   (c,   d,   a,   b,   x[   2],   S43,   0x2ad7d2bb);   
  II   (b,   c,   d,   a,   x[   9],   S44,   0xeb86d391);  
  state[0]   +=   a;  
  state[1]   +=   b;  
  state[2]   +=   c;  
  state[3]   +=   d;  
  memset   ((POINTER)x,   0,   sizeof   (x));  
  }  
   
inline   void   MD5Init(MD5_CTX   *context)  
{  
  context->count[0]   =   context->count[1]   =   0;  
  context->state[0]   =   0x67452301;  
  context->state[1]   =   0xefcdab89;  
  context->state[2]   =   0x98badcfe;  
  context->state[3]   =   0x10325476;  
}  

inline   void   MD5Update(MD5_CTX   *context,   unsigned   char   *input,   unsigned   int   inputLen)  
{  
  unsigned   int   i,   index,   partLen;  
 
  index   =   (unsigned   int)((context->count[0]   >>   3)   &   0x3F);  
  if   ((context->count[0]   +=   ((UINT4)inputLen   <<   3))  
    <   ((UINT4)inputLen   <<   3))  
    context->count[1]++;  
  context->count[1]   +=   ((UINT4)inputLen   >>   29);  
 
  partLen   =   64   -   index;  
 
  if   (inputLen   >=   partLen)   {  
    memcpy((POINTER)&context->buffer[index],   (POINTER)input,   partLen);  
    MD5Transform(context->state,   context->buffer);  
    
    for   (i   =   partLen;   i   +   63   <   inputLen;   i   +=   64)  
      MD5Transform   (context->state,   &input[i]);  
    index   =   0;  
  }  
  else  
    i   =   0;  
 
  memcpy((POINTER)&context->buffer[index],   (POINTER)&input[i],   inputLen-i);  
}  

inline   void   MD5Final(unsigned   char   digest[16],   MD5_CTX   *context)  
{  
  unsigned   char   bits[8];  
  unsigned   int   index,   padLen;  
 
  Encode   (bits,   context->count,   8);  
  index   =   (unsigned   int)((context->count[0]   >>   3)   &   0x3f);  
  padLen   =   (index   <   56)   ?   (56   -   index)   :   (120   -   index);  
  MD5Update   (context,   PADDING,   padLen);  
  MD5Update   (context,   bits,   8);  
  Encode   (digest,   context->state,   16);  
  memset   ((POINTER)context,   0,   sizeof   (*context));  
  }  

void   MD5Digest(char   *pszInput,   unsigned   long   nInputSize,   char   *pszOutPut)  
{  
  MD5_CTX   context;  
  unsigned   int   len   =   strlen   (pszInput);  
 
  MD5Init   (&context);  
  MD5Update   (&context,   (unsigned   char   *)pszInput,   len);  
  MD5Final   ((unsigned   char   *)pszOutPut,   &context);  
}  

main()  
{ char szDigest[16];  
  char encrypt[200];  
  printf("请输入要计算MD5值的字符串:");
  gets(encrypt);
  printf("\n加密结果:");
  MD5Digest(encrypt,strlen(encrypt),szDigest);  
  int i;
  for (i=0;i<16;i++) printf ("%02X",(unsigned char)szDigest[i]);
  getchar();

}
3、运行效果

这里我们都以输入123456为例

(1)java输出结果如下:

(2)C++输出结果如下:


  • 3
    点赞
  • 3
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 3
    评论
md5c++实现md5算法. 开发平台 Ubuntu14.04 运行 sudo get-apt install g++ make ./md5_test md5简介 消息摘要算法第五版(英语:Message-Digest Algorithm 5,缩写为MD5),是当前计算机领域用于确保信息传输完整一致而广泛使用的散列算法之一(又译哈希算法、摘要算法等),主流编程语言普遍已有MD5实现。将数据 (如一段文字)运算变为另一固定长度值,是散列算法的基础原理,MD5的前身有MD2、MD3和MD4。MD5由MD4、MD3、MD2改进而来,主要增强算法复杂度和不可逆性。目前,MD5算法因其普遍、稳定、快速的特点,仍广泛应用于普通 数据的错误检查领域。例如在一些BitTorrent下载中,软件将通过计算MD5检验下载到的文件片段的完整性。MD5已经广泛使用在为文件传输提供一定的可靠性方面。例如,服务器预先提供一个MD5校验和,用户下载完文件以后, 用MD5算法计算下载文件的MD5校验和,然后通过检查这两个校验和是否一致,就能判断下载的文件是否出错。MD5是输入不定长度信息,输出固定长度128-bits的算法。经过程序流程,生成四个32位数据,最后联合起来成为一个 128-bits散列。基本方式为,求余、取余、调整长度、与链接变量进行循环运算。得出结果。 md5算法描述 假设输入信息(input message)的长度为b(bit),我们想要产生它的报文摘要,在此处b为任意的非负整数:b也可能为0,也不一定为8的整数倍,且可能是任意大的长度。设该信息的比特流表示如下: M[0] M[1] M[2] ... M[b-1] 计算此信息的报文摘要需要如下5步: 1.补位 信息计算前先要进行位补位,设补位后信息的长度为LEN(bit),则LEN%512 = 448(bit),即数据扩展至 K * 512 + 448(bit)。即K * 64+56(byte),K为整数。补位操作始终要执行,即使补位前信息的长度对512求余的结果是448。具体补位操作:补一个1,然后补0至满足上述要求。总共最少要补1bit,最多补512bit。 2.尾部加上信息长度 将输入信息的原始长度b(bit)表示成一个64-bit的数字,把它添加到上一步的结果后面(在32位的机器上,这64位将用2个字来表示并且低位在前)。当遇到b大于2^64这种极少的情况时,b的高位被截去,仅使用b的低64位。经过上面两步,数据就被填补成长度为512(bit)的倍数。也就是说,此时的数据长度是16个字(32byte)的整数倍。此时的数据表示为: M[0 ... N-1] 其中的N是16的倍数。 3.初始化缓存区 用一个四个字的缓冲器(A,B,C,D)来计算报文摘要,A,B,C,D分别是32位的寄存器,初始化使用的是十六进制表示的数字,注意低字节在前: word A: 01 23 45 67 word B: 89 ab cd ef word C: fe dc ba 98 word D: 76 54 32 10 4.转换 首先定义4个辅助函数,每个函数的输入是三个32位的字,输出是一个32位的字: F(X,Y,Z) = XY v not(X) Z G(X,Y,Z) = XZ v Y not(Z) H(X,Y,Z) = X xor Y xor Z I(X,Y,Z) = Y xor (X v not(Z)) FF(a,b,c,d,Mj,s,ti)表示 a = b + ((a + F(b,c,d) + Mj + ti) << s) GG(a,b,c,d,Mj,s,ti)表示 a = b + ((a + G(b,c,d) + Mj + ti) << s) HH(a,b,c,d,Mj,s,ti)表示 a = b + ((a + H(b,c,d) + Mj + ti) << s) Ⅱ(a,b,c,d,Mj,s,ti)表示 a = b + ((a + I(b,c,d) + Mj + ti) << s) 这四轮(64步)是: 第一轮 FF(a,b,c,d,M0,7,0xd76aa478) FF(d,a,b,c,M1,12,0xe8c7b756) FF(c,d,a,b,M2,17,0x242070db) FF(b,c,d,a,M3,22,0xc1bdceee) FF(a,b,c,d,M4,7,0xf57c0faf) FF(d,a,b,c,M5,12,0x4787c62a) FF(c,d,a,b,M6,17,0xa8304613) FF(b,c,d,a,M7,22,0xfd469501) FF(a,b,c,d,M8,7,0x698098d8) FF(d,a,b,c,M9,12,0x8b44f7af) FF(c,d,a,b,M10,17,0xffff5bb1) FF(b,c,d,a,M11,22,0x895cd7be) FF(a,b,c,d,M12,7,0x6b901122) FF(d,a,b,c,M13,12,0xfd987193) FF(c,d,a,b,M14,17,0xa679438e) FF(b,c,d,a,M15,22,0x49b40821) 第二轮 GG(a,b,c,d,M1,5,0xf61e2562) GG(d,a,b,c,M6,9,0xc040b340) GG(c,d,a,b,M11,14,0x265e5a51) GG(b,c,d,a,M0,20,0xe9b6c7aa) GG(a,b,c,d,M5,5,0xd62f105d) GG(d,a,b,c,M10,9,0x02441453) GG(c,d,a,b,M15,14,0xd8a1e681) GG(b,c,d,a,M4,20,0xe7d3fbc8) GG(a,b,c,d,M9,5,0x21e1cde6) GG(d,a,b,c,M14,9,0xc33707d6) GG(c,d,a,b,M3,14,0xf4d50d87) GG(b,c,d,a,M8,20,0x455a14ed) GG(a,b,c,d,M13,5,0xa9e3e905) GG(d,a,b,c,M2,9,0xfcefa3f8) GG(c,d,a,b,M7,14,0x676f02d9) GG(b,c,d,a,M12,20,0x8d2a4c8a) 第三轮 HH(a,b,c,d,M5,4,0xfffa3942) HH(d,a,b,c,M8,11,0x8771f681) HH(c,d,a,b,M11,16,0x6d9d6122) HH(b,c,d,a,M14,23,0xfde5380c) HH(a,b,c,d,M1,4,0xa4beea44) HH(d,a,b,c,M4,11,0x4bdecfa9) HH(c,d,a,b,M7,16,0xf6bb4b60) HH(b,c,d,a,M10,23,0xbebfbc70) HH(a,b,c,d,M13,4,0x289b7ec6) HH(d,a,b,c,M0,11,0xeaa127fa) HH(c,d,a,b,M3,16,0xd4ef3085) HH(b,c,d,a,M6,23,0x04881d05) HH(a,b,c,d,M9,4,0xd9d4d039) HH(d,a,b,c,M12,11,0xe6db99e5) HH(c,d,a,b,M15,16,0x1fa27cf8) HH(b,c,d,a,M2,23,0xc4ac5665) 第四轮 Ⅱ(a,b,c,d,M0,6,0xf4292244) Ⅱ(d,a,b,c,M7,10,0x432aff97) Ⅱ(c,d,a,b,M14,15,0xab9423a7) Ⅱ(b,c,d,a,M5,21,0xfc93a039) Ⅱ(a,b,c,d,M12,6,0x655b59c3) Ⅱ(d,a,b,c,M3,10,0x8f0ccc92) Ⅱ(c,d,a,b,M10,15,0xffeff47d) Ⅱ(b,c,d,a,M1,21,0x85845dd1) Ⅱ(a,b,c,d,M8,6,0x6fa87e4f) Ⅱ(d,a,b,c,M15,10,0xfe2ce6e0) Ⅱ(c,d,a,b,M6,15,0xa3014314) Ⅱ(b,c,d,a,M13,21,0x4e0811a1) Ⅱ(a,b,c,d,M4,6,0xf7537e82) Ⅱ(d,a,b,c,M11,10,0xbd3af235) Ⅱ(c,d,a,b,M2,15,0x2ad7d2bb) Ⅱ(b,c,d,a,M9,21,0xeb86d391)

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 3
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

冰 河

可以吃鸡腿么?

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值