Java开发网 - MD5 算法的Java Bean

Java开发网

您没有登录

» Java开发网 » Java程序分享区

打印话题 寄给朋友 订阅主题

作者

MD5 算法的Java Bean

YuLimin

简单就是美

版主

发贴: 866

于 2005-04-10 14:02

import java.lang.reflect.*;

/**
* MD5 算法的Java Bean
* MD5 类实现了RSA Data Security, Inc.在提交给IETF 的RFC1321中的MD5 message-digest 算法。
*/
public class MD5
{
//下面这些S11-S44实际上是一个4*4的矩阵，在原始的C实现中是用#define 实现的，这里把它们实现成为static final是表示了只读，切能在同一个进程空间内的多个Instance间共享
static final int S11 = 7;
static final int S12 = 12;
static final int S13 = 17;
static final int S14 = 22;

static final int S21 = 5;
static final int S22 = 9;
static final int S23 = 14;
static final int S24 = 20;

static final int S31 = 4;
static final int S32 = 11;
static final int S33 = 16;
static final int S34 = 23;

static final int S41 = 6;
static final int S42 = 10;
static final int S43 = 15;
static final int S44 = 21;

static final byte[] PADDING =
{ -128,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计算过程中用到的3个核心数据，在原始的C实现中被定义到MD5_CTX结构中
private long[] state = new long[4]; // state (ABCD)
private long[] count = new long[2]; // number of bits, modulo 2^64 (lsb first)
private byte[] buffer = new byte[64]; // input buffer

//digestHexStr是MD5的唯一一个公共成员，是最新一次计算结果的16进制ASCII表示.
public String digestHexStr;

//digest,是最新一次计算结果的2进制内部表示，表示128bit的MD5值.
private byte[] digest = new byte[16];

//getMD5ofStr是类MD5最主要的公共方法，入口参数是你想要进行MD5变换的字符串返回的是变换完的结果，这个结果是从公共成员digestHexStr取得的．
public String getMD5ofStr(String inbuf)
{
md5Init();
md5Update(inbuf.getBytes(),inbuf.length());
md5Final();
digestHexStr = "";
for(int i = 0;i < 16;i++)
{
digestHexStr += byteHEX(digest[i]);
}
return digestHexStr;
}

// 这是MD5这个类的标准构造函数，JavaBean要求有一个public的并且没有参数的构造函数
public MD5()
{
md5Init();
return;
}

//md5Init是一个初始化函数，初始化核心变量，装入标准的幻数
private void md5Init()
{
count[0] = 0L;
count[1] = 0L;
//Load magic initialization constants.

state[0] = 0x67452301L;
state[1] = 0xefcdab89L;
state[2] = 0x98badcfeL;
state[3] = 0x10325476L;

return;
}

/* F, G, H ,I 是4个基本的MD5函数，在原始的MD5的C实现中，由于它们是简单的位运算，可能出于效率的考虑把它们实现成了宏，在java中，我们把它们实现成了private方法，名字保持了原来C中的。 */
private long F(long x,long y,long z)
{
return(x & y) | ((~x) & z);
}

private long G(long x,long y,long z)
{
return(x & z) | (y & (~z));
}

private long H(long x,long y,long z)
{
return x ^ y ^ z;
}

private long I(long x,long y,long z)
{
return y ^ (x | (~z));
}

/*
FF,GG,HH和II将调用F,G,H,I进行近一步变换FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
Rotation is separate from addition to prevent recomputation.
*/
private long FF(long a,long b,long c,long d,long x,long s,long ac)
{
a += F(b,c,d) + x + ac;
a = ((int)a << s) | ((int)a >>> (32 - s));
a += b;
return a;
}

private long GG(long a,long b,long c,long d,long x,long s,long ac)
{
a += G(b,c,d) + x + ac;
a = ((int)a << s) | ((int)a >>> (32 - s));
a += b;
return a;
}

private long HH(long a,long b,long c,long d,long x,long s,long ac)
{
a += H(b,c,d) + x + ac;
a = ((int)a << s) | ((int)a >>> (32 - s));
a += b;
return a;
}

private long II(long a,long b,long c,long d,long x,long s,long ac)
{
a += I(b,c,d) + x + ac;
a = ((int)a << s) | ((int)a >>> (32 - s));
a += b;
return a;
}

//md5Update是MD5的主计算过程，inbuf是要变换的字节串，inputlen是长度，这个函数由getMD5ofStr调用，调用之前需要调用md5init，因此把它设计成private的
private void md5Update(byte[] inbuf,int inputLen)
{
int i,index,partLen;
byte[] block = new byte[64];
index = (int)(count[0] >>> 3) & 0x3F;
//Update number of bits
if((count[0] += (inputLen << 3)) < (inputLen << 3))
{
count[1]++;
}
count[1] += (inputLen >>> 29);

partLen = 64 - index;

//Transform as many times as possible.
if(inputLen >= partLen)
{
md5Memcpy(buffer,inbuf,index,0,partLen);
md5Transform(buffer);

for(i = partLen;i + 63 < inputLen;i += 64)
{
md5Memcpy(block,inbuf,0,i,64);
md5Transform(block);
}
index = 0;
}
else
{
i = 0;
}
//Buffer remaining input
md5Memcpy(buffer,inbuf,index,i,inputLen - i);
}

//md5Final整理和填写输出结果
private void md5Final()
{
byte[] bits = new byte[8];
int index,padLen;

//Save number of bits
Encode(bits,count,8);

//Pad out to 56 mod 64.
index = (int)(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,state,16);
}

//md5Memcpy是一个内部使用的byte数组的块拷贝函数，从input的inpos开始把len长度的字节拷贝到output的outpos位置开始
private void md5Memcpy(byte[] output,byte[] input,int outpos,int inpos,int len)
{
int i;
for(i = 0;i < len;i++)
{
output[outpos + i] = input[inpos + i];
}
}

//md5Transform是MD5核心变换程序，有md5Update调用，block是分块的原始字节
private void md5Transform(byte block[])
{
long a = state[0],b = state[1],c = state[2],d = state[3];
long[] x = new long[16];

Decode(x,block,64);

/* Round 1 */
a = FF(a,b,c,d,x[0],S11,0xd76aa478L); /* 1 */
d = FF(d,a,b,c,x[1],S12,0xe8c7b756L); /* 2 */
c = FF(c,d,a,b,x[2],S13,0x242070dbL); /* 3 */
b = FF(b,c,d,a,x[3],S14,0xc1bdceeeL); /* 4 */
a = FF(a,b,c,d,x[4],S11,0xf57c0fafL); /* 5 */
d = FF(d,a,b,c,x[5],S12,0x4787c62aL); /* 6 */
c = FF(c,d,a,b,x[6],S13,0xa8304613L); /* 7 */
b = FF(b,c,d,a,x[7],S14,0xfd469501L); /* 8 */
a = FF(a,b,c,d,x[8],S11,0x698098d8L); /* 9 */
d = FF(d,a,b,c,x[9],S12,0x8b44f7afL); /* 10 */
c = FF(c,d,a,b,x[10],S13,0xffff5bb1L); /* 11 */
b = FF(b,c,d,a,x[11],S14,0x895cd7beL); /* 12 */
a = FF(a,b,c,d,x[12],S11,0x6b901122L); /* 13 */
d = FF(d,a,b,c,x[13],S12,0xfd987193L); /* 14 */
c = FF(c,d,a,b,x[14],S13,0xa679438eL); /* 15 */
b = FF(b,c,d,a,x[15],S14,0x49b40821L); /* 16 */

/* Round 2 */
a = GG(a,b,c,d,x[1],S21,0xf61e2562L); /* 17 */
d = GG(d,a,b,c,x[6],S22,0xc040b340L); /* 18 */
c = GG(c,d,a,b,x[11],S23,0x265e5a51L); /* 19 */
b = GG(b,c,d,a,x[0],S24,0xe9b6c7aaL); /* 20 */
a = GG(a,b,c,d,x[5],S21,0xd62f105dL); /* 21 */
d = GG(d,a,b,c,x[10],S22,0x2441453L); /* 22 */
c = GG(c,d,a,b,x[15],S23,0xd8a1e681L); /* 23 */
b = GG(b,c,d,a,x[4],S24,0xe7d3fbc8L); /* 24 */
a = GG(a,b,c,d,x[9],S21,0x21e1cde6L); /* 25 */
d = GG(d,a,b,c,x[14],S22,0xc33707d6L); /* 26 */
c = GG(c,d,a,b,x[3],S23,0xf4d50d87L); /* 27 */
b = GG(b,c,d,a,x[8],S24,0x455a14edL); /* 28 */
a = GG(a,b,c,d,x[13],S21,0xa9e3e905L); /* 29 */
d = GG(d,a,b,c,x[2],S22,0xfcefa3f8L); /* 30 */
c = GG(c,d,a,b,x[7],S23,0x676f02d9L); /* 31 */
b = GG(b,c,d,a,x[12],S24,0x8d2a4c8aL); /* 32 */

/* Round 3 */
a = HH(a,b,c,d,x[5],S31,0xfffa3942L); /* 33 */
d = HH(d,a,b,c,x[8],S32,0x8771f681L); /* 34 */
c = HH(c,d,a,b,x[11],S33,0x6d9d6122L); /* 35 */
b = HH(b,c,d,a,x[14],S34,0xfde5380cL); /* 36 */
a = HH(a,b,c,d,x[1],S31,0xa4beea44L); /* 37 */
d = HH(d,a,b,c,x[4],S32,0x4bdecfa9L); /* 38 */
c = HH(c,d,a,b,x[7],S33,0xf6bb4b60L); /* 39 */
b = HH(b,c,d,a,x[10],S34,0xbebfbc70L); /* 40 */
a = HH(a,b,c,d,x[13],S31,0x289b7ec6L); /* 41 */
d = HH(d,a,b,c,x[0],S32,0xeaa127faL); /* 42 */
c = HH(c,d,a,b,x[3],S33,0xd4ef3085L); /* 43 */
b = HH(b,c,d,a,x[6],S34,0x4881d05L); /* 44 */
a = HH(a,b,c,d,x[9],S31,0xd9d4d039L); /* 45 */
d = HH(d,a,b,c,x[12],S32,0xe6db99e5L); /* 46 */
c = HH(c,d,a,b,x[15],S33,0x1fa27cf8L); /* 47 */
b = HH(b,c,d,a,x[2],S34,0xc4ac5665L); /* 48 */

/* Round 4 */
a = II(a,b,c,d,x[0],S41,0xf4292244L); /* 49 */
d = II(d,a,b,c,x[7],S42,0x432aff97L); /* 50 */
c = II(c,d,a,b,x[14],S43,0xab9423a7L); /* 51 */
b = II(b,c,d,a,x[5],S44,0xfc93a039L); /* 52 */
a = II(a,b,c,d,x[12],S41,0x655b59c3L); /* 53 */
d = II(d,a,b,c,x[3],S42,0x8f0ccc92L); /* 54 */
c = II(c,d,a,b,x[10],S43,0xffeff47dL); /* 55 */
b = II(b,c,d,a,x[1],S44,0x85845dd1L); /* 56 */
a = II(a,b,c,d,x[8],S41,0x6fa87e4fL); /* 57 */
d = II(d,a,b,c,x[15],S42,0xfe2ce6e0L); /* 58 */
c = II(c,d,a,b,x[6],S43,0xa3014314L); /* 59 */
b = II(b,c,d,a,x[13],S44,0x4e0811a1L); /* 60 */
a = II(a,b,c,d,x[4],S41,0xf7537e82L); /* 61 */
d = II(d,a,b,c,x[11],S42,0xbd3af235L); /* 62 */
c = II(c,d,a,b,x[2],S43,0x2ad7d2bbL); /* 63 */
b = II(b,c,d,a,x[9],S44,0xeb86d391L); /* 64 */

state[0] += a;
state[1] += b;
state[2] += c;
state[3] += d;
}

//Encode把long数组按顺序拆成byte数组，因为java的long类型是64bit的，只拆低32bit，以适应原始C实现的用途
private void Encode(byte[] output,long[] input,int len)
{
int i,j;

for(i = 0,j = 0;j < len;i++,j += 4)
{
output[j] = (byte)(input[i] & 0xffL);
output[j + 1] = (byte)((input[i] >>> 8) & 0xffL);
output[j + 2] = (byte)((input[i] >>> 16) & 0xffL);
output[j + 3] = (byte)((input[i] >>> 24) & 0xffL);
}
}

//Decode把byte数组按顺序合成成long数组，因为java的long类型是64bit的，只合成低32bit，高32bit清零，以适应原始C实现的用途
private void Decode(long[] output,byte[] input,int len)
{
int i,j;
for(i = 0,j = 0;j < len;i++,j += 4)
{
output[i] = b2iu(input[j]) | (b2iu(input[j + 1]) << 8) | (b2iu(input[j + 2]) << 16) | (b2iu(input[j + 3]) << 24);
}
return;
}

//b2iu是一个把byte按照不考虑正负号的原则的＂升位＂程序，因为java没有unsigned运算
public static long b2iu(byte b)
{
return b < 0 ? b & 0x7F + 128 : b;
}

//byteHEX()，用来把一个byte类型的数转换成十六进制的ASCII表示，因为java中的byte的toString无法实现这一点，我们又没有C语言中的sprintf(outbuf,"%02X",ib)
public static String byteHEX(byte ib)
{
char[] Digit =
{'0','1','2','3','4','5','6','7','8','9',
'A','B','C','D','E','F'};
char[] ob = new char[2];
ob[0] = Digit[(ib >>> 4) & 0X0F];
ob[1] = Digit[ib & 0X0F];
String s = new String(ob);
return s;
}

public static void main(String args[])
{
MD5 m = new MD5();
if(Array.getLength(args) == 0)
{
//如果没有参数，执行标准的Test Suite
System.out.println("MD5 Test suite:");
System.out.println("MD5(\"\"):" + m.getMD5ofStr(""));
System.out.println("MD5(\"16899168\"):" + m.getMD5ofStr("16899168"));//77604D727334C3D1B074DBFC1B5E1B9C
System.out.println("MD5(\"password\"):" + m.getMD5ofStr("password"));//5F4DCC3B5AA765D61D8327DEB882CF99
System.out.println("MD5(\"a\"):" + m.getMD5ofStr("a"));
System.out.println("MD5(\"abc\"):" + m.getMD5ofStr("abc"));
System.out.println("MD5(\"message digest\"):" + m.getMD5ofStr("message digest"));
System.out.println("MD5(\"abcdefghijklmnopqrstuvwxyz\"):" + m.getMD5ofStr("abcdefghijklmnopqrstuvwxyz"));
System.out.println("MD5(\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\"):" + m.getMD5ofStr("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789"));
}
else
{
System.out.println("MD5(" + args[0] + ")=" + m.getMD5ofStr(args[0]));
}
}
}

　当兵不后悔！后悔不当兵！　
超越黎明时空，追逐时代潮流！
人，是要靠自己的！简单就是美！
我的Java：http://www.Java2Class.net
我的Blog：http://YuLimin.ItEye.com

作者

Re:MD5 算法的Java Bean [Re:YuLimin]

YuLimin

简单就是美

版主

发贴: 866

于 2005-04-10 14:17

//节省资源的MD5算法
//为一个字节或字符数组或串计算md5值，内部只创建一个数组，节省分配时间，节省内存
//完全是static方法，线程安全
//注意对返回值的处理，见注释

public final class Md5
{
  /** return BytesMd5 (bytes, 0, Integer.MAX_VALUE) */
  public static int[] BytesMd5(byte[] bytes)
  {
    return BytesMd5(bytes, 0, Integer.MAX_VALUE);
  }

