java js hexmd5 不一致_js MD5包含中文串时加密结果与JAVA结果不一致的解决方案

1 //UTF-8转码方法1

2 URLEncoder.encode(str,'utf-8');3

4 //UTF-8转码方法2

5 functionUtf8Encode(string) {6 var utftext = "";7 for (var n = 0; n < string.length; n++) {8 var c =string.charCodeAt(n);9 if (c < 128) {10 utftext +=String.fromCharCode(c);11 } else if ((c > 127) && (c < 2048)) {12 utftext += String.fromCharCode((c >> 6) | 192);13 utftext += String.fromCharCode((c & 63) | 128);14 } else{15 utftext += String.fromCharCode((c >> 12) | 224);16 utftext += String.fromCharCode(((c >> 6) & 63) | 128);17 utftext += String.fromCharCode((c & 63) | 128);18 }19 }20 returnutftext;21 }22

23 //常规MD5加密代码(供参考)

24 /*

25 * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message26 * Digest Algorithm, as defined in RFC 1321.27 * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002.28 * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet29 * Distributed under the BSD License30 * See http://pajhome.org.uk/crypt/md5 for more info.31 */

32

33 /*

34 * Configurable variables. You may need to tweak these to be compatible with35 * the server-side, but the defaults work in most cases.36 */

37 var hexcase = 0; /*hex output format. 0 - lowercase; 1 - uppercase*/

38 var b64pad = ""; /*base-64 pad character. "=" for strict RFC compliance*/

39 var chrsz = 8; /*bits per input character. 8 - ASCII; 16 - Unicode*/

40

41 /*

42 * These are the functions you'll usually want to call43 * They take string arguments and return either hex or base-64 encoded strings44 */

45 function hex_md5(s){ return binl2hex(core_md5(str2binl(s), s.length *chrsz));}46 function b64_md5(s){ return binl2b64(core_md5(str2binl(s), s.length *chrsz));}47 function str_md5(s){ return binl2str(core_md5(str2binl(s), s.length *chrsz));}48 function hex_hmac_md5(key, data) { returnbinl2hex(core_hmac_md5(key, data)); }49 function b64_hmac_md5(key, data) { returnbinl2b64(core_hmac_md5(key, data)); }50 function str_hmac_md5(key, data) { returnbinl2str(core_hmac_md5(key, data)); }51

52 /*

53 * Perform a simple self-test to see if the VM is working54 */

55 functionmd5_vm_test()56 {57 return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72";58 }59

60 /*

61 * Calculate the MD5 of an array of little-endian words, and a bit length62 */

63 functioncore_md5(x, len)64 {65 /*append padding*/

66 x[len >> 5] |= 0x80 << ((len) % 32);67 x[(((len + 64) >>> 9) << 4) + 14] =len;68

69 var a = 1732584193;70 var b = -271733879;71 var c = -1732584194;72 var d = 271733878;73

74 for(var i = 0; i < x.length; i += 16)75 {76 var olda =a;77 var oldb =b;78 var oldc =c;79 var oldd =d;80

81 a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);82 d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);83 c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);84 b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);85 a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);86 d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);87 c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);88 b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);89 a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);90 d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);91 c = md5_ff(c, d, a, b, x[i+10], 17, -42063);92 b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);93 a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);94 d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);95 c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);96 b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);97

98 a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);99 d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);100 c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);101 b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);102 a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);103 d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);104 c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);105 b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);106 a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);107 d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);108 c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);109 b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);110 a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);111 d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);112 c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);113 b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);114

115 a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);116 d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);117 c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);118 b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);119 a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);120 d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);121 c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);122 b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);123 a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);124 d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);125 c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);126 b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);127 a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);128 d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);129 c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);130 b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);131

132 a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);133 d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);134 c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);135 b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);136 a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);137 d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);138 c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);139 b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);140 a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);141 d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);142 c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);143 b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);144 a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);145 d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);146 c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);147 b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);148

