菜单

JS散列表碰撞处理【澳门太阳集团】

2020年4月3日 - 首页

正文实例汇报了JS散列表碰撞管理、开链法、HashTable散列。分享给我们供大家参照他事他说加以考察,具体如下:

本文实例陈诉了JS常用加密编码与算法。共享给我们供我们仿照效法,具体如下:

/** * 散列表碰撞处理、开链法、HashTable散列。 * 将数组里的元素位置,也设置为数组,当两个数据的散列在同一个位置时, * 就可以放在这个位置的二维数组里,解决了散列函数的碰撞处理问题 */function HashTable() { this.table = new Array; this.betterHash = betterHash;//散列函数 this.showDistro = showDistro;//显示散列表里的数据 this.buildChains = buildChains;//生成二维数组 this.put = put;//将数据存储到散列表 this.get = get;//从散列表中取出某个数据}// put for separate chainingfunction put { var pos = this.betterHash; var index = 0; if (this.table[pos][index] == undefined) { this.table[pos][index] = data; }else { while (this.table[pos][index] != undefined) { ++index; } this.table[pos][index] = data; }}/*散列函数*/function betterHash { const H = 37; var total = 0; for (var i = 0; i < string.length; ++i) { total += H * total + string.charCodeAt; } total = total % this.table.length; if  { total += this.table.length-1; } return parseInt;}function showDistro() { var n = 0; for (var i = 0; i < this.table.length; ++i) { if (this.table[i][n] != undefined) { console.log(i + ": " + this.table[i]); } }}function buildChains() { for (var i = 0; i < this.table.length; ++i) { this.table[i] = new Array(); }}// get for separate chainingfunction get { var index = 0; var pos = this.betterHash; while ((this.table[pos][index] != undefined)&&(this.table[pos][index] != key)) { index += 1; } if(this.table[pos][index] == key) { console.log(key+" 的键值为: "+this.table[pos][index]); return this.table[pos][index]; }else{ console.log; return undefined; }}/*测试开链法*/var someNames = ["David", "Jennifer", "Donnie", "Raymond", "Cynthia", "Mike", "Clayton", "Danny", "Jonathan"];var hTable = new HashTable();hTable.buildChains();for (var i = 0; i < someNames.length; ++i) { hTable.put(someNames[i],someNames[i]);}hTable.showDistro();hTable.betterHash;hTable.get;hTable.get;

一:UTF8编码函数

澳门太阳集团,使用在线HTML/CSS/JavaScript代码运营工具

function URLEncode{ if return ""; var newStr=""; function toCase{ return sStr.toString; } for(var i=0,icode,len=Str.length;i=0x30&&icode<=0x39)||(icode>=0x41&&icode<=0x5A)||(icode>=0x61&&icode<=0x7A)) newStr+=Str.charAt; else newStr+="%"+toCase; } else if{ newStr+="%"+toCase; newStr+="%"+toCase; } else{ newStr+="%"+toCase; newStr+="%"+toCase; newStr+="%"+toCase; } } return newStr; }

更加多关于JavaScript相关内容感兴趣的读者可查看本站专项论题:《JavaScript数学生运动算用法计算》、《JavaScript数据布局与算法技艺总计》、《JavaScript数组操作手艺总括》、《JavaScript排序算法总括》、《JavaScript遍历算法与本事总括》、《JavaScript查找算法手艺总计》及《JavaScript错误与调治技艺总计》

二:Base64编码,解码函数

梦想本文所述对大家JavaScript程序设计有着支持。

