function hex_hmac_md5(a, b) { return rstr2hex(rstr_hmac_md5(str2rstr_utf8(a), str2rstr_utf8(b))) function md5_vm_test() { return hex_md5("abc").toLowerCase() == "900150983cd24fb0d6963f7d28e17f72" function rstr_md5(a) { return binl2rstr(binl_md5(rstr2binl(a), a.length * 8 )) function rstr_hmac_md5(c, f) { var e = rstr2binl(c); if (e.length > 16 ) { e = binl_md5(e, c.length * 8 ) var a = Array (16), d = Array (16 ); for ( var b = 0; b < 16; b++ ) { a[b] = e[b]^909522486 ; d[b] = e[b]^1549556828 var g = binl_md5(a.concat(rstr2binl(f)), 512 + f.length * 8 ); return binl2rstr(binl_md5(d.concat(g), 512 + 128 )) function rstr2hex(c) { try { hexcase } catch (g) { hexcase = 0 var f = hexcase ? "0123456789ABCDEF" : "0123456789abcdef" ; var b = "" ; var a; for ( var d = 0; d < c.length; d++ ) { a = c. charCodeAt(d); b += f.charAt((a >>> 4) & 15) + f.charAt(a & 15 ) return b function str2rstr_utf8(c) { var b = "" ; var d = -1 ; var a, while (++d < c. length) { a = c. charCodeAt(d); e = d + 1 < c.length ? c.charCodeAt(d + 1) : 0 ; if (55296 <= a && a <= 56319 && 56320 <= e && e <= 57343 ) { a = 65536 + ((a & 1023) << 10) + (e & 1023 ); if (a <= 127 ) { b += String . fromCharCode(a) } else { if (a <= 2047 ) { b += String .fromCharCode(192 | ((a >>> 6) & 31), 128 | (a & 63 )) } else { if (a <= 65535 ) { b += String .fromCharCode(224 | ((a >>> 12) & 15), 128 | ((a >>> 6) & 63), 128 | (a & 63 )) } else { if (a <= 2097151 ) { b += String .fromCharCode(240 | ((a >>> 18) & 7), 128 | ((a >>> 12) & 63), 128 | ((a >>> 6) & 63), 128 | (a & 63 )) return b function rstr2binl(b) { var a = Array (b.length >> 2 ); for ( var c = 0; c < a.length; c++ ) { a[c] = 0 for ( var c = 0; c < b.length * 8; c += 8 ) { a[c >> 5] |= (b.charCodeAt(c / 8) & 255) << (c % 32 ) return a function binl2rstr(b) { var a = "" ; for ( var c = 0; c < b.length * 32; c += 8 ) { a += String .fromCharCode((b[c >> 5] >>> (c % 32)) & 255 ) return a function binl_md5(p, k) { p[k >> 5] |= 128 << ((k) % 32 ); p[(((k + 64) >>> 9) << 4) + 14] = k; var o = 1732584193 ; var n = -271733879 ; var m = -1732584194 ; var l = 271733878 ; for ( var g = 0; g < p.length; g += 16 ) { var j = o; var h = n; var f = m; var e = l; o = md5_ff(o, n, m, l, p[g + 0], 7, -680876936 ); l = md5_ff(l, o, n, m, p[g + 1], 12, -389564586 ); m = md5_ff(m, l, o, n, p[g + 2], 17, 606105819 ); n = md5_ff(n, m, l, o, p[g + 3], 22, -1044525330 ); o = md5_ff(o, n, m, l, p[g + 4], 7, -176418897 ); l = md5_ff(l, o, n, m, p[g + 5], 12, 1200080426 ); m = md5_ff(m, l, o, n, p[g + 6], 17, -1473231341 ); n = md5_ff(n, m, l, o, p[g + 7], 22, -45705983 ); o = md5_ff(o, n, m, l, p[g + 8], 7, 1770035416 ); l = md5_ff(l, o, n, m, p[g + 9], 12, -1958414417 ); m = md5_ff(m, l, o, n, p[g + 10], 17, -42063 ); n = md5_ff(n, m, l, o, p[g + 11], 22, -1990404162 ); o = md5_ff(o, n, m, l, p[g + 12], 7, 1804603682 ); l = md5_ff(l, o, n, m, p[g + 13], 12, -40341101 ); m = md5_ff(m, l, o, n, p[g + 14], 17, -1502002290 ); n = md5_ff(n, m, l, o, p[g + 15], 22, 1236535329 ); o = md5_gg(o, n, m, l, p[g + 1], 5, -165796510 ); l = md5_gg(l, o, n, m, p[g + 6], 9, -1069501632 ); m = md5_gg(m, l, o, n, p[g + 11], 14, 643717713 ); n = md5_gg(n, m, l, o, p[g + 0], 20, -373897302 ); o = md5_gg(o, n, m, l, p[g + 5], 5, -701558691 ); l = md5_gg(l, o, n, m, p[g + 10], 9, 38016083 ); m = md5_gg(m, l, o, n, p[g + 15], 14, -660478335 ); n = md5_gg(n, m, l, o, p[g + 4], 20, -405537848 ); o = md5_gg(o, n, m, l, p[g + 9], 5, 568446438 ); l = md5_gg(l, o, n, m, p[g + 14], 9, -1019803690 ); m = md5_gg(m, l, o, n, p[g + 3], 14, -187363961 ); n = md5_gg(n, m, l, o, p[g + 8], 20, 1163531501 ); o = md5_gg(o, n, m, l, p[g + 13], 5, -1444681467 ); l = md5_gg(l, o, n, m, p[g + 2], 9, -51403784 ); m = md5_gg(m, l, o, n, p[g + 7], 14, 1735328473 ); n = md5_gg(n, m, l, o, p[g + 12], 20, -1926607734 ); o = md5_hh(o, n, m, l, p[g + 5], 4, -378558 ); l = md5_hh(l, o, n, m, p[g + 8], 11, -2022574463 ); m = md5_hh(m, l, o, n, p[g + 11], 16, 1839030562 ); n = md5_hh(n, m, l, o, p[g + 14], 23, -35309556 ); o = md5_hh(o, n, m, l, p[g + 1], 4, -1530992060 ); l = md5_hh(l, o, n, m, p[g + 4], 11, 1272893353 ); m = md5_hh(m, l, o, n, p[g + 7], 16, -155497632 ); n = md5_hh(n, m, l, o, p[g + 10], 23, -1094730640 ); o = md5_hh(o, n, m, l, p[g + 13], 4, 681279174 ); l = md5_hh(l, o, n, m, p[g + 0], 11, -358537222 ); m = md5_hh(m, l, o, n, p[g + 3], 16, -722521979 ); n = md5_hh(n, m, l, o, p[g + 6], 23, 76029189 ); o = md5_hh(o, n, m, l, p[g + 9], 4, -640364487 ); l = md5_hh(l, o, n, m, p[g + 12], 11, -421815835 ); m = md5_hh(m, l, o, n, p[g + 15], 16, 530742520 ); n = md5_hh(n, m, l, o, p[g + 2], 23, -995338651 ); o = md5_ii(o, n, m, l, p[g + 0], 6, -198630844 ); l = md5_ii(l, o, n, m, p[g + 7], 10, 1126891415 ); m = md5_ii(m, l, o, n, p[g + 14], 15, -1416354905 ); n = md5_ii(n, m, l, o, p[g + 5], 21, -57434055 ); o = md5_ii(o, n, m, l, p[g + 12], 6, 1700485571 ); l = md5_ii(l, o, n, m, p[g + 3], 10, -1894986606 ); m = md5_ii(m, l, o, n, p[g + 10], 15, -1051523 ); n = md5_ii(n, m, l, o, p[g + 1], 21, -2054922799 ); o = md5_ii(o, n, m, l, p[g + 8], 6, 1873313359 ); l = md5_ii(l, o, n, m, p[g + 15], 10, -30611744 ); m = md5_ii(m, l, o, n, p[g + 6], 15, -1560198380 ); n = md5_ii(n, m, l, o, p[g + 13], 21, 1309151649 ); o = md5_ii(o, n, m, l, p[g + 4], 6, -145523070 ); l = md5_ii(l, o, n, m, p[g + 11], 10, -1120210379 ); m = md5_ii(m, l, o, n, p[g + 2], 15, 718787259 ); n = md5_ii(n, m, l, o, p[g + 9], 21, -343485551 ); o = safe_add(o, j); n = safe_add(n, h); m = safe_add(m, f); l = safe_add(l, e) return Array (o, n, m, l) function md5_cmn(h, e, d, c, g, f) { return safe_add(bit_rol(safe_add(safe_add(e, h), safe_add(c, f)), g), d) function md5_ff(g, f, k, j, e, i, h) { return md5_cmn((f & k) | ((~f) & j), g, f, e, i, h) function md5_gg(g, f, k, j, e, i, h) { return md5_cmn((f & j) | (k & (~j)), g, f, e, i, h) function md5_hh(g, f, k, j, e, i, h) { return md5_cmn(f^k^j, g, f, e, i, h) function md5_ii(g, f, k, j, e, i, h) { return md5_cmn(k^(f | (~j)), g, f, e, i, h) function safe_add(a, d) { var c = (a & 65535) + (d & 65535 ); var b = (a >> 16) + (d >> 16) + (c >> 16 ); return (b << 16) | (c & 65535 ) function bit_rol(a, b) { return (a << b) | (a >>> (32 - b)) </script> <script> // base64.js function base64_encode (str) { var base64EncodeChars = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/" ; var out, i, len; var c1, c2, c3; len = str. length; i = 0 ; out = "" ; while (i < len) { c1 = str.charCodeAt(i++) & 0xff ; if (i == len) out += base64EncodeChars.charAt(c1 >> 2 ); out += base64EncodeChars.charAt((c1 & 0x3) << 4 ); out += "==" ; break ; c2 = str.charCodeAt(i++ ); if (i == len) out += base64EncodeChars.charAt(c1 >> 2 ); out += base64EncodeChars.charAt(((c1 & 0x3)<< 4) | ((c2 & 0xF0) >> 4 )); out += base64EncodeChars.charAt((c2 & 0xF) << 2 ); out += "=" ; break ; c3 = str.charCodeAt(i++ ); out += base64EncodeChars.charAt(c1 >> 2 ); out += base64EncodeChars.charAt(((c1 & 0x3)<< 4) | ((c2 & 0xF0) >> 4 )); out += base64EncodeChars.charAt(((c2 & 0xF) << 2) | ((c3 & 0xC0) >>6 )); out += base64EncodeChars.charAt(c3 & 0x3F ); return out; function base64_decode (str) { var base64DecodeChars = new Array ( -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, -1, -1, -1, 63, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -1, -1, -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1, -1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1 ); var c1, c2, c3, c4; var i, len, out; len = str. length; i = 0 ; out = "" ; while (i < len) { /* c1 */ c1 = base64DecodeChars[str.charCodeAt(i++) & 0xff ]; } while (i < len && c1 == -1 ); if (c1 == -1 ) break ; /* c2 */ c2 = base64DecodeChars[str.charCodeAt(i++) & 0xff ]; } while (i < len && c2 == -1 ); if (c2 == -1 ) break ; out += String .fromCharCode((c1 << 2) | ((c2 & 0x30) >> 4 )); /* c3 */ c3 = str.charCodeAt(i++) & 0xff ; if (c3 == 61 ) return out; c3 = base64DecodeChars[c3]; } while (i < len && c3 == -1 ); if (c3 == -1 ) break ; out += String .fromCharCode(((c2 & 0XF) << 4) | ((c3 & 0x3C) >> 2 )); /* c4 */ c4 = str.charCodeAt(i++) & 0xff ; if (c4 == 61 ) return out; c4 = base64DecodeChars[c4]; } while (i < len && c4 == -1 ); if (c4 == -1 ) break ; out += String .fromCharCode(((c3 & 0x03) << 6) | c4); return out; function utf16to8(str) { var out, i, len, c; out = "" ; len = str. length; for (i = 0; i < len; i++ ) { c = str. charCodeAt(i); if ((c >= 0x0001) && (c <= 0x007F )) { out += str. charAt(i); } else if (c > 0x07FF ) { out += String .fromCharCode(0xE0 | ((c >> 12) & 0x0F )); out += String .fromCharCode(0x80 | ((c >> 6) & 0x3F )); out += String .fromCharCode(0x80 | ((c >> 0) & 0x3F )); } else { out += String .fromCharCode(0xC0 | ((c >> 6) & 0x1F )); out += String .fromCharCode(0x80 | ((c >> 0) & 0x3F )); return out; function utf8to16(str) { var out, i, len, c; var char2, char3; out = "" ; len = str. length; i = 0 ; while (i < len) { c = str.charCodeAt(i++ ); switch (c >> 4 ) case 0: case 1: case 2: case 3: case 4: case 5: case 6: case 7: // 0xxxxxxx out += str.charAt(i-1 ); break ; case 12: case 13: // 110x xxxx 10xx xxxx char2 = str.charCodeAt(i++ ); out += String .fromCharCode(((c & 0x1F) << 6) | (char2 & 0x3F )); break ; case 14: // 1110 xxxx 10xx xxxx 10xx xxxx char2 = str.charCodeAt(i++ ); char3 = str.charCodeAt(i++ ); out += String .fromCharCode(((c & 0x0F) << 12) | ((char2 & 0x3F) << 6) | ((char3 & 0x3F) << 0 )); break ; return out; </script> <script> * @param string str 加密内容 * @param string operation 加密动作 * @param string key 密钥 * @param int expiry 有效时间秒 * @return string 加密串 function authcode(str, operation, key , expiry) { var operation = operation ? operation : 'DECODE' ; var key = key ? key : '' ; var expiry = expiry ? expiry : 0 ; var ckey_length = 4 ; key = md5 ( key ); // 密匙a会参与加解密 var keya = md5 ( key . substr (0, 16 )); // 密匙b会用来做数据完整性验证 var keyb = md5 ( key . substr (16, 16 )); // 密匙c用于变化生成的密文 // IE下不支持substr第一个参数为负数的情况 if (ckey_length){ if (operation == 'DECODE' ){ var keyc = str. substr (0, ckey_length); } else { var md5_time = md5 ( microtime ()); var start = md5_time.length - ckey_length; var keyc = md5_time. substr (start, ckey_length) } else { var keyc = '' ; // 参与运算的密匙 var cryptkey = keya + md5 (keya + keyc); var strbuf; if (operation == 'DECODE' ) { str = str. substr (ckey_length); strbuf = base64_decode (str); // string = b.toString(); } else { expiry = expiry ? expiry + time () : 0 ; tmpstr = expiry. toString(); if (tmpstr.length >= 10 ) str = tmpstr. substr (0, 10) + md5 (str + keyb). substr (0, 16) + str; else { var count = 10 - tmpstr. length; for ( var i = 0; i < count ; i++ ) { tmpstr = '0' + tmpstr; str = tmpstr + md5 (str + keyb). substr (0, 16) + str; strbuf = str; var box = new Array (256 ); for ( var i = 0; i < 256; i++ ) { box[i] = i; var rndkey = new Array (); // 产生密匙簿 for ( var i = 0; i < 256; i++ ) { rndkey[i] = cryptkey.charCodeAt(i % cryptkey. length); // 用固定的算法，打乱密匙簿，增加随机性，好像很复杂，实际上对并不会增加密文的强度 for ( var j = i = 0; i < 256; i++ ) { j = (j + box[i] + rndkey[i]) % 256 ; tmp = box[i]; box[i] = box[j]; box[j] = tmp; // 核心加解密部分 var s = '' ; // IE下不支持直接通过下标访问字符串的字符，需要先转换为数组 strbuf = strbuf. split ('' ); for ( var a = j = i = 0; i < strbuf.length; i++ ) { a = (a + 1) % 256 ; j = (j + box[a]) % 256 ; tmp = box[a]; box[a] = box[j]; box[j] = tmp; // 从密匙簿得出密匙进行异或，再转成字符 s += chr ( ord (strbuf[i])^(box[(box[a] + box[j]) % 256 ])); if (operation == 'DECODE' ) { if ((s. substr (0, 10) == 0 || s. substr (0, 10) - time () > 0) && s. substr (10, 16) == md5 (s. substr (26) + keyb). substr (0, 16 )) { s = s. substr (26 ); } else { s = '' ; } else { s = base64_encode (s); var regex = new RegExp('=', "g" ); s = s.replace(regex, '' ); s = keyc + s; return (s); function time () { var unixtime_ms = new Date (). getTime(); return parseInt(unixtime_ms / 1000 ); function microtime (get_as_float) { var unixtime_ms = new Date (). getTime(); var sec = parseInt(unixtime_ms / 1000 ); return get_as_float ? (unixtime_ms / 1000) : (unixtime_ms - (sec * 1000)) / 1000 + ' ' + sec; function chr (s) { return String . fromCharCode(s); function ord (s) { return s. charCodeAt(); function md5 (str) { return hex_md5(str); // js版本的加密和解密（ps:js需要引入md5.js和base64.js） //使用方法： var key = "1" ; document .write("js版本加密："+ base64_encode (authcode('abc','ENCODE', key ))+"<br>" ); document .write("js版本解密："+authcode( base64_decode ('YTVjZm9FU0NKSG5xL2J4UDNSSnhCVUpWY2pMR0E2OG4xS3VGbVNSa2xGNA=='),'DECODE', key )+"<br><br><br>" ); </script> <? php function authcode( $string , $operation = 'DECODE', $key = '', $expiry = 0 ) $ckey_length = 4 ; $key = md5 ( $key ); $keya = md5 ( substr ( $key , 0, 16 )); $keyb = md5 ( substr ( $key , 16, 16 )); $keyc = $ckey_length ? ( $operation == 'DECODE' ? substr ( $string , 0, $ckey_length ): substr ( md5 ( microtime ()), - $ckey_length )) : '' ; $cryptkey = $keya . md5 ( $keya . $keyc ); $key_length = strlen ( $cryptkey ); $string = $operation == 'DECODE' ? base64_decode ( substr ( $string , $ckey_length )) : sprintf ('%010d', $expiry ? $expiry + time () : 0). substr ( md5 ( $string . $keyb ), 0, 16). $string ; $string_length = strlen ( $string ); $result = '' ; $box = range (0, 255 ); $rndkey = array (); for ( $i = 0; $i <= 255; $i ++ ) $rndkey [ $i ] = ord ( $cryptkey [ $i % $key_length ]); for ( $j = $i = 0; $i < 256; $i ++ ) $j = ( $j + $box [ $i ] + $rndkey [ $i ]) % 256 ; $tmp = $box [ $i ]; $box [ $i ] = $box [ $j ]; $box [ $j ] = $tmp ; for ( $a = $j = $i = 0; $i < $string_length ; $i ++ ) $a = ( $a + 1) % 256 ; $j = ( $j + $box [ $a ]) % 256 ; $tmp = $box [ $a ]; $box [ $a ] = $box [ $j ]; $box [ $j ] = $tmp ; $result .= chr ( ord ( $string [ $i ]) ^ ( $box [( $box [ $a ] + $box [ $j ]) % 256 ])); if ( $operation == 'DECODE' ) if (( substr ( $result , 0, 10) == 0 || substr ( $result , 0, 10) - time () > 0) && substr ( $result , 10, 16) == substr ( md5 ( substr ( $result , 26). $keyb ), 0, 16 )) return substr ( $result , 26 ); } else { return '' ; } else { return $keyc . str_replace ('=', '', base64_encode ( $result )); // 使用方法： $key = '1'; // 加密密钥 $a01 = base64_encode (authcode("abc",'ENCODE', $key ,0)); // 加密 echo "php版本加密：". $a01 ."<br>"; // 输出的是加密文件 $url = authcode( base64_decode ("OGU0MmJsK0R4TmFVM0pENzZiYUV2c1ZaUlVqNmJKVXpRNVBDSmZjUGt3bw=="),'DECODE', $key ,0); // 解密 echo "php版本解密：". $url ; // 输出的解密文件 echo '<br>' ;