谁能发一个JS版MD5函数，网上找的加密中文时就和VB版结果不一样：（
百度、Google找过了，蓝色论坛上也搜索过了
加密非中文字符时JS版和VB版结果一样
一旦加密的是中文字符，就不一样：（
本想将JS版和VB版函数都发上来，太长了发不了
大家可到蓝色论坛上看下我发的
http://bbs.blueidea.com/thread-2771831-1-1.html
[解决办法]
/***************************************************************************************
* md5加密算法
* 此代码版权归原作者所有，
*
* 如果您对本程序有什么建议，请email to:ocean@forever.net.cn。
*
* 海洋工作室
* http://www.oceanstudio.net
* ocean(ocean@forever.net.cn) 制作
*****************************************************************************************/
/*****************************************************************************************
* md5加密算法
* 原作者的版权声明如下, 我将原作者的代码封装到String中
* 具体使用请参见例子
* md5.js
* 调用方法:object.value=string.calcMD5();
* 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);
}
[解决办法]
var md5 = function(sInp){
var sAscii = " !\ "#$%& '()*+,-./0123456789:; <=> ?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~ ";
var sHex = "0123456789ABCDEF ";
var hex = function(i){
var h = " ";
for(j = 0; j <= 3; j++){
h += sHex.charAt((i > > (j * 8 + 4)) & 0x0F) + sHex.charAt((i > > (j * 8)) & 0x0F);
}
return h;
};
var add = function (x, y){
return ((x&0x7FFFFFFF) + (y&0x7FFFFFFF)) ^ (x&0x80000000) ^ (y&0x80000000);
};
var R1 = function (A, B, C, D, X, S, T){
var q = add(add(A, (B & C) | (~B & D)), add(X, T));
return add((q < < S) | ((q > > (32 - S)) & (Math.pow(2, S) - 1)), B);
};
var R2 = function (A, B, C, D, X, S, T){
var q = add(add(A, (B & D) | (C & ~D)), add(X, T));
return add((q < < S) | ((q > > (32 - S)) & (Math.pow(2, S) - 1)), B);
};
var R3 = function (A, B, C, D, X, S, T){
var q = add(add(A, B ^ C ^ D), add(X, T));
return add((q < < S) | ((q > > (32 - S)) & (Math.pow(2, S) - 1)), B);
};
var R4 = function (A, B, C, D, X, S, T){
var q = add(add(A, C ^ (B | ~D)), add(X, T));
return add((q < < S) | ((q > > (32 - S)) & (Math.pow(2, S) - 1)), B);
};
var wLen = (((sInp.length + 8) > > 6) + 1) < < 4;
var X = new Array(wLen);
var j = 4,i=0;
for (i = 0; (i * 4) < sInp.length; i++){
X[i] = 0;
for (j = 0; (j < 4) && ((j + i * 4) < sInp.length); j++){
X[i] += (sAscii.indexOf(sInp.charAt((i * 4) + j)) + 32) < < (j * 8);
}
}
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;
var a = 0x67452301;
var b = 0xefcdab89;
var c = 0x98badcfe;
var d = 0x10325476;
for (i = 0; i < wLen; i += 16) {
var aO = a;
var bO = b;
var cO = c;
var dO = d;
a = R1(a, b, c, d, X[i+ 0], 7 , 0xd76aa478);
d = R1(d, a, b, c, X[i+ 1], 12, 0xe8c7b756);
c = R1(c, d, a, b, X[i+ 2], 17, 0x242070db);
b = R1(b, c, d, a, X[i+ 3], 22, 0xc1bdceee);
a = R1(a, b, c, d, X[i+ 4], 7 , 0xf57c0faf);
d = R1(d, a, b, c, X[i+ 5], 12, 0x4787c62a);
c = R1(c, d, a, b, X[i+ 6], 17, 0xa8304613);
b = R1(b, c, d, a, X[i+ 7], 22, 0xfd469501);
a = R1(a, b, c, d, X[i+ 8], 7 , 0x698098d8);
d = R1(d, a, b, c, X[i+ 9], 12, 0x8b44f7af);
c = R1(c, d, a, b, X[i+10], 17, 0xffff5bb1);
b = R1(b, c, d, a, X[i+11], 22, 0x895cd7be);
a = R1(a, b, c, d, X[i+12], 7 , 0x6b901122);
d = R1(d, a, b, c, X[i+13], 12, 0xfd987193);
c = R1(c, d, a, b, X[i+14], 17, 0xa679438e);
b = R1(b, c, d, a, X[i+15], 22, 0x49b40821);
a = R2(a, b, c, d, X[i+ 1], 5 , 0xf61e2562);
d = R2(d, a, b, c, X[i+ 6], 9 , 0xc040b340);
c = R2(c, d, a, b, X[i+11], 14, 0x265e5a51);
b = R2(b, c, d, a, X[i+ 0], 20, 0xe9b6c7aa);
a = R2(a, b, c, d, X[i+ 5], 5 , 0xd62f105d);
d = R2(d, a, b, c, X[i+10], 9 , 0x2441453);
c = R2(c, d, a, b, X[i+15], 14, 0xd8a1e681);
b = R2(b, c, d, a, X[i+ 4], 20, 0xe7d3fbc8);
a = R2(a, b, c, d, X[i+ 9], 5 , 0x21e1cde6);
d = R2(d, a, b, c, X[i+14], 9 , 0xc33707d6);
c = R2(c, d, a, b, X[i+ 3], 14, 0xf4d50d87);
b = R2(b, c, d, a, X[i+ 8], 20, 0x455a14ed);
a = R2(a, b, c, d, X[i+13], 5 , 0xa9e3e905);
d = R2(d, a, b, c, X[i+ 2], 9 , 0xfcefa3f8);
c = R2(c, d, a, b, X[i+ 7], 14, 0x676f02d9);
b = R2(b, c, d, a, X[i+12], 20, 0x8d2a4c8a);
a = R3(a, b, c, d, X[i+ 5], 4 , 0xfffa3942);
d = R3(d, a, b, c, X[i+ 8], 11, 0x8771f681);
c = R3(c, d, a, b, X[i+11], 16, 0x6d9d6122);
b = R3(b, c, d, a, X[i+14], 23, 0xfde5380c);
a = R3(a, b, c, d, X[i+ 1], 4 , 0xa4beea44);
d = R3(d, a, b, c, X[i+ 4], 11, 0x4bdecfa9);
c = R3(c, d, a, b, X[i+ 7], 16, 0xf6bb4b60);
b = R3(b, c, d, a, X[i+10], 23, 0xbebfbc70);
a = R3(a, b, c, d, X[i+13], 4 , 0x289b7ec6);
d = R3(d, a, b, c, X[i+ 0], 11, 0xeaa127fa);
c = R3(c, d, a, b, X[i+ 3], 16, 0xd4ef3085);
b = R3(b, c, d, a, X[i+ 6], 23, 0x4881d05);
a = R3(a, b, c, d, X[i+ 9], 4 , 0xd9d4d039);
d = R3(d, a, b, c, X[i+12], 11, 0xe6db99e5);
c = R3(c, d, a, b, X[i+15], 16, 0x1fa27cf8);
b = R3(b, c, d, a, X[i+ 2], 23, 0xc4ac5665);
a = R4(a, b, c, d, X[i+ 0], 6 , 0xf4292244);
d = R4(d, a, b, c, X[i+ 7], 10, 0x432aff97);
c = R4(c, d, a, b, X[i+14], 15, 0xab9423a7);
b = R4(b, c, d, a, X[i+ 5], 21, 0xfc93a039);
a = R4(a, b, c, d, X[i+12], 6 , 0x655b59c3);
d = R4(d, a, b, c, X[i+ 3], 10, 0x8f0ccc92);
c = R4(c, d, a, b, X[i+10], 15, 0xffeff47d);
b = R4(b, c, d, a, X[i+ 1], 21, 0x85845dd1);
a = R4(a, b, c, d, X[i+ 8], 6 , 0x6fa87e4f);
d = R4(d, a, b, c, X[i+15], 10, 0xfe2ce6e0);
c = R4(c, d, a, b, X[i+ 6], 15, 0xa3014314);
b = R4(b, c, d, a, X[i+13], 21, 0x4e0811a1);
a = R4(a, b, c, d, X[i+ 4], 6 , 0xf7537e82);
d = R4(d, a, b, c, X[i+11], 10, 0xbd3af235);
c = R4(c, d, a, b, X[i+ 2], 15, 0x2ad7d2bb);
b = R4(b, c, d, a, X[i+ 9], 21, 0xeb86d391);
a = add(a, aO);
b = add(b, bO);
c = add(c, cO);
d = add(d, dO);
}
return hex(a) + hex(b) + hex(c) + hex(d);
};
String.prototype.md5 = function(){
return md5(this);
}
[解决办法]
/* MD5 Message-Digest Algorithm - JavaScript
' MODIFICATION HISTORY:
' 1.0 16-Feb-2001 - Phil Fresle (sales@frez.co.uk) - Initial Version (VB/ASP code)
' 1.0 21-Feb-2001 - Enrico Mosanghini (erik504@yahoo.com) - JavaScript porting
*/
function MD5(sMessage) {
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;
// Steps 1 and 2. Append padding bits and length and convert to words
x = ConvertToWordArray(sMessage);
// Step 3. Initialise
a = 0x67452301; b = 0xEFCDAB89; c = 0x98BADCFE; d = 0x10325476;
// Step 4. Process the message in 16-word blocks
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);
}
// Step 5. Output the 128 bit digest
var temp= WordToHex(a)+WordToHex(b)+WordToHex(c)+WordToHex(d);
return temp.toLowerCase();
function RotateLeft(lValue, iShiftBits) {
return (lValue < <iShiftBits) | (lValue> > > (32-iShiftBits));
}
function AddUnsigned(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);
}
function F(x,y,z) { return (x & y) | ((~x) & z); }
function G(x,y,z) { return (x & z) | (y & (~z)); }
function H(x,y,z) { return (x ^ y ^ z); }
function I(x,y,z) { return (y ^ (x | (~z))); }
function FF(a,b,c,d,x,s,ac) {
a = AddUnsigned(a, AddUnsigned(AddUnsigned(F(b, c, d), x), ac));
return AddUnsigned(RotateLeft(a, s), b);
}
function GG(a,b,c,d,x,s,ac) {
a = AddUnsigned(a, AddUnsigned(AddUnsigned(G(b, c, d), x), ac));
return AddUnsigned(RotateLeft(a, s), b);
}
function HH(a,b,c,d,x,s,ac) {
a = AddUnsigned(a, AddUnsigned(AddUnsigned(H(b, c, d), x), ac));
return AddUnsigned(RotateLeft(a, s), b);
}
function II(a,b,c,d,x,s,ac) {
a = AddUnsigned(a, AddUnsigned(AddUnsigned(I(b, c, d), x), ac));
return AddUnsigned(RotateLeft(a, s), b);
}
function ConvertToWordArray(sMessage) {
var lWordCount;
var lMessageLength = sMessage.length;
var lNumberOfWords_temp1=lMessageLength + 8;
var lNumberOfWords_temp2=(lNumberOfWords_temp1-(lNumberOfWords_temp1 % 64))/64;
var lNumberOfWords = (lNumberOfWords_temp2+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] | (sMessage.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;
}
function WordToHex(lValue) {
var WordToHexValue= " ",WordToHexValue_temp= " ",lByte,lCount;
for (lCount = 0;lCount <=3;lCount++) {
lByte = (lValue> > > (lCount*8)) & 255;
WordToHexValue_temp = "0 " + lByte.toString(16);
WordToHexValue = WordToHexValue + WordToHexValue_temp.substr(WordToHexValue_temp.length-2,2);
}
return WordToHexValue;
}
} // end function MD5(sMessage)
[解决办法]
观望.
上面的函数测试都未通过.
"中文 " 的MD5值是
a7bac2239fcdcb3a067903d8077c4a07
[解决办法]
呵呵，JS 和 Java 一样，处理字符变量时内部都使用 Unicode 编码（用 UTF-16）。
VB 可能是（因为我没有测试过）用你运行环境的编码方式。
字符流一样，但字节流不一样，结果自然不一样喽。
解决思路：统一编码，没有其他办法。