md5加密算法

md5.js

/***************************************************************************************
 *                                    md5加密算法
 *     此代码版权归原作者所有，
 *
 * 如果您对本程序有什么建议，请email to:[email protected]。
 *
 *                                                                          海洋工作室
 *                                                          http://www.oceanstudio.net
 *                                                     ocean( [email protected]) 制作
 *****************************************************************************************/
/*****************************************************************************************
 * md5加密算法
 * 原作者的版权声明如下, 我将原作者的代码封装到String中
 * 具体使用请参见例子
 * md5.js
 *
 * A JavaScript implementation of the RSA Data Security, Inc. MD5
 * Message-Digest Algorithm.
 *
 * Copyright (C) Paul Johnston 1999. Distributed under the LGPL.
 *****************************************************************************************/

/* to convert strings to a list of ascii values */
String.prototype.sAscii = " !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~";
/* convert integer to hex string */
String.prototype.sHex = "0123456789ABCDEF";
String.prototype.hex = function (i) {
 h = "";
 for(j = 0; j <= 3; j++)
  h += this.sHex.charAt((i >> (j * 8 + 4)) & 0x0F) + this.sHex.charAt((i >> (j * 8)) & 0x0F);
// for(j = 3; j >= 0; j--)
//  h += this.sHex.charAt((i >> (j * 8 + 4)) & 0x0F) + this.sHex.charAt((i >> (j * 8)) & 0x0F);
 return h;
}

/* add, handling overflows correctly */
String.prototype.add = function (x, y)
{
 return ((x&0x7FFFFFFF) + (y&0x7FFFFFFF)) ^ (x&0x80000000) ^ (y&0x80000000);
}

/* MD5 rounds functions */
String.prototype.R1 = function (A, B, C, D, X, S, T) {
 q = this.add(this.add(A, (B & C) | (~B & D)), this.add(X, T));
 return this.add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B);
}

String.prototype.R2 = function (A, B, C, D, X, S, T) {
 q = this.add(this.add(A, (B & D) | (C & ~D)), this.add(X, T));
 return this.add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B);
}

String.prototype.R3 = function (A, B, C, D, X, S, T) {
 q = this.add(this.add(A, B ^ C ^ D), this.add(X, T));
 return this.add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B);
}

String.prototype.R4 = function (A, B, C, D, X, S, T) {
 q = this.add(this.add(A, C ^ (B | ~D)), this.add(X, T));
 return this.add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B);
}