  /**
   * give the bytes and get the md result
   * null bytes means from and end1 is 0
   * return value is locally allocated array
   * return[0] is highest 32 bits, return[3] is lowest 32 bits
   * (((long)return[0]) << 32) | (return[1] & 0xFFFFFFFFL) is high 64 bits
   * (((long)return[2]) << 32) | (return[3] & 0xFFFFFFFFL) is low 64 bits
   * thread-safe without synchronized
   */
  public static int[] BytesMd5(byte[] bytes, int from, int end1)
  {
//    bytes = Util.MaskNull(bytes);
//    from = Util.Bound(from, 0, bytes.length);
//    end1 = Util.Bound(end1, from, bytes.length);
/** !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
  add code for checking the arguments here
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!*/

    int[] x = new int[20]; // x[16-19] means the md result in little-endian
    x[16] = 0x67452301;
    x[17] = 0xEFCDAB89;
    x[18] = 0x98BADCFE;
    x[19] = 0x10325476;
    int n;
    int d;
    for (n = 0, d = from; d < end1 - 3; d += 4)
    {
      x[n++] = (bytes[d] & 0xFF) | ((bytes[d + 1] & 0xFF) << 8) //
        | ((bytes[d + 2] & 0xFF) << 16) | ((bytes[d + 3] & 0xFF) << 24);
      if (n == 16)
      {
        Transform(x);
        n = 0;
      }
    }
    if (d == end1)
      x[n++] = 0x80;
    else if (d == end1 - 1)
      x[n++] = (bytes[d] & 0xFF) | 0x8000;
    else if (d == end1 - 2)
      x[n++] = (bytes[d] & 0xFF) | ((bytes[d + 1] & 0xFF) << 8) | 0x800000;
    else /* d == len - 3 */
      x[n++] = (bytes[d] & 0xFF) | ((bytes[d + 1] & 0xFF) << 8) //
        | ((bytes[d + 2] & 0xFF) << 16) | 0x80000000;
    if (n == 15)
      x[n++] = 0;
    if (n == 16)
    {
      Transform(x);
      n = 0;
    }
    if (n < 14)
      for ( ; n < 14; n++)
        x[n] = 0;
    x[14] = (end1 - from) << 3;
    x[15] = (end1 - from) >> 29;
    Transform(x);
    x[0] = x[19];
    x[1] = x[18];
    x[2] = x[17];
    x[3] = x[16];
    return x;
  }

