<script language="JavaScript"> /***************************************************************************** * 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 */ var sAscii = " !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ" var sAscii = sAscii + "[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~"; /* convert integer to hex string */ var sHex = "0123456789ABCDEF"; function hex(i) { h = ""; for(j = 0; j <= 3; j++) { h += sHex.charAt((i >> (j * 8 + 4)) & 0x0F) + sHex.charAt((i >> (j * 8)) & 0x0F); } return h; } /* add, handling overflows correctly */ function add(x, y) { return ((x&0x7FFFFFFF) + (y&0x7FFFFFFF)) ^ (x&0x80000000) ^ (y&0x80000000); } /* MD5 rounds functions */ function R1(A, B, C, D, X, S, T) { q = add(add(A, (B & C) | (~B & D)), add(X, T)); return add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B); } function R2(A, B, C, D, X, S, T) { q = add(add(A, (B & D) | (C & ~D)), add(X, T)); return add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B); } function R3(A, B, C, D, X, S, T) { q = add(add(A, B ^ C ^ D), add(X, T)); return add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B); } function R4(A, B, C, D, X, S, T) { q = add(add(A, C ^ (B | ~D)), add(X, T)); return add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B); } /* main entry point */ function calcMD5(sInp) { /* 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 for (j = 0; (j < 4) && ((j + i * 4) < sInp.length); j++) { X } } /* Append padding bits and length */ if (j == 4) { X } else { X } for(; i < wLen; i++) { X } 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 = R1(a, b, c, d, X d = R1(d, a, b, c, X c = R1(c, d, a, b, X b = R1(b, c, d, a, X a = R1(a, b, c, d, X d = R1(d, a, b, c, X c = R1(c, d, a, b, X b = R1(b, c, d, a, X a = R1(a, b, c, d, X d = R1(d, a, b, c, X c = R1(c, d, a, b, X b = R1(b, c, d, a, X a = R1(a, b, c, d, X d = R1(d, a, b, c, X c = R1(c, d, a, b, X b = R1(b, c, d, a, X a = R2(a, b, c, d, X d = R2(d, a, b, c, X c = R2(c, d, a, b, X b = R2(b, c, d, a, X a = R2(a, b, c, d, X d = R2(d, a, b, c, X c = R2(c, d, a, b, X b = R2(b, c, d, a, X a = R2(a, b, c, d, X d = R2(d, a, b, c, X c = R2(c, d, a, b, X b = R2(b, c, d, a, X a = R2(a, b, c, d, X d = R2(d, a, b, c, X c = R2(c, d, a, b, X b = R2(b, c, d, a, X a = R3(a, b, c, d, X d = R3(d, a, b, c, X c = R3(c, d, a, b, X b = R3(b, c, d, a, X a = R3(a, b, c, d, X d = R3(d, a, b, c, X c = R3(c, d, a, b, X b = R3(b, c, d, a, X a = R3(a, b, c, d, X d = R3(d, a, b, c, X c = R3(c, d, a, b, X b = R3(b, c, d, a, X a = R3(a, b, c, d, X d = R3(d, a, b, c, X c = R3(c, d, a, b, X b = R3(b, c, d, a, X a = R4(a, b, c, d, X d = R4(d, a, b, c, X c = R4(c, d, a, b, X b = R4(b, c, d, a, X a = R4(a, b, c, d, X d = R4(d, a, b, c, X c = R4(c, d, a, b, X b = R4(b, c, d, a, X a = R4(a, b, c, d, X d = R4(d, a, b, c, X c = R4(c, d, a, b, X b = R4(b, c, d, a, X a = R4(a, b, c, d, X d = R4(d, a, b, c, X c = R4(c, d, a, b, X b = R4(b, c, d, a, X 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); } </script> <input type="text" id="m"><input type=button value="md5加密" onclick=alert(calcMD5(m.value)) |
MD5的验证
转载下一篇:我的友情链接
提问和评论都可以,用心的回复会被更多人看到
评论
发布评论
相关文章
-
Linux 文件管理命令 md5sum awk
Linux 文件管理命令md5sum:MD5 函数值计算和检查 awk:模式匹配语言
Linux命令 md5sum awk -
eigrp md5验证
&n
md5验证 -
android对文件的MD5验证
android自带的MD5校验例程
android string buffer hex exception