var base64EncodeChars = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";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);function base64encode { var out, i, len; var c1, c2, c3; len = str.length; i = 0; out = ""; while { c1 = str.charCodeAt & 0xff; if { out += base64EncodeChars.charAt; out += base64EncodeChars.charAt; out += "=="; break; } c2 = str.charCodeAt { out += base64EncodeChars.charAt; out += base64EncodeChars.charAt | ; out += base64EncodeChars.charAt; out += "="; break; } c3 = str.charCodeAt; out += base64EncodeChars.charAt; out += base64EncodeChars.charAt | ; out += base64EncodeChars.charAt | ; out += base64EncodeChars.charAt; } return out;}function base64decode { var c1, c2, c3, c4; var i, len, out; len = str.length; i = 0; out = ""; while { /* c1 */ do { c1 = base64DecodeChars[str.charCodeAt & 0xff]; } while; if break; /* c2 */ do { c2 = base64DecodeChars[str.charCodeAt & 0xff]; } while; if break; out += String.fromCharCode | ; /* c3 */ do { c3 = str.charCodeAt & 0xff; if return out; c3 = base64DecodeChars[c3]; } while; if break; out += String.fromCharCode | ; /* c4 */ do { c4 = str.charCodeAt & 0xff; if return out; c4 = base64DecodeChars[c4]; } while; if break; out += String.fromCharCode | c4); } return out;}function utf16to8 { var out, i, len, c; out = ""; len = str.length; for { c = str.charCodeAt &&  { out += str.charAt; } else if  { out += String.fromCharCode & 0x0F)); out += String.fromCharCode & 0x3F)); out += String.fromCharCode & 0x3F)); } else { out += String.fromCharCode & 0x1F)); out += String.fromCharCode & 0x3F)); } } return out;}function utf8to16 { var out, i, len, c; var char2, char3; out = ""; len = str.length; i = 0; while { c = str.charCodeAt { case 0: case 1: case 2: case 3: case 4: case 5: case 6: case 7: // 0xxxxxxx out += str.charAt; break; case 12: case 13: // 110x xxxx 10xx xxxx char2 = str.charCodeAt; out += String.fromCharCode | ; break; case 14: // 1110 xxxx 10xx xxxx 10xx xxxx char2 = str.charCodeAt; char3 = str.charCodeAt; out += String.fromCharCode |  | ; break; } } return out;}function doit() { var f = document.f f.output.value = base64encode(utf16to8 f.decode.value = utf8to16(base64decode}

三:MD5

/* * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message * Digest Algorithm, as defined in RFC 1321. * Version 2.1 Copyright  Paul Johnston 1999 - 2002. * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet * Distributed under the BSD License * See http://pajhome.org.uk/crypt/md5 for more info. *//* * Configurable variables. You may need to tweak these to be compatible with * the server-side, but the defaults work in most cases. */var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode *//* * These are the functions you'll usually want to call * They take string arguments and return either hex or base-64 encoded strings */function hex_md5{ return binl2hex, s.length * chrsz));}function b64_md5{ return binl2b64, s.length * chrsz));}function str_md5{ return binl2str, s.length * chrsz));}function hex_hmac_md5 { return binl2hex(core_hmac_md5; }function b64_hmac_md5 { return binl2b64(core_hmac_md5; }function str_hmac_md5 { return binl2str(core_hmac_md5; }/* * Perform a simple self-test to see if the VM is working */function md5_vm_test(){ return hex_md5 == "900150983cd24fb0d6963f7d28e17f72";}/* * Calculate the MD5 of an array of little-endian words, and a bit length */function core_md5{ /* append padding */ x[len >> 5] |= 0x80 << ; x[ << 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; b = safe_add; c = safe_add; d = safe_add; } return Array;}/* * These functions implement the four basic operations the algorithm uses. */function md5_cmn{ return safe_add(bit_rol(safe_add, safe_add;}function md5_ff{ return md5_cmn, a, b, x, s, t);}function md5_gg{ return md5_cmn, a, b, x, s, t);}function md5_hh{ return md5_cmn(b ^ c ^ d, a, b, x, s, t);}function md5_ii{ return md5_cmn, a, b, x, s, t);}/* * Calculate the HMAC-MD5, of a key and some data */function core_hmac_md5{ var bkey = str2binl; if bkey = core_md5(bkey, key.length * chrsz); var ipad = Array; for(var i = 0; i < 16; i++) { ipad[i] = bkey[i] ^ 0x36363636; opad[i] = bkey[i] ^ 0x5C5C5C5C; } var hash = core_md5(ipad.concat, 512 + data.length * chrsz); return core_md5, 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{ var lsw =  + ; var msw =  + ; return  | ;}/* * Bitwise rotate a 32-bit number to the left. */function bit_rol{ return  | ;}/* * Convert a string to an array of little-endian words * If chrsz is ASCII, characters >255 have their hi-byte silently ignored. */function str2binl{ var bin = Array(); var mask =  - 1; for(var i = 0; i < str.length * chrsz; i += chrsz) bin[i>>5] |= (str.charCodeAt << ; return bin;}/* * Convert an array of little-endian words to a string */function binl2str{ var str = ""; var mask =  - 1; for(var i = 0; i < bin.length * 32; i += chrsz) str += String.fromCharCode((bin[i>>5] >>> ; return str;}/* * Convert an array of little-endian words to a hex string. */function binl2hex{ var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef"; var str = ""; for(var i = 0; i < binarray.length * 4; i++) { str += hex_tab.charAt((binarray[i>>2] >>  + hex_tab.charAt((binarray[i>>2] >> ; } return str;}/* * Convert an array of little-endian words to a base-64 string */function binl2b64{ var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; var str = ""; for(var i = 0; i < binarray.length * 4; i += 3) { var triplet = (((binarray[i >> 2] >> 8 *  << 16) | (((binarray[i+1 >> 2] >> 8 *  << 8 ) | ((binarray[i+2 >> 2] >> 8 * ; for(var j = 0; j < 4; j++) { if(i * 8 + j * 6 > binarray.length * 32) str += b64pad; else str += tab.charAt & 0x3F); } } return str;}