  /** return UnicodeMd5 (chars, 0, Integer.MAX_VALUE) */
  public static int[] UnicodeMd5(char[] chars)
  {
    return UnicodeMd5(chars, 0, Integer.MAX_VALUE);
  }

  /**
   * give the unicode chars and get the md result
   * null chars means from and end1 is 0
   * each unicode char is treated as two bytes in big-endian
   * return value is locally allocated array
   * return[0] is highest 32 bits, return[3] is lowest 32 bits
   * (((long)return[0]) << 32) | (return[1] & 0xFFFFFFFFL) is high 64 bits
   * (((long)return[2]) << 32) | (return[3] & 0xFFFFFFFFL) is low 64 bits
   * thread-safe without synchronized
   */
  public static int[] UnicodeMd5(char[] chars, int from, int end1)
  {
//    chars = Util.MaskNull(chars);
//    from = Util.Bound(from, 0, chars.length);
//    end1 = Util.Bound(end1, from, chars.length);
/** !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
  add code for checking the arguments here
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!*/
    int[] x = new int[20]; // x[16-19] means the md result in little-endian
    x[16] = 0x67452301;
    x[17] = 0xEFCDAB89;
    x[18] = 0x98BADCFE;
    x[19] = 0x10325476;
    int n;
    int d;
    for (n = 0, d = from; d < end1 - 1; d += 2)
    {
      x[n++] = (chars[d] >>> 8) | ((chars[d] & 0xFF) << 8) //
        | ((chars[d + 1] >>> 8) << 16) | ((chars[d + 1] & 0xFF) << 24);
      if (n == 16)
      {
        Transform(x);
        n = 0;
      }
    }
    if (d == end1)
      x[n++] = 0x80;
    else /* d == end1 - 1 */
      x[n++] = (chars[d] >>> 8) | ((chars[d] & 0xFF) << 8) | 0x800000;
    if (n == 15)
      x[n++] = 0;
    if (n == 16)
    {
      Transform(x);
      n = 0;
    }
    if (n < 14)
      for ( ; n < 14; n++)
        x[n] = 0;
    x[14] = (end1 - from) << 4;
    x[15] = (end1 - from) >> 28;
    Transform(x);
    x[0] = x[19];
    x[1] = x[18];
    x[2] = x[17];
    x[3] = x[16];
    return x;
  }

