昆仑游戏[JS加密修改]
来源：互联网 发布：微信群二维码采集软件 编辑：程序博客网 时间：2024/04/27 06:38
昆仑游戏:http://www.kunlun.com/index.html
View CodeView CodeView CodeView Code
JS加密修改
BigTools=window.BigTools;//重点RSAKeyPair=window.RSAKeyPair;//重点
调用function
getToken
下面是匿名函数
(function(ab) {var ad = 2;var I = 16;var o = I;var Q = 1 << 16;var e = Q >>> 1;var M = Q * Q;var T = Q - 1;var Z = 9999999999999998;var U;var aa;var n, c;function u(af) { U = af; aa = new Array(U); for (var a = 0; a < aa.length; a++) { aa[a] = 0 } n = new b(); c = new b(); c.digits[0] = 1}u(20);var J = 15;var L = q(1000000000000000);function b(a) { if (typeof a == "boolean" && a == true) { this.digits = null } else { this.digits = aa.slice(0) } this.isNeg = false}function r(ai) { var ah = ai.charAt(0) == "-"; var ag = ah ? 1 : 0; var a; while (ag < ai.length && ai.charAt(ag) == "0") {++ag } if (ag == ai.length) { a = new b() } else { var af = ai.length - ag; var aj = af % J; if (aj == 0) { aj = J } a = q(Number(ai.substr(ag, aj))); ag += aj; while (ag < ai.length) { a = g(ae(a, L), q(Number(ai.substr(ag, J)))); ag += J } a.isNeg = ah } return a}function P(af) { var a = new b(true); a.digits = af.digits.slice(0); a.isNeg = af.isNeg; return a}function q(ag) { var a = new b(); a.isNeg = ag < 0; ag = Math.abs(ag); var af = 0; while (ag > 0) { a.digits[af++] = ag & T; ag = Math.floor(ag / Q) } return a}function x(ag) { var a = ""; for (var af = ag.length - 1; af > -1; --af) { a += ag.charAt(af) } return a}var d = new Array("0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z");function O(ag, ai) { var af = new b(); af.digits[0] = ai; var ah = w(ag, af); var a = d[ah[1].digits[0]]; while (f(ah[0], n) == 1) { ah = w(ah[0], af); digit = ah[1].digits[0]; a += d[ah[1].digits[0]] } return (ag.isNeg ? "-": "") + x(a)}function ac(ag) { var af = new b(); af.digits[0] = 10; var ah = w(ag, af); var a = String(ah[1].digits[0]); while (f(ah[0], n) == 1) { ah = w(ah[0], af); a += String(ah[1].digits[0]) } return (ag.isNeg ? "-": "") + x(a)}var m = new Array("0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f");function R(ag) { var af = 15; var a = ""; for (i = 0; i < 4; ++i) { a += m[ag & af]; ag >>>= 4 } return x(a)}function B(af) { var a = ""; var ah = V(af); for (var ag = V(af); ag > -1; --ag) { a += R(af.digits[ag]) } return a}function A(al) { var ag = 48; var af = ag + 9; var ah = 97; var ak = ah + 25; var aj = 65; var ai = 65 + 25; var a; if (al >= ag && al <= af) { a = al - ag } else { if (al >= aj && al <= ai) { a = 10 + al - aj } else { if (al >= ah && al <= ak) { a = 10 + al - ah } else { a = 0 } } } return a}function K(ah) { var af = 0; var a = Math.min(ah.length, 4); for (var ag = 0; ag < a; ++ag) { af <<= 4; af |= A(ah.charCodeAt(ag)) } return af}function W(ai) { var af = new b(); var a = ai.length; for (var ah = a, ag = 0; ah > 0; ah -= 4, ++ag) { af.digits[ag] = K(ai.substr(Math.max(ah - 4, 0), Math.min(ah, 4))) } return af}function C(am, al) { var a = am.charAt(0) == "-"; var ah = a ? 1 : 0; var an = new b(); var af = new b(); af.digits[0] = 1; for (var ag = am.length - 1; ag >= ah; ag--) { var ai = am.charCodeAt(ag); var aj = A(ai); var ak = k(af, aj); an = g(an, ak); af = k(af, al) } an.isNeg = a; return an}function D(a) { return (a.isNeg ? "-": "") + a.digits.join(" ")}function g(af, aj) { var a; if (af.isNeg != aj.isNeg) { aj.isNeg = !aj.isNeg; a = S(af, aj); aj.isNeg = !aj.isNeg } else { a = new b(); var ai = 0; var ah; for (var ag = 0; ag < af.digits.length; ++ag) { ah = af.digits[ag] + aj.digits[ag] + ai; a.digits[ag] = ah % Q; ai = Number(ah >= Q) } a.isNeg = af.isNeg } return a}function S(af, aj) { var a; if (af.isNeg != aj.isNeg) { aj.isNeg = !aj.isNeg; a = g(af, aj); aj.isNeg = !aj.isNeg } else { a = new b(); var ai, ah; ah = 0; for (var ag = 0; ag < af.digits.length; ++ag) { ai = af.digits[ag] - aj.digits[ag] + ah; a.digits[ag] = ai % Q; if (a.digits[ag] < 0) { a.digits[ag] += Q } ah = 0 - Number(ai < 0) } if (ah == -1) { ah = 0; for (var ag = 0; ag < af.digits.length; ++ag) { ai = 0 - a.digits[ag] + ah; a.digits[ag] = ai % Q; if (a.digits[ag] < 0) { a.digits[ag] += Q } ah = 0 - Number(ai < 0) } a.isNeg = !af.isNeg } else { a.isNeg = af.isNeg } } return a}function V(af) { var a = af.digits.length - 1; while (a > 0 && af.digits[a] == 0) {--a } return a}function H(ag) { var ai = V(ag); var ah = ag.digits[ai]; var af = (ai + 1) * o; var a; for (a = af; a > af - o; --a) { if ((ah & 32768) != 0) { break } ah <<= 1 } return a}function ae(ak, aj) { var an = new b(); var ai; var af = V(ak); var am = V(aj); var al, a, ag; for (var ah = 0; ah <= am; ++ah) { ai = 0; ag = ah; for (j = 0; j <= af; ++j, ++ag) { a = an.digits[ag] + ak.digits[j] * aj.digits[ah] + ai; an.digits[ag] = a & T; ai = a >>> I } an.digits[ah + af + 1] = ai } an.isNeg = ak.isNeg != aj.isNeg; return an}function k(a, aj) { var ai, ah, ag; result = new b(); ai = V(a); ah = 0; for (var af = 0; af <= ai; ++af) { ag = result.digits[af] + a.digits[af] * aj + ah; result.digits[af] = ag & T; ah = ag >>> I } result.digits[1 + ai] = ah; return result}function v(ai, al, ag, ak, aj) { var a = Math.min(al + aj, ai.length); for (var ah = al, af = ak; ah < a; ++ah, ++af) { ag[af] = ai[ah] }}var p = new Array(0, 32768, 49152, 57344, 61440, 63488, 64512, 65024, 65280, 65408, 65472, 65504, 65520, 65528, 65532, 65534, 65535);function t(af, al) { var ah = Math.floor(al / o); var a = new b(); v(af.digits, 0, a.digits, ah, a.digits.length - ah); var ak = al % o; var ag = o - ak; for (var ai = a.digits.length - 1, aj = ai - 1; ai > 0; --ai, --aj) { a.digits[ai] = ((a.digits[ai] << ak) & T) | ((a.digits[aj] & p[ak]) >>> (ag)) } a.digits[0] = ((a.digits[ai] << ak) & T); a.isNeg = af.isNeg; return a}var E = new Array(0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535);function l(af, al) { var ag = Math.floor(al / o); var a = new b(); v(af.digits, ag, a.digits, 0, af.digits.length - ag); var aj = al % o; var ak = o - aj; for (var ah = 0, ai = ah + 1; ah < a.digits.length - 1; ++ah, ++ai) { a.digits[ah] = (a.digits[ah] >>> aj) | ((a.digits[ai] & E[aj]) << ak) } a.digits[a.digits.length - 1] >>>= aj; a.isNeg = af.isNeg; return a}function y(af, ag) { var a = new b(); v(af.digits, 0, a.digits, ag, a.digits.length - ag); return a}function h(af, ag) { var a = new b(); v(af.digits, ag, a.digits, 0, a.digits.length - ag); return a}function N(af, ag) { var a = new b(); v(af.digits, 0, a.digits, 0, ag); return a}function f(a, ag) { if (a.isNeg != ag.isNeg) { return 1 - 2 * Number(a.isNeg) } for (var af = a.digits.length - 1; af >= 0; --af) { if (a.digits[af] != ag.digits[af]) { if (a.isNeg) { return 1 - 2 * Number(a.digits[af] > ag.digits[af]) } else { return 1 - 2 * Number(a.digits[af] < ag.digits[af]) } } } return 0}function w(aj, ai) { var a = H(aj); var ah = H(ai); var ag = ai.isNeg; var ao, an; if (a < ah) { if (aj.isNeg) { ao = P(c); ao.isNeg = !ai.isNeg; aj.isNeg = false; ai.isNeg = false; an = S(ai, aj); aj.isNeg = true; ai.isNeg = ag } else { ao = new b(); an = P(aj) } return new Array(ao, an) } ao = new b(); an = aj; var al = Math.ceil(ah / o) - 1; var ak = 0; while (ai.digits[al] < e) { ai = t(ai, 1); ++ak; ++ah; al = Math.ceil(ah / o) - 1 } an = t(an, ak); a += ak; var ar = Math.ceil(a / o) - 1; var ax = y(ai, ar - al); while (f(an, ax) != -1) {++ao.digits[ar - al]; an = S(an, ax) } for (var av = ar; av > al; --av) { var am = (av >= an.digits.length) ? 0 : an.digits[av]; var aw = (av - 1 >= an.digits.length) ? 0 : an.digits[av - 1]; var au = (av - 2 >= an.digits.length) ? 0 : an.digits[av - 2]; var at = (al >= ai.digits.length) ? 0 : ai.digits[al]; var af = (al - 1 >= ai.digits.length) ? 0 : ai.digits[al - 1]; if (am == at) { ao.digits[av - al - 1] = T } else { ao.digits[av - al - 1] = Math.floor((am * Q + aw) / at) } var aq = ao.digits[av - al - 1] * ((at * Q) + af); var ap = (am * M) + ((aw * Q) + au); while (aq > ap) {--ao.digits[av - al - 1]; aq = ao.digits[av - al - 1] * ((at * Q) | af); ap = (am * Q * Q) + ((aw * Q) + au) } ax = y(ai, av - al - 1); an = S(an, k(ax, ao.digits[av - al - 1])); if (an.isNeg) { an = g(an, ax); --ao.digits[av - al - 1] } } an = l(an, ak); ao.isNeg = aj.isNeg != ag; if (aj.isNeg) { if (ag) { ao = g(ao, c) } else { ao = S(ao, c) } ai = l(ai, ak); an = S(ai, an) } if (an.digits[0] == 0 && V(an) == 0) { an.isNeg = false } return new Array(ao, an)}function Y(a, af) { return w(a, af)[0]}function z(a, af) { return w(a, af)[1]}function s(af, ag, a) { return z(ae(af, ag), a)}function G(ag, ai) { var af = c; var ah = ag; while (true) { if ((ai & 1) != 0) { af = ae(af, ah) } ai >>= 1; if (ai == 0) { break } ah = ae(ah, ah) } return af}function F(ah, ak, ag) { var af = c; var ai = ah; var aj = ak; while (true) { if ((aj.digits[0] & 1) != 0) { af = s(af, ai, ag) } aj = l(aj, 1); if (aj.digits[0] == 0 && V(aj) == 0) { break } ai = s(ai, ai, ag) } return af}var X = { setMaxDigits: u, biCopy: P, biHighIndex: V, BigInt: b, biDivide: Y, biDivideByRadixPower: h, biMultiply: ae, biModuloByRadixPower: N, biSubtract: S, biAdd: g, biCompare: f, biShiftRight: l, biFromHex: W, biToHex: B, biToString: O, biFromString: C};ab.BigTools = ab.BigTools || X})(window); (function(c) {var h = c.BigTools,a = h.BigInt,e = h.biFromHex,f = h.biHighIndex;function d(k) { this.modulus = h.biCopy(k); this.k = f(this.modulus) + 1; var l = new a(); l.digits[2 * this.k] = 1; this.mu = h.biDivide(l, this.modulus); this.bkplus1 = new a(); this.bkplus1.digits[this.k + 1] = 1; this.modulo = function(u) { var t = h.biDivideByRadixPower(u, this.k - 1); var q = h.biMultiply(t, this.mu); var p = h.biDivideByRadixPower(q, this.k + 1); var o = h.biModuloByRadixPower(u, this.k + 1); var v = h.biMultiply(p, this.modulus); var n = h.biModuloByRadixPower(v, this.k + 1); var m = h.biSubtract(o, n); if (m.isNeg) { m = h.biAdd(m, this.bkplus1) } var s = h.biCompare(m, this.modulus) >= 0; while (s) { m = h.biSubtract(m, this.modulus); s = h.biCompare(m, this.modulus) >= 0 } return m }; this.multiplyMod = function(m, o) { var n = h.biMultiply(m, o); return this.modulo(n) }; this.powMod = function(n, q) { var m = new a(); m.digits[0] = 1; var o = n; var p = q; while (true) { if ((p.digits[0] & 1) != 0) { m = this.multiplyMod(m, o) } p = h.biShiftRight(p, 1); if (p.digits[0] == 0 && f(p) == 0) { break } o = this.multiplyMod(o, o) } return m }}function g(l, m, k) { this.e = e(l); this.d = e(m); this.m = e(k); this.chunkSize = 2 * f(this.m); this.radix = 16; this.barrett = new d(this.m)}function b(k) { return (k < 10 ? "0": "") + String(k)}g.encryptedString = function(t, w) { var r = new Array(); var l = w.length; var p = 0; while (p < l) { r[p] = w.charCodeAt(p); p++ } while (r.length % t.chunkSize != 0) { r[p++] = 0 } var q = r.length; var x = ""; var o, n, m; for (p = 0; p < q; p += t.chunkSize) { m = new a(); o = 0; for (n = p; n < p + t.chunkSize; ++o) { m.digits[o] = r[n++]; m.digits[o] += r[n++] << 8 } var v = t.barrett.powMod(m, t.e); var u = t.radix == 16 ? h.biToHex(v) : h.biToString(v, t.radix); x += u + " " } return x.substring(0, x.length - 1)};g.decryptedString = function(o, p) { var r = p.split(" "); var k = ""; var n, m, q; for (n = 0; n < r.length; ++n) { var l; if (o.radix == 16) { l = e(r[n]) } else { l = h.biFromString(r[n], o.radix) } q = o.barrett.powMod(l, o.d); for (m = 0; m <= f(q); ++m) { k += String.fromCharCode(q.digits[m] & 255, q.digits[m] >> 8) } } if (k.charCodeAt(k.length - 1) == 0) { k = k.substring(0, k.length - 1) } return k};c.RSAKeyPair = c.RSAKeyPair || g})(window);
如果修改匿名函数呢?下面是修改后的,ab.BigTools = ab.BigTools || X,在这里 ab就是window
匿名函数尾部有window,就是设置window属性的,这种函数运行的时候先到函数的末尾找到（）,,,(function(ab)ab是个参数
下面是如何修改匿名函数
window={};(function(ab) {var ad = 2;var I = 16;var o = I;var Q = 1 << 16;var e = Q >>> 1;var M = Q * Q;var T = Q - 1;var Z = 9999999999999998;var U;var aa;var n, c;function u(af) { U = af; aa = new Array(U); for (var a = 0; a < aa.length; a++) { aa[a] = 0 } n = new b(); c = new b(); c.digits[0] = 1}u(20);var J = 15;var L = q(1000000000000000);function b(a) { if (typeof a == "boolean" && a == true) { this.digits = null } else { this.digits = aa.slice(0) } this.isNeg = false}function r(ai) { var ah = ai.charAt(0) == "-"; var ag = ah ? 1 : 0; var a; while (ag < ai.length && ai.charAt(ag) == "0") {++ag } if (ag == ai.length) { a = new b() } else { var af = ai.length - ag; var aj = af % J; if (aj == 0) { aj = J } a = q(Number(ai.substr(ag, aj))); ag += aj; while (ag < ai.length) { a = g(ae(a, L), q(Number(ai.substr(ag, J)))); ag += J } a.isNeg = ah } return a}function P(af) { var a = new b(true); a.digits = af.digits.slice(0); a.isNeg = af.isNeg; return a}function q(ag) { var a = new b(); a.isNeg = ag < 0; ag = Math.abs(ag); var af = 0; while (ag > 0) { a.digits[af++] = ag & T; ag = Math.floor(ag / Q) } return a}function x(ag) { var a = ""; for (var af = ag.length - 1; af > -1; --af) { a += ag.charAt(af) } return a}var d = new Array("0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z");function O(ag, ai) { var af = new b(); af.digits[0] = ai; var ah = w(ag, af); var a = d[ah[1].digits[0]]; while (f(ah[0], n) == 1) { ah = w(ah[0], af); digit = ah[1].digits[0]; a += d[ah[1].digits[0]] } return (ag.isNeg ? "-": "") + x(a)}function ac(ag) { var af = new b(); af.digits[0] = 10; var ah = w(ag, af); var a = String(ah[1].digits[0]); while (f(ah[0], n) == 1) { ah = w(ah[0], af); a += String(ah[1].digits[0]) } return (ag.isNeg ? "-": "") + x(a)}var m = new Array("0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f");function R(ag) { var af = 15; var a = ""; for (i = 0; i < 4; ++i) { a += m[ag & af]; ag >>>= 4 } return x(a)}function B(af) { var a = ""; var ah = V(af); for (var ag = V(af); ag > -1; --ag) { a += R(af.digits[ag]) } return a}function A(al) { var ag = 48; var af = ag + 9; var ah = 97; var ak = ah + 25; var aj = 65; var ai = 65 + 25; var a; if (al >= ag && al <= af) { a = al - ag } else { if (al >= aj && al <= ai) { a = 10 + al - aj } else { if (al >= ah && al <= ak) { a = 10 + al - ah } else { a = 0 } } } return a}function K(ah) { var af = 0; var a = Math.min(ah.length, 4); for (var ag = 0; ag < a; ++ag) { af <<= 4; af |= A(ah.charCodeAt(ag)) } return af}function W(ai) { var af = new b(); var a = ai.length; for (var ah = a, ag = 0; ah > 0; ah -= 4, ++ag) { af.digits[ag] = K(ai.substr(Math.max(ah - 4, 0), Math.min(ah, 4))) } return af}function C(am, al) { var a = am.charAt(0) == "-"; var ah = a ? 1 : 0; var an = new b(); var af = new b(); af.digits[0] = 1; for (var ag = am.length - 1; ag >= ah; ag--) { var ai = am.charCodeAt(ag); var aj = A(ai); var ak = k(af, aj); an = g(an, ak); af = k(af, al) } an.isNeg = a; return an}function D(a) { return (a.isNeg ? "-": "") + a.digits.join(" ")}function g(af, aj) { var a; if (af.isNeg != aj.isNeg) { aj.isNeg = !aj.isNeg; a = S(af, aj); aj.isNeg = !aj.isNeg } else { a = new b(); var ai = 0; var ah; for (var ag = 0; ag < af.digits.length; ++ag) { ah = af.digits[ag] + aj.digits[ag] + ai; a.digits[ag] = ah % Q; ai = Number(ah >= Q) } a.isNeg = af.isNeg } return a}function S(af, aj) { var a; if (af.isNeg != aj.isNeg) { aj.isNeg = !aj.isNeg; a = g(af, aj); aj.isNeg = !aj.isNeg } else { a = new b(); var ai, ah; ah = 0; for (var ag = 0; ag < af.digits.length; ++ag) { ai = af.digits[ag] - aj.digits[ag] + ah; a.digits[ag] = ai % Q; if (a.digits[ag] < 0) { a.digits[ag] += Q } ah = 0 - Number(ai < 0) } if (ah == -1) { ah = 0; for (var ag = 0; ag < af.digits.length; ++ag) { ai = 0 - a.digits[ag] + ah; a.digits[ag] = ai % Q; if (a.digits[ag] < 0) { a.digits[ag] += Q } ah = 0 - Number(ai < 0) } a.isNeg = !af.isNeg } else { a.isNeg = af.isNeg } } return a}function V(af) { var a = af.digits.length - 1; while (a > 0 && af.digits[a] == 0) {--a } return a}function H(ag) { var ai = V(ag); var ah = ag.digits[ai]; var af = (ai + 1) * o; var a; for (a = af; a > af - o; --a) { if ((ah & 32768) != 0) { break } ah <<= 1 } return a}function ae(ak, aj) { var an = new b(); var ai; var af = V(ak); var am = V(aj); var al, a, ag; for (var ah = 0; ah <= am; ++ah) { ai = 0; ag = ah; for (j = 0; j <= af; ++j, ++ag) { a = an.digits[ag] + ak.digits[j] * aj.digits[ah] + ai; an.digits[ag] = a & T; ai = a >>> I } an.digits[ah + af + 1] = ai } an.isNeg = ak.isNeg != aj.isNeg; return an}function k(a, aj) { var ai, ah, ag; result = new b(); ai = V(a); ah = 0; for (var af = 0; af <= ai; ++af) { ag = result.digits[af] + a.digits[af] * aj + ah; result.digits[af] = ag & T; ah = ag >>> I } result.digits[1 + ai] = ah; return result}function v(ai, al, ag, ak, aj) { var a = Math.min(al + aj, ai.length); for (var ah = al, af = ak; ah < a; ++ah, ++af) { ag[af] = ai[ah] }}var p = new Array(0, 32768, 49152, 57344, 61440, 63488, 64512, 65024, 65280, 65408, 65472, 65504, 65520, 65528, 65532, 65534, 65535);function t(af, al) { var ah = Math.floor(al / o); var a = new b(); v(af.digits, 0, a.digits, ah, a.digits.length - ah); var ak = al % o; var ag = o - ak; for (var ai = a.digits.length - 1, aj = ai - 1; ai > 0; --ai, --aj) { a.digits[ai] = ((a.digits[ai] << ak) & T) | ((a.digits[aj] & p[ak]) >>> (ag)) } a.digits[0] = ((a.digits[ai] << ak) & T); a.isNeg = af.isNeg; return a}var E = new Array(0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535);function l(af, al) { var ag = Math.floor(al / o); var a = new b(); v(af.digits, ag, a.digits, 0, af.digits.length - ag); var aj = al % o; var ak = o - aj; for (var ah = 0, ai = ah + 1; ah < a.digits.length - 1; ++ah, ++ai) { a.digits[ah] = (a.digits[ah] >>> aj) | ((a.digits[ai] & E[aj]) << ak) } a.digits[a.digits.length - 1] >>>= aj; a.isNeg = af.isNeg; return a}function y(af, ag) { var a = new b(); v(af.digits, 0, a.digits, ag, a.digits.length - ag); return a}function h(af, ag) { var a = new b(); v(af.digits, ag, a.digits, 0, a.digits.length - ag); return a}function N(af, ag) { var a = new b(); v(af.digits, 0, a.digits, 0, ag); return a}function f(a, ag) { if (a.isNeg != ag.isNeg) { return 1 - 2 * Number(a.isNeg) } for (var af = a.digits.length - 1; af >= 0; --af) { if (a.digits[af] != ag.digits[af]) { if (a.isNeg) { return 1 - 2 * Number(a.digits[af] > ag.digits[af]) } else { return 1 - 2 * Number(a.digits[af] < ag.digits[af]) } } } return 0}function w(aj, ai) { var a = H(aj); var ah = H(ai); var ag = ai.isNeg; var ao, an; if (a < ah) { if (aj.isNeg) { ao = P(c); ao.isNeg = !ai.isNeg; aj.isNeg = false; ai.isNeg = false; an = S(ai, aj); aj.isNeg = true; ai.isNeg = ag } else { ao = new b(); an = P(aj) } return new Array(ao, an) } ao = new b(); an = aj; var al = Math.ceil(ah / o) - 1; var ak = 0; while (ai.digits[al] < e) { ai = t(ai, 1); ++ak; ++ah; al = Math.ceil(ah / o) - 1 } an = t(an, ak); a += ak; var ar = Math.ceil(a / o) - 1; var ax = y(ai, ar - al); while (f(an, ax) != -1) {++ao.digits[ar - al]; an = S(an, ax) } for (var av = ar; av > al; --av) { var am = (av >= an.digits.length) ? 0 : an.digits[av]; var aw = (av - 1 >= an.digits.length) ? 0 : an.digits[av - 1]; var au = (av - 2 >= an.digits.length) ? 0 : an.digits[av - 2]; var at = (al >= ai.digits.length) ? 0 : ai.digits[al]; var af = (al - 1 >= ai.digits.length) ? 0 : ai.digits[al - 1]; if (am == at) { ao.digits[av - al - 1] = T } else { ao.digits[av - al - 1] = Math.floor((am * Q + aw) / at) } var aq = ao.digits[av - al - 1] * ((at * Q) + af); var ap = (am * M) + ((aw * Q) + au); while (aq > ap) {--ao.digits[av - al - 1]; aq = ao.digits[av - al - 1] * ((at * Q) | af); ap = (am * Q * Q) + ((aw * Q) + au) } ax = y(ai, av - al - 1); an = S(an, k(ax, ao.digits[av - al - 1])); if (an.isNeg) { an = g(an, ax); --ao.digits[av - al - 1] } } an = l(an, ak); ao.isNeg = aj.isNeg != ag; if (aj.isNeg) { if (ag) { ao = g(ao, c) } else { ao = S(ao, c) } ai = l(ai, ak); an = S(ai, an) } if (an.digits[0] == 0 && V(an) == 0) { an.isNeg = false } return new Array(ao, an)}function Y(a, af) { return w(a, af)[0]}function z(a, af) { return w(a, af)[1]}function s(af, ag, a) { return z(ae(af, ag), a)}function G(ag, ai) { var af = c; var ah = ag; while (true) { if ((ai & 1) != 0) { af = ae(af, ah) } ai >>= 1; if (ai == 0) { break } ah = ae(ah, ah) } return af}function F(ah, ak, ag) { var af = c; var ai = ah; var aj = ak; while (true) { if ((aj.digits[0] & 1) != 0) { af = s(af, ai, ag) } aj = l(aj, 1); if (aj.digits[0] == 0 && V(aj) == 0) { break } ai = s(ai, ai, ag) } return af}var X = { setMaxDigits: u, biCopy: P, biHighIndex: V, BigInt: b, biDivide: Y, biDivideByRadixPower: h, biMultiply: ae, biModuloByRadixPower: N, biSubtract: S, biAdd: g, biCompare: f, biShiftRight: l, biFromHex: W, biToHex: B, biToString: O, biFromString: C};ab.BigTools = ab.BigTools || X})(window); (function(c) {var h = c.BigTools,a = h.BigInt,e = h.biFromHex,f = h.biHighIndex;function d(k) { this.modulus = h.biCopy(k); this.k = f(this.modulus) + 1; var l = new a(); l.digits[2 * this.k] = 1; this.mu = h.biDivide(l, this.modulus); this.bkplus1 = new a(); this.bkplus1.digits[this.k + 1] = 1; this.modulo = function(u) { var t = h.biDivideByRadixPower(u, this.k - 1); var q = h.biMultiply(t, this.mu); var p = h.biDivideByRadixPower(q, this.k + 1); var o = h.biModuloByRadixPower(u, this.k + 1); var v = h.biMultiply(p, this.modulus); var n = h.biModuloByRadixPower(v, this.k + 1); var m = h.biSubtract(o, n); if (m.isNeg) { m = h.biAdd(m, this.bkplus1) } var s = h.biCompare(m, this.modulus) >= 0; while (s) { m = h.biSubtract(m, this.modulus); s = h.biCompare(m, this.modulus) >= 0 } return m }; this.multiplyMod = function(m, o) { var n = h.biMultiply(m, o); return this.modulo(n) }; this.powMod = function(n, q) { var m = new a(); m.digits[0] = 1; var o = n; var p = q; while (true) { if ((p.digits[0] & 1) != 0) { m = this.multiplyMod(m, o) } p = h.biShiftRight(p, 1); if (p.digits[0] == 0 && f(p) == 0) { break } o = this.multiplyMod(o, o) } return m }}function g(l, m, k) { this.e = e(l); this.d = e(m); this.m = e(k); this.chunkSize = 2 * f(this.m); this.radix = 16; this.barrett = new d(this.m)}function b(k) { return (k < 10 ? "0": "") + String(k)}g.encryptedString = function(t, w) { var r = new Array(); var l = w.length; var p = 0; while (p < l) { r[p] = w.charCodeAt(p); p++ } while (r.length % t.chunkSize != 0) { r[p++] = 0 } var q = r.length; var x = ""; var o, n, m; for (p = 0; p < q; p += t.chunkSize) { m = new a(); o = 0; for (n = p; n < p + t.chunkSize; ++o) { m.digits[o] = r[n++]; m.digits[o] += r[n++] << 8 } var v = t.barrett.powMod(m, t.e); var u = t.radix == 16 ? h.biToHex(v) : h.biToString(v, t.radix); x += u + " " } return x.substring(0, x.length - 1)};g.decryptedString = function(o, p) { var r = p.split(" "); var k = ""; var n, m, q; for (n = 0; n < r.length; ++n) { var l; if (o.radix == 16) { l = e(r[n]) } else { l = h.biFromString(r[n], o.radix) } q = o.barrett.powMod(l, o.d); for (m = 0; m <= f(q); ++m) { k += String.fromCharCode(q.digits[m] & 255, q.digits[m] >> 8) } } if (k.charCodeAt(k.length - 1) == 0) { k = k.substring(0, k.length - 1) } return k};c.RSAKeyPair = c.RSAKeyPair || g})(window);BigTools=window.BigTools;RSAKeyPair=window.RSAKeyPair;
下面是修改成功的代码
/* * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message * Digest Algorithm, as defined in RFC 1321. * Version 2.2 Copyright (C) Paul Johnston 1999 - 2009 * 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 *//* * 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(s) {return rstr2hex(rstr_md5(str2rstr_utf8(s)));}function b64_md5(s) {return rstr2b64(rstr_md5(str2rstr_utf8(s)));}function any_md5(s, e) {return rstr2any(rstr_md5(str2rstr_utf8(s)), e);}function hex_hmac_md5(k, d) {return rstr2hex(rstr_hmac_md5(str2rstr_utf8(k), str2rstr_utf8(d)));}function b64_hmac_md5(k, d) {return rstr2b64(rstr_hmac_md5(str2rstr_utf8(k), str2rstr_utf8(d)));}function any_hmac_md5(k, d, e) {return rstr2any(rstr_hmac_md5(str2rstr_utf8(k), str2rstr_utf8(d)), e);}/* * Perform a simple self-test to see if the VM is working */function md5_vm_test() {return hex_md5("abc").toLowerCase() == "900150983cd24fb0d6963f7d28e17f72";}/* * Calculate the MD5 of a raw string */function rstr_md5(s) {return binl2rstr(binl_md5(rstr2binl(s), s.length * 8));}/* * Calculate the HMAC-MD5, of a key and some data (raw strings) */function rstr_hmac_md5(key, data) {var bkey = rstr2binl(key);if (bkey.length > 16) bkey = binl_md5(bkey, key.length * 8);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 = binl_md5(ipad.concat(rstr2binl(data)), 512 + data.length * 8);return binl2rstr(binl_md5(opad.concat(hash), 512 + 128));}/* * Convert a raw string to a hex string */function rstr2hex(input) {try { hexcase} catch(e) { hexcase = 0;}var hex_tab = hexcase ? "0123456789ABCDEF": "0123456789abcdef";var output = "";var x;for (var i = 0; i < input.length; i++) { x = input.charCodeAt(i); output += hex_tab.charAt((x >>> 4) & 0x0F) + hex_tab.charAt(x & 0x0F);}return output;}/* * Convert a raw string to a base-64 string */function rstr2b64(input) {try { b64pad} catch(e) { b64pad = '';}var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";var output = "";var len = input.length;for (var i = 0; i < len; i += 3) { var triplet = (input.charCodeAt(i) << 16) | (i + 1 < len ? input.charCodeAt(i + 1) << 8 : 0) | (i + 2 < len ? input.charCodeAt(i + 2) : 0); for (var j = 0; j < 4; j++) { if (i * 8 + j * 6 > input.length * 8) output += b64pad; else output += tab.charAt((triplet >>> 6 * (3 - j)) & 0x3F); }}return output;}/* * Convert a raw string to an arbitrary string encoding */function rstr2any(input, encoding) {var divisor = encoding.length;var i, j, q, x, quotient;/* Convert to an array of 16-bit big-endian values, forming the dividend */var dividend = Array(Math.ceil(input.length / 2));for (i = 0; i < dividend.length; i++) { dividend[i] = (input.charCodeAt(i * 2) << 8) | input.charCodeAt(i * 2 + 1);}/* * Repeatedly perform a long division. The binary array forms the dividend, * the length of the encoding is the divisor. Once computed, the quotient * forms the dividend for the next step. All remainders are stored for later * use. */var full_length = Math.ceil(input.length * 8 / (Math.log(encoding.length) / Math.log(2)));var remainders = Array(full_length);for (j = 0; j < full_length; j++) { quotient = Array(); x = 0; for (i = 0; i < dividend.length; i++) { x = (x << 16) + dividend[i]; q = Math.floor(x / divisor); x -= q * divisor; if (quotient.length > 0 || q > 0) quotient[quotient.length] = q; } remainders[j] = x; dividend = quotient;}/* Convert the remainders to the output string */var output = "";for (i = remainders.length - 1; i >= 0; i--) output += encoding.charAt(remainders[i]);return output;}/* * Encode a string as utf-8. * For efficiency, this assumes the input is valid utf-16. */function str2rstr_utf8(input) {var output = "";var i = -1;var x, y;while (++i < input.length) { /* Decode utf-16 surrogate pairs */ x = input.charCodeAt(i); y = i + 1 < input.length ? input.charCodeAt(i + 1) : 0; if (0xD800 <= x && x <= 0xDBFF && 0xDC00 <= y && y <= 0xDFFF) { x = 0x10000 + ((x & 0x03FF) << 10) + (y & 0x03FF); i++; } /* Encode output as utf-8 */ if (x <= 0x7F) output += String.fromCharCode(x); else if (x <= 0x7FF) output += String.fromCharCode(0xC0 | ((x >>> 6) & 0x1F), 0x80 | (x & 0x3F)); else if (x <= 0xFFFF) output += String.fromCharCode(0xE0 | ((x >>> 12) & 0x0F), 0x80 | ((x >>> 6) & 0x3F), 0x80 | (x & 0x3F)); else if (x <= 0x1FFFFF) output += String.fromCharCode(0xF0 | ((x >>> 18) & 0x07), 0x80 | ((x >>> 12) & 0x3F), 0x80 | ((x >>> 6) & 0x3F), 0x80 | (x & 0x3F));}return output;}/* * Encode a string as utf-16 */function str2rstr_utf16le(input) {var output = "";for (var i = 0; i < input.length; i++) output += String.fromCharCode(input.charCodeAt(i) & 0xFF, (input.charCodeAt(i) >>> 8) & 0xFF);return output;}function str2rstr_utf16be(input) {var output = "";for (var i = 0; i < input.length; i++) output += String.fromCharCode((input.charCodeAt(i) >>> 8) & 0xFF, input.charCodeAt(i) & 0xFF);return output;}/* * Convert a raw string to an array of little-endian words * Characters >255 have their high-byte silently ignored. */function rstr2binl(input) {var output = Array(input.length >> 2);for (var i = 0; i < output.length; i++) output[i] = 0;for (var i = 0; i < input.length * 8; i += 8) output[i >> 5] |= (input.charCodeAt(i / 8) & 0xFF) << (i % 32);return output;}/* * Convert an array of little-endian words to a string */function binl2rstr(input) {var output = "";for (var i = 0; i < input.length * 32; i += 8) output += String.fromCharCode((input[i >> 5] >>> (i % 32)) & 0xFF);return output;}/* * Calculate the MD5 of an array of little-endian words, and a bit length. */function binl_md5(x, len) {/* append padding */x[len >> 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, 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(a, olda); b = safe_add(b, oldb); c = safe_add(c, oldc); d = safe_add(d, oldd);}return Array(a, b, c, d);}/* * These functions implement the four basic operations the algorithm uses. */function md5_cmn(q, a, b, x, s, t) {return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s), b);}function md5_ff(a, b, c, d, x, s, t) {return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);}function md5_gg(a, b, c, d, x, s, t) {return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);}function md5_hh(a, b, c, d, x, s, t) {return md5_cmn(b ^ c ^ d, a, b, x, s, t);}function md5_ii(a, b, c, d, x, s, t) {return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);}/* * 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));}window={};(function(ab) {var ad = 2;var I = 16;var o = I;var Q = 1 << 16;var e = Q >>> 1;var M = Q * Q;var T = Q - 1;var Z = 9999999999999998;var U;var aa;var n, c;function u(af) { U = af; aa = new Array(U); for (var a = 0; a < aa.length; a++) { aa[a] = 0 } n = new b(); c = new b(); c.digits[0] = 1}u(20);var J = 15;var L = q(1000000000000000);function b(a) { if (typeof a == "boolean" && a == true) { this.digits = null } else { this.digits = aa.slice(0) } this.isNeg = false}function r(ai) { var ah = ai.charAt(0) == "-"; var ag = ah ? 1 : 0; var a; while (ag < ai.length && ai.charAt(ag) == "0") {++ag } if (ag == ai.length) { a = new b() } else { var af = ai.length - ag; var aj = af % J; if (aj == 0) { aj = J } a = q(Number(ai.substr(ag, aj))); ag += aj; while (ag < ai.length) { a = g(ae(a, L), q(Number(ai.substr(ag, J)))); ag += J } a.isNeg = ah } return a}function P(af) { var a = new b(true); a.digits = af.digits.slice(0); a.isNeg = af.isNeg; return a}function q(ag) { var a = new b(); a.isNeg = ag < 0; ag = Math.abs(ag); var af = 0; while (ag > 0) { a.digits[af++] = ag & T; ag = Math.floor(ag / Q) } return a}function x(ag) { var a = ""; for (var af = ag.length - 1; af > -1; --af) { a += ag.charAt(af) } return a}var d = new Array("0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z");function O(ag, ai) { var af = new b(); af.digits[0] = ai; var ah = w(ag, af); var a = d[ah[1].digits[0]]; while (f(ah[0], n) == 1) { ah = w(ah[0], af); digit = ah[1].digits[0]; a += d[ah[1].digits[0]] } return (ag.isNeg ? "-": "") + x(a)}function ac(ag) { var af = new b(); af.digits[0] = 10; var ah = w(ag, af); var a = String(ah[1].digits[0]); while (f(ah[0], n) == 1) { ah = w(ah[0], af); a += String(ah[1].digits[0]) } return (ag.isNeg ? "-": "") + x(a)}var m = new Array("0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f");function R(ag) { var af = 15; var a = ""; for (i = 0; i < 4; ++i) { a += m[ag & af]; ag >>>= 4 } return x(a)}function B(af) { var a = ""; var ah = V(af); for (var ag = V(af); ag > -1; --ag) { a += R(af.digits[ag]) } return a}function A(al) { var ag = 48; var af = ag + 9; var ah = 97; var ak = ah + 25; var aj = 65; var ai = 65 + 25; var a; if (al >= ag && al <= af) { a = al - ag } else { if (al >= aj && al <= ai) { a = 10 + al - aj } else { if (al >= ah && al <= ak) { a = 10 + al - ah } else { a = 0 } } } return a}function K(ah) { var af = 0; var a = Math.min(ah.length, 4); for (var ag = 0; ag < a; ++ag) { af <<= 4; af |= A(ah.charCodeAt(ag)) } return af}function W(ai) { var af = new b(); var a = ai.length; for (var ah = a, ag = 0; ah > 0; ah -= 4, ++ag) { af.digits[ag] = K(ai.substr(Math.max(ah - 4, 0), Math.min(ah, 4))) } return af}function C(am, al) { var a = am.charAt(0) == "-"; var ah = a ? 1 : 0; var an = new b(); var af = new b(); af.digits[0] = 1; for (var ag = am.length - 1; ag >= ah; ag--) { var ai = am.charCodeAt(ag); var aj = A(ai); var ak = k(af, aj); an = g(an, ak); af = k(af, al) } an.isNeg = a; return an}function D(a) { return (a.isNeg ? "-": "") + a.digits.join(" ")}function g(af, aj) { var a; if (af.isNeg != aj.isNeg) { aj.isNeg = !aj.isNeg; a = S(af, aj); aj.isNeg = !aj.isNeg } else { a = new b(); var ai = 0; var ah; for (var ag = 0; ag < af.digits.length; ++ag) { ah = af.digits[ag] + aj.digits[ag] + ai; a.digits[ag] = ah % Q; ai = Number(ah >= Q) } a.isNeg = af.isNeg } return a}function S(af, aj) { var a; if (af.isNeg != aj.isNeg) { aj.isNeg = !aj.isNeg; a = g(af, aj); aj.isNeg = !aj.isNeg } else { a = new b(); var ai, ah; ah = 0; for (var ag = 0; ag < af.digits.length; ++ag) { ai = af.digits[ag] - aj.digits[ag] + ah; a.digits[ag] = ai % Q; if (a.digits[ag] < 0) { a.digits[ag] += Q } ah = 0 - Number(ai < 0) } if (ah == -1) { ah = 0; for (var ag = 0; ag < af.digits.length; ++ag) { ai = 0 - a.digits[ag] + ah; a.digits[ag] = ai % Q; if (a.digits[ag] < 0) { a.digits[ag] += Q } ah = 0 - Number(ai < 0) } a.isNeg = !af.isNeg } else { a.isNeg = af.isNeg } } return a}function V(af) { var a = af.digits.length - 1; while (a > 0 && af.digits[a] == 0) {--a } return a}function H(ag) { var ai = V(ag); var ah = ag.digits[ai]; var af = (ai + 1) * o; var a; for (a = af; a > af - o; --a) { if ((ah & 32768) != 0) { break } ah <<= 1 } return a}function ae(ak, aj) { var an = new b(); var ai; var af = V(ak); var am = V(aj); var al, a, ag; for (var ah = 0; ah <= am; ++ah) { ai = 0; ag = ah; for (j = 0; j <= af; ++j, ++ag) { a = an.digits[ag] + ak.digits[j] * aj.digits[ah] + ai; an.digits[ag] = a & T; ai = a >>> I } an.digits[ah + af + 1] = ai } an.isNeg = ak.isNeg != aj.isNeg; return an}function k(a, aj) { var ai, ah, ag; result = new b(); ai = V(a); ah = 0; for (var af = 0; af <= ai; ++af) { ag = result.digits[af] + a.digits[af] * aj + ah; result.digits[af] = ag & T; ah = ag >>> I } result.digits[1 + ai] = ah; return result}function v(ai, al, ag, ak, aj) { var a = Math.min(al + aj, ai.length); for (var ah = al, af = ak; ah < a; ++ah, ++af) { ag[af] = ai[ah] }}var p = new Array(0, 32768, 49152, 57344, 61440, 63488, 64512, 65024, 65280, 65408, 65472, 65504, 65520, 65528, 65532, 65534, 65535);function t(af, al) { var ah = Math.floor(al / o); var a = new b(); v(af.digits, 0, a.digits, ah, a.digits.length - ah); var ak = al % o; var ag = o - ak; for (var ai = a.digits.length - 1, aj = ai - 1; ai > 0; --ai, --aj) { a.digits[ai] = ((a.digits[ai] << ak) & T) | ((a.digits[aj] & p[ak]) >>> (ag)) } a.digits[0] = ((a.digits[ai] << ak) & T); a.isNeg = af.isNeg; return a}var E = new Array(0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535);function l(af, al) { var ag = Math.floor(al / o); var a = new b(); v(af.digits, ag, a.digits, 0, af.digits.length - ag); var aj = al % o; var ak = o - aj; for (var ah = 0, ai = ah + 1; ah < a.digits.length - 1; ++ah, ++ai) { a.digits[ah] = (a.digits[ah] >>> aj) | ((a.digits[ai] & E[aj]) << ak) } a.digits[a.digits.length - 1] >>>= aj; a.isNeg = af.isNeg; return a}function y(af, ag) { var a = new b(); v(af.digits, 0, a.digits, ag, a.digits.length - ag); return a}function h(af, ag) { var a = new b(); v(af.digits, ag, a.digits, 0, a.digits.length - ag); return a}function N(af, ag) { var a = new b(); v(af.digits, 0, a.digits, 0, ag); return a}function f(a, ag) { if (a.isNeg != ag.isNeg) { return 1 - 2 * Number(a.isNeg) } for (var af = a.digits.length - 1; af >= 0; --af) { if (a.digits[af] != ag.digits[af]) { if (a.isNeg) { return 1 - 2 * Number(a.digits[af] > ag.digits[af]) } else { return 1 - 2 * Number(a.digits[af] < ag.digits[af]) } } } return 0}function w(aj, ai) { var a = H(aj); var ah = H(ai); var ag = ai.isNeg; var ao, an; if (a < ah) { if (aj.isNeg) { ao = P(c); ao.isNeg = !ai.isNeg; aj.isNeg = false; ai.isNeg = false; an = S(ai, aj); aj.isNeg = true; ai.isNeg = ag } else { ao = new b(); an = P(aj) } return new Array(ao, an) } ao = new b(); an = aj; var al = Math.ceil(ah / o) - 1; var ak = 0; while (ai.digits[al] < e) { ai = t(ai, 1); ++ak; ++ah; al = Math.ceil(ah / o) - 1 } an = t(an, ak); a += ak; var ar = Math.ceil(a / o) - 1; var ax = y(ai, ar - al); while (f(an, ax) != -1) {++ao.digits[ar - al]; an = S(an, ax) } for (var av = ar; av > al; --av) { var am = (av >= an.digits.length) ? 0 : an.digits[av]; var aw = (av - 1 >= an.digits.length) ? 0 : an.digits[av - 1]; var au = (av - 2 >= an.digits.length) ? 0 : an.digits[av - 2]; var at = (al >= ai.digits.length) ? 0 : ai.digits[al]; var af = (al - 1 >= ai.digits.length) ? 0 : ai.digits[al - 1]; if (am == at) { ao.digits[av - al - 1] = T } else { ao.digits[av - al - 1] = Math.floor((am * Q + aw) / at) } var aq = ao.digits[av - al - 1] * ((at * Q) + af); var ap = (am * M) + ((aw * Q) + au); while (aq > ap) {--ao.digits[av - al - 1]; aq = ao.digits[av - al - 1] * ((at * Q) | af); ap = (am * Q * Q) + ((aw * Q) + au) } ax = y(ai, av - al - 1); an = S(an, k(ax, ao.digits[av - al - 1])); if (an.isNeg) { an = g(an, ax); --ao.digits[av - al - 1] } } an = l(an, ak); ao.isNeg = aj.isNeg != ag; if (aj.isNeg) { if (ag) { ao = g(ao, c) } else { ao = S(ao, c) } ai = l(ai, ak); an = S(ai, an) } if (an.digits[0] == 0 && V(an) == 0) { an.isNeg = false } return new Array(ao, an)}function Y(a, af) { return w(a, af)[0]}function z(a, af) { return w(a, af)[1]}function s(af, ag, a) { return z(ae(af, ag), a)}function G(ag, ai) { var af = c; var ah = ag; while (true) { if ((ai & 1) != 0) { af = ae(af, ah) } ai >>= 1; if (ai == 0) { break } ah = ae(ah, ah) } return af}function F(ah, ak, ag) { var af = c; var ai = ah; var aj = ak; while (true) { if ((aj.digits[0] & 1) != 0) { af = s(af, ai, ag) } aj = l(aj, 1); if (aj.digits[0] == 0 && V(aj) == 0) { break } ai = s(ai, ai, ag) } return af}var X = { setMaxDigits: u, biCopy: P, biHighIndex: V, BigInt: b, biDivide: Y, biDivideByRadixPower: h, biMultiply: ae, biModuloByRadixPower: N, biSubtract: S, biAdd: g, biCompare: f, biShiftRight: l, biFromHex: W, biToHex: B, biToString: O, biFromString: C};ab.BigTools = ab.BigTools || X})(window); (function(c) {var h = c.BigTools,a = h.BigInt,e = h.biFromHex,f = h.biHighIndex;function d(k) { this.modulus = h.biCopy(k); this.k = f(this.modulus) + 1; var l = new a(); l.digits[2 * this.k] = 1; this.mu = h.biDivide(l, this.modulus); this.bkplus1 = new a(); this.bkplus1.digits[this.k + 1] = 1; this.modulo = function(u) { var t = h.biDivideByRadixPower(u, this.k - 1); var q = h.biMultiply(t, this.mu); var p = h.biDivideByRadixPower(q, this.k + 1); var o = h.biModuloByRadixPower(u, this.k + 1); var v = h.biMultiply(p, this.modulus); var n = h.biModuloByRadixPower(v, this.k + 1); var m = h.biSubtract(o, n); if (m.isNeg) { m = h.biAdd(m, this.bkplus1) } var s = h.biCompare(m, this.modulus) >= 0; while (s) { m = h.biSubtract(m, this.modulus); s = h.biCompare(m, this.modulus) >= 0 } return m }; this.multiplyMod = function(m, o) { var n = h.biMultiply(m, o); return this.modulo(n) }; this.powMod = function(n, q) { var m = new a(); m.digits[0] = 1; var o = n; var p = q; while (true) { if ((p.digits[0] & 1) != 0) { m = this.multiplyMod(m, o) } p = h.biShiftRight(p, 1); if (p.digits[0] == 0 && f(p) == 0) { break } o = this.multiplyMod(o, o) } return m }}function g(l, m, k) { this.e = e(l); this.d = e(m); this.m = e(k); this.chunkSize = 2 * f(this.m); this.radix = 16; this.barrett = new d(this.m)}function b(k) { return (k < 10 ? "0": "") + String(k)}g.encryptedString = function(t, w) { var r = new Array(); var l = w.length; var p = 0; while (p < l) { r[p] = w.charCodeAt(p); p++ } while (r.length % t.chunkSize != 0) { r[p++] = 0 } var q = r.length; var x = ""; var o, n, m; for (p = 0; p < q; p += t.chunkSize) { m = new a(); o = 0; for (n = p; n < p + t.chunkSize; ++o) { m.digits[o] = r[n++]; m.digits[o] += r[n++] << 8 } var v = t.barrett.powMod(m, t.e); var u = t.radix == 16 ? h.biToHex(v) : h.biToString(v, t.radix); x += u + " " } return x.substring(0, x.length - 1)};g.decryptedString = function(o, p) { var r = p.split(" "); var k = ""; var n, m, q; for (n = 0; n < r.length; ++n) { var l; if (o.radix == 16) { l = e(r[n]) } else { l = h.biFromString(r[n], o.radix) } q = o.barrett.powMod(l, o.d); for (m = 0; m <= f(q); ++m) { k += String.fromCharCode(q.digits[m] & 255, q.digits[m] >> 8) } } if (k.charCodeAt(k.length - 1) == 0) { k = k.substring(0, k.length - 1) } return k};c.RSAKeyPair = c.RSAKeyPair || g})(window);BigTools=window.BigTools;//重点RSAKeyPair=window.RSAKeyPair;//重点function getToken(ptoken, b, d) {ptoken = hex_md5(ptoken);BigTools && BigTools.setMaxDigits(130);var c = new RSAKeyPair(b, "", d);ptoken = RSAKeyPair.encryptedString(c, ptoken);return ptoken;}
下面是另一种方法
function encryptString(pwd,b,d){pwd=hex_md5(pwd);var key=RSAUtils.getKeyPair(b,'',d);pwd=RSAUtils.encryptedString(key,pwd);return pwd;}RSAUtils={};var biRadixBase=2;var biRadixBits=16;var bitsPerDigit=biRadixBits;var biRadix=1<<16;var biHalfRadix=biRadix>>>1;var biRadixSquared=biRadix*biRadix;var maxDigitVal=biRadix-1;var maxInteger=9999999999999998;var maxDigits;var ZERO_ARRAY;var bigZero,bigOne;var BigInt=function(flag){if(typeof flag=="boolean"&&flag==true){this.digits=null}else{this.digits=ZERO_ARRAY.slice(0)}this.isNeg=false};RSAUtils.setMaxDigits=function(value){maxDigits=value;ZERO_ARRAY=new Array(maxDigits);for(var iza=0;iza<ZERO_ARRAY.length;iza++)ZERO_ARRAY[iza]=0;bigZero=new BigInt();bigOne=new BigInt();bigOne.digits[0]=1};RSAUtils.setMaxDigits(20);var dpl10=15;RSAUtils.biFromNumber=function(i){var result=new BigInt();result.isNeg=i<0;i=Math.abs(i);var j=0;while(i>0){result.digits[j++]=i&maxDigitVal;i=Math.floor(i/biRadix)}return result};var lr10=RSAUtils.biFromNumber(1000000000000000);RSAUtils.biFromDecimal=function(s){var isNeg=s.charAt(0)=='-';var i=isNeg?1:0;var result;while(i<s.length&&s.charAt(i)=='0')++i;if(i==s.length){result=new BigInt()}else{var digitCount=s.length-i;var fgl=digitCount%dpl10;if(fgl==0)fgl=dpl10;result=RSAUtils.biFromNumber(Number(s.substr(i,fgl)));i+=fgl;while(i<s.length){result=RSAUtils.biAdd(RSAUtils.biMultiply(result,lr10),RSAUtils.biFromNumber(Number(s.substr(i,dpl10))));i+=dpl10}result.isNeg=isNeg}return result};RSAUtils.biCopy=function(bi){var result=new BigInt(true);result.digits=bi.digits.slice(0);result.isNeg=bi.isNeg;return result};RSAUtils.reverseStr=function(s){var result="";for(var i=s.length-1;i>-1;--i){result+=s.charAt(i)}return result};var hexatrigesimalToChar=['0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'];RSAUtils.biToString=function(x,radix){var b=new BigInt();b.digits[0]=radix;var qr=RSAUtils.biDivideModulo(x,b);var result=hexatrigesimalToChar[qr[1].digits[0]];while(RSAUtils.biCompare(qr[0],bigZero)==1){qr=RSAUtils.biDivideModulo(qr[0],b);digit=qr[1].digits[0];result+=hexatrigesimalToChar[qr[1].digits[0]]}return(x.isNeg?"-":"")+RSAUtils.reverseStr(result)};RSAUtils.biToDecimal=function(x){var b=new BigInt();b.digits[0]=10;var qr=RSAUtils.biDivideModulo(x,b);var result=String(qr[1].digits[0]);while(RSAUtils.biCompare(qr[0],bigZero)==1){qr=RSAUtils.biDivideModulo(qr[0],b);result+=String(qr[1].digits[0])}return(x.isNeg?"-":"")+RSAUtils.reverseStr(result)};var hexToChar=['0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f'];RSAUtils.digitToHex=function(n){var mask=0xf;var result="";for(i=0;i<4;++i){result+=hexToChar[n&mask];n>>>=4}return RSAUtils.reverseStr(result)};RSAUtils.biToHex=function(x){var result="";var n=RSAUtils.biHighIndex(x);for(var i=RSAUtils.biHighIndex(x);i>-1;--i){result+=RSAUtils.digitToHex(x.digits[i])}return result};RSAUtils.charToHex=function(c){var ZERO=48;var NINE=ZERO+9;var littleA=97;var littleZ=littleA+25;var bigA=65;var bigZ=65+25;var result;if(c>=ZERO&&c<=NINE){result=c-ZERO}else if(c>=bigA&&c<=bigZ){result=10+c-bigA}else if(c>=littleA&&c<=littleZ){result=10+c-littleA}else{result=0}return result};RSAUtils.hexToDigit=function(s){var result=0;var sl=Math.min(s.length,4);for(var i=0;i<sl;++i){result<<=4;result|=RSAUtils.charToHex(s.charCodeAt(i))}return result};RSAUtils.biFromHex=function(s){var result=new BigInt();var sl=s.length;for(var i=sl,j=0;i>0;i-=4,++j){result.digits[j]=RSAUtils.hexToDigit(s.substr(Math.max(i-4,0),Math.min(i,4)))}return result};RSAUtils.biFromString=function(s,radix){var isNeg=s.charAt(0)=='-';var istop=isNeg?1:0;var result=new BigInt();var place=new BigInt();place.digits[0]=1;for(var i=s.length-1;i>=istop;i--){var c=s.charCodeAt(i);var digit=RSAUtils.charToHex(c);var biDigit=RSAUtils.biMultiplyDigit(place,digit);result=RSAUtils.biAdd(result,biDigit);place=RSAUtils.biMultiplyDigit(place,radix)}result.isNeg=isNeg;return result};RSAUtils.biDump=function(b){return(b.isNeg?"-":"")+b.digits.join(" ")};RSAUtils.biAdd=function(x,y){var result;if(x.isNeg!=y.isNeg){y.isNeg=!y.isNeg;result=RSAUtils.biSubtract(x,y);y.isNeg=!y.isNeg}else{result=new BigInt();var c=0;var n;for(var i=0;i<x.digits.length;++i){n=x.digits[i]+y.digits[i]+c;result.digits[i]=n%biRadix;c=Number(n>=biRadix)}result.isNeg=x.isNeg}return result};RSAUtils.biSubtract=function(x,y){var result;if(x.isNeg!=y.isNeg){y.isNeg=!y.isNeg;result=RSAUtils.biAdd(x,y);y.isNeg=!y.isNeg}else{result=new BigInt();var n,c;c=0;for(var i=0;i<x.digits.length;++i){n=x.digits[i]-y.digits[i]+c;result.digits[i]=n%biRadix;if(result.digits[i]<0)result.digits[i]+=biRadix;c=0-Number(n<0)}if(c==-1){c=0;for(var i=0;i<x.digits.length;++i){n=0-result.digits[i]+c;result.digits[i]=n%biRadix;if(result.digits[i]<0)result.digits[i]+=biRadix;c=0-Number(n<0)}result.isNeg=!x.isNeg}else{result.isNeg=x.isNeg}}return result};RSAUtils.biHighIndex=function(x){var result=x.digits.length-1;while(result>0&&x.digits[result]==0)--result;return result};RSAUtils.biNumBits=function(x){var n=RSAUtils.biHighIndex(x);var d=x.digits[n];var m=(n+1)*bitsPerDigit;var result;for(result=m;result>m-bitsPerDigit;--result){if((d&0x8000)!=0)break;d<<=1}return result};RSAUtils.biMultiply=function(x,y){var result=new BigInt();var c;var n=RSAUtils.biHighIndex(x);var t=RSAUtils.biHighIndex(y);var u,uv,k;for(var i=0;i<=t;++i){c=0;k=i;for(j=0;j<=n;++j,++k){uv=result.digits[k]+x.digits[j]*y.digits[i]+c;result.digits[k]=uv&maxDigitVal;c=uv>>>biRadixBits}result.digits[i+n+1]=c}result.isNeg=x.isNeg!=y.isNeg;return result};RSAUtils.biMultiplyDigit=function(x,y){var n,c,uv;result=new BigInt();n=RSAUtils.biHighIndex(x);c=0;for(var j=0;j<=n;++j){uv=result.digits[j]+x.digits[j]*y+c;result.digits[j]=uv&maxDigitVal;c=uv>>>biRadixBits}result.digits[1+n]=c;return result};RSAUtils.arrayCopy=function(src,srcStart,dest,destStart,n){var m=Math.min(srcStart+n,src.length);for(var i=srcStart,j=destStart;i<m;++i,++j){dest[j]=src[i]}};var highBitMasks=[0x0000,0x8000,0xC000,0xE000,0xF000,0xF800,0xFC00,0xFE00,0xFF00,0xFF80,0xFFC0,0xFFE0,0xFFF0,0xFFF8,0xFFFC,0xFFFE,0xFFFF];RSAUtils.biShiftLeft=function(x,n){var digitCount=Math.floor(n/bitsPerDigit);var result=new BigInt();RSAUtils.arrayCopy(x.digits,0,result.digits,digitCount,result.digits.length-digitCount);var bits=n%bitsPerDigit;var rightBits=bitsPerDigit-bits;for(var i=result.digits.length-1,i1=i-1;i>0;--i,--i1){result.digits[i]=((result.digits[i]<<bits)&maxDigitVal)|((result.digits[i1]&highBitMasks[bits])>>>(rightBits))}result.digits[0]=((result.digits[i]<<bits)&maxDigitVal);result.isNeg=x.isNeg;return result};var lowBitMasks=[0x0000,0x0001,0x0003,0x0007,0x000F,0x001F,0x003F,0x007F,0x00FF,0x01FF,0x03FF,0x07FF,0x0FFF,0x1FFF,0x3FFF,0x7FFF,0xFFFF];RSAUtils.biShiftRight=function(x,n){var digitCount=Math.floor(n/bitsPerDigit);var result=new BigInt();RSAUtils.arrayCopy(x.digits,digitCount,result.digits,0,x.digits.length-digitCount);var bits=n%bitsPerDigit;var leftBits=bitsPerDigit-bits;for(var i=0,i1=i+1;i<result.digits.length-1;++i,++i1){result.digits[i]=(result.digits[i]>>>bits)|((result.digits[i1]&lowBitMasks[bits])<<leftBits)}result.digits[result.digits.length-1]>>>=bits;result.isNeg=x.isNeg;return result};RSAUtils.biMultiplyByRadixPower=function(x,n){var result=new BigInt();RSAUtils.arrayCopy(x.digits,0,result.digits,n,result.digits.length-n);return result};RSAUtils.biDivideByRadixPower=function(x,n){var result=new BigInt();RSAUtils.arrayCopy(x.digits,n,result.digits,0,result.digits.length-n);return result};RSAUtils.biModuloByRadixPower=function(x,n){var result=new BigInt();RSAUtils.arrayCopy(x.digits,0,result.digits,0,n);return result};RSAUtils.biCompare=function(x,y){if(x.isNeg!=y.isNeg){return 1-2*Number(x.isNeg)}for(var i=x.digits.length-1;i>=0;--i){if(x.digits[i]!=y.digits[i]){if(x.isNeg){return 1-2*Number(x.digits[i]>y.digits[i])}else{return 1-2*Number(x.digits[i]<y.digits[i])}}}return 0};RSAUtils.biDivideModulo=function(x,y){var nb=RSAUtils.biNumBits(x);var tb=RSAUtils.biNumBits(y);var origYIsNeg=y.isNeg;var q,r;if(nb<tb){if(x.isNeg){q=RSAUtils.biCopy(bigOne);q.isNeg=!y.isNeg;x.isNeg=false;y.isNeg=false;r=biSubtract(y,x);x.isNeg=true;y.isNeg=origYIsNeg}else{q=new BigInt();r=RSAUtils.biCopy(x)}return[q,r]}q=new BigInt();r=x;var t=Math.ceil(tb/bitsPerDigit)-1;var lambda=0;while(y.digits[t]<biHalfRadix){y=RSAUtils.biShiftLeft(y,1);++lambda;++tb;t=Math.ceil(tb/bitsPerDigit)-1}r=RSAUtils.biShiftLeft(r,lambda);nb+=lambda;var n=Math.ceil(nb/bitsPerDigit)-1;var b=RSAUtils.biMultiplyByRadixPower(y,n-t);while(RSAUtils.biCompare(r,b)!=-1){++q.digits[n-t];r=RSAUtils.biSubtract(r,b)}for(var i=n;i>t;--i){var ri=(i>=r.digits.length)?0:r.digits[i];var ri1=(i-1>=r.digits.length)?0:r.digits[i-1];var ri2=(i-2>=r.digits.length)?0:r.digits[i-2];var yt=(t>=y.digits.length)?0:y.digits[t];var yt1=(t-1>=y.digits.length)?0:y.digits[t-1];if(ri==yt){q.digits[i-t-1]=maxDigitVal}else{q.digits[i-t-1]=Math.floor((ri*biRadix+ri1)/yt)}var c1=q.digits[i-t-1]*((yt*biRadix)+yt1);var c2=(ri*biRadixSquared)+((ri1*biRadix)+ri2);while(c1>c2){--q.digits[i-t-1];c1=q.digits[i-t-1]*((yt*biRadix)|yt1);c2=(ri*biRadix*biRadix)+((ri1*biRadix)+ri2)}b=RSAUtils.biMultiplyByRadixPower(y,i-t-1);r=RSAUtils.biSubtract(r,RSAUtils.biMultiplyDigit(b,q.digits[i-t-1]));if(r.isNeg){r=RSAUtils.biAdd(r,b);--q.digits[i-t-1]}}r=RSAUtils.biShiftRight(r,lambda);q.isNeg=x.isNeg!=origYIsNeg;if(x.isNeg){if(origYIsNeg){q=RSAUtils.biAdd(q,bigOne)}else{q=RSAUtils.biSubtract(q,bigOne)}y=RSAUtils.biShiftRight(y,lambda);r=RSAUtils.biSubtract(y,r)}if(r.digits[0]==0&&RSAUtils.biHighIndex(r)==0)r.isNeg=false;return[q,r]};RSAUtils.biDivide=function(x,y){return RSAUtils.biDivideModulo(x,y)[0]};RSAUtils.biModulo=function(x,y){return RSAUtils.biDivideModulo(x,y)[1]};RSAUtils.biMultiplyMod=function(x,y,m){return RSAUtils.biModulo(RSAUtils.biMultiply(x,y),m)};RSAUtils.biPow=function(x,y){var result=bigOne;var a=x;while(true){if((y&1)!=0)result=RSAUtils.biMultiply(result,a);y>>=1;if(y==0)break;a=RSAUtils.biMultiply(a,a)}return result};RSAUtils.biPowMod=function(x,y,m){var result=bigOne;var a=x;var k=y;while(true){if((k.digits[0]&1)!=0)result=RSAUtils.biMultiplyMod(result,a,m);k=RSAUtils.biShiftRight(k,1);if(k.digits[0]==0&&RSAUtils.biHighIndex(k)==0)break;a=RSAUtils.biMultiplyMod(a,a,m)}return result};BarrettMu=function(m){this.modulus=RSAUtils.biCopy(m);this.k=RSAUtils.biHighIndex(this.modulus)+1;var b2k=new BigInt();b2k.digits[2*this.k]=1;this.mu=RSAUtils.biDivide(b2k,this.modulus);this.bkplus1=new BigInt();this.bkplus1.digits[this.k+1]=1;this.modulo=BarrettMu_modulo;this.multiplyMod=BarrettMu_multiplyMod;this.powMod=BarrettMu_powMod};function BarrettMu_modulo(x){var $dmath=RSAUtils;var q1=$dmath.biDivideByRadixPower(x,this.k-1);var q2=$dmath.biMultiply(q1,this.mu);var q3=$dmath.biDivideByRadixPower(q2,this.k+1);var r1=$dmath.biModuloByRadixPower(x,this.k+1);var r2term=$dmath.biMultiply(q3,this.modulus);var r2=$dmath.biModuloByRadixPower(r2term,this.k+1);var r=$dmath.biSubtract(r1,r2);if(r.isNeg){r=$dmath.biAdd(r,this.bkplus1)}var rgtem=$dmath.biCompare(r,this.modulus)>=0;while(rgtem){r=$dmath.biSubtract(r,this.modulus);rgtem=$dmath.biCompare(r,this.modulus)>=0}return r}function BarrettMu_multiplyMod(x,y){var xy=RSAUtils.biMultiply(x,y);return this.modulo(xy)}function BarrettMu_powMod(x,y){var result=new BigInt();result.digits[0]=1;var a=x;var k=y;while(true){if((k.digits[0]&1)!=0)result=this.multiplyMod(result,a);k=RSAUtils.biShiftRight(k,1);if(k.digits[0]==0&&RSAUtils.biHighIndex(k)==0)break;a=this.multiplyMod(a,a)}return result}var RSAKeyPair=function(encryptionExponent,decryptionExponent,modulus){var $dmath=RSAUtils;this.e=$dmath.biFromHex(encryptionExponent);this.d=$dmath.biFromHex(decryptionExponent);this.m=$dmath.biFromHex(modulus);this.chunkSize=2*$dmath.biHighIndex(this.m);this.radix=16;this.barrett=new BarrettMu(this.m)};RSAUtils.getKeyPair=function(encryptionExponent,decryptionExponent,modulus){return new RSAKeyPair(encryptionExponent,decryptionExponent,modulus)};if(typeof twoDigit==='undefined'){twoDigit=function(n){return(n<10?"0":"")+String(n)}}RSAUtils.encryptedString=function(key,s){var a=[];var sl=s.length;var i=0;while(i<sl){a[i]=s.charCodeAt(i);i++}while(a.length%key.chunkSize!=0){a[i++]=0}var al=a.length;var result="";var j,k,block;for(i=0;i<al;i+=key.chunkSize){block=new BigInt();j=0;for(k=i;k<i+key.chunkSize;++j){block.digits[j]=a[k++];block.digits[j]+=a[k++]<<8}var crypt=key.barrett.powMod(block,key.e);var text=key.radix==16?RSAUtils.biToHex(crypt):RSAUtils.biToString(crypt,key.radix);result+=text+" "}return result.substring(0,result.length-1)};RSAUtils.decryptedString=function(key,s){var blocks=s.split(" ");var result="";var i,j,block;for(i=0;i<blocks.length;++i){var bi;if(key.radix==16){bi=RSAUtils.biFromHex(blocks[i])}else{bi=RSAUtils.biFromString(blocks[i],key.radix)}block=key.barrett.powMod(bi,key.d);for(j=0;j<=RSAUtils.biHighIndex(block);++j){result+=String.fromCharCode(block.digits[j]&255,block.digits[j]>>8)}}if(result.charCodeAt(result.length-1)==0){result=result.substring(0,result.length-1)}return result};RSAUtils.setMaxDigits(130);var hexcase=0;var b64pad="";var chrsz=8;function hex_md5(a){return binl2hex(core_md5(str2binl(a),a.length*chrsz));}function b64_md5(a){return binl2b64(core_md5(str2binl(a),a.length*chrsz));}function hex_hmac_md5(a,c){return binl2hex(core_hmac_md5(a,c));}function b64_hmac_md5(a,c){return binl2b64(core_hmac_md5(a,c));}function calcMD5(a){return binl2hex(core_md5(str2binl(a),a.length*chrsz));}function hex_md5_16(c){var a=hex_md5(c);a=a.substring(8,24);return reverse(a);}function core_md5(r,k){r[k>>5]|=128<<((k)%32);r[(((k+64)>>>9)<<4)+14]=k;var q=1732584193;var p=-271733879;var m=-1732584194;var l=271733878;for(var g=0;g<r.length;g+=16){var j=q;var h=p;var f=m;var e=l;q=md5_ff(q,p,m,l,r[g+0],7,-680876936);l=md5_ff(l,q,p,m,r[g+1],12,-389564586);m=md5_ff(m,l,q,p,r[g+2],17,606105819);p=md5_ff(p,m,l,q,r[g+3],22,-1044525330);q=md5_ff(q,p,m,l,r[g+4],7,-176418897);l=md5_ff(l,q,p,m,r[g+5],12,1200080426);m=md5_ff(m,l,q,p,r[g+6],17,-1473231341);p=md5_ff(p,m,l,q,r[g+7],22,-45705983);q=md5_ff(q,p,m,l,r[g+8],7,1770035416);l=md5_ff(l,q,p,m,r[g+9],12,-1958414417);m=md5_ff(m,l,q,p,r[g+10],17,-42063);p=md5_ff(p,m,l,q,r[g+11],22,-1990404162);q=md5_ff(q,p,m,l,r[g+12],7,1804603682);l=md5_ff(l,q,p,m,r[g+13],12,-40341101);m=md5_ff(m,l,q,p,r[g+14],17,-1502002290);p=md5_ff(p,m,l,q,r[g+15],22,1236535329);q=md5_gg(q,p,m,l,r[g+1],5,-165796510);l=md5_gg(l,q,p,m,r[g+6],9,-1069501632);m=md5_gg(m,l,q,p,r[g+11],14,643717713);p=md5_gg(p,m,l,q,r[g+0],20,-373897302);q=md5_gg(q,p,m,l,r[g+5],5,-701558691);l=md5_gg(l,q,p,m,r[g+10],9,38016083);m=md5_gg(m,l,q,p,r[g+15],14,-660478335);p=md5_gg(p,m,l,q,r[g+4],20,-405537848);q=md5_gg(q,p,m,l,r[g+9],5,568446438);l=md5_gg(l,q,p,m,r[g+14],9,-1019803690);m=md5_gg(m,l,q,p,r[g+3],14,-187363961);p=md5_gg(p,m,l,q,r[g+8],20,1163531501);q=md5_gg(q,p,m,l,r[g+13],5,-1444681467);l=md5_gg(l,q,p,m,r[g+2],9,-51403784);m=md5_gg(m,l,q,p,r[g+7],14,1735328473);p=md5_gg(p,m,l,q,r[g+12],20,-1926607734);q=md5_hh(q,p,m,l,r[g+5],4,-378558);l=md5_hh(l,q,p,m,r[g+8],11,-2022574463);m=md5_hh(m,l,q,p,r[g+11],16,1839030562);p=md5_hh(p,m,l,q,r[g+14],23,-35309556);q=md5_hh(q,p,m,l,r[g+1],4,-1530992060);l=md5_hh(l,q,p,m,r[g+4],11,1272893353);m=md5_hh(m,l,q,p,r[g+7],16,-155497632);p=md5_hh(p,m,l,q,r[g+10],23,-1094730640);q=md5_hh(q,p,m,l,r[g+13],4,681279174);l=md5_hh(l,q,p,m,r[g+0],11,-358537222);m=md5_hh(m,l,q,p,r[g+3],16,-722521979);p=md5_hh(p,m,l,q,r[g+6],23,76029189);q=md5_hh(q,p,m,l,r[g+9],4,-640364487);l=md5_hh(l,q,p,m,r[g+12],11,-421815835);m=md5_hh(m,l,q,p,r[g+15],16,530742520);p=md5_hh(p,m,l,q,r[g+2],23,-995338651);q=md5_ii(q,p,m,l,r[g+0],6,-198630844);l=md5_ii(l,q,p,m,r[g+7],10,1126891415);m=md5_ii(m,l,q,p,r[g+14],15,-1416354905);p=md5_ii(p,m,l,q,r[g+5],21,-57434055);q=md5_ii(q,p,m,l,r[g+12],6,1700485571);l=md5_ii(l,q,p,m,r[g+3],10,-1894986606);m=md5_ii(m,l,q,p,r[g+10],15,-1051523);p=md5_ii(p,m,l,q,r[g+1],21,-2054922799);q=md5_ii(q,p,m,l,r[g+8],6,1873313359);l=md5_ii(l,q,p,m,r[g+15],10,-30611744);m=md5_ii(m,l,q,p,r[g+6],15,-1560198380);p=md5_ii(p,m,l,q,r[g+13],21,1309151649);q=md5_ii(q,p,m,l,r[g+4],6,-145523070);l=md5_ii(l,q,p,m,r[g+11],10,-1120210379);m=md5_ii(m,l,q,p,r[g+2],15,718787259);p=md5_ii(p,m,l,q,r[g+9],21,-343485551);q=safe_add(q,j);p=safe_add(p,h);m=safe_add(m,f);l=safe_add(l,e);}return Array(q,p,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,l,k,e,j,h){return md5_cmn((f&l)|((~f)&k),g,f,e,j,h);}function md5_gg(g,f,l,k,e,j,h){return md5_cmn((f&k)|(l&(~k)),g,f,e,j,h);}function md5_hh(g,f,l,k,e,j,h){return md5_cmn(f^l^k,g,f,e,j,h);}function md5_ii(g,f,l,k,e,j,h){return md5_cmn(l^(f|(~k)),g,f,e,j,h);}function core_hmac_md5(d,g){var f=str2binl(d);if(f.length>16){f=core_md5(f,d.length*chrsz);}var a=Array(16),e=Array(16);for(var c=0;c<16;c++){a[c]=f[c]^909522486;e[c]=f[c]^1549556828;}var h=core_md5(a.concat(str2binl(g)),512+g.length*chrsz);return core_md5(e.concat(h),512+128);}function safe_add(a,e){var d=(a&65535)+(e&65535);var c=(a>>16)+(e>>16)+(d>>16);return(c<<16)|(d&65535);}function bit_rol(a,c){return(a<<c)|(a>>>(32-c));}function str2binl(e){var d=Array();var a=(1<<chrsz)-1;for(var c=0;c<e.length*chrsz;c+=chrsz){d[c>>5]|=(e.charCodeAt(c/chrsz)&a)<<(c%32);}return d;}function binl2hex(d){var c=hexcase?"0123456789ABCDEF":"0123456789abcdef";var e="";for(var a=0;a<d.length*4;a++){e+=c.charAt((d[a>>2]>>((a%4)*8+4))&15)+c.charAt((d[a>>2]>>((a%4)*8))&15);}return e;}function binl2b64(e){var d="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";var g="";for(var c=0;c<e.length*4;c+=3){var f=(((e[c>>2]>>8*(c%4))&255)<<16)|(((e[c+1>>2]>>8*((c+1)%4))&255)<<8)|((e[c+2>>2]>>8*((c+2)%4))&255);for(var a=0;a<4;a++){if(c*8+a*6>e.length*32){g+=b64pad;}else{g+=d.charAt((f>>6*(3-a))&63);}}}return g;}function reverse(d){var a="";for(var c=d.length-1;c>=0;c--){a+=d.charAt(c);}return a;}function getm32str(c,a){return hex_md5(hex_md5(c)+a.substring(5,11));}function getm16str(c,a){if(a.length!=13){return"";}return hex_md5(hex_md5_16(c)+a.substring(5,11));}
0 0
- 昆仑游戏[JS加密修改]
- 修改游戏传输加密函数的步骤
- js 参数加密 修改jquery源码
- 【术】游戏内存修改器原理及游戏敏感数值加密建议
- js加密
- js加密
- js加密
- js加密
- js 加密
- js加密
- JS加密
- js加密
- 游戏修改
- 游戏服务器之加密
- cocos2dx游戏加密
- js游戏
- JS游戏
- Sqlite3 加密完善修改
- eclipse环境搭建
- .Net4.0以上使用System.Data.Sqlite
- MSSQLSERVER
- c#smtp多线程
- vs2013中2.0类库提示是英文,解决方案
- 昆仑游戏[JS加密修改]
- 供销大集-JS修改
- C#记录程序运行时间记录显示
- HttpHelper
- PPS传奇生死
- StringHelper
- EncodingHelper
- Stream与byte[]与Image与string
- 红豆电信JS
