pFan.encrypt = { //# 加密
md5: function (words) { //# md5 雜湊演算法
/*
* Crypto-JS 3.1.2
*
http://code.google.com/p/crypto-js
*/
var CryptoJS = 函數 (s, p) {
var m = {}, l = m.lib = {}, n = function () { }, r = l.Base = { 擴充: function (b) { n.prototype = this; var h = 新 n; b && h.mixIn(b); h.hasOwnProperty("init") || (h.init = function () { h.$super.init.apply(this, 參數) }); h.init.prototype = h; h.$super =這個; return h }, create: function () { var b = this.extend(); b.init.apply(b, 參數); return b }, init: function () { }, mixIn: function (b) { for (var h in b) b.hasOwnProperty(h) && (this[h] = b[h]); b.hasOwnProperty("toString") && (this.toString = b.toString) }, clone: function () { return this.init.prototype.extend(this) } }, q = l.WordArray = r.extend( { init: function (b, h) { b = this.words = b []; this.sigBytes = h != p ? h : 4 * b.length }, toString: function (b) { return (b || t).stringify(this) }, concat: function (b) { var h = this.words, j = this.sigBytes; b = b.sigBytes; (j % 4) for (var g = 0; g >> 2] |= (a[g >>> 2] >>> 24 - 8 * (g % 4) & 255) >> 2] = a[g >>> 2]; else h.push.apply(h , a); 回傳this }, : function () { var b = this.words, h = this.sigBytes; b[h >>> 2] &= 4294967295 >>> 2]>>>> 24 - 8 * (j% 4) & 255; g.push((k>>4).toString(16)); g.push((k & 15).toString(16)) } return g.join("") }, parse: function (b) { for (var a = b.length, g = [], j = 0 ; j >; 3] |= parseInt(b.substr(j, 2), 16) >> 2] >>> 24 - 8 * (j % 4) & 255)) ; return g.join("") }, parse: function (b) { for (var a = b.length, g = [], j = 0; j >>> ; 2] |= (b.charCodeAt(j) & 255)
g = l.BufferedBlockAlgorithm = r.extend({ Reset: function () { this._data = new q.init; this._nDataBytes = 0 }, _append: function (b) { "string" == typeof b && (b = u.parse(b)); this._data.concat(b); this._nDataBytes = b.sigBytes }, _process: 函數(b) { var a = this._data, g = a.words, j = a .sigBytes, k = this.blockSize, m = j / (4 * k), m = b ? s.ceil(m) : s.max((m | 0) - this._minBufferSize, 0 * k; j = s.min(4 * b, j); if (b) { for (var l = 0; l
}(數學);
(函數){
函數 p(a, k, b, h, l, j, m) { a = a (k & b | ~k & h) l m; return (a > 32 - j) k } function m(a, k, b, h, l, j, m) { a = a (k & h | b & 〜h)l米; return (a > 32 - j) k } function l(a, k, b, h, l, j, m) { a = a (k ^ b ^ h)升米; return (a > 32 - j) k } function n(a, k, b, h, l, j, m) { a = a (b ^ (k | ~ h))l米; return (a > 32 - j) k } for (var r = CryptoJS, q = r.lib, v = q.WordArray, t = q.Hasher, q = r .algo, a = [], u = 0 > u ) a[u] = 4294967296 * s.abs(s.sin(u 1)); 0; q = q.MD5 = t.extend({
_doReset: function () { this._hash = new v.init([1732584193, 4023233417, 2562383102, 271733878]) }, _doProcessBlock: function (g, k)>
for (var b = 0; 16 > b; b ) { var h = k b, w = g[h]; g[h] = (w > 24) & 16711935 | (w > 8) & 4278255360 } var b = this._hash.words, h = g[k 0], w = g[k 1], j = g[k 2]、q = g [k 3]、r = g[k 4]、s = g[k 5]、t = g[k 6]、u = g[k 7]、v = g[k 8] , x = g[k 9]、y = g[k 10]、z = g[k 11]、A = g[k 12]、B = g[k 13]、C = g[k 14]、D = g[k 15] , c = b[0], d = b[1], e = b[2], f = b[3], c = p(c, d, e, f, h, 7 , a[0]) , f = p(f, c, d, e, w, 12, a[1]), e = p(e, f, c, d, j, 17, a[2]) , d = p(d , e, f, c, q, 22, a[3]), c = p(c, d, e, f, r, 7, a[4]), f = p(f , c, d, e , s, 12, a[5]), e = p(e, f, c, d, t, 17, a[6]), d = p(d, e, f, c , u, 22, a [7]), c = p(c, d, e, f, v, 7, a[8]), f = p(f, c, d, e, x, 12, a [9]), e = p(e, f, c, d, y, 17, a[10]), d = p(d, e, f, c, z, 22, a[11]), c = p(c, d , e, f, A, 7, a[12]), f = p(f, c, d, e, B, 12, a[13]), e = p(e, f , c, d, C , 17, a[14]), d = p(d, e, f, c, D, 22, a[15]), c = m(c, d, e, f, w , 5, a[16 ] ]), f = m(f, c, d, e, t, 9, a[17]), e = m(e, f, c, d, z, 14, a[18] ]), d = m(d, e, f, c, h, 20, a[19]), c = m(c, d, e, f, s, 5, a[20]), f = m (f, c , d, e, y, 9, a[21]), e = m(e, f, c, d, D, 14, a[22]), d = m(d, e, f , c, r , 20、a[23])、c = m(c、d、e、f、x、5、a[24])、f = m(f、c、d、e、C、9 、a[25 ] ), e = m(e, f, c, d, q, 14, a[26]), d = m(d, e, f, c, v, 20, a[27]) , c = m ( c, d, e, f, B, 5, a[28]), f = m(f, c, d, e, j, 9, a[29]), e = m(e , f, c , d, u, 14, a[30]), d = m(d, e, f, c, A, 20, a[31]), c = l(c, d, e, f , s, 4 , a[32]), f = l(f, c, d, e, v, 11, a[33]), e = l(e, f, c, d, z, 16, a [34]) , d = l(d, e, f, c, C, 23, a[35]), c = l(c, d, e, f, w, 4, a[36]), f = l(f , c, d, e, r, 11, a[37]), e = l(e, f, c, d, u, 16, a[38]), d = l(d, e , f, c , y, 23, a[39]), c = l(c, d, e, f, B, 4, a[40]), f = l(f, c, d, e, h , 11, a [ 41]), e = l(e, f, c, d, q, 16, a[42]), d = l(d, e, f, c, t, 23, a[43] ]), c = l(c, d, e, f, x, 4, a[44]), f = l(f, c, d, e, A, 11, a[45]), e = l (e, f , c, d, D, 16, a[46]), d = l(d, e, f, c, j, 23, a[47]), c = n(c, d, e , f, h , 6, a[48]), f = n(f, c, d, e, u, 10, a[49]), e = n(e, f, c, d,
C, 15, a[50]), d = n(d, e, f, c, s, 21, a[51]), c = n(c, d, e, f, A, 6, a[ 52]), f = n(f, c, d, e, q, 10, a[53]), e = n(e, f, c, d, y, 15, a[54]), d = n(d, e, f, c, w, 21, a[55]), c = n(c, d, e, f, v, 6, a[56]), f = n(f, c, d, e, D, 10, a[57]), e = n(e, f, c, d, t, 15, a[58]), d = n(d, e, f, c, B, 21、a[59])、c = n(c、d、e、f、r、6、a[60])、f = n(f、c、d、e、z、10、a[61] ), e = n(e, f, c, d, j, 15, a[62]), d = n(d, e, f, c, x, 21, a[63]); b[0] = b[0] c | 0; b[1] = b[1] d | 0; b[2] = b[2] e | 0; b[3] = b[3] f | b[3] = b[3] b[3] = b[3] 0
}, _doFinalize: function () { var a = this._data, k = a.words, b = 8 * this._nDataBytes, h = 8 * a.sigBytes; k[h>>>> 5] |= 128 > 9 > 24) & 16711935 | (l > 8) & 4278255360; k[(h 64 >> 9 > 24) & 16711935 | (b > 8) & 4278255360; a.sigBytes = 4 * (k.length 1); this._process(); a = this._hash; k = a.單字;對於(b = 0; 4 > b; b ) h = k[b], k[b] = (h >> 24) & 16711935 | (h > 8) & 4278255360;回傳a }, 克隆: function () { var a = t.clone.call(this); a._hash = this._hash.clone();回傳一個}
}); r.MD5 = t._createHelper(q); r.HmacMD5 = t._createHmacHelper(q)
})(數學);
return CryptoJS.MD5(words).toString();
}
// sha1
, sha1: function (words) { //# sha1 哈希演算法
var CryptoJS = function (e, m) { var p = {}, j = p.lib = {}, l = function () { }, f = j.Base = { 擴展: function (a) { l.prototype =這個;var c = 新l; a && c.mixIn(a); c.hasOwnProperty("init") || (c.init = function () { c.$super.init.apply(this, 參數) }); c.init.prototype = c; $超級=這個; return c }, create: function () { var a = this.extend(); a.init.apply(a, 參數); return a }, init: function () { }, mixIn: function (a) { for (var c in a) a.hasOwnProperty(c) && (this[c] = a[c]); a.hasOwnProperty("toString") && (this.toString = a.toString) }, clone: function () { return this.init.prototype.extend(this) } }, n = j.WordArray = f.extend( { init: function (a, c) { a = this.words = a []; this.sigBytes = c != m ? c : 4 * a.length }, toString: function (a) { return (a || h).stringify(this) }, concat: function (a) { var c = this.words, q = this.sigBytes; a = a.sigBytes; (d % 4) for (var b = 0; b >> 2] |= (q[b >>> 2] >>> 24 - 8 * (b % 4) & 255) >> 2] = q[b >>> 2]; else c.push.apply(c , q); 回傳this }, : function () { var a = this.words, c = this.sigBytes; a[c >>> 2] &= 4294967295 >>>> 2]>>>> 24 - 8 * (d% 4) & 255; b.push((f>>4).toString(16)); b.push((f & 15).toString(16)) } return b.join("") }, 解析: function (a) { for (var c = a.length, b = [], d = 0 ; d >; 3] |= parseInt(a.substr(d, 2), 16) >> 2] >> 24 - 8 * (d % 4) & 255)); return b.join("") }, parse: function (a) { for (var c = a.length, b = [], d = 0; d >>> ; 2] |= (a.charCodeAt(d) & 255) (function () { var e = CryptoJS, m = e.lib, p = m.WordArray, j = m.Hasher, l = [], m = e.algo.SHA1 = j.extend({ _doReset: function ( ) { this._hash = new p.init([1732584193, 4023233417, 2562383102, 271733878, 3285377520]) }, _doProcessBlock: 函數(f, = n. ], g = b[1], e = b[2], k = b[3], j = b[4], a = 0 ) { if (16 > a) l [a] = f[ n a] | else { var c = l[a - 3] ^ l[a - 8] ^ l[a - 14] ^ l[a - 16]; > 31 } c = (h > 27) j l[a] & e | ~g & k) 1518500249) : 40 > a ? c ((g ^ e ^ k) 1859775393) : 60 > c ((g & e | g & k | e & k) - 1894007588 ) : c ((g ^ e ^ k) - 899497514); k = e; e = g > > 2; [0] = b[0] h | b[1] g | 0; b[3] = b[3] k | b[3] = b[3] k | ; b[4] = b[4] j | b[4] = b[4] j | 0 }, _doFinalize: function () { var f = this._data, e = f.words, b = 8 * this._nDataBytes, h = 8 * f.sigBytes; e[h>>>> 5] |= 128 >> 9 >> 9
return CryptoJS.SHA1(words).toString();
}
// time33 哈
, time33: function (words) { //# time33 哈希演算法
字數=字數|| '';
// 哈希時間33演算法
for (var i = 0, len = Words.length, hash = 5381; i
hash = (hash
};
傳回哈希值 & 0x7ffffffff;
}
}