  /** return UnicodeMd5(s, 0, Integer.MAX_VALUE) */
  public static int[] UnicodeMd5(String s)
  {
    return UnicodeMd5(s, 0, Integer.MAX_VALUE);
  }

  /**
   * give the unicode str and get the md result
   * null str means from and end1 is 0
   * each unicode char is treated as two bytes in big-endian
   * return value is locally allocated array
   * return[0] is highest 32 bits, return[3] is lowest 32 bits
   * (((long)return[0]) << 32) | (return[1] & 0xFFFFFFFFL) is high 64 bits
   * (((long)return[2]) << 32) | (return[3] & 0xFFFFFFFFL) is low 64 bits
   * thread-safe without synchronized
   */
  public static int[] UnicodeMd5(String str, int from, int end1)
  {
//    str = Util.MaskNull(str);
//    from = Util.Bound(from, 0, str.length());
//    end1 = Util.Bound(end1, from, str.length());
/** !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
  add code for checking the arguments here
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!*/
    int[] x = new int[20]; // x[16-19] means the md result in little-endian
    x[16] = 0x67452301;
    x[17] = 0xEFCDAB89;
    x[18] = 0x98BADCFE;
    x[19] = 0x10325476;
    int n;
    int d;
    for (n = 0, d = from; d < end1 - 1; d += 2)
    {
      x[n++] = (str.charAt(d) >>> 8) | ((str.charAt(d) & 0xFF) << 8) //
        | ((str.charAt(d + 1) >>> 8) << 16) | ((str.charAt(d + 1) & 0xFF) << 24);
      if (n == 16)
      {
        Transform(x);
        n = 0;
      }
    }
    if (d == end1)
      x[n++] = 0x80;
    else /* d == end1 - 1 */
      x[n++] = (str.charAt(d) >>> 8) | ((str.charAt(d) & 0xFF) << 8) | 0x800000;
    if (n == 15)
      x[n++] = 0;
    if (n == 16)
    {
      Transform(x);
      n = 0;
    }
    if (n < 14)
      for ( ; n < 14; n++)
        x[n] = 0;
    x[14] = (end1 - from) << 4;
    x[15] = (end1 - from) >> 28;
    Transform(x);
    x[0] = x[19];
    x[1] = x[18];
    x[2] = x[17];
    x[3] = x[16];
    return x;
  }

