jQuery的md5加密插件及其它js md5加密代碼

/**
 * jQuery MD5 hash algorithm function
 * 
 * 	<code>
 * 		Calculate the md5 hash of a String 
 * 		String $.md5 ( String str )
 * 	</code>
 * 
 * Calculates the MD5 hash of str using the » RSA Data Security, Inc. MD5 Message-Digest Algorithm, and returns that hash. 
 * MD5 (Message-Digest algorithm 5) is a widely-used cryptographic hash function with a 128-bit hash value. MD5 has been employed in a wide variety of security applications, and is also commonly used to check the integrity of data. The generated hash is also non-reversable. Data cannot be retrieved from the message digest, the digest uniquely identifies the data.
 * MD5 was developed by Professor Ronald L. Rivest in 1994. Its 128 bit (16 byte) message digest makes it a faster implementation than SHA-1.
 * This script is used to process a variable length message into a fixed-length output of 128 bits using the MD5 algorithm. It is fully compatible with UTF-8 encoding. It is very useful when u want to transfer encrypted passwords over the internet. If you plan using UTF-8 encoding in your project don't forget to set the page encoding to UTF-8 (Content-Type meta tag). 
 * This function orginally get from the WebToolkit and rewrite for using as the jQuery plugin.
 * 
 * Example
 * 	Code
 * 		<code>
 * 			$.md5("I'm Persian."); 
 * 		</code>
 * 	Result
 * 		<code>
 * 			"b8c901d0f02223f9761016cfff9d68df"
 * 		</code>
 * 
 * @alias Muhammad Hussein Fattahizadeh < muhammad [AT] semnanweb [DOT] com >
 * @link http://www.semnanweb.com/jquery-plugin/md5.html
 * @see http://www.webtoolkit.info/
 * @license http://www.gnu.org/licenses/gpl.html [GNU General Public License]
 * @param {jQuery} {md5:function(string))
 * @return string
 */

