JS实现的base64加密、md5加密及sha1加密详解

前端之家收集整理的这篇文章主要介绍了JS实现的base64加密、md5加密及sha1加密详解前端之家小编觉得挺不错的,现在分享给大家,也给大家做个参考。

本文实例讲述了JS实现的base64加密、md5加密及sha1加密。分享给大家供大家参考,具体如下:

1、base64加密

页面中引入base64.js文件调用方法为:

<Meta charset="utf-8"> base64加密

2、md5加密

页面中引用md5.js文件调用方法

<Meta charset="utf-8"> md5加密

3、sha1加密

据说这是最安全的加密

页面中引入sha1.js,调用方法

<Meta charset="utf-8"> sha1加密

一下为js们的源代码

base64.js:

> 2; enc2 = ((chr1 & 3) << 4) | (chr2 >> 4); enc3 = ((chr2 & 15) << 2) | (chr3 >> 6); enc4 = chr3 & 63; if (isNaN(chr2)) { enc3 = enc4 = 64; } else if (isNaN(chr3)) { enc4 = 64; } output = output + _keyStr.charAt(enc1) + _keyStr.charAt(enc2) + _keyStr.charAt(enc3) + _keyStr.charAt(enc4); } return output; } // public method for decoding this.decode = function (input) { var output = ""; var chr1,chr3; var enc1,enc4; var i = 0; input = input.replace(/[^A-Za-z0-9\+\/\=]/g,""); while (i < input.length) { enc1 = _keyStr.indexOf(input.charAt(i++)); enc2 = _keyStr.indexOf(input.charAt(i++)); enc3 = _keyStr.indexOf(input.charAt(i++)); enc4 = _keyStr.indexOf(input.charAt(i++)); chr1 = (enc1 << 2) | (enc2 >> 4); chr2 = ((enc2 & 15) << 4) | (enc3 >> 2); chr3 = ((enc3 & 3) << 6) | enc4; output = output + String.fromCharCode(chr1); if (enc3 != 64) { output = output + String.fromCharCode(chr2); } if (enc4 != 64) { output = output + String.fromCharCode(chr3); } } output = _utf8_decode(output); return output; } // private method for UTF-8 encoding _utf8_encode = function (string) { string = string.replace(/\r\n/g,"\n"); var utftext = ""; for (var n = 0; n < string.length; n++) { var c = string.charCodeAt(n); if (c < 128) { utftext += String.fromCharCode(c); } else if((c > 127) && (c < 2048)) { utftext += String.fromCharCode((c >> 6) | 192); utftext += String.fromCharCode((c & 63) | 128); } else { utftext += String.fromCharCode((c >> 12) | 224); utftext += String.fromCharCode(((c >> 6) & 63) | 128); utftext += String.fromCharCode((c & 63) | 128); } } return utftext; } // private method for UTF-8 decoding _utf8_decode = function (utftext) { var string = ""; var i = 0; var c = c1 = c2 = 0; while ( i < utftext.length ) { c = utftext.charCodeAt(i); if (c < 128) { string += String.fromCharCode(c); i++; } else if((c > 191) && (c < 224)) { c2 = utftext.charCodeAt(i+1); string += String.fromCharCode(((c & 31) << 6) | (c2 & 63)); i += 2; } else { c2 = utftext.charCodeAt(i+1); c3 = utftext.charCodeAt(i+2); string += String.fromCharCode(((c & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63)); i += 3; } } return string; } }

MD5.js:

> 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,x[i+ 1],12,-389564586); c = md5_ff(c,x[i+ 2],17,606105819); b = md5_ff(b,x[i+ 3],22,-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,5,-165796510); d = md5_gg(d,9,-1069501632); c = md5_gg(c,14,643717713); b = md5_gg(b,20,-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,4,-378558); d = md5_hh(d,11,-2022574463); c = md5_hh(c,16,1839030562); b = md5_hh(b,23,-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,6,-198630844); d = md5_ii(d,10,1126891415); c = md5_ii(c,15,-1416354905); b = md5_ii(b,21,-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; }

sha1.js:

> 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,olda); b = safe_add(b,oldb); c = safe_add(c,oldc); d = safe_add(d,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,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,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) << (24 - 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] >>> (24 - 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; }

对于JavaScript加密感兴趣的朋友还可以参看本站在线工具:

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

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

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

猜你在找的JavaScript相关文章