  private static int F(int x, int y, int z)
  {
    return (x & y) | ((~x) & z);
  }

  private static int G(int x, int y, int z)
  {
    return (x & z) | (y & (~z));
  }

  private static int H(int x, int y, int z)
  {
    return x ^ y ^ z;
  }

  private static int I(int x, int y, int z)
  {
    return y ^ (x | (~z));
  }

  private static int FF(int a, int b, int c, int d, int x, int s, int ac)
  {
    a += F(b, c, d) + x + ac;
    return ((a << s) | (a >>> (32 - s))) + b;
  }

  private static int GG(int a, int b, int c, int d, int x, int s, int ac)
  {
    a += G(b, c, d) + x + ac;
    return ((a << s) | (a >>> (32 - s))) + b;
  }

  private static int HH(int a, int b, int c, int d, int x, int s, int ac)
  {
    a += H(b, c, d) + x + ac;
    return ((a << s) | (a >>> (32 - s))) + b;
  }

  private static int II(int a, int b, int c, int d, int x, int s, int ac)
  {
    a += I(b, c, d) + x + ac;
    return ((a << s) | (a >>> (32 - s))) + b;
  }

  private static void Transform(int[] x)
  {
    int a = x[16], b = x[17], c = x[18], d = x[19];
    //
    // Round 1
    a = FF(a, b, c, d, x[0], 7, 0xD76AA478);
    d = FF(d, a, b, c, x[1], 12, 0xE8C7B756);
    c = FF(c, d, a, b, x[2], 17, 0x242070DB);
    b = FF(b, c, d, a, x[3], 22, 0xC1BDCEEE);
    //
    a = FF(a, b, c, d, x[4], 7, 0xF57C0FAF);
    d = FF(d, a, b, c, x[5], 12, 0x4787C62A);
    c = FF(c, d, a, b, x[6], 17, 0xA8304613);
    b = FF(b, c, d, a, x[7], 22, 0xFD469501);
    //
    a = FF(a, b, c, d, x[8], 7, 0x698098D8);
    d = FF(d, a, b, c, x[9], 12, 0x8B44F7AF);
    c = FF(c, d, a, b, x[10], 17, 0xFFFF5BB1);
    b = FF(b, c, d, a, x[11], 22, 0x895CD7BE);
    //
    a = FF(a, b, c, d, x[12], 7, 0x6B901122);
    d = FF(d, a, b, c, x[13], 12, 0xFD987193);
    c = FF(c, d, a, b, x[14], 17, 0xA679438E);
    b = FF(b, c, d, a, x[15], 22, 0x49B40821);
    //
    // Round 2
    a = GG(a, b, c, d, x[1], 5, 0xF61E2562);
    d = GG(d, a, b, c, x[6], 9, 0xC040B340);
    c = GG(c, d, a, b, x[11], 14, 0x265E5A51);
    b = GG(b, c, d, a, x[0], 20, 0xE9B6C7AA);
    //
    a = GG(a, b, c, d, x[5], 5, 0xD62F105D);
    d = GG(d, a, b, c, x[10], 9, 0x2441453);
    c = GG(c, d, a, b, x[15], 14, 0xD8A1E681);
    b = GG(b, c, d, a, x[4], 20, 0xE7D3FBC8);
    //
    a = GG(a, b, c, d, x[9], 5, 0x21E1CDE6);
    d = GG(d, a, b, c, x[14], 9, 0xC33707D6);
    c = GG(c, d, a, b, x[3], 14, 0xF4D50D87);
    b = GG(b, c, d, a, x[8], 20, 0x455A14ED);
    //
    a = GG(a, b, c, d, x[13], 5, 0xA9E3E905);
    d = GG(d, a, b, c, x[2], 9, 0xFCEFA3F8);
    c = GG(c, d, a, b, x[7], 14, 0x676F02D9);
    b = GG(b, c, d, a, x[12], 20, 0x8D2A4C8A);
    //
    // Round 3
    a = HH(a, b, c, d, x[5], 4, 0xFFFA3942);
    d = HH(d, a, b, c, x[8], 11, 0x8771F681);
    c = HH(c, d, a, b, x[11], 16, 0x6D9D6122);
    b = HH(b, c, d, a, x[14], 23, 0xFDE5380C);
    //
    a = HH(a, b, c, d, x[1], 4, 0xA4BEEA44);
    d = HH(d, a, b, c, x[4], 11, 0x4BDECFA9);
    c = HH(c, d, a, b, x[7], 16, 0xF6BB4B60);
    b = HH(b, c, d, a, x[10], 23, 0xBEBFBC70);
    //
    a = HH(a, b, c, d, x[13], 4, 0x289B7EC6);
    d = HH(d, a, b, c, x[0], 11, 0xEAA127FA);
    c = HH(c, d, a, b, x[3], 16, 0xD4EF3085);
    b = HH(b, c, d, a, x[6], 23, 0x4881D05);
    //
    a = HH(a, b, c, d, x[9], 4, 0xD9D4D039);
    d = HH(d, a, b, c, x[12], 11, 0xE6DB99E5);
    c = HH(c, d, a, b, x[15], 16, 0x1FA27CF8);
    b = HH(b, c, d, a, x[2], 23, 0xC4AC5665);
    //
    // Round 4
    a = II(a, b, c, d, x[0], 6, 0xF4292244);
    d = II(d, a, b, c, x[7], 10, 0x432AFF97);
    c = II(c, d, a, b, x[14], 15, 0xAB9423A7);
    b = II(b, c, d, a, x[5], 21, 0xFC93A039);
    //
    a = II(a, b, c, d, x[12], 6, 0x655B59C3);
    d = II(d, a, b, c, x[3], 10, 0x8F0CCC92);
    c = II(c, d, a, b, x[10], 15, 0xFFEFF47D);
    b = II(b, c, d, a, x[1], 21, 0x85845DD1);
    //
    a = II(a, b, c, d, x[8], 6, 0x6FA87E4F);
    d = II(d, a, b, c, x[15], 10, 0xFE2CE6E0);
    c = II(c, d, a, b, x[6], 15, 0xA3014314);
    b = II(b, c, d, a, x[13], 21, 0x4E0811A1);
    //
    a = II(a, b, c, d, x[4], 6, 0xF7537E82);
    d = II(d, a, b, c, x[11], 10, 0xBD3AF235);
    c = II(c, d, a, b, x[2], 15, 0x2AD7D2BB);
    b = II(b, c, d, a, x[9], 21, 0xEB86D391);
    //
    //
    x[16] += a;
    x[17] += b;
    x[18] += c;
    x[19] += d;
  }
}

作者

Re:MD5 算法的Java Bean [Re:YuLimin]

YuLimin

简单就是美

版主

发贴: 866

于 2005-04-10 14:28

MD5加密算法简介

一、算法实现
1、MD5算法是对输入的数据进行补位，使得如果数据位长度LEN对512求余的结果
是448。
即数据扩展至K*512+448位。即K*64+56个字节，K为整数。
具体补位操作：补一个1，然后补0至满足上述要求
2、补数据长度：
用一个64位的数字表示数据的原始长度B，把B用两个32位数表示。这时，数据
就被填
补成长度为512位的倍数。
3. 初始化MD5参数
四个32位整数 (A,B,C,D) 用来计算信息摘要，初始化使用的是十六进制表示
的数字
A=0X01234567
B=0X89abcdef
C=0Xfedcba98
D=0X76543210
4、处理位操作函数
X，Y，Z为32位整数。
F(X,Y,Z) = X&Y|NOT(X)&Z
G(X,Y,Z) = X&Z|Y¬(Z)
H(X,Y,Z) = X xor Y xor Z
I(X,Y,Z) = Y xor (X|not(Z))
5、主要变换过程：
使用常数组T[1 ... 64]， T[i]为32位整数用16进制表示，数据用16个32位的
整
数数组M[]表示。
具体过程如下：
/* 处理数据原文 */
For i = 0 to N/16-1 do
/*每一次，把数据原文存放在16个元素的数组X中. */
For j = 0 to 15 do
Set X[j] to M[i*16+j].
end /结束对J的循环
/* Save A as AA, B as BB, C as CC, and D as DD. */
AA = A
BB = B
CC = C
DD = D
/* 第1轮*/
/* 以 [abcd k s i]表示如下操作
a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */
/* Do the following 16 operations. */
[ABCD 0 7 1] [DABC 1 12 2] [CDAB 2 17 3] [BCDA 3 22 4]
[ABCD 4 7 5] [DABC 5 12 6] [CDAB 6 17 7] [BCDA 7 22 8]
[ABCD 8 7 9] [DABC 9 12 10] [CDAB 10 17 11] [BCDA 11 22 12]
[ABCD 12 7 13] [DABC 13 12 14] [CDAB 14 17 15] [BCDA 15 22 16]
/* 第2轮* */
/* 以 [abcd k s i]表示如下操作
a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */
/* Do the following 16 operations. */
[ABCD 1 5 17] [DABC 6 9 18] [CDAB 11 14 19] [BCDA 0 20 20]
[ABCD 5 5 21] [DABC 10 9 22] [CDAB 15 14 23] [BCDA 4 20 24]
[ABCD 9 5 25] [DABC 14 9 26] [CDAB 3 14 27] [BCDA 8 20 28]
[ABCD 13 5 29] [DABC 2 9 30] [CDAB 7 14 31] [BCDA 12 20 32]
/* 第3轮*/
/* 以 [abcd k s i]表示如下操作
a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */
/* Do the following 16 operations. */
[ABCD 5 4 33] [DABC 8 11 34] [CDAB 11 16 35] [BCDA 14 23 36]
[ABCD 1 4 37] [DABC 4 11 38] [CDAB 7 16 39] [BCDA 10 23 40]
[ABCD 13 4 41] [DABC 0 11 42] [CDAB 3 16 43] [BCDA 6 23 44]
[ABCD 9 4 45] [DABC 12 11 46] [CDAB 15 16 47] [BCDA 2 23 48]
/* 第4轮*/
/* 以 [abcd k s i]表示如下操作
a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */
/* Do the following 16 operations. */
[ABCD 0 6 49] [DABC 7 10 50] [CDAB 14 15 51] [BCDA 5 21 52]
[ABCD 12 6 53] [DABC 3 10 54] [CDAB 10 15 55] [BCDA 1 21 56]
[ABCD 8 6 57] [DABC 15 10 58] [CDAB 6 15 59] [BCDA 13 21 60]
[ABCD 4 6 61] [DABC 11 10 62] [CDAB 2 15 63] [BCDA 9 21 64]
/* 然后进行如下操作 */
A = A + AA
B = B + BB
C = C + CC
D = D + DD
end /* 结束对I的循环*/
6、输出结果。

作者	Re:MD5 算法的Java Bean [Re:YuLimin]
rtornados 发贴: 4	于 2005-05-27 15:20 nb

作者	Re:MD5 算法的Java Bean [Re:YuLimin]
chenyajun5 一日不倒，每天都打 CJSDN高级会员发贴: 643	于 2005-06-02 12:37 在我的印象中好像可以直接调用jdk中函数产生md5。。。。想干的人找一个方法，不想干的人找一个借口。

作者	Re:MD5 算法的Java Bean [Re:YuLimin]
phoenix_tree 发贴: 9	于 2005-06-02 13:25 org.apache.catalina.util.MD5Encoder

已读帖子

新的帖子

被删除的帖子