/* main entry point */
String.prototype.calcMD5 = function () {
 var sInp = this.valueOf();

/* Calculate length in machine words, including padding */
 wLen = (((sInp.length + 8) >> 6) + 1) << 4;
 var X = new Array(wLen);

/* Convert string to array of words */
 j = 4;
 for (i = 0; (i * 4) < sInp.length; i++) {
  X[i] = 0;
  for (j = 0; (j < 4) && ((j + i * 4) < sInp.length); j++) {
   X[i] += (this.sAscii.indexOf(sInp.charAt((i * 4) + j)) + 32) << (j * 8);
  }
 }

/* Append padding bits and length */
 if (j == 4) {
  X[i++] = 0x80;
 }
 else
 {
  X[i - 1] += 0x80 << (j * 8);
 }
 for (; i < wLen; i++) { X[i] = 0; }
 X[wLen - 2] = sInp.length * 8;

/* hard-coded initial values */
 a = 0x67452301;
 b = 0xefcdab89;
 c = 0x98badcfe;
 d = 0x10325476;

/* Process each 16-word block in turn */
 for (i = 0; i < wLen; i += 16) {
  aO = a;
  bO = b;
  cO = c;
  dO = d;

  a = this.R1(a, b, c, d, X[i+ 0], 7 , 0xd76aa478);
  d = this.R1(d, a, b, c, X[i+ 1], 12, 0xe8c7b756);
  c = this.R1(c, d, a, b, X[i+ 2], 17, 0x242070db);
  b = this.R1(b, c, d, a, X[i+ 3], 22, 0xc1bdceee);
  a = this.R1(a, b, c, d, X[i+ 4], 7 , 0xf57c0faf);
  d = this.R1(d, a, b, c, X[i+ 5], 12, 0x4787c62a);
  c = this.R1(c, d, a, b, X[i+ 6], 17, 0xa8304613);
  b = this.R1(b, c, d, a, X[i+ 7], 22, 0xfd469501);
  a = this.R1(a, b, c, d, X[i+ 8], 7 , 0x698098d8);
  d = this.R1(d, a, b, c, X[i+ 9], 12, 0x8b44f7af);
  c = this.R1(c, d, a, b, X[i+10], 17, 0xffff5bb1);
  b = this.R1(b, c, d, a, X[i+11], 22, 0x895cd7be);
  a = this.R1(a, b, c, d, X[i+12], 7 , 0x6b901122);
  d = this.R1(d, a, b, c, X[i+13], 12, 0xfd987193);
  c = this.R1(c, d, a, b, X[i+14], 17, 0xa679438e);
  b = this.R1(b, c, d, a, X[i+15], 22, 0x49b40821);

  a = this.R2(a, b, c, d, X[i+ 1], 5 , 0xf61e2562);
  d = this.R2(d, a, b, c, X[i+ 6], 9 , 0xc040b340);
  c = this.R2(c, d, a, b, X[i+11], 14, 0x265e5a51);
  b = this.R2(b, c, d, a, X[i+ 0], 20, 0xe9b6c7aa);
  a = this.R2(a, b, c, d, X[i+ 5], 5 , 0xd62f105d);
  d = this.R2(d, a, b, c, X[i+10], 9 , 0x2441453);
  c = this.R2(c, d, a, b, X[i+15], 14, 0xd8a1e681);
  b = this.R2(b, c, d, a, X[i+ 4], 20, 0xe7d3fbc8);
  a = this.R2(a, b, c, d, X[i+ 9], 5 , 0x21e1cde6);
  d = this.R2(d, a, b, c, X[i+14], 9 , 0xc33707d6);
  c = this.R2(c, d, a, b, X[i+ 3], 14, 0xf4d50d87);
  b = this.R2(b, c, d, a, X[i+ 8], 20, 0x455a14ed);
  a = this.R2(a, b, c, d, X[i+13], 5 , 0xa9e3e905);
  d = this.R2(d, a, b, c, X[i+ 2], 9 , 0xfcefa3f8);
  c = this.R2(c, d, a, b, X[i+ 7], 14, 0x676f02d9);
  b = this.R2(b, c, d, a, X[i+12], 20, 0x8d2a4c8a);

  a = this.R3(a, b, c, d, X[i+ 5], 4 , 0xfffa3942);
  d = this.R3(d, a, b, c, X[i+ 8], 11, 0x8771f681);
  c = this.R3(c, d, a, b, X[i+11], 16, 0x6d9d6122);
  b = this.R3(b, c, d, a, X[i+14], 23, 0xfde5380c);
  a = this.R3(a, b, c, d, X[i+ 1], 4 , 0xa4beea44);
  d = this.R3(d, a, b, c, X[i+ 4], 11, 0x4bdecfa9);
  c = this.R3(c, d, a, b, X[i+ 7], 16, 0xf6bb4b60);
  b = this.R3(b, c, d, a, X[i+10], 23, 0xbebfbc70);
  a = this.R3(a, b, c, d, X[i+13], 4 , 0x289b7ec6);
  d = this.R3(d, a, b, c, X[i+ 0], 11, 0xeaa127fa);
  c = this.R3(c, d, a, b, X[i+ 3], 16, 0xd4ef3085);
  b = this.R3(b, c, d, a, X[i+ 6], 23, 0x4881d05);
  a = this.R3(a, b, c, d, X[i+ 9], 4 , 0xd9d4d039);
  d = this.R3(d, a, b, c, X[i+12], 11, 0xe6db99e5);
  c = this.R3(c, d, a, b, X[i+15], 16, 0x1fa27cf8);
  b = this.R3(b, c, d, a, X[i+ 2], 23, 0xc4ac5665);

  a = this.R4(a, b, c, d, X[i+ 0], 6 , 0xf4292244);
  d = this.R4(d, a, b, c, X[i+ 7], 10, 0x432aff97);
  c = this.R4(c, d, a, b, X[i+14], 15, 0xab9423a7);
  b = this.R4(b, c, d, a, X[i+ 5], 21, 0xfc93a039);
  a = this.R4(a, b, c, d, X[i+12], 6 , 0x655b59c3);
  d = this.R4(d, a, b, c, X[i+ 3], 10, 0x8f0ccc92);
  c = this.R4(c, d, a, b, X[i+10], 15, 0xffeff47d);
  b = this.R4(b, c, d, a, X[i+ 1], 21, 0x85845dd1);
  a = this.R4(a, b, c, d, X[i+ 8], 6 , 0x6fa87e4f);
  d = this.R4(d, a, b, c, X[i+15], 10, 0xfe2ce6e0);
  c = this.R4(c, d, a, b, X[i+ 6], 15, 0xa3014314);
  b = this.R4(b, c, d, a, X[i+13], 21, 0x4e0811a1);
  a = this.R4(a, b, c, d, X[i+ 4], 6 , 0xf7537e82);
  d = this.R4(d, a, b, c, X[i+11], 10, 0xbd3af235);
  c = this.R4(c, d, a, b, X[i+ 2], 15, 0x2ad7d2bb);
  b = this.R4(b, c, d, a, X[i+ 9], 21, 0xeb86d391);

  a = this.add(a, aO);
  b = this.add(b, bO);
  c = this.add(c, cO);
  d = this.add(d, dO);
 }
 return this.hex(a) + this.hex(b) + this.hex(c) + this.hex(d);
}

example.htm

<html>
<head>
<script language="JavaScript" src="md5.js"></script>
<script language="JavaScript">
function doMd5() {
 document.getElementById("miwen").value = document.getElementById("mingwen").value.calcMD5();
}
</script>
</head>
<body>

<pre>
/***************************************************************************************
 *                                    md5加密算法
 *     此代码版权归原作者所有，
 *
 * 如果您对本程序有什么建议，请email to:[email protected]。
 *
 *                                                                          海洋工作室
 *                                                          http://www.oceanstudio.net
 *                                                     ocean( [email protected]) 制作
 *****************************************************************************************/
/*****************************************************************************************
 * md5加密算法
 * 原作者的版权声明如下, 我将原作者的代码封装到String中
 * 具体使用请参见例子
 * md5.js
 *
 * A JavaScript implementation of the RSA Data Security, Inc. MD5
 * Message-Digest Algorithm.
 *
 * Copyright (C) Paul Johnston 1999. Distributed under the LGPL.
 *****************************************************************************************/
 这是一个md5的加密包，是我原来从网上找的，为了方便调用，我就干脆封装到String中了。
   希望大家能够给本工作室支持，本工作室将更好的为大家服务。
                                                                           2003年7月10日夜
</pre>
<div style="text-align:center;font-size:14pt;font-weight:bold">md5压缩演示</div>
<table>
 <tr>
  <td>请输入明文：</td>
  <td><input type="text" id="mingwen" style="width:600px"></td>
 </tr>
 <tr>
  <td><input type="button" value="加密" onclick="doMd5()"></td>
  <td><input type="text" id="miwen" style="width:600px"></td>
 </tr>
</table>
</body>
</html>