JS常用加密编码与算法实例总结

前端之家收集整理的这篇文章主要介绍了JS常用加密编码与算法实例总结前端之家小编觉得挺不错的,现在分享给大家,也给大家做个参考。

本文实例讲述了JS常用加密编码与算法。分享给大家供大家参考,具体如下:

一:UTF8编码函数

=0x30&&icode<=0x39)||(icode>=0x41&&icode<=0x5A)||(icode>=0x61&&icode<=0x7A)) newStr+=Str.charAt(i); else newStr+="%"+toCase(icode); } else if(icode<0x800){ newStr+="%"+toCase(0xC0+(icode>>6)); newStr+="%"+toCase(0x80+icode%0x40); } else{ newStr+="%"+toCase(0xE0+(icode>>12)); newStr+="%"+toCase(0x80+(icode>>6)%0x40); newStr+="%"+toCase(0x80+icode%0x40); } } return newStr; }

二:Base64编码,解码函数

> 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 base64decode(str) { var c1,c3,c4; var i,len,out; len = str.length; i = 0; out = ""; while(i < len) { /* c1 */ do { c1 = base64DecodeChars[str.charCodeAt(i++) & 0xff]; } while(i < len && c1 == -1); if(c1 == -1) break; /* c2 */ do { c2 = base64DecodeChars[str.charCodeAt(i++) & 0xff]; } while(i < len && c2 == -1); if(c2 == -1) break; out += String.fromCharCode((c1 << 2) | ((c2 & 0x30) >> 4)); /* c3 */ do { 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 */ do { 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,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,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; } function doit() { var f = document.f f.output.value = base64encode(utf16to8(f.source.value)) f.decode.value = utf8to16(base64decode(f.output.value)) }

三:MD5

> 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],-680876936); d = md5_ff(d,a,x[i+ 1],-389564586); c = md5_ff(c,x[i+ 2],606105819); b = md5_ff(b,x[i+ 3],-1044525330); a = md5_ff(a,x[i+ 4],-176418897); d = md5_ff(d,x[i+ 5],1200080426); c = md5_ff(c,x[i+ 6],-1473231341); b = md5_ff(b,x[i+ 7],-45705983); a = md5_ff(a,x[i+ 8],1770035416); d = md5_ff(d,x[i+ 9],-1958414417); c = md5_ff(c,x[i+10],-42063); b = md5_ff(b,x[i+11],-1990404162); a = md5_ff(a,x[i+12],1804603682); d = md5_ff(d,x[i+13],-40341101); c = md5_ff(c,x[i+14],-1502002290); b = md5_ff(b,x[i+15],1236535329); a = md5_gg(a,-165796510); d = md5_gg(d,-1069501632); c = md5_gg(c,643717713); b = md5_gg(b,-373897302); a = md5_gg(a,-701558691); d = md5_gg(d,38016083); c = md5_gg(c,-660478335); b = md5_gg(b,-405537848); a = md5_gg(a,568446438); d = md5_gg(d,-1019803690); c = md5_gg(c,-187363961); b = md5_gg(b,1163531501); a = md5_gg(a,-1444681467); d = md5_gg(d,-51403784); c = md5_gg(c,1735328473); b = md5_gg(b,-1926607734); a = md5_hh(a,-378558); d = md5_hh(d,-2022574463); c = md5_hh(c,1839030562); b = md5_hh(b,-35309556); a = md5_hh(a,-1530992060); d = md5_hh(d,1272893353); c = md5_hh(c,-155497632); b = md5_hh(b,-1094730640); a = md5_hh(a,681279174); d = md5_hh(d,-358537222); c = md5_hh(c,-722521979); b = md5_hh(b,76029189); a = md5_hh(a,-640364487); d = md5_hh(d,-421815835); c = md5_hh(c,530742520); b = md5_hh(b,-995338651); a = md5_ii(a,-198630844); d = md5_ii(d,1126891415); c = md5_ii(c,-1416354905); b = md5_ii(b,-57434055); a = md5_ii(a,1700485571); d = md5_ii(d,-1894986606); c = md5_ii(c,-1051523); b = md5_ii(b,-2054922799); a = md5_ii(a,1873313359); d = md5_ii(d,-30611744); c = md5_ii(c,-1560198380); b = md5_ii(b,1309151649); a = md5_ii(a,-145523070); d = md5_ii(d,-1120210379); c = md5_ii(c,718787259); b = md5_ii(b,-343485551); a = safe_add(a,olda); b = safe_add(b,oldb); c = safe_add(c,oldc); d = safe_add(d,oldd); } return Array(a,d); } /* * These functions implement the four basic operations the algorithm uses. */ function md5_cmn(q,x,s,t) { return safe_add(bit_rol(safe_add(safe_add(a,q),safe_add(x,t)),s),b); } function md5_ff(a,t) { return md5_cmn((b & c) | ((~b) & d),t); } function md5_gg(a,t) { return md5_cmn((b & d) | (c & (~d)),t); } function md5_hh(a,t) { return md5_cmn(b ^ c ^ d,t); } function md5_ii(a,t) { return md5_cmn(c ^ (b | (~d)),t); } /* * Calculate the HMAC-MD5,of a key and some data */ 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); } /* * Add integers,wrapping at 2^32. This uses 16-bit operations internally * to work around bugs in some JS interpreters. */ function safe_add(x,y) { var lsw = (x & 0xFFFF) + (y & 0xFFFF); var msw = (x >> 16) + (y >> 16) + (lsw >> 16); return (msw << 16) | (lsw & 0xFFFF); } /* * Bitwise rotate a 32-bit number to the left. */ function bit_rol(num,cnt) { return (num << cnt) | (num >>> (32 - cnt)); } /* * Convert a string to an array of little-endian words * If chrsz is ASCII,characters >255 have their hi-byte silently ignored. */ 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; } /* * Convert an array of little-endian words to a string */ 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; } /* * Convert an array of little-endian words to a hex string. */ 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; } /* * Convert an array of little-endian words to a base-64 string */ 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; }