149 a =safe_add(a, olda);150 b =safe_add(b, oldb);151 c =safe_add(c, oldc);152 d =safe_add(d, oldd);153 }154 returnArray(a, b, c, d);155

156 }157

158 /*

159 * These functions implement the four basic operations the algorithm uses.160 */

161 functionmd5_cmn(q, a, b, x, s, t)162 {163 returnsafe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);164 }165 functionmd5_ff(a, b, c, d, x, s, t)166 {167 return md5_cmn((b & c) | ((~b) &d), a, b, x, s, t);168 }169 functionmd5_gg(a, b, c, d, x, s, t)170 {171 return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);172 }173 functionmd5_hh(a, b, c, d, x, s, t)174 {175 return md5_cmn(b ^ c ^d, a, b, x, s, t);176 }177 functionmd5_ii(a, b, c, d, x, s, t)178 {179 return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);180 }181

182 /*

183 * Calculate the HMAC-MD5, of a key and some data184 */

185 functioncore_hmac_md5(key, data)186 {187 var bkey =str2binl(key);188 if(bkey.length > 16) bkey = core_md5(bkey, key.length *chrsz);189

190 var ipad = Array(16), opad = Array(16);191 for(var i = 0; i < 16; i++)192 {193 ipad[i] = bkey[i] ^ 0x36363636;194 opad[i] = bkey[i] ^ 0x5C5C5C5C;195 }196

197 var hash = core_md5(ipad.concat(str2binl(data)), 512 + data.length *chrsz);198 return core_md5(opad.concat(hash), 512 + 128);199 }200

201 /*

202 * Add integers, wrapping at 2^32. This uses 16-bit operations internally203 * to work around bugs in some JS interpreters.204 */

205 functionsafe_add(x, y)206 {207 var lsw = (x & 0xFFFF) + (y & 0xFFFF);208 var msw = (x >> 16) + (y >> 16) + (lsw >> 16);209 return (msw << 16) | (lsw & 0xFFFF);210 }211

212 /*

213 * Bitwise rotate a 32-bit number to the left.214 */

215 functionbit_rol(num, cnt)216 {217 return (num << cnt) | (num >>> (32 -cnt));218 }219

220 /*

221 * Convert a string to an array of little-endian words222 * If chrsz is ASCII, characters >255 have their hi-byte silently ignored.223 */

224 functionstr2binl(str)225 {226 var bin =Array();227 var mask = (1 << chrsz) - 1;228 for(var i = 0; i < str.length * chrsz; i +=chrsz)229 bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (i%32);230 returnbin;231 }232

233 /*

234 * Convert an array of little-endian words to a string235 */

236 functionbinl2str(bin)237 {238 var str = "";239 var mask = (1 << chrsz) - 1;240 for(var i = 0; i < bin.length * 32; i +=chrsz)241 str += String.fromCharCode((bin[i>>5] >>> (i % 32)) &mask);242 returnstr;243 }244

245 /*

246 * Convert an array of little-endian words to a hex string.247 */

248 functionbinl2hex(binarray)249 {250 var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";251 var str = "";252 for(var i = 0; i < binarray.length * 4; i++)253 {254 str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) +

255 hex_tab.charAt((binarray[i>>2] >> ((i%4)*8 )) & 0xF);256 }257 returnstr;258 }259

260 /*

261 * Convert an array of little-endian words to a base-64 string262 */

263 functionbinl2b64(binarray)264 {265 var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";266 var str = "";267 for(var i = 0; i < binarray.length * 4; i += 3)268 {269 var triplet = (((binarray[i >> 2] >> 8 * ( i %4)) & 0xFF) << 16)270 | (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8)271 | ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF);272 for(var j = 0; j < 4; j++)273 {274 if(i * 8 + j * 6 > binarray.length * 32) str +=b64pad;275 else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);276 }277 }278 returnstr;279 }