/* * A JavaScript implementation of the RSA Data Security, Inc. MD4 Message * Digest Algorithm, as defined in RFC 1320. * Version 2.1 Copyright  Jerrad Pierce, Paul Johnston 1999 - 2002. * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet * Distributed under the BSD License * See http://pajhome.org.uk/crypt/md5 for more info. *//* * Configurable variables. You may need to tweak these to be compatible with * the server-side, but the defaults work in most cases. */var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode *//* * These are the functions you'll usually want to call */function hex_md4{ return binl2hex, s.length * chrsz));}function b64_md4{ return binl2b64, s.length * chrsz));}function str_md4{ return binl2str, s.length * chrsz));}function hex_hmac_md4 { return binl2hex(core_hmac_md4; }function b64_hmac_md4 { return binl2b64(core_hmac_md4; }function str_hmac_md4 { return binl2str(core_hmac_md4; }/* * Perform a simple self-test to see if the VM is working */function md4_vm_test(){ return hex_md4 == "a448017aaf21d8525fc10ae87aa6729d";}/* * Calculate the MD4 of an array of little-endian words, and a bit length */function core_md4{ /* append padding */ x[len >> 5] |= 0x80 << ; x[ << 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, b, c, d, x[i+ 0], 3 ); d = md4_ff(d, a, b, c, x[i+ 1], 7 ); c = md4_ff(c, d, a, b, x[i+ 2], 11); b = md4_ff(b, c, d, a, x[i+ 3], 19); a = md4_ff(a, b, c, d, x[i+ 4], 3 ); d = md4_ff(d, a, b, c, x[i+ 5], 7 ); c = md4_ff(c, d, a, b, x[i+ 6], 11); b = md4_ff(b, c, d, a, x[i+ 7], 19); a = md4_ff(a, b, c, d, x[i+ 8], 3 ); d = md4_ff(d, a, b, c, x[i+ 9], 7 ); c = md4_ff(c, d, a, b, x[i+10], 11); b = md4_ff(b, c, d, a, x[i+11], 19); a = md4_ff(a, b, c, d, x[i+12], 3 ); d = md4_ff(d, a, b, c, x[i+13], 7 ); c = md4_ff(c, d, a, b, x[i+14], 11); b = md4_ff(b, c, d, a, x[i+15], 19); a = md4_gg(a, b, c, d, x[i+ 0], 3 ); d = md4_gg(d, a, b, c, x[i+ 4], 5 ); c = md4_gg(c, d, a, b, x[i+ 8], 9 ); b = md4_gg(b, c, d, a, x[i+12], 13); a = md4_gg(a, b, c, d, x[i+ 1], 3 ); d = md4_gg(d, a, b, c, x[i+ 5], 5 ); c = md4_gg(c, d, a, b, x[i+ 9], 9 ); b = md4_gg(b, c, d, a, x[i+13], 13); a = md4_gg(a, b, c, d, x[i+ 2], 3 ); d = md4_gg(d, a, b, c, x[i+ 6], 5 ); c = md4_gg(c, d, a, b, x[i+10], 9 ); b = md4_gg(b, c, d, a, x[i+14], 13); a = md4_gg(a, b, c, d, x[i+ 3], 3 ); d = md4_gg(d, a, b, c, x[i+ 7], 5 ); c = md4_gg(c, d, a, b, x[i+11], 9 ); b = md4_gg(b, c, d, a, x[i+15], 13); a = md4_hh(a, b, c, d, x[i+ 0], 3 ); d = md4_hh(d, a, b, c, x[i+ 8], 9 ); c = md4_hh(c, d, a, b, x[i+ 4], 11); b = md4_hh(b, c, d, a, x[i+12], 15); a = md4_hh(a, b, c, d, x[i+ 2], 3 ); d = md4_hh(d, a, b, c, x[i+10], 9 ); c = md4_hh(c, d, a, b, x[i+ 6], 11); b = md4_hh(b, c, d, a, x[i+14], 15); a = md4_hh(a, b, c, d, x[i+ 1], 3 ); d = md4_hh(d, a, b, c, x[i+ 9], 9 ); c = md4_hh(c, d, a, b, x[i+ 5], 11); b = md4_hh(b, c, d, a, x[i+13], 15); a = md4_hh(a, b, c, d, x[i+ 3], 3 ); d = md4_hh(d, a, b, c, x[i+11], 9 ); c = md4_hh(c, d, a, b, x[i+ 7], 11); b = md4_hh(b, c, d, a, x[i+15], 15); a = safe_add; b = safe_add; c = safe_add; d = safe_add; } return Array;}/* * These functions implement the basic operation for each round of the * algorithm. */function md4_cmn{ return safe_add(rol(safe_add, safe_add;}function md4_ff{ return md4_cmn, a, 0, x, s, 0);}function md4_gg{ return md4_cmn | , a, 0, x, s, 1518500249);}function md4_hh{ return md4_cmn(b ^ c ^ d, a, 0, x, s, 1859775393);}/* * Calculate the HMAC-MD4, of a key and some data */function core_hmac_md4{ var bkey = str2binl; if bkey = core_md4(bkey, key.length * chrsz); var ipad = Array; for(var i = 0; i < 16; i++) { ipad[i] = bkey[i] ^ 0x36363636; opad[i] = bkey[i] ^ 0x5C5C5C5C; } var hash = core_md4(ipad.concat, 512 + data.length * chrsz); return core_md4, 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{ var lsw =  + ; var msw =  + ; return  | ;}/* * Bitwise rotate a 32-bit number to the left. */function rol{ return  | ;}/* * Convert a string to an array of little-endian words * If chrsz is ASCII, characters >255 have their hi-byte silently ignored. */function str2binl{ var bin = Array(); var mask =  - 1; for(var i = 0; i < str.length * chrsz; i += chrsz) bin[i>>5] |= (str.charCodeAt << ; return bin;}/* * Convert an array of little-endian words to a string */function binl2str{ var str = ""; var mask =  - 1; for(var i = 0; i < bin.length * 32; i += chrsz) str += String.fromCharCode((bin[i>>5] >>> ; return str;}/* * Convert an array of little-endian words to a hex string. */function binl2hex{ var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef"; var str = ""; for(var i = 0; i < binarray.length * 4; i++) { str += hex_tab.charAt((binarray[i>>2] >>  + hex_tab.charAt((binarray[i>>2] >> ; } return str;}/* * Convert an array of little-endian words to a base-64 string */function binl2b64{ var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; var str = ""; for(var i = 0; i < binarray.length * 4; i += 3) { var triplet = (((binarray[i >> 2] >> 8 *  << 16) | (((binarray[i+1 >> 2] >> 8 *  << 8 ) | ((binarray[i+2 >> 2] >> 8 * ; for(var j = 0; j < 4; j++) { if(i * 8 + j * 6 > binarray.length * 32) str += b64pad; else str += tab.charAt & 0x3F); } } return str;}

/* * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined * in FIPS PUB 180-1 * Version 2.1a Copyright Paul Johnston 2000 - 2002. * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet * Distributed under the BSD License * See http://pajhome.org.uk/crypt/md5 for details. *//* * Configurable variables. You may need to tweak these to be compatible with * the server-side, but the defaults work in most cases. */var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode *//* * These are the functions you'll usually want to call * They take string arguments and return either hex or base-64 encoded strings */function hex_sha1{return binb2hex,s.length * chrsz));}function b64_sha1{return binb2b64,s.length * chrsz));}function str_sha1{return binb2str,s.length * chrsz));}function hex_hmac_sha1{ return binb2hex(core_hmac_sha1;}function b64_hmac_sha1{ return binb2b64(core_hmac_sha1;}function str_hmac_sha1{ return binb2str(core_hmac_sha1;}/* * Perform a simple self-test to see if the VM is working */function sha1_vm_test(){ return hex_sha1 == "a9993e364706816aba3e25717850c26c9cd0d89d";}/* * Calculate the SHA-1 of an array of big-endian words, and a bit length */function core_sha1{ /* append padding */ x[len >> 5] |= 0x80 << ; x[ + 15] = len; var w = Array; 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 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, sha1_ft, safe_add, sha1_kt; e = d; d = c; c = rol; b = a; a = t; } a = safe_add; b = safe_add; c = safe_add; d = safe_add; e = safe_add; } return Array;}/* * Perform the appropriate triplet combination function for the current * iteration */function sha1_ft{ if return ; if return b ^ c ^ d; if return  | ; return b ^ c ^ d;}/* * Determine the appropriate additive constant for the current iteration */function sha1_kt ? 1518500249 :  ? 1859775393 :  ? -1894007588 : -899497514;}/* * Calculate the HMAC-SHA1 of a key and some data */function core_hmac_sha1{ var bkey = str2binb; if bkey = core_sha1(bkey, key.length * chrsz); var ipad = Array; for(var i = 0; i < 16; i++) { ipad[i] = bkey[i] ^ 0x36363636; opad[i] = bkey[i] ^ 0x5C5C5C5C; } var hash = core_sha1(ipad.concat, 512 + data.length * chrsz); return core_sha1, 512 + 160);}/* * Add integers, wrapping at 2^32. This uses 16-bit operations internally * to work around bugs in some JS interpreters. */function safe_add{ var lsw =  + ; var msw =  + ; return  | ;}/* * Bitwise rotate a 32-bit number to the left. */function rol{ return  | ;}/* * 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{ var bin = Array(); var mask =  - 1; for(var i = 0; i < str.length * chrsz; i += chrsz) bin[i>>5] |= (str.charCodeAt << ; return bin;}/* * Convert an array of big-endian words to a string */function binb2str{ var str = ""; var mask =  - 1; for(var i = 0; i < bin.length * 32; i += chrsz) str += String.fromCharCode((bin[i>>5] >>>  & mask); return str;}/* * Convert an array of big-endian words to a hex string. */function binb2hex{ var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef"; var str = ""; for(var i = 0; i < binarray.length * 4; i++) { str += hex_tab.charAt((binarray[i>>2] >>  & 0xF) + hex_tab.charAt((binarray[i>>2] >> ; } return str;}/* * Convert an array of big-endian words to a base-64 string */function binb2b64{ var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; var str = ""; for(var i = 0; i < binarray.length * 4; i += 3) { var triplet = (((binarray[i >> 2] >> 8 *  << 16) | (((binarray[i+1 >> 2] >> 8 *  << 8 ) | ((binarray[i+2 >> 2] >> 8 * ; for(var j = 0; j < 4; j++) { if(i * 8 + j * 6 > binarray.length * 32) str += b64pad; else str += tab.charAt & 0x3F); } } return str;}

PS:关于加密解密感兴趣的意中人仍然为能够参见本站在线工具:

BASE64编码解码工具:

U福特ExplorerL网站16进制加密工具:

密码安全性在线检验:

高强度密码生成器:

MD5在线加密工具:

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

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

越多关于JavaScript相关内容可查阅本站专项论题:《JavaScript加密解密手艺汇总》、《JavaScript切换特效与本领总计》、《JavaScript查找算法手艺总计》、《JavaScript动漫特效与技艺汇总》、《JavaScript错误与调度能力总括》、《JavaScript数据布局与算法才干计算》、《JavaScript遍历算法与工夫计算》及《JavaScript数学生运动算用法总计》

仰望本文所述对大家JavaScript程序设计有着帮忙。

相关文章

发表评论

电子邮件地址不会被公开。 必填项已用*标注

网站地图xml地图