(function($){
	
	var rotateLeft = function(lValue, iShiftBits) {
		return (lValue << iShiftBits) | (lValue >>> (32 - iShiftBits));
	}
	
	var addUnsigned = function(lX, lY) {
		var lX4, lY4, lX8, lY8, lResult;
		lX8 = (lX & 0x80000000);
		lY8 = (lY & 0x80000000);
		lX4 = (lX & 0x40000000);
		lY4 = (lY & 0x40000000);
		lResult = (lX & 0x3FFFFFFF) + (lY & 0x3FFFFFFF);
		if (lX4 & lY4) return (lResult ^ 0x80000000 ^ lX8 ^ lY8);
		if (lX4 | lY4) {
			if (lResult & 0x40000000) return (lResult ^ 0xC0000000 ^ lX8 ^ lY8);
			else return (lResult ^ 0x40000000 ^ lX8 ^ lY8);
		} else {
			return (lResult ^ lX8 ^ lY8);
		}
	}
	
	var F = function(x, y, z) {
		return (x & y) | ((~ x) & z);
	}
	
	var G = function(x, y, z) {
		return (x & z) | (y & (~ z));
	}
	
	var H = function(x, y, z) {
		return (x ^ y ^ z);
	}
	
	var I = function(x, y, z) {
		return (y ^ (x | (~ z)));
	}
	
	var FF = function(a, b, c, d, x, s, ac) {
		a = addUnsigned(a, addUnsigned(addUnsigned(F(b, c, d), x), ac));
		return addUnsigned(rotateLeft(a, s), b);
	};
	
	var GG = function(a, b, c, d, x, s, ac) {
		a = addUnsigned(a, addUnsigned(addUnsigned(G(b, c, d), x), ac));
		return addUnsigned(rotateLeft(a, s), b);
	};
	
	var HH = function(a, b, c, d, x, s, ac) {
		a = addUnsigned(a, addUnsigned(addUnsigned(H(b, c, d), x), ac));
		return addUnsigned(rotateLeft(a, s), b);
	};
	
	var II = function(a, b, c, d, x, s, ac) {
		a = addUnsigned(a, addUnsigned(addUnsigned(I(b, c, d), x), ac));
		return addUnsigned(rotateLeft(a, s), b);
	};
	
	var convertToWordArray = function(string) {
		var lWordCount;
		var lMessageLength = string.length;
		var lNumberOfWordsTempOne = lMessageLength + 8;
		var lNumberOfWordsTempTwo = (lNumberOfWordsTempOne - (lNumberOfWordsTempOne % 64)) / 64;
		var lNumberOfWords = (lNumberOfWordsTempTwo + 1) * 16;
		var lWordArray = Array(lNumberOfWords - 1);
		var lBytePosition = 0;
		var lByteCount = 0;
		while (lByteCount < lMessageLength) {
			lWordCount = (lByteCount - (lByteCount % 4)) / 4;
			lBytePosition = (lByteCount % 4) * 8;
			lWordArray[lWordCount] = (lWordArray[lWordCount] | (string.charCodeAt(lByteCount) << lBytePosition));
			lByteCount++;
		}
		lWordCount = (lByteCount - (lByteCount % 4)) / 4;
		lBytePosition = (lByteCount % 4) * 8;
		lWordArray[lWordCount] = lWordArray[lWordCount] | (0x80 << lBytePosition);
		lWordArray[lNumberOfWords - 2] = lMessageLength << 3;
		lWordArray[lNumberOfWords - 1] = lMessageLength >>> 29;
		return lWordArray;
	};
	
	var wordToHex = function(lValue) {
		var WordToHexValue = "", WordToHexValueTemp = "", lByte, lCount;
		for (lCount = 0; lCount <= 3; lCount++) {
			lByte = (lValue >>> (lCount * 8)) & 255;
			WordToHexValueTemp = "0" + lByte.toString(16);
			WordToHexValue = WordToHexValue + WordToHexValueTemp.substr(WordToHexValueTemp.length - 2, 2);
		}
		return WordToHexValue;
	};
	
	var uTF8Encode = function(string) {
		string = string.replace(/\x0d\x0a/g, "\x0a");
		var output = "";
		for (var n = 0; n < string.length; n++) {
			var c = string.charCodeAt(n);
			if (c < 128) {
				output += String.fromCharCode(c);
			} else if ((c > 127) && (c < 2048)) {
				output += String.fromCharCode((c >> 6) | 192);
				output += String.fromCharCode((c & 63) | 128);
			} else {
				output += String.fromCharCode((c >> 12) | 224);
				output += String.fromCharCode(((c >> 6) & 63) | 128);
				output += String.fromCharCode((c & 63) | 128);
			}
		}
		return output;
	};
	
	$.extend({
		md5: function(string) {
			var x = Array();
			var k, AA, BB, CC, DD, a, b, c, d;
			var S11=7, S12=12, S13=17, S14=22;
			var S21=5, S22=9 , S23=14, S24=20;
			var S31=4, S32=11, S33=16, S34=23;
			var S41=6, S42=10, S43=15, S44=21;
			string = uTF8Encode(string);
			x = convertToWordArray(string);
			a = 0x67452301; b = 0xEFCDAB89; c = 0x98BADCFE; d = 0x10325476;
			for (k = 0; k < x.length; k += 16) {
				AA = a; BB = b; CC = c; DD = d;
				a = FF(a, b, c, d, x[k+0],  S11, 0xD76AA478);
				d = FF(d, a, b, c, x[k+1],  S12, 0xE8C7B756);
				c = FF(c, d, a, b, x[k+2],  S13, 0x242070DB);
				b = FF(b, c, d, a, x[k+3],  S14, 0xC1BDCEEE);
				a = FF(a, b, c, d, x[k+4],  S11, 0xF57C0FAF);
				d = FF(d, a, b, c, x[k+5],  S12, 0x4787C62A);
				c = FF(c, d, a, b, x[k+6],  S13, 0xA8304613);
				b = FF(b, c, d, a, x[k+7],  S14, 0xFD469501);
				a = FF(a, b, c, d, x[k+8],  S11, 0x698098D8);
				d = FF(d, a, b, c, x[k+9],  S12, 0x8B44F7AF);
				c = FF(c, d, a, b, x[k+10], S13, 0xFFFF5BB1);
				b = FF(b, c, d, a, x[k+11], S14, 0x895CD7BE);
				a = FF(a, b, c, d, x[k+12], S11, 0x6B901122);
				d = FF(d, a, b, c, x[k+13], S12, 0xFD987193);
				c = FF(c, d, a, b, x[k+14], S13, 0xA679438E);
				b = FF(b, c, d, a, x[k+15], S14, 0x49B40821);
				a = GG(a, b, c, d, x[k+1],  S21, 0xF61E2562);
				d = GG(d, a, b, c, x[k+6],  S22, 0xC040B340);
				c = GG(c, d, a, b, x[k+11], S23, 0x265E5A51);
				b = GG(b, c, d, a, x[k+0],  S24, 0xE9B6C7AA);
				a = GG(a, b, c, d, x[k+5],  S21, 0xD62F105D);
				d = GG(d, a, b, c, x[k+10], S22, 0x2441453);
				c = GG(c, d, a, b, x[k+15], S23, 0xD8A1E681);
				b = GG(b, c, d, a, x[k+4],  S24, 0xE7D3FBC8);
				a = GG(a, b, c, d, x[k+9],  S21, 0x21E1CDE6);
				d = GG(d, a, b, c, x[k+14], S22, 0xC33707D6);
				c = GG(c, d, a, b, x[k+3],  S23, 0xF4D50D87);
				b = GG(b, c, d, a, x[k+8],  S24, 0x455A14ED);
				a = GG(a, b, c, d, x[k+13], S21, 0xA9E3E905);
				d = GG(d, a, b, c, x[k+2],  S22, 0xFCEFA3F8);
				c = GG(c, d, a, b, x[k+7],  S23, 0x676F02D9);
				b = GG(b, c, d, a, x[k+12], S24, 0x8D2A4C8A);
				a = HH(a, b, c, d, x[k+5],  S31, 0xFFFA3942);
				d = HH(d, a, b, c, x[k+8],  S32, 0x8771F681);
				c = HH(c, d, a, b, x[k+11], S33, 0x6D9D6122);
				b = HH(b, c, d, a, x[k+14], S34, 0xFDE5380C);
				a = HH(a, b, c, d, x[k+1],  S31, 0xA4BEEA44);
				d = HH(d, a, b, c, x[k+4],  S32, 0x4BDECFA9);
				c = HH(c, d, a, b, x[k+7],  S33, 0xF6BB4B60);
				b = HH(b, c, d, a, x[k+10], S34, 0xBEBFBC70);
				a = HH(a, b, c, d, x[k+13], S31, 0x289B7EC6);
				d = HH(d, a, b, c, x[k+0],  S32, 0xEAA127FA);
				c = HH(c, d, a, b, x[k+3],  S33, 0xD4EF3085);
				b = HH(b, c, d, a, x[k+6],  S34, 0x4881D05);
				a = HH(a, b, c, d, x[k+9],  S31, 0xD9D4D039);
				d = HH(d, a, b, c, x[k+12], S32, 0xE6DB99E5);
				c = HH(c, d, a, b, x[k+15], S33, 0x1FA27CF8);
				b = HH(b, c, d, a, x[k+2],  S34, 0xC4AC5665);
				a = II(a, b, c, d, x[k+0],  S41, 0xF4292244);
				d = II(d, a, b, c, x[k+7],  S42, 0x432AFF97);
				c = II(c, d, a, b, x[k+14], S43, 0xAB9423A7);
				b = II(b, c, d, a, x[k+5],  S44, 0xFC93A039);
				a = II(a, b, c, d, x[k+12], S41, 0x655B59C3);
				d = II(d, a, b, c, x[k+3],  S42, 0x8F0CCC92);
				c = II(c, d, a, b, x[k+10], S43, 0xFFEFF47D);
				b = II(b, c, d, a, x[k+1],  S44, 0x85845DD1);
				a = II(a, b, c, d, x[k+8],  S41, 0x6FA87E4F);
				d = II(d, a, b, c, x[k+15], S42, 0xFE2CE6E0);
				c = II(c, d, a, b, x[k+6],  S43, 0xA3014314);
				b = II(b, c, d, a, x[k+13], S44, 0x4E0811A1);
				a = II(a, b, c, d, x[k+4],  S41, 0xF7537E82);
				d = II(d, a, b, c, x[k+11], S42, 0xBD3AF235);
				c = II(c, d, a, b, x[k+2],  S43, 0x2AD7D2BB);
				b = II(b, c, d, a, x[k+9],  S44, 0xEB86D391);
				a = addUnsigned(a, AA);
				b = addUnsigned(b, BB);
				c = addUnsigned(c, CC);
				d = addUnsigned(d, DD);
			}
			var tempValue = wordToHex(a) + wordToHex(b) + wordToHex(c) + wordToHex(d);
			return tempValue.toLowerCase();
		}
	});
})(jQuery);