MD4算法

> 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 = md4_ff(a,3 ); d = md4_ff(d,7 ); c = md4_ff(c,11); b = md4_ff(b,19); a = md4_ff(a,19); a = md4_gg(a,3 ); d = md4_gg(d,5 ); c = md4_gg(c,9 ); b = md4_gg(b,13); a = md4_gg(a,13); a = md4_hh(a,3 ); d = md4_hh(d,9 ); c = md4_hh(c,11); b = md4_hh(b,15); a = md4_hh(a,15); a = safe_add(a,d); } /* * These functions implement the basic operation for each round of the * algorithm. */ function md4_cmn(q,t) { return safe_add(rol(safe_add(safe_add(a,b); } function md4_ff(a,s) { return md4_cmn((b & c) | ((~b) & d),0); } function md4_gg(a,s) { return md4_cmn((b & c) | (b & d) | (c & d),1518500249); } function md4_hh(a,s) { return md4_cmn(b ^ c ^ d,1859775393); } /* * Calculate the HMAC-MD4,of a key and some data */ function core_hmac_md4(key,data) { var bkey = str2binl(key); if(bkey.length > 16) bkey = core_md4(bkey,opad = Array(16); for(var i = 0; i < 16; i++) { ipad[i] = bkey[i] ^ 0x36363636; opad[i] = bkey[i] ^ 0x5C5C5C5C; } var hash = core_md4(ipad.concat(str2binl(data)),512 + data.length * chrsz); return core_md4(opad.concat(hash),y) { var lsw = (x & 0xFFFF) + (y & 0xFFFF); var msw = (x >> 16) + (y >> 16) + (lsw >> 16); return (msw << 16) | (lsw & 0xFFFF); } /* * Bitwise rotate a 32-bit number to the left. */ function rol(num,characters >255 have their hi-byte silently ignored. */ 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; } /* * Convert an array of little-endian words to a string */ 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; } /* * Convert an array of little-endian words to a hex string. */ 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; } /* * Convert an array of little-endian words to a base-64 string */ 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; }

SHA1算法

> 5] |= 0x80 << (24 - len % 32); x[((len + 64 >> 9) << 4) + 15] = len; var w = Array(80); var a = 1732584193; var b = -271733879; var c = -1732584194; var d = 271733878; var e = -1009589776; for(var i = 0; i < x.length; i += 16) { var olda = a; var oldb = b; var oldc = c; var oldd = d; var olde = e; for(var j = 0; j < 80; j++) { if(j < 16) w[j] = x[i + j]; else w[j] = rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16],1); var t = safe_add(safe_add(rol(a,5),sha1_ft(j,d)),safe_add(safe_add(e,w[j]),sha1_kt(j))); e = d; d = c; c = rol(b,30); b = a; a = t; } a = safe_add(a,oldd); e = safe_add(e,olde); } return Array(a,e); } /* * Perform the appropriate triplet combination function for the current * iteration */ function sha1_ft(t,d) { if(t < 20) return (b & c) | ((~b) & d); if(t < 40) return b ^ c ^ d; if(t < 60) return (b & c) | (b & d) | (c & d); return b ^ c ^ d; } /* * Determine the appropriate additive constant for the current iteration */ function sha1_kt(t) { return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 : (t < 60) ? -1894007588 : -899497514; } /* * Calculate the HMAC-SHA1 of a key and some data */ function core_hmac_sha1(key,data) { var bkey = str2binb(key); if(bkey.length > 16) bkey = core_sha1(bkey,opad = Array(16); for(var i = 0; i < 16; i++) { ipad[i] = bkey[i] ^ 0x36363636; opad[i] = bkey[i] ^ 0x5C5C5C5C; } var hash = core_sha1(ipad.concat(str2binb(data)),512 + data.length * chrsz); return core_sha1(opad.concat(hash),512 + 160); } /* * Add integers,cnt) { return (num << cnt) | (num >>> (32 - cnt)); } /* * Convert an 8-bit or 16-bit string to an array of big-endian words * In 8-bit function,characters >255 have their hi-byte silently ignored. */ function str2binb(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) << (32 - chrsz - i%32); return bin; } /* * Convert an array of big-endian words to a string */ function binb2str(bin) { var str = ""; var mask = (1 << chrsz) - 1; for(var i = 0; i < bin.length * 32; i += chrsz) str += String.fromCharCode((bin[i>>5] >>> (32 - chrsz - i%32)) & mask); return str; } /* * Convert an array of big-endian words to a hex string. */ function binb2hex(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] >> ((3 - i%4)*8+4)) & 0xF) + hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8 )) & 0xF); } return str; } /* * Convert an array of big-endian words to a base-64 string */ function binb2b64(binarray) { var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; var str = ""; for(var i = 0; i < binarray.length * 4; i += 3) { var triplet = (((binarray[i >> 2] >> 8 * (3 - i %4)) & 0xFF) << 16) | (((binarray[i+1 >> 2] >> 8 * (3 - (i+1)%4)) & 0xFF) << 8 ) | ((binarray[i+2 >> 2] >> 8 * (3 - (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; }

BASE64编码解码工具:

URL网址16进制加密工具:

密码安全性在线检测:

高强度密码生成器:

http://tools.jb51.cc/password/Createh3Password

MD5在线加密工具:

http://tools.jb51.cc/password/CreateMD5Password

迅雷、快车、旋风URL加密/解密工具:

http://tools.jb51.cc/password/urlrethunder

在线散列/哈希算法加密工具:

http://tools.jb51.cc/password/hash_encrypt

更多关于JavaScript相关内容可查看本站专题:《》、《》、《》、《》、《》、《》、《》及《

希望本文所述对大家JavaScript程序设计有所帮助。

原文链接:https://www.f2er.com/js/43270.html

猜你在找的JavaScript相关文章