关于javascript md5 函数

ゝ一纸荒年。 2024-04-03 12:26 67阅读 0赞

var hexcase = 1;

var b64pad = "";

var chrsz = 8;

var mode = 16; //模式选择 (16为16位的[加密][Link 1] 32 为32位的加密)

function preprocess(form)

var str = "";

str += form.verifycode.value;

str = str.toUpperCase();

form.p.value = [md5][](md5\_3(form.p.value)+str);

return true;

function md5\_3(s)

var tmp = new Array;

tmp = core\_md5(str2binl(s), s.length \* chrsz);

tmp = core\_md5(tmp, 16 \* chrsz);

return binl2hex(tmp);

function md5(s)

return hex\_md5(s);

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 str\_md5(s)

return binl2str(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));

function str\_hmac\_md5(key, data)

return binl2str(core\_hmac\_md5(key, data));

function md5\_vm\_test()

return hex\_md5("abc") == "900150983cd24fb0d6963f7d28e17f72";

function core\_md5(x, len)

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);

if (mode == 16)

return Array(b, c);

else

return Array(a, b, c, d);

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);

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);

function safe\_add(x, y)

var lsw = (x & 0xFFFF) + (y & 0xFFFF);

var msw = (x >> 16) + (y >> 16) + (lsw >> 16);

return (msw << 16) | (lsw & 0xFFFF);

function bit\_rol(num, cnt)

return (num << cnt) | (num >>> (32-cnt));

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;

function binl2str(bin)

var str = "";

var mask = (1 << chrsz) - 1;

for (var i = 0; i < bin.length \* 32; i += chrsz)

str += String.fromCharCode((bin\[i >> 5\] >>> (i % 32)) & mask);

return str;

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;

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.js

调用代码为 在需要使用的页面 拷入下面代码

＜script src="md5.js"＞＜/script＞

调用演示：

＜script>　　 alert(md5("123456"));

来源：[https://www.weidianyuedu.com][https_www.weidianyuedu.com]

[Link 1]: https://so.csdn.net/so/search?q=%E5%8A%A0%E5%AF%86&spm=1001.2101.3001.7020
[md5]: https://so.csdn.net/so/search?q=md5&spm=1001.2101.3001.7020
[https_www.weidianyuedu.com]: https://www.weidianyuedu.com

关于javascript md5 函数

发表评论取消回复

还没有评论，来说两句吧...

相关阅读

相关关于javascript md5 函数

相关 javascript md5 函数浅谈

相关 javascript 实现MD5加密

相关 javascript实现MD5加密

相关 Javascript的MD5加密

相关 C++ MD5加密函数

相关 c++ md5加密函数

相关 JavaScript编写MD5加密

相关 javascript 生成MD5加密

相关 JavaScript md5