這裏能夠下載：http://blog.greycode.cn/labs/jqmd5/jquery.md5.js

演示效果：http://blog.greycode.cn/labs/jqmd5/jquery.md5.html

其它js md5加密代碼：

代碼一：

/**
 * 對文本進行MD5加密js腳本
 */

var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */
var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */
var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */
/*
* These are the functions you'll usually want to call
* They take string arguments and return either hex or base-64 encoded strings
*/
function hex_md5(s){ return binl2hex(core_md5(str2binl(s), s.length * chrsz));}
function b64_md5(s){ return binl2b64(core_md5(str2binl(s), s.length * chrsz));}
function hex_hmac_md5(key, data) { return binl2hex(core_hmac_md5(key, data)); }
function b64_hmac_md5(key, data) { return binl2b64(core_hmac_md5(key, data)); }
/* Backwards compatibility - same as hex_md5() */
function calcMD5(s){ return binl2hex(core_md5(str2binl(s), s.length * chrsz));}
/*
* Perform a simple self-test to see if the VM is working
*/
function md5_vm_test()
{
	return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72";
}
/*
* Calculate the MD5 of an array of little-endian words, and a bit length
*/
function core_md5(x, len)
{
	/* append padding */
	x[len >> 5] |= 0x80 << ((len) % 32);
	x[(((len + 64) >>> 9) << 4) + 14] = len;
	var a = 1732584193;
	var b = -271733879;
	var c = -1732584194;
	var d = 271733878;
	for(var i = 0; i < x.length; i += 16)
	{
		var olda = a;
		var oldb = b;
		var oldc = c;
		var oldd = d;
		a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);
		d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);
		c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);
		b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);
		a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);
		d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);
		c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);
		b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);
		a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);
		d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);
		c = md5_ff(c, d, a, b, x[i+10], 17, -42063);
		b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);
		a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);
		d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);
		c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);
		b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);
		a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);
		d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);
		c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);
		b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);
		a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);
		d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);
		c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);
		b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);
		a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);
		d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);
		c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);
		b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);
		a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);
		d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);
		c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);
		b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);
		a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);
		d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);
		c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);
		b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);
		a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);
		d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);
		c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);
		b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);
		a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);
		d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);
		c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);
		b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);
		a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);
		d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);
		c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);
		b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);
		a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);
		d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);
		c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);
		b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);
		a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);
		d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);
		c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);
		b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);
		a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);
		d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);
		c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);
		b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);
		a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);
		d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);
		c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);
		b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);
		a = safe_add(a, olda);
		b = safe_add(b, oldb);
		c = safe_add(c, oldc);
		d = safe_add(d, oldd);
	}
	return Array(a, b, c, d);
}
/*
* These functions implement the four basic operations the algorithm uses.
*/
function md5_cmn(q, a, b, x, s, t)
{
	return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);
}
function md5_ff(a, b, c, d, x, s, t)
{
	return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);
}
function md5_gg(a, b, c, d, x, s, t)
{
	return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);
}
function md5_hh(a, b, c, d, x, s, t)
{
	return md5_cmn(b ^ c ^ d, a, b, x, s, t);
}
function md5_ii(a, b, c, d, x, s, t)
{
	return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);
}
/*
* Calculate the HMAC-MD5, of a key and some data
*/
function core_hmac_md5(key, data)
{
	var bkey = str2binl(key);
	if(bkey.length > 16) bkey = core_md5(bkey, key.length * chrsz);
	var ipad = Array(16), opad = Array(16);
	for(var i = 0; i < 16; i++)
	{
		ipad[i] = bkey[i] ^ 0x36363636;
		opad[i] = bkey[i] ^ 0x5C5C5C5C;
	}
	var hash = core_md5(ipad.concat(str2binl(data)), 512 + data.length * chrsz);
	return core_md5(opad.concat(hash), 512 + 128);
}
/*
* Add integers, wrapping at 2^32. This uses 16-bit operations internally
* to work around bugs in some JS interpreters.
*/
function safe_add(x, y)
{
	var lsw = (x & 0xFFFF) + (y & 0xFFFF);
	var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
	return (msw << 16) | (lsw & 0xFFFF);
}
/*
* Bitwise rotate a 32-bit number to the left.
*/
function bit_rol(num, cnt)
{
	return (num << cnt) | (num >>> (32 - cnt));
}
/*
* Convert a string to an array of little-endian words
* If chrsz is ASCII, characters >255 have their hi-byte silently ignored.
*/
function str2binl(str)
{
	var bin = Array();
	var mask = (1 << chrsz) - 1;
	for(var i = 0; i < str.length * chrsz; i += chrsz)
	bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (i%32);
	return bin;
}
/*
* Convert an array of little-endian words to a hex string.
*/
function binl2hex(binarray)
{
	var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
	var str = "";
	for(var i = 0; i < binarray.length * 4; i++)
	{
		str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) +
		hex_tab.charAt((binarray[i>>2] >> ((i%4)*8 )) & 0xF);
	}
	return str;
}
/*
* Convert an array of little-endian words to a base-64 string
*/
function binl2b64(binarray)
{
	var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
	var str = "";
	for(var i = 0; i < binarray.length * 4; i += 3)
	{
		var triplet = (((binarray[i >> 2] >> 8 * ( i %4)) & 0xFF) << 16)
		| (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8 )
		| ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF);
		for(var j = 0; j < 4; j++)
		{
			if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;
			else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
		}
	}
	return str;
}

代碼二：

/**
 * js md5加密代碼
 */


function MD5(instring){
	 var hexcase = 0;   /* hex output format. 0 - lowercase; 1 - uppercase        */
	 var b64pad  = "";  /* base-64 pad character. "=" for strict RFC compliance   */

	 /*
	  * These are the functions you'll usually want to call
	  * They take string arguments and return either hex or base-64 encoded strings
	  */
	 function hex_md5(s)    { return rstr2hex(rstr_md5(str2rstr_utf8(s))); }
	 function b64_md5(s)    { return rstr2b64(rstr_md5(str2rstr_utf8(s))); }
	 function any_md5(s, e) { return rstr2any(rstr_md5(str2rstr_utf8(s)), e); }
	 function hex_hmac_md5(k, d)
	   { return rstr2hex(rstr_hmac_md5(str2rstr_utf8(k), str2rstr_utf8(d))); }
	 function b64_hmac_md5(k, d)
	   { return rstr2b64(rstr_hmac_md5(str2rstr_utf8(k), str2rstr_utf8(d))); }
	 function any_hmac_md5(k, d, e)
	   { return rstr2any(rstr_hmac_md5(str2rstr_utf8(k), str2rstr_utf8(d)), e); }

	 /*
	  * Perform a simple self-test to see if the VM is working
	  */
	 function md5_vm_test()
	 {
	   return hex_md5("abc").toLowerCase() == "900150983cd24fb0d6963f7d28e17f72";
	 }

	 /*
	  * Calculate the MD5 of a raw string
	  */
	 function rstr_md5(s)
	 {
	   return binl2rstr(binl_md5(rstr2binl(s), s.length * 8));
	 }

	 /*
	  * Calculate the HMAC-MD5, of a key and some data (raw strings)
	  */
	 function rstr_hmac_md5(key, data)
	 {
	   var bkey = rstr2binl(key);
	   if(bkey.length > 16) bkey = binl_md5(bkey, key.length * 8);

	   var ipad = Array(16), opad = Array(16);
	   for(var i = 0; i < 16; i++)
	   {
	     ipad[i] = bkey[i] ^ 0x36363636;
	     opad[i] = bkey[i] ^ 0x5C5C5C5C;
	   }

	   var hash = binl_md5(ipad.concat(rstr2binl(data)), 512 + data.length * 8);
	   return binl2rstr(binl_md5(opad.concat(hash), 512 + 128));
	 }

	 /*
	  * Convert a raw string to a hex string
	  */
	 function rstr2hex(input)
	 {
	   try { hexcase } catch(e) { hexcase=0; }
	   var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
	   var output = "";
	   var x;
	   for(var i = 0; i < input.length; i++)
	   {
	     x = input.charCodeAt(i);
	     output += hex_tab.charAt((x >>> 4) & 0x0F)
	            +  hex_tab.charAt( x        & 0x0F);
	   }
	   return output;
	 }

	 /*
	  * Convert a raw string to a base-64 string
	  */
	 function rstr2b64(input)
	 {
	   try { b64pad } catch(e) { b64pad=''; }
	   var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
	   var output = "";
	   var len = input.length;
	   for(var i = 0; i < len; i += 3)
	   {
	     var triplet = (input.charCodeAt(i) << 16)
	                 | (i + 1 < len ? input.charCodeAt(i+1) << 8 : 0)
	                 | (i + 2 < len ? input.charCodeAt(i+2)      : 0);
	     for(var j = 0; j < 4; j++)
	     {
	       if(i * 8 + j * 6 > input.length * 8) output += b64pad;
	       else output += tab.charAt((triplet >>> 6*(3-j)) & 0x3F);
	     }
	   }
	   return output;
	 }

	 /*
	  * Convert a raw string to an arbitrary string encoding
	  */
	 function rstr2any(input, encoding)
	 {
	   var divisor = encoding.length;
	   var i, j, q, x, quotient;

	   /* Convert to an array of 16-bit big-endian values, forming the dividend */
	   var dividend = Array(Math.ceil(input.length / 2));
	   for(i = 0; i < dividend.length; i++)
	   {
	     dividend[i] = (input.charCodeAt(i * 2) << 8) | input.charCodeAt(i * 2 + 1);
	   }

	   /*
	    * Repeatedly perform a long division. The binary array forms the dividend,
	    * the length of the encoding is the divisor. Once computed, the quotient
	    * forms the dividend for the next step. All remainders are stored for later
	    * use.
	    */
	   var full_length = Math.ceil(input.length * 8 /
	                                     (Math.log(encoding.length) / Math.log(2)));
	   var remainders = Array(full_length);
	   for(j = 0; j < full_length; j++)
	   {
	     quotient = Array();
	     x = 0;
	     for(i = 0; i < dividend.length; i++)
	     {
	       x = (x << 16) + dividend[i];
	       q = Math.floor(x / divisor);
	       x -= q * divisor;
	       if(quotient.length > 0 || q > 0)
	         quotient[quotient.length] = q;
	     }
	     remainders[j] = x;
	     dividend = quotient;
	   }

	   /* Convert the remainders to the output string */
	   var output = "";
	   for(i = remainders.length - 1; i >= 0; i--)
	     output += encoding.charAt(remainders[i]);

	   return output;
	 }

	 /*
	  * Encode a string as utf-8.
	  * For efficiency, this assumes the input is valid utf-16.
	  */
	 function str2rstr_utf8(input)
	 {
	   var output = "";
	   var i = -1;
	   var x, y;

	   while(++i < input.length)
	   {
	     /* Decode utf-16 surrogate pairs */
	     x = input.charCodeAt(i);
	     y = i + 1 < input.length ? input.charCodeAt(i + 1) : 0;
	     if(0xD800 <= x && x <= 0xDBFF && 0xDC00 <= y && y <= 0xDFFF)
	     {
	       x = 0x10000 + ((x & 0x03FF) << 10) + (y & 0x03FF);
	       i++;
	     }

	     /* Encode output as utf-8 */
	     if(x <= 0x7F)
	       output += String.fromCharCode(x);
	     else if(x <= 0x7FF)
	       output += String.fromCharCode(0xC0 | ((x >>> 6 ) & 0x1F),
	                                     0x80 | ( x         & 0x3F));
	     else if(x <= 0xFFFF)
	       output += String.fromCharCode(0xE0 | ((x >>> 12) & 0x0F),
	                                     0x80 | ((x >>> 6 ) & 0x3F),
	                                     0x80 | ( x         & 0x3F));
	     else if(x <= 0x1FFFFF)
	       output += String.fromCharCode(0xF0 | ((x >>> 18) & 0x07),
	                                     0x80 | ((x >>> 12) & 0x3F),
	                                     0x80 | ((x >>> 6 ) & 0x3F),
	                                     0x80 | ( x         & 0x3F));
	   }
	   return output;
	 }

	 /*
	  * Encode a string as utf-16
	  */
	 function str2rstr_utf16le(input)
	 {
	   var output = "";
	   for(var i = 0; i < input.length; i++)
	     output += String.fromCharCode( input.charCodeAt(i)        & 0xFF,
	                                   (input.charCodeAt(i) >>> 8) & 0xFF);
	   return output;
	 }

	 function str2rstr_utf16be(input)
	 {
	   var output = "";
	   for(var i = 0; i < input.length; i++)
	     output += String.fromCharCode((input.charCodeAt(i) >>> 8) & 0xFF,
	                                    input.charCodeAt(i)        & 0xFF);
	   return output;
	 }

	 /*
	  * Convert a raw string to an array of little-endian words
	  * Characters >255 have their high-byte silently ignored.
	  */
	 function rstr2binl(input)
	 {
	   var output = Array(input.length >> 2);
	   for(var i = 0; i < output.length; i++)
	     output[i] = 0;
	   for(var i = 0; i < input.length * 8; i += 8)
	     output[i>>5] |= (input.charCodeAt(i / 8) & 0xFF) << (i%32);
	   return output;
	 }

	 /*
	  * Convert an array of little-endian words to a string
	  */
	 function binl2rstr(input)
	 {
	   var output = "";
	   for(var i = 0; i < input.length * 32; i += 8)
	     output += String.fromCharCode((input[i>>5] >>> (i % 32)) & 0xFF);
	   return output;
	 }

	 /*
	  * Calculate the MD5 of an array of little-endian words, and a bit length.
	  */
	 function binl_md5(x, len)
	 {
	   /* append padding */
	   x[len >> 5] |= 0x80 << ((len) % 32);
	   x[(((len + 64) >>> 9) << 4) + 14] = len;

	   var a =  1732584193;
	   var b = -271733879;
	   var c = -1732584194;
	   var d =  271733878;

	   for(var i = 0; i < x.length; i += 16)
	   {
	     var olda = a;
	     var oldb = b;
	     var oldc = c;
	     var oldd = d;

	     a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);
	     d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);
	     c = md5_ff(c, d, a, b, x[i+ 2], 17,  606105819);
	     b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);
	     a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);
	     d = md5_ff(d, a, b, c, x[i+ 5], 12,  1200080426);
	     c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);
	     b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);
	     a = md5_ff(a, b, c, d, x[i+ 8], 7 ,  1770035416);
	     d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);
	     c = md5_ff(c, d, a, b, x[i+10], 17, -42063);
	     b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);
	     a = md5_ff(a, b, c, d, x[i+12], 7 ,  1804603682);
	     d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);
	     c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);
	     b = md5_ff(b, c, d, a, x[i+15], 22,  1236535329);

	     a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);
	     d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);
	     c = md5_gg(c, d, a, b, x[i+11], 14,  643717713);
	     b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);
	     a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);
	     d = md5_gg(d, a, b, c, x[i+10], 9 ,  38016083);
	     c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);
	     b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);
	     a = md5_gg(a, b, c, d, x[i+ 9], 5 ,  568446438);
	     d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);
	     c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);
	     b = md5_gg(b, c, d, a, x[i+ 8], 20,  1163531501);
	     a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);
	     d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);
	     c = md5_gg(c, d, a, b, x[i+ 7], 14,  1735328473);
	     b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);

	     a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);
	     d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);
	     c = md5_hh(c, d, a, b, x[i+11], 16,  1839030562);
	     b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);
	     a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);
	     d = md5_hh(d, a, b, c, x[i+ 4], 11,  1272893353);
	     c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);
	     b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);
	     a = md5_hh(a, b, c, d, x[i+13], 4 ,  681279174);
	     d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);
	     c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);
	     b = md5_hh(b, c, d, a, x[i+ 6], 23,  76029189);
	     a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);
	     d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);
	     c = md5_hh(c, d, a, b, x[i+15], 16,  530742520);
	     b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);

	     a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);
	     d = md5_ii(d, a, b, c, x[i+ 7], 10,  1126891415);
	     c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);
	     b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);
	     a = md5_ii(a, b, c, d, x[i+12], 6 ,  1700485571);
	     d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);
	     c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);
	     b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);
	     a = md5_ii(a, b, c, d, x[i+ 8], 6 ,  1873313359);
	     d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);
	     c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);
	     b = md5_ii(b, c, d, a, x[i+13], 21,  1309151649);
	     a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);
	     d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);
	     c = md5_ii(c, d, a, b, x[i+ 2], 15,  718787259);
	     b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);

	     a = safe_add(a, olda);
	     b = safe_add(b, oldb);
	     c = safe_add(c, oldc);
	     d = safe_add(d, oldd);
	   }
	   return Array(a, b, c, d);
	 }

	 /*
	  * These functions implement the four basic operations the algorithm uses.
	  */
	 function md5_cmn(q, a, b, x, s, t)
	 {
	   return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);
	 }
	 function md5_ff(a, b, c, d, x, s, t)
	 {
	   return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);
	 }
	 function md5_gg(a, b, c, d, x, s, t)
	 {
	   return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);
	 }
	 function md5_hh(a, b, c, d, x, s, t)
	 {
	   return md5_cmn(b ^ c ^ d, a, b, x, s, t);
	 }
	 function md5_ii(a, b, c, d, x, s, t)
	 {
	   return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);
	 }

	 /*
	  * Add integers, wrapping at 2^32. This uses 16-bit operations internally
	  * to work around bugs in some JS interpreters.
	  */
	 function safe_add(x, y)
	 {
	   var lsw = (x & 0xFFFF) + (y & 0xFFFF);
	   var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
	   return (msw << 16) | (lsw & 0xFFFF);
	 }

	 /*
	  * Bitwise rotate a 32-bit number to the left.
	  */
	 function bit_rol(num, cnt)
	 {
	   return (num << cnt) | (num >>> (32 - cnt));
	 }

	 return hex_md5(instring);
}

調用：

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" >
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<script type="text/javascript" src="js/md5.js"></script>
</head>
<body>
<script type="text/javascript">
	var a="123";
	alert(a);
	alert(hex_md5(a));
	alert(MD5(a));
</script>
</body>
</html>