|
|
发表于 2025-1-8 10:04:23
|
显示全部楼层
辽宁省葫芦岛市
var navigator={}
var window=this;
var lwd;
!function(t) {
"use strict";
function e(t) {
return "0123456789abcdefghijklmnopqrstuvwxyz".charAt(t)
}
function n(t, e) {
return t & e
}
function r(t, e) {
return t | e
}
function o(t, e) {
return t ^ e
}
function i(t, e) {
return t & ~e
}
function a(t) {
if (0 == t)
return -1;
var e = 0;
return 0 == (65535 & t) && (t >>= 16,
e += 16),
0 == (255 & t) && (t >>= 8,
e += 8),
0 == (15 & t) && (t >>= 4,
e += 4),
0 == (3 & t) && (t >>= 2,
e += 2),
0 == (1 & t) && ++e,
e
}
function u(t) {
for (var e = 0; 0 != t; )
t &= t - 1,
++e;
return e
}
var c = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
function s(t) {
var e, n, r = "";
for (e = 0; e + 3 <= t.length; e += 3)
n = parseInt(t.substring(e, e + 3), 16),
r += c.charAt(n >> 6) + c.charAt(63 & n);
for (e + 1 == t.length ? (n = parseInt(t.substring(e, e + 1), 16),
r += c.charAt(n << 2)) : e + 2 == t.length && (n = parseInt(t.substring(e, e + 2), 16),
r += c.charAt(n >> 2) + c.charAt((3 & n) << 4)); (3 & r.length) > 0; )
r += "=";
return r
}
function l(t) {
var n, r = "", o = 0, i = 0;
for (n = 0; n < t.length && "=" != t.charAt(n); ++n) {
var a = c.indexOf(t.charAt(n));
a < 0 || (0 == o ? (r += e(a >> 2),
i = 3 & a,
o = 1) : 1 == o ? (r += e(i << 2 | a >> 4),
i = 15 & a,
o = 2) : 2 == o ? (r += e(i),
r += e(a >> 2),
i = 3 & a,
o = 3) : (r += e(i << 2 | a >> 4),
r += e(15 & a),
o = 0))
}
return 1 == o && (r += e(i << 2)),
r
}
/*! *****************************************************************************
Copyright (c) Microsoft Corporation. All rights reserved.
Licensed under the Apache License, Version 2.0 (the "License"); you may not use
this file except in compliance with the License. You may obtain a copy of the
License at http://www.apache.org/licenses/LICENSE-2.0
THIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED
WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,
MERCHANTABLITY OR NON-INFRINGEMENT.
See the Apache Version 2.0 License for specific language governing permissions
and limitations under the License.
***************************************************************************** */
var f, p, h = function(t, e) {
return (h = Object.setPrototypeOf || {
__proto__: []
}instanceof Array && function(t, e) {
t.__proto__ = e
}
|| function(t, e) {
for (var n in e)
e.hasOwnProperty(n) && (t[n] = e[n])
}
)(t, e)
}, d = function(t) {
var e;
if (void 0 === f) {
var n = "0123456789ABCDEF";
for (f = {},
e = 0; e < 16; ++e)
f[n.charAt(e)] = e;
for (n = n.toLowerCase(),
e = 10; e < 16; ++e)
f[n.charAt(e)] = e;
for (e = 0; e < " \f\n\r\t \u2028\u2029".length; ++e)
f[" \f\n\r\t \u2028\u2029".charAt(e)] = -1
}
var r = []
, o = 0
, i = 0;
for (e = 0; e < t.length; ++e) {
var a = t.charAt(e);
if ("=" == a)
break;
if (-1 != (a = f[a])) {
if (void 0 === a)
throw new Error("Illegal character at offset " + e);
o |= a,
++i >= 2 ? (r[r.length] = o,
o = 0,
i = 0) : o <<= 4
}
}
if (i)
throw new Error("Hex encoding incomplete: 4 bits missing");
return r
}, v = {
decode: function(t) {
var e;
if (void 0 === p) {
for (p = Object.create(null),
e = 0; e < 64; ++e)
p["ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".charAt(e)] = e;
for (e = 0; e < "= \f\n\r\t \u2028\u2029".length; ++e)
p["= \f\n\r\t \u2028\u2029".charAt(e)] = -1
}
var n = []
, r = 0
, o = 0;
for (e = 0; e < t.length; ++e) {
var i = t.charAt(e);
if ("=" == i)
break;
if (-1 != (i = p)) {
if (void 0 === i)
throw new Error("Illegal character at offset " + e);
r |= i,
++o >= 4 ? (n[n.length] = r >> 16,
n[n.length] = r >> 8 & 255,
n[n.length] = 255 & r,
r = 0,
o = 0) : r <<= 6
}
}
switch (o) {
case 1:
throw new Error("Base64 encoding incomplete: at least 2 bits missing");
case 2:
n[n.length] = r >> 10;
break;
case 3:
n[n.length] = r >> 16,
n[n.length] = r >> 8 & 255
}
return n
},
re: /-----BEGIN [^-]+-----([A-Za-z0-9+\/=\s]+)-----END [^-]+-----|begin-base64[^\n]+\n([A-Za-z0-9+\/=\s]+)====/,
unarmor: function(t) {
var e = v.re.exec(t);
if (e)
if (e[1])
t = e[1];
else {
if (!e[2])
throw new Error("RegExp out of sync");
t = e[2]
}
return v.decode(t)
}
}, g = 1e13, y = function() {
function t(t) {
this.buf = [+t || 0]
}
return t.prototype.mulAdd = function(t, e) {
var n, r, o = this.buf, i = o.length;
for (n = 0; n < i; ++n)
(r = o[n] * t + e) < g ? e = 0 : r -= (e = 0 | r / g) * g,
o[n] = r;
e > 0 && (o[n] = e)
}
,
t.prototype.sub = function(t) {
var e, n, r = this.buf, o = r.length;
for (e = 0; e < o; ++e)
(n = r[e] - t) < 0 ? (n += g,
t = 1) : t = 0,
r[e] = n;
for (; 0 === r[r.length - 1]; )
r.pop()
}
,
t.prototype.toString = function(t) {
if (10 != (t || 10))
throw new Error("only base 10 is supported");
for (var e = this.buf, n = e[e.length - 1].toString(), r = e.length - 2; r >= 0; --r)
n += (g + e[r]).toString().substring(1);
return n
}
,
t.prototype.valueOf = function() {
for (var t = this.buf, e = 0, n = t.length - 1; n >= 0; --n)
e = e * g + t[n];
return e
}
,
t.prototype.simplify = function() {
var t = this.buf;
return 1 == t.length ? t[0] : this
}
,
t
}(), m = /^(\d\d)(0[1-9]|1[0-2])(0[1-9]|[12]\d|3[01])([01]\d|2[0-3])(?:([0-5]\d)(?:([0-5]\d)(?:[.,](\d{1,3}))?)?)?(Z|[-+](?:[0]\d|1[0-2])([0-5]\d)?)?$/, b = /^(\d\d\d\d)(0[1-9]|1[0-2])(0[1-9]|[12]\d|3[01])([01]\d|2[0-3])(?:([0-5]\d)(?:([0-5]\d)(?:[.,](\d{1,3}))?)?)?(Z|[-+](?:[0]\d|1[0-2])([0-5]\d)?)?$/;
function w(t, e) {
return t.length > e && (t = t.substring(0, e) + "…"),
t
}
var _, x = function() {
function t(e, n) {
this.hexDigits = "0123456789ABCDEF",
e instanceof t ? (this.enc = e.enc,
this.pos = e.pos) : (this.enc = e,
this.pos = n)
}
return t.prototype.get = function(t) {
if (void 0 === t && (t = this.pos++),
t >= this.enc.length)
throw new Error("Requesting byte offset " + t + " on a stream of length " + this.enc.length);
return "string" == typeof this.enc ? this.enc.charCodeAt(t) : this.enc[t]
}
,
t.prototype.hexByte = function(t) {
return this.hexDigits.charAt(t >> 4 & 15) + this.hexDigits.charAt(15 & t)
}
,
t.prototype.hexDump = function(t, e, n) {
for (var r = "", o = t; o < e; ++o)
if (r += this.hexByte(this.get(o)),
!0 !== n)
switch (15 & o) {
case 7:
r += " ";
break;
case 15:
r += "\n";
break;
default:
r += " "
}
return r
}
,
t.prototype.isASCII = function(t, e) {
for (var n = t; n < e; ++n) {
var r = this.get(n);
if (r < 32 || r > 176)
return !1
}
return !0
}
,
t.prototype.parseStringISO = function(t, e) {
for (var n = "", r = t; r < e; ++r)
n += String.fromCharCode(this.get(r));
return n
}
,
t.prototype.parseStringUTF = function(t, e) {
for (var n = "", r = t; r < e; ) {
var o = this.get(r++);
n += o < 128 ? String.fromCharCode(o) : o > 191 && o < 224 ? String.fromCharCode((31 & o) << 6 | 63 & this.get(r++)) : String.fromCharCode((15 & o) << 12 | (63 & this.get(r++)) << 6 | 63 & this.get(r++))
}
return n
}
,
t.prototype.parseStringBMP = function(t, e) {
for (var n, r, o = "", i = t; i < e; )
n = this.get(i++),
r = this.get(i++),
o += String.fromCharCode(n << 8 | r);
return o
}
,
t.prototype.parseTime = function(t, e, n) {
var r = this.parseStringISO(t, e)
, o = (n ? m : b).exec(r);
return o ? (n && (o[1] = +o[1],
o[1] += +o[1] < 70 ? 2e3 : 1900),
r = o[1] + "-" + o[2] + "-" + o[3] + " " + o[4],
o[5] && (r += ":" + o[5],
o[6] && (r += ":" + o[6],
o[7] && (r += "." + o[7]))),
o[8] && (r += " UTC",
"Z" != o[8] && (r += o[8],
o[9] && (r += ":" + o[9]))),
r) : "Unrecognized time: " + r
}
,
t.prototype.parseInteger = function(t, e) {
for (var n, r = this.get(t), o = r > 127, i = o ? 255 : 0, a = ""; r == i && ++t < e; )
r = this.get(t);
if (0 == (n = e - t))
return o ? -1 : 0;
if (n > 4) {
for (a = r,
n <<= 3; 0 == (128 & (+a ^ i)); )
a = +a << 1,
--n;
a = "(" + n + " bit)\n"
}
o && (r -= 256);
for (var u = new y(r), c = t + 1; c < e; ++c)
u.mulAdd(256, this.get(c));
return a + u.toString()
}
,
t.prototype.parseBitString = function(t, e, n) {
for (var r = this.get(t), o = "(" + ((e - t - 1 << 3) - r) + " bit)\n", i = "", a = t + 1; a < e; ++a) {
for (var u = this.get(a), c = a == e - 1 ? r : 0, s = 7; s >= c; --s)
i += u >> s & 1 ? "1" : "0";
if (i.length > n)
return o + w(i, n)
}
return o + i
}
,
t.prototype.parseOctetString = function(t, e, n) {
if (this.isASCII(t, e))
return w(this.parseStringISO(t, e), n);
var r = e - t
, o = "(" + r + " byte)\n";
r > (n /= 2) && (e = t + n);
for (var i = t; i < e; ++i)
o += this.hexByte(this.get(i));
return r > n && (o += "…"),
o
}
,
t.prototype.parseOID = function(t, e, n) {
for (var r = "", o = new y, i = 0, a = t; a < e; ++a) {
var u = this.get(a);
if (o.mulAdd(128, 127 & u),
i += 7,
!(128 & u)) {
if ("" === r)
if ((o = o.simplify())instanceof y)
o.sub(80),
r = "2." + o.toString();
else {
var c = o < 80 ? o < 40 ? 0 : 1 : 2;
r = c + "." + (o - 40 * c)
}
else
r += "." + o.toString();
if (r.length > n)
return w(r, n);
o = new y,
i = 0
}
}
return i > 0 && (r += ".incomplete"),
r
}
,
t
}(), S = function() {
function t(t, e, n, r, o) {
if (!(r instanceof E))
throw new Error("Invalid tag value.");
this.stream = t,
this.header = e,
this.length = n,
this.tag = r,
this.sub = o
}
return t.prototype.typeName = function() {
switch (this.tag.tagClass) {
case 0:
switch (this.tag.tagNumber) {
case 0:
return "EOC";
case 1:
return "BOOLEAN";
case 2:
return "INTEGER";
case 3:
return "BIT_STRING";
case 4:
return "OCTET_STRING";
case 5:
return "NULL";
case 6:
return "OBJECT_IDENTIFIER";
case 7:
return "ObjectDescriptor";
case 8:
return "EXTERNAL";
case 9:
return "REAL";
case 10:
return "ENUMERATED";
case 11:
return "EMBEDDED_PDV";
case 12:
return "UTF8String";
case 16:
return "SEQUENCE";
case 17:
return "SET";
case 18:
return "NumericString";
case 19:
return "PrintableString";
case 20:
return "TeletexString";
case 21:
return "VideotexString";
case 22:
return "IA5String";
case 23:
return "UTCTime";
case 24:
return "GeneralizedTime";
case 25:
return "GraphicString";
case 26:
return "VisibleString";
case 27:
return "GeneralString";
case 28:
return "UniversalString";
case 30:
return "BMPString"
}
return "Universal_" + this.tag.tagNumber.toString();
case 1:
return "Application_" + this.tag.tagNumber.toString();
case 2:
return "[" + this.tag.tagNumber.toString() + "]";
case 3:
return "Private_" + this.tag.tagNumber.toString()
}
}
,
t.prototype.content = function(t) {
if (void 0 === this.tag)
return null;
void 0 === t && (t = 1 / 0);
var e = this.posContent()
, n = Math.abs(this.length);
if (!this.tag.isUniversal())
return null !== this.sub ? "(" + this.sub.length + " elem)" : this.stream.parseOctetString(e, e + n, t);
switch (this.tag.tagNumber) {
case 1:
return 0 === this.stream.get(e) ? "false" : "true";
case 2:
return this.stream.parseInteger(e, e + n);
case 3:
return this.sub ? "(" + this.sub.length + " elem)" : this.stream.parseBitString(e, e + n, t);
case 4:
return this.sub ? "(" + this.sub.length + " elem)" : this.stream.parseOctetString(e, e + n, t);
case 6:
return this.stream.parseOID(e, e + n, t);
case 16:
case 17:
return null !== this.sub ? "(" + this.sub.length + " elem)" : "(no elem)";
case 12:
return w(this.stream.parseStringUTF(e, e + n), t);
case 18:
case 19:
case 20:
case 21:
case 22:
case 26:
return w(this.stream.parseStringISO(e, e + n), t);
case 30:
return w(this.stream.parseStringBMP(e, e + n), t);
case 23:
case 24:
return this.stream.parseTime(e, e + n, 23 == this.tag.tagNumber)
}
return null
}
,
t.prototype.toString = function() {
return this.typeName() + "@" + this.stream.pos + "[header:" + this.header + ",length:" + this.length + ",sub:" + (null === this.sub ? "null" : this.sub.length) + "]"
}
,
t.prototype.toPrettyString = function(t) {
void 0 === t && (t = "");
var e = t + this.typeName() + " @" + this.stream.pos;
if (this.length >= 0 && (e += "+"),
e += this.length,
this.tag.tagConstructed ? e += " (constructed)" : !this.tag.isUniversal() || 3 != this.tag.tagNumber && 4 != this.tag.tagNumber || null === this.sub || (e += " (encapsulates)"),
e += "\n",
null !== this.sub) {
t += " ";
for (var n = 0, r = this.sub.length; n < r; ++n)
e += this.sub[n].toPrettyString(t)
}
return e
}
,
t.prototype.posStart = function() {
return this.stream.pos
}
,
t.prototype.posContent = function() {
return this.stream.pos + this.header
}
,
t.prototype.posEnd = function() {
return this.stream.pos + this.header + Math.abs(this.length)
}
,
t.prototype.toHexString = function() {
return this.stream.hexDump(this.posStart(), this.posEnd(), !0)
}
,
t.decodeLength = function(t) {
var e = t.get()
, n = 127 & e;
if (n == e)
return n;
if (n > 6)
throw new Error("Length over 48 bits not supported at position " + (t.pos - 1));
if (0 === n)
return null;
e = 0;
for (var r = 0; r < n; ++r)
e = 256 * e + t.get();
return e
}
,
t.prototype.getHexStringValue = function() {
var t = this.toHexString()
, e = 2 * this.header
, n = 2 * this.length;
return t.substr(e, n)
}
,
t.decode = function(e) {
var n;
n = e instanceof x ? e : new x(e,0);
var r = new x(n)
, o = new E(n)
, i = t.decodeLength(n)
, a = n.pos
, u = a - r.pos
, c = null
, s = function() {
var e = [];
if (null !== i) {
for (var r = a + i; n.pos < r; )
e[e.length] = t.decode(n);
if (n.pos != r)
throw new Error("Content size is not correct for container starting at offset " + a)
} else
try {
for (; ; ) {
var o = t.decode(n);
if (o.tag.isEOC())
break;
e[e.length] = o
}
i = a - n.pos
} catch (t) {
throw new Error("Exception while decoding undefined length content: " + t)
}
return e
};
if (o.tagConstructed)
c = s();
else if (o.isUniversal() && (3 == o.tagNumber || 4 == o.tagNumber))
try {
if (3 == o.tagNumber && 0 != n.get())
throw new Error("BIT STRINGs with unused bits cannot encapsulate.");
c = s();
for (var l = 0; l < c.length; ++l)
if (c[l].tag.isEOC())
throw new Error("EOC is not supposed to be actual content.")
} catch (t) {
c = null
}
if (null === c) {
if (null === i)
throw new Error("We can't skip over an invalid tag with undefined length at offset " + a);
n.pos = a + Math.abs(i)
}
return new t(r,u,i,o,c)
}
,
t
}(), E = function() {
function t(t) {
var e = t.get();
if (this.tagClass = e >> 6,
this.tagConstructed = 0 != (32 & e),
this.tagNumber = 31 & e,
31 == this.tagNumber) {
var n = new y;
do {
e = t.get(),
n.mulAdd(128, 127 & e)
} while (128 & e);
this.tagNumber = n.simplify()
}
}
return t.prototype.isUniversal = function() {
return 0 === this.tagClass
}
,
t.prototype.isEOC = function() {
return 0 === this.tagClass && 0 === this.tagNumber
}
,
t
}(), O = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997], j = (1 << 26) / O[O.length - 1], T = function() {
function t(t, e, n) {
null != t && ("number" == typeof t ? this.fromNumber(t, e, n) : null == e && "string" != typeof t ? this.fromString(t, 256) : this.fromString(t, e))
}
return t.prototype.toString = function(t) {
if (this.s < 0)
return "-" + this.negate().toString(t);
var n;
if (16 == t)
n = 4;
else if (8 == t)
n = 3;
else if (2 == t)
n = 1;
else if (32 == t)
n = 5;
else {
if (4 != t)
return this.toRadix(t);
n = 2
}
var r, o = (1 << n) - 1, i = !1, a = "", u = this.t, c = this.DB - u * this.DB % n;
if (u-- > 0)
for (c < this.DB && (r = this >> c) > 0 && (i = !0,
a = e(r)); u >= 0; )
c < n ? (r = (this & (1 << c) - 1) << n - c,
r |= this[--u] >> (c += this.DB - n)) : (r = this >> (c -= n) & o,
c <= 0 && (c += this.DB,
--u)),
r > 0 && (i = !0),
i && (a += e(r));
return i ? a : "0"
}
,
t.prototype.negate = function() {
var e = A();
return t.ZERO.subTo(this, e),
e
}
,
t.prototype.abs = function() {
return this.s < 0 ? this.negate() : this
}
,
t.prototype.compareTo = function(t) {
var e = this.s - t.s;
if (0 != e)
return e;
var n = this.t;
if (0 != (e = n - t.t))
return this.s < 0 ? -e : e;
for (; --n >= 0; )
if (0 != (e = this[n] - t[n]))
return e;
return 0
}
,
t.prototype.bitLength = function() {
return this.t <= 0 ? 0 : this.DB * (this.t - 1) + F(this[this.t - 1] ^ this.s & this.DM)
}
,
t.prototype.mod = function(e) {
var n = A();
return this.abs().divRemTo(e, null, n),
this.s < 0 && n.compareTo(t.ZERO) > 0 && e.subTo(n, n),
n
}
,
t.prototype.modPowInt = function(t, e) {
var n;
return n = t < 256 || e.isEven() ? new k(e) : new R(e),
this.exp(t, n)
}
,
t.prototype.clone = function() {
var t = A();
return this.copyTo(t),
t
}
,
t.prototype.intValue = function() {
if (this.s < 0) {
if (1 == this.t)
return this[0] - this.DV;
if (0 == this.t)
return -1
} else {
if (1 == this.t)
return this[0];
if (0 == this.t)
return 0
}
return (this[1] & (1 << 32 - this.DB) - 1) << this.DB | this[0]
}
,
t.prototype.byteValue = function() {
return 0 == this.t ? this.s : this[0] << 24 >> 24
}
,
t.prototype.shortValue = function() {
return 0 == this.t ? this.s : this[0] << 16 >> 16
}
,
t.prototype.signum = function() {
return this.s < 0 ? -1 : this.t <= 0 || 1 == this.t && this[0] <= 0 ? 0 : 1
}
,
t.prototype.toByteArray = function() {
var t = this.t
, e = [];
e[0] = this.s;
var n, r = this.DB - t * this.DB % 8, o = 0;
if (t-- > 0)
for (r < this.DB && (n = this[t] >> r) != (this.s & this.DM) >> r && (e[o++] = n | this.s << this.DB - r); t >= 0; )
r < 8 ? (n = (this[t] & (1 << r) - 1) << 8 - r,
n |= this[--t] >> (r += this.DB - 8)) : (n = this[t] >> (r -= 8) & 255,
r <= 0 && (r += this.DB,
--t)),
0 != (128 & n) && (n |= -256),
0 == o && (128 & this.s) != (128 & n) && ++o,
(o > 0 || n != this.s) && (e[o++] = n);
return e
}
,
t.prototype.equals = function(t) {
return 0 == this.compareTo(t)
}
,
t.prototype.min = function(t) {
return this.compareTo(t) < 0 ? this : t
}
,
t.prototype.max = function(t) {
return this.compareTo(t) > 0 ? this : t
}
,
t.prototype.and = function(t) {
var e = A();
return this.bitwiseTo(t, n, e),
e
}
,
t.prototype.or = function(t) {
var e = A();
return this.bitwiseTo(t, r, e),
e
}
,
t.prototype.xor = function(t) {
var e = A();
return this.bitwiseTo(t, o, e),
e
}
,
t.prototype.andNot = function(t) {
var e = A();
return this.bitwiseTo(t, i, e),
e
}
,
t.prototype.not = function() {
for (var t = A(), e = 0; e < this.t; ++e)
t[e] = this.DM & ~this[e];
return t.t = this.t,
t.s = ~this.s,
t
}
,
t.prototype.shiftLeft = function(t) {
var e = A();
return t < 0 ? this.rShiftTo(-t, e) : this.lShiftTo(t, e),
e
}
,
t.prototype.shiftRight = function(t) {
var e = A();
return t < 0 ? this.lShiftTo(-t, e) : this.rShiftTo(t, e),
e
}
,
t.prototype.getLowestSetBit = function() {
for (var t = 0; t < this.t; ++t)
if (0 != this[t])
return t * this.DB + a(this[t]);
return this.s < 0 ? this.t * this.DB : -1
}
,
t.prototype.bitCount = function() {
for (var t = 0, e = this.s & this.DM, n = 0; n < this.t; ++n)
t += u(this[n] ^ e);
return t
}
,
t.prototype.testBit = function(t) {
var e = Math.floor(t / this.DB);
return e >= this.t ? 0 != this.s : 0 != (this[e] & 1 << t % this.DB)
}
,
t.prototype.setBit = function(t) {
return this.changeBit(t, r)
}
,
t.prototype.clearBit = function(t) {
return this.changeBit(t, i)
}
,
t.prototype.flipBit = function(t) {
return this.changeBit(t, o)
}
,
t.prototype.add = function(t) {
var e = A();
return this.addTo(t, e),
e
}
,
t.prototype.subtract = function(t) {
var e = A();
return this.subTo(t, e),
e
}
,
t.prototype.multiply = function(t) {
var e = A();
return this.multiplyTo(t, e),
e
}
,
t.prototype.divide = function(t) {
var e = A();
return this.divRemTo(t, e, null),
e
}
,
t.prototype.remainder = function(t) {
var e = A();
return this.divRemTo(t, null, e),
e
}
,
t.prototype.divideAndRemainder = function(t) {
var e = A()
, n = A();
return this.divRemTo(t, e, n),
[e, n]
}
,
t.prototype.modPow = function(t, e) {
var n, r, o = t.bitLength(), i = N(1);
if (o <= 0)
return i;
n = o < 18 ? 1 : o < 48 ? 3 : o < 144 ? 4 : o < 768 ? 5 : 6,
r = o < 8 ? new k(e) : e.isEven() ? new C(e) : new R(e);
var a = []
, u = 3
, c = n - 1
, s = (1 << n) - 1;
if (a[1] = r.convert(this),
n > 1) {
var l = A();
for (r.sqrTo(a[1], l); u <= s; )
a = A(),
r.mulTo(l, a[u - 2], a),
u += 2
}
var f, p, h = t.t - 1, d = !0, v = A();
for (o = F(t[h]) - 1; h >= 0; ) {
for (o >= c ? f = t[h] >> o - c & s : (f = (t[h] & (1 << o + 1) - 1) << c - o,
h > 0 && (f |= t[h - 1] >> this.DB + o - c)),
u = n; 0 == (1 & f); )
f >>= 1,
--u;
if ((o -= u) < 0 && (o += this.DB,
--h),
d)
a[f].copyTo(i),
d = !1;
else {
for (; u > 1; )
r.sqrTo(i, v),
r.sqrTo(v, i),
u -= 2;
u > 0 ? r.sqrTo(i, v) : (p = i,
i = v,
v = p),
r.mulTo(v, a[f], i)
}
for (; h >= 0 && 0 == (t[h] & 1 << o); )
r.sqrTo(i, v),
p = i,
i = v,
v = p,
--o < 0 && (o = this.DB - 1,
--h)
}
return r.revert(i)
}
,
t.prototype.modInverse = function(e) {
var n = e.isEven();
if (this.isEven() && n || 0 == e.signum())
return t.ZERO;
for (var r = e.clone(), o = this.clone(), i = N(1), a = N(0), u = N(0), c = N(1); 0 != r.signum(); ) {
for (; r.isEven(); )
r.rShiftTo(1, r),
n ? (i.isEven() && a.isEven() || (i.addTo(this, i),
a.subTo(e, a)),
i.rShiftTo(1, i)) : a.isEven() || a.subTo(e, a),
a.rShiftTo(1, a);
for (; o.isEven(); )
o.rShiftTo(1, o),
n ? (u.isEven() && c.isEven() || (u.addTo(this, u),
c.subTo(e, c)),
u.rShiftTo(1, u)) : c.isEven() || c.subTo(e, c),
c.rShiftTo(1, c);
r.compareTo(o) >= 0 ? (r.subTo(o, r),
n && i.subTo(u, i),
a.subTo(c, a)) : (o.subTo(r, o),
n && u.subTo(i, u),
c.subTo(a, c))
}
return 0 != o.compareTo(t.ONE) ? t.ZERO : c.compareTo(e) >= 0 ? c.subtract(e) : c.signum() < 0 ? (c.addTo(e, c),
c.signum() < 0 ? c.add(e) : c) : c
}
,
t.prototype.pow = function(t) {
return this.exp(t, new P)
}
,
t.prototype.gcd = function(t) {
var e = this.s < 0 ? this.negate() : this.clone()
, n = t.s < 0 ? t.negate() : t.clone();
if (e.compareTo(n) < 0) {
var r = e;
e = n,
n = r
}
var o = e.getLowestSetBit()
, i = n.getLowestSetBit();
if (i < 0)
return e;
for (o < i && (i = o),
i > 0 && (e.rShiftTo(i, e),
n.rShiftTo(i, n)); e.signum() > 0; )
(o = e.getLowestSetBit()) > 0 && e.rShiftTo(o, e),
(o = n.getLowestSetBit()) > 0 && n.rShiftTo(o, n),
e.compareTo(n) >= 0 ? (e.subTo(n, e),
e.rShiftTo(1, e)) : (n.subTo(e, n),
n.rShiftTo(1, n));
return i > 0 && n.lShiftTo(i, n),
n
}
,
t.prototype.isProbablePrime = function(t) {
var e, n = this.abs();
if (1 == n.t && n[0] <= O[O.length - 1]) {
for (e = 0; e < O.length; ++e)
if (n[0] == O[e])
return !0;
return !1
}
if (n.isEven())
return !1;
for (e = 1; e < O.length; ) {
for (var r = O[e], o = e + 1; o < O.length && r < j; )
r *= O[o++];
for (r = n.modInt(r); e < o; )
if (r % O[e++] == 0)
return !1
}
return n.millerRabin(t)
}
,
t.prototype.copyTo = function(t) {
for (var e = this.t - 1; e >= 0; --e)
t[e] = this[e];
t.t = this.t,
t.s = this.s
}
,
t.prototype.fromInt = function(t) {
this.t = 1,
this.s = t < 0 ? -1 : 0,
t > 0 ? this[0] = t : t < -1 ? this[0] = t + this.DV : this.t = 0
}
,
t.prototype.fromString = function(e, n) {
var r;
if (16 == n)
r = 4;
else if (8 == n)
r = 3;
else if (256 == n)
r = 8;
else if (2 == n)
r = 1;
else if (32 == n)
r = 5;
else {
if (4 != n)
return void this.fromRadix(e, n);
r = 2
}
this.t = 0,
this.s = 0;
for (var o = e.length, i = !1, a = 0; --o >= 0; ) {
var u = 8 == r ? 255 & +e[o] : U(e, o);
u < 0 ? "-" == e.charAt(o) && (i = !0) : (i = !1,
0 == a ? this[this.t++] = u : a + r > this.DB ? (this[this.t - 1] |= (u & (1 << this.DB - a) - 1) << a,
this[this.t++] = u >> this.DB - a) : this[this.t - 1] |= u << a,
(a += r) >= this.DB && (a -= this.DB))
}
8 == r && 0 != (128 & +e[0]) && (this.s = -1,
a > 0 && (this[this.t - 1] |= (1 << this.DB - a) - 1 << a)),
this.clamp(),
i && t.ZERO.subTo(this, this)
}
,
t.prototype.clamp = function() {
for (var t = this.s & this.DM; this.t > 0 && this[this.t - 1] == t; )
--this.t
}
,
t.prototype.dlShiftTo = function(t, e) {
var n;
for (n = this.t - 1; n >= 0; --n)
e[n + t] = this[n];
for (n = t - 1; n >= 0; --n)
e[n] = 0;
e.t = this.t + t,
e.s = this.s
}
,
t.prototype.drShiftTo = function(t, e) {
for (var n = t; n < this.t; ++n)
e[n - t] = this[n];
e.t = Math.max(this.t - t, 0),
e.s = this.s
}
,
t.prototype.lShiftTo = function(t, e) {
for (var n = t % this.DB, r = this.DB - n, o = (1 << r) - 1, i = Math.floor(t / this.DB), a = this.s << n & this.DM, u = this.t - 1; u >= 0; --u)
e[u + i + 1] = this >> r | a,
a = (this & o) << n;
for (u = i - 1; u >= 0; --u)
e = 0;
e = a,
e.t = this.t + i + 1,
e.s = this.s,
e.clamp()
}
,
t.prototype.rShiftTo = function(t, e) {
e.s = this.s;
var n = Math.floor(t / this.DB);
if (n >= this.t)
e.t = 0;
else {
var r = t % this.DB
, o = this.DB - r
, i = (1 << r) - 1;
e[0] = this[n] >> r;
for (var a = n + 1; a < this.t; ++a)
e[a - n - 1] |= (this[a] & i) << o,
e[a - n] = this[a] >> r;
r > 0 && (e[this.t - n - 1] |= (this.s & i) << o),
e.t = this.t - n,
e.clamp()
}
}
,
t.prototype.subTo = function(t, e) {
for (var n = 0, r = 0, o = Math.min(t.t, this.t); n < o; )
r += this[n] - t[n],
e[n++] = r & this.DM,
r >>= this.DB;
if (t.t < this.t) {
for (r -= t.s; n < this.t; )
r += this[n],
e[n++] = r & this.DM,
r >>= this.DB;
r += this.s
} else {
for (r += this.s; n < t.t; )
r -= t[n],
e[n++] = r & this.DM,
r >>= this.DB;
r -= t.s
}
e.s = r < 0 ? -1 : 0,
r < -1 ? e[n++] = this.DV + r : r > 0 && (e[n++] = r),
e.t = n,
e.clamp()
}
,
t.prototype.multiplyTo = function(e, n) {
var r = this.abs()
, o = e.abs()
, i = r.t;
for (n.t = i + o.t; --i >= 0; )
n = 0;
for (i = 0; i < o.t; ++i)
n[i + r.t] = r.am(0, o, n, i, 0, r.t);
n.s = 0,
n.clamp(),
this.s != e.s && t.ZERO.subTo(n, n)
}
,
t.prototype.squareTo = function(t) {
for (var e = this.abs(), n = t.t = 2 * e.t; --n >= 0; )
t[n] = 0;
for (n = 0; n < e.t - 1; ++n) {
var r = e.am(n, e[n], t, 2 * n, 0, 1);
(t[n + e.t] += e.am(n + 1, 2 * e[n], t, 2 * n + 1, r, e.t - n - 1)) >= e.DV && (t[n + e.t] -= e.DV,
t[n + e.t + 1] = 1)
}
t.t > 0 && (t[t.t - 1] += e.am(n, e[n], t, 2 * n, 0, 1)),
t.s = 0,
t.clamp()
}
,
t.prototype.divRemTo = function(e, n, r) {
var o = e.abs();
if (!(o.t <= 0)) {
var i = this.abs();
if (i.t < o.t)
return null != n && n.fromInt(0),
void (null != r && this.copyTo(r));
null == r && (r = A());
var a = A()
, u = this.s
, c = e.s
, s = this.DB - F(o[o.t - 1]);
s > 0 ? (o.lShiftTo(s, a),
i.lShiftTo(s, r)) : (o.copyTo(a),
i.copyTo(r));
var l = a.t
, f = a[l - 1];
if (0 != f) {
var p = f * (1 << this.F1) + (l > 1 ? a[l - 2] >> this.F2 : 0)
, h = this.FV / p
, d = (1 << this.F1) / p
, v = 1 << this.F2
, g = r.t
, y = g - l
, m = null == n ? A() : n;
for (a.dlShiftTo(y, m),
r.compareTo(m) >= 0 && (r[r.t++] = 1,
r.subTo(m, r)),
t.ONE.dlShiftTo(l, m),
m.subTo(a, a); a.t < l; )
a[a.t++] = 0;
for (; --y >= 0; ) {
var b = r[--g] == f ? this.DM : Math.floor(r[g] * h + (r[g - 1] + v) * d);
if ((r[g] += a.am(0, b, r, y, 0, l)) < b)
for (a.dlShiftTo(y, m),
r.subTo(m, r); r[g] < --b; )
r.subTo(m, r)
}
null != n && (r.drShiftTo(l, n),
u != c && t.ZERO.subTo(n, n)),
r.t = l,
r.clamp(),
s > 0 && r.rShiftTo(s, r),
u < 0 && t.ZERO.subTo(r, r)
}
}
}
,
t.prototype.invDigit = function() {
if (this.t < 1)
return 0;
var t = this[0];
if (0 == (1 & t))
return 0;
var e = 3 & t;
return (e = (e = (e = (e = e * (2 - (15 & t) * e) & 15) * (2 - (255 & t) * e) & 255) * (2 - ((65535 & t) * e & 65535)) & 65535) * (2 - t * e % this.DV) % this.DV) > 0 ? this.DV - e : -e
}
,
t.prototype.isEven = function() {
return 0 == (this.t > 0 ? 1 & this[0] : this.s)
}
,
t.prototype.exp = function(e, n) {
if (e > 4294967295 || e < 1)
return t.ONE;
var r = A()
, o = A()
, i = n.convert(this)
, a = F(e) - 1;
for (i.copyTo(r); --a >= 0; )
if (n.sqrTo(r, o),
(e & 1 << a) > 0)
n.mulTo(o, i, r);
else {
var u = r;
r = o,
o = u
}
return n.revert(r)
}
,
t.prototype.chunkSize = function(t) {
return Math.floor(Math.LN2 * this.DB / Math.log(t))
}
,
t.prototype.toRadix = function(t) {
if (null == t && (t = 10),
0 == this.signum() || t < 2 || t > 36)
return "0";
var e = this.chunkSize(t)
, n = Math.pow(t, e)
, r = N(n)
, o = A()
, i = A()
, a = "";
for (this.divRemTo(r, o, i); o.signum() > 0; )
a = (n + i.intValue()).toString(t).substr(1) + a,
o.divRemTo(r, o, i);
return i.intValue().toString(t) + a
}
,
t.prototype.fromRadix = function(e, n) {
this.fromInt(0),
null == n && (n = 10);
for (var r = this.chunkSize(n), o = Math.pow(n, r), i = !1, a = 0, u = 0, c = 0; c < e.length; ++c) {
var s = U(e, c);
s < 0 ? "-" == e.charAt(c) && 0 == this.signum() && (i = !0) : (u = n * u + s,
++a >= r && (this.dMultiply(o),
this.dAddOffset(u, 0),
a = 0,
u = 0))
}
a > 0 && (this.dMultiply(Math.pow(n, a)),
this.dAddOffset(u, 0)),
i && t.ZERO.subTo(this, this)
}
,
t.prototype.fromNumber = function(e, n, o) {
if ("number" == typeof n)
if (e < 2)
this.fromInt(1);
else
for (this.fromNumber(e, o),
this.testBit(e - 1) || this.bitwiseTo(t.ONE.shiftLeft(e - 1), r, this),
this.isEven() && this.dAddOffset(1, 0); !this.isProbablePrime(n); )
this.dAddOffset(2, 0),
this.bitLength() > e && this.subTo(t.ONE.shiftLeft(e - 1), this);
else {
var i = []
, a = 7 & e;
i.length = 1 + (e >> 3),
n.nextBytes(i),
a > 0 ? i[0] &= (1 << a) - 1 : i[0] = 0,
this.fromString(i, 256)
}
}
,
t.prototype.bitwiseTo = function(t, e, n) {
var r, o, i = Math.min(t.t, this.t);
for (r = 0; r < i; ++r)
n[r] = e(this[r], t[r]);
if (t.t < this.t) {
for (o = t.s & this.DM,
r = i; r < this.t; ++r)
n[r] = e(this[r], o);
n.t = this.t
} else {
for (o = this.s & this.DM,
r = i; r < t.t; ++r)
n[r] = e(o, t[r]);
n.t = t.t
}
n.s = e(this.s, t.s),
n.clamp()
}
,
t.prototype.changeBit = function(e, n) {
var r = t.ONE.shiftLeft(e);
return this.bitwiseTo(r, n, r),
r
}
,
t.prototype.addTo = function(t, e) {
for (var n = 0, r = 0, o = Math.min(t.t, this.t); n < o; )
r += this[n] + t[n],
e[n++] = r & this.DM,
r >>= this.DB;
if (t.t < this.t) {
for (r += t.s; n < this.t; )
r += this[n],
e[n++] = r & this.DM,
r >>= this.DB;
r += this.s
} else {
for (r += this.s; n < t.t; )
r += t[n],
e[n++] = r & this.DM,
r >>= this.DB;
r += t.s
}
e.s = r < 0 ? -1 : 0,
r > 0 ? e[n++] = r : r < -1 && (e[n++] = this.DV + r),
e.t = n,
e.clamp()
}
,
t.prototype.dMultiply = function(t) {
this[this.t] = this.am(0, t - 1, this, 0, 0, this.t),
++this.t,
this.clamp()
}
,
t.prototype.dAddOffset = function(t, e) {
if (0 != t) {
for (; this.t <= e; )
this[this.t++] = 0;
for (this[e] += t; this[e] >= this.DV; )
this[e] -= this.DV,
++e >= this.t && (this[this.t++] = 0),
++this[e]
}
}
,
t.prototype.multiplyLowerTo = function(t, e, n) {
var r = Math.min(this.t + t.t, e);
for (n.s = 0,
n.t = r; r > 0; )
n[--r] = 0;
for (var o = n.t - this.t; r < o; ++r)
n[r + this.t] = this.am(0, t[r], n, r, 0, this.t);
for (o = Math.min(t.t, e); r < o; ++r)
this.am(0, t[r], n, r, 0, e - r);
n.clamp()
}
,
t.prototype.multiplyUpperTo = function(t, e, n) {
--e;
var r = n.t = this.t + t.t - e;
for (n.s = 0; --r >= 0; )
n[r] = 0;
for (r = Math.max(e - this.t, 0); r < t.t; ++r)
n[this.t + r - e] = this.am(e - r, t[r], n, 0, 0, this.t + r - e);
n.clamp(),
n.drShiftTo(1, n)
}
,
t.prototype.modInt = function(t) {
if (t <= 0)
return 0;
var e = this.DV % t
, n = this.s < 0 ? t - 1 : 0;
if (this.t > 0)
if (0 == e)
n = this[0] % t;
else
for (var r = this.t - 1; r >= 0; --r)
n = (e * n + this[r]) % t;
return n
}
,
t.prototype.millerRabin = function(e) {
var n = this.subtract(t.ONE)
, r = n.getLowestSetBit();
if (r <= 0)
return !1;
var o = n.shiftRight(r);
(e = e + 1 >> 1) > O.length && (e = O.length);
for (var i = A(), a = 0; a < e; ++a) {
i.fromInt(O[Math.floor(Math.random() * O.length)]);
var u = i.modPow(o, this);
if (0 != u.compareTo(t.ONE) && 0 != u.compareTo(n)) {
for (var c = 1; c++ < r && 0 != u.compareTo(n); )
if (0 == (u = u.modPowInt(2, this)).compareTo(t.ONE))
return !1;
if (0 != u.compareTo(n))
return !1
}
}
return !0
}
,
t.prototype.square = function() {
var t = A();
return this.squareTo(t),
t
}
,
t.prototype.gcda = function(t, e) {
var n = this.s < 0 ? this.negate() : this.clone()
, r = t.s < 0 ? t.negate() : t.clone();
if (n.compareTo(r) < 0) {
var o = n;
n = r,
r = o
}
var i = n.getLowestSetBit()
, a = r.getLowestSetBit();
if (a < 0)
e(n);
else {
i < a && (a = i),
a > 0 && (n.rShiftTo(a, n),
r.rShiftTo(a, r));
var u = function() {
(i = n.getLowestSetBit()) > 0 && n.rShiftTo(i, n),
(i = r.getLowestSetBit()) > 0 && r.rShiftTo(i, r),
n.compareTo(r) >= 0 ? (n.subTo(r, n),
n.rShiftTo(1, n)) : (r.subTo(n, r),
r.rShiftTo(1, r)),
n.signum() > 0 ? setTimeout(u, 0) : (a > 0 && r.lShiftTo(a, r),
setTimeout((function() {
e(r)
}
), 0))
};
setTimeout(u, 10)
}
}
,
t.prototype.fromNumberAsync = function(e, n, o, i) {
if ("number" == typeof n)
if (e < 2)
this.fromInt(1);
else {
this.fromNumber(e, o),
this.testBit(e - 1) || this.bitwiseTo(t.ONE.shiftLeft(e - 1), r, this),
this.isEven() && this.dAddOffset(1, 0);
var a = this
, u = function() {
a.dAddOffset(2, 0),
a.bitLength() > e && a.subTo(t.ONE.shiftLeft(e - 1), a),
a.isProbablePrime(n) ? setTimeout((function() {
i()
}
), 0) : setTimeout(u, 0)
};
setTimeout(u, 0)
}
else {
var c = []
, s = 7 & e;
c.length = 1 + (e >> 3),
n.nextBytes(c),
s > 0 ? c[0] &= (1 << s) - 1 : c[0] = 0,
this.fromString(c, 256)
}
}
,
t
}(), P = function() {
function t() {}
return t.prototype.convert = function(t) {
return t
}
,
t.prototype.revert = function(t) {
return t
}
,
t.prototype.mulTo = function(t, e, n) {
t.multiplyTo(e, n)
}
,
t.prototype.sqrTo = function(t, e) {
t.squareTo(e)
}
,
t
}(), k = function() {
function t(t) {
this.m = t
}
return t.prototype.convert = function(t) {
return t.s < 0 || t.compareTo(this.m) >= 0 ? t.mod(this.m) : t
}
,
t.prototype.revert = function(t) {
return t
}
,
t.prototype.reduce = function(t) {
t.divRemTo(this.m, null, t)
}
,
t.prototype.mulTo = function(t, e, n) {
t.multiplyTo(e, n),
this.reduce(n)
}
,
t.prototype.sqrTo = function(t, e) {
t.squareTo(e),
this.reduce(e)
}
,
t
}(), R = function() {
function t(t) {
this.m = t,
this.mp = t.invDigit(),
this.mpl = 32767 & this.mp,
this.mph = this.mp >> 15,
this.um = (1 << t.DB - 15) - 1,
this.mt2 = 2 * t.t
}
return t.prototype.convert = function(t) {
var e = A();
return t.abs().dlShiftTo(this.m.t, e),
e.divRemTo(this.m, null, e),
t.s < 0 && e.compareTo(T.ZERO) > 0 && this.m.subTo(e, e),
e
}
,
t.prototype.revert = function(t) {
var e = A();
return t.copyTo(e),
this.reduce(e),
e
}
,
t.prototype.reduce = function(t) {
for (; t.t <= this.mt2; )
t[t.t++] = 0;
for (var e = 0; e < this.m.t; ++e) {
var n = 32767 & t[e]
, r = n * this.mpl + ((n * this.mph + (t[e] >> 15) * this.mpl & this.um) << 15) & t.DM;
for (t[n = e + this.m.t] += this.m.am(0, r, t, e, 0, this.m.t); t[n] >= t.DV; )
t[n] -= t.DV,
t[++n]++
}
t.clamp(),
t.drShiftTo(this.m.t, t),
t.compareTo(this.m) >= 0 && t.subTo(this.m, t)
}
,
t.prototype.mulTo = function(t, e, n) {
t.multiplyTo(e, n),
this.reduce(n)
}
,
t.prototype.sqrTo = function(t, e) {
t.squareTo(e),
this.reduce(e)
}
,
t
}(), C = function() {
function t(t) {
this.m = t,
this.r2 = A(),
this.q3 = A(),
T.ONE.dlShiftTo(2 * t.t, this.r2),
this.mu = this.r2.divide(t)
}
return t.prototype.convert = function(t) {
if (t.s < 0 || t.t > 2 * this.m.t)
return t.mod(this.m);
if (t.compareTo(this.m) < 0)
return t;
var e = A();
return t.copyTo(e),
this.reduce(e),
e
}
,
t.prototype.revert = function(t) {
return t
}
,
t.prototype.reduce = function(t) {
for (t.drShiftTo(this.m.t - 1, this.r2),
t.t > this.m.t + 1 && (t.t = this.m.t + 1,
t.clamp()),
this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3),
this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2); t.compareTo(this.r2) < 0; )
t.dAddOffset(1, this.m.t + 1);
for (t.subTo(this.r2, t); t.compareTo(this.m) >= 0; )
t.subTo(this.m, t)
}
,
t.prototype.mulTo = function(t, e, n) {
t.multiplyTo(e, n),
this.reduce(n)
}
,
t.prototype.sqrTo = function(t, e) {
t.squareTo(e),
this.reduce(e)
}
,
t
}();
function A() {
return new T(null)
}
function I(t, e) {
return new T(t,e)
}
"Microsoft Internet Explorer" == navigator.appName ? (T.prototype.am = function(t, e, n, r, o, i) {
for (var a = 32767 & e, u = e >> 15; --i >= 0; ) {
var c = 32767 & this[t]
, s = this[t++] >> 15
, l = u * c + s * a;
o = ((c = a * c + ((32767 & l) << 15) + n[r] + (1073741823 & o)) >>> 30) + (l >>> 15) + u * s + (o >>> 30),
n[r++] = 1073741823 & c
}
return o
}
,
_ = 30) : "Netscape" != navigator.appName ? (T.prototype.am = function(t, e, n, r, o, i) {
for (; --i >= 0; ) {
var a = e * this[t++] + n[r] + o;
o = Math.floor(a / 67108864),
n[r++] = 67108863 & a
}
return o
}
,
_ = 26) : (T.prototype.am = function(t, e, n, r, o, i) {
for (var a = 16383 & e, u = e >> 14; --i >= 0; ) {
var c = 16383 & this[t]
, s = this[t++] >> 14
, l = u * c + s * a;
o = ((c = a * c + ((16383 & l) << 14) + n[r] + o) >> 28) + (l >> 14) + u * s,
n[r++] = 268435455 & c
}
return o
}
,
_ = 28),
T.prototype.DB = _,
T.prototype.DM = (1 << _) - 1,
T.prototype.DV = 1 << _,
T.prototype.FV = Math.pow(2, 52),
T.prototype.F1 = 52 - _,
T.prototype.F2 = 2 * _ - 52;
var L, D, B = [];
for (L = "0".charCodeAt(0),
D = 0; D <= 9; ++D)
B[L++] = D;
for (L = "a".charCodeAt(0),
D = 10; D < 36; ++D)
B[L++] = D;
for (L = "A".charCodeAt(0),
D = 10; D < 36; ++D)
B[L++] = D;
function U(t, e) {
var n = B[t.charCodeAt(e)];
return null == n ? -1 : n
}
function N(t) {
var e = A();
return e.fromInt(t),
e
}
function F(t) {
var e, n = 1;
return 0 != (e = t >>> 16) && (t = e,
n += 16),
0 != (e = t >> 8) && (t = e,
n += 8),
0 != (e = t >> 4) && (t = e,
n += 4),
0 != (e = t >> 2) && (t = e,
n += 2),
0 != (e = t >> 1) && (t = e,
n += 1),
n
}
T.ZERO = N(0),
T.ONE = N(1);
var M, q, V = function() {
function t() {
this.i = 0,
this.j = 0,
this.S = []
}
return t.prototype.init = function(t) {
var e, n, r;
for (e = 0; e < 256; ++e)
this.S[e] = e;
for (n = 0,
e = 0; e < 256; ++e)
n = n + this.S[e] + t[e % t.length] & 255,
r = this.S[e],
this.S[e] = this.S[n],
this.S[n] = r;
this.i = 0,
this.j = 0
}
,
t.prototype.next = function() {
var t;
return this.i = this.i + 1 & 255,
this.j = this.j + this.S[this.i] & 255,
t = this.S[this.i],
this.S[this.i] = this.S[this.j],
this.S[this.j] = t,
this.S[t + this.S[this.i] & 255]
}
,
t
}(), H = null;
if (null == H) {
H = [],
q = 0;
var K = void 0;
if (window.crypto && window.crypto.getRandomValues) {
var z = new Uint32Array(256);
for (window.crypto.getRandomValues(z),
K = 0; K < z.length; ++K)
H[q++] = 255 & z[K]
}
var W = function(t) {
if (this.count = this.count || 0,
this.count >= 256 || q >= 256)
window.removeEventListener ? window.removeEventListener("mousemove", W, !1) : window.detachEvent && window.detachEvent("onmousemove", W);
else
try {
var e = t.x + t.y;
H[q++] = 255 & e,
this.count += 1
} catch (t) {}
};
window.addEventListener ? window.addEventListener("mousemove", W, !1) : window.attachEvent && window.attachEvent("onmousemove", W)
}
function Z() {
if (null == M) {
for (M = new V; q < 256; ) {
var t = Math.floor(65536 * Math.random());
H[q++] = 255 & t
}
for (M.init(H),
q = 0; q < H.length; ++q)
H[q] = 0;
q = 0
}
return M.next()
}
var G = function() {
function t() {}
return t.prototype.nextBytes = function(t) {
for (var e = 0; e < t.length; ++e)
t[e] = Z()
}
,
t
}()
, J = function() {
function t() {
this.n = null,
this.e = 0,
this.d = null,
this.p = null,
this.q = null,
this.dmp1 = null,
this.dmq1 = null,
this.coeff = null
}
return t.prototype.doPublic = function(t) {
return t.modPowInt(this.e, this.n)
}
,
t.prototype.doPrivate = function(t) {
if (null == this.p || null == this.q)
return t.modPow(this.d, this.n);
for (var e = t.mod(this.p).modPow(this.dmp1, this.p), n = t.mod(this.q).modPow(this.dmq1, this.q); e.compareTo(n) < 0; )
e = e.add(this.p);
return e.subtract(n).multiply(this.coeff).mod(this.p).multiply(this.q).add(n)
}
,
t.prototype.setPublic = function(t, e) {
null != t && null != e && t.length > 0 && e.length > 0 && (this.n = I(t, 16),
this.e = parseInt(e, 16))
}
,
t.prototype.encrypt = function(t) {
var e = function(t, e) {
if (e < t.length + 11)
return null;
for (var n = [], r = t.length - 1; r >= 0 && e > 0; ) {
var o = t.charCodeAt(r--);
o < 128 ? n[--e] = o : o > 127 && o < 2048 ? (n[--e] = 63 & o | 128,
n[--e] = o >> 6 | 192) : (n[--e] = 63 & o | 128,
n[--e] = o >> 6 & 63 | 128,
n[--e] = o >> 12 | 224)
}
n[--e] = 0;
for (var i = new G, a = []; e > 2; ) {
for (a[0] = 0; 0 == a[0]; )
i.nextBytes(a);
n[--e] = a[0]
}
return n[--e] = 2,
n[--e] = 0,
new T(n)
}(t, this.n.bitLength() + 7 >> 3);
if (null == e)
return null;
var n = this.doPublic(e);
if (null == n)
return null;
var r = n.toString(16);
return 0 == (1 & r.length) ? r : "0" + r
}
,
t.prototype.setPrivate = function(t, e, n) {
null != t && null != e && t.length > 0 && e.length > 0 && (this.n = I(t, 16),
this.e = parseInt(e, 16),
this.d = I(n, 16))
}
,
t.prototype.setPrivateEx = function(t, e, n, r, o, i, a, u) {
null != t && null != e && t.length > 0 && e.length > 0 && (this.n = I(t, 16),
this.e = parseInt(e, 16),
this.d = I(n, 16),
this.p = I(r, 16),
this.q = I(o, 16),
this.dmp1 = I(i, 16),
this.dmq1 = I(a, 16),
this.coeff = I(u, 16))
}
,
t.prototype.generate = function(t, e) {
var n = new G
, r = t >> 1;
this.e = parseInt(e, 16);
for (var o = new T(e,16); ; ) {
for (; this.p = new T(t - r,1,n),
0 != this.p.subtract(T.ONE).gcd(o).compareTo(T.ONE) || !this.p.isProbablePrime(10); )
;
for (; this.q = new T(r,1,n),
0 != this.q.subtract(T.ONE).gcd(o).compareTo(T.ONE) || !this.q.isProbablePrime(10); )
;
if (this.p.compareTo(this.q) <= 0) {
var i = this.p;
this.p = this.q,
this.q = i
}
var a = this.p.subtract(T.ONE)
, u = this.q.subtract(T.ONE)
, c = a.multiply(u);
if (0 == c.gcd(o).compareTo(T.ONE)) {
this.n = this.p.multiply(this.q),
this.d = o.modInverse(c),
this.dmp1 = this.d.mod(a),
this.dmq1 = this.d.mod(u),
this.coeff = this.q.modInverse(this.p);
break
}
}
}
,
t.prototype.decrypt = function(t) {
var e = I(t, 16)
, n = this.doPrivate(e);
return null == n ? null : function(t, e) {
for (var n = t.toByteArray(), r = 0; r < n.length && 0 == n[r]; )
++r;
if (n.length - r != e - 1 || 2 != n[r])
return null;
for (++r; 0 != n[r]; )
if (++r >= n.length)
return null;
for (var o = ""; ++r < n.length; ) {
var i = 255 & n[r];
i < 128 ? o += String.fromCharCode(i) : i > 191 && i < 224 ? (o += String.fromCharCode((31 & i) << 6 | 63 & n[r + 1]),
++r) : (o += String.fromCharCode((15 & i) << 12 | (63 & n[r + 1]) << 6 | 63 & n[r + 2]),
r += 2)
}
return o
}(n, this.n.bitLength() + 7 >> 3)
}
,
t.prototype.generateAsync = function(t, e, n) {
var r = new G
, o = t >> 1;
this.e = parseInt(e, 16);
var i = new T(e,16)
, a = this
, u = function() {
var e = function() {
if (a.p.compareTo(a.q) <= 0) {
var t = a.p;
a.p = a.q,
a.q = t
}
var e = a.p.subtract(T.ONE)
, r = a.q.subtract(T.ONE)
, o = e.multiply(r);
0 == o.gcd(i).compareTo(T.ONE) ? (a.n = a.p.multiply(a.q),
a.d = i.modInverse(o),
a.dmp1 = a.d.mod(e),
a.dmq1 = a.d.mod(r),
a.coeff = a.q.modInverse(a.p),
setTimeout((function() {
n()
}
), 0)) : setTimeout(u, 0)
}
, c = function() {
a.q = A(),
a.q.fromNumberAsync(o, 1, r, (function() {
a.q.subtract(T.ONE).gcda(i, (function(t) {
0 == t.compareTo(T.ONE) && a.q.isProbablePrime(10) ? setTimeout(e, 0) : setTimeout(c, 0)
}
))
}
))
}
, s = function() {
a.p = A(),
a.p.fromNumberAsync(t - o, 1, r, (function() {
a.p.subtract(T.ONE).gcda(i, (function(t) {
0 == t.compareTo(T.ONE) && a.p.isProbablePrime(10) ? setTimeout(c, 0) : setTimeout(s, 0)
}
))
}
))
};
setTimeout(s, 0)
};
setTimeout(u, 0)
}
,
t.prototype.sign = function(t, e, n) {
var r = function(t, e) {
if (e < t.length + 22)
return null;
for (var n = e - t.length - 6, r = "", o = 0; o < n; o += 2)
r += "ff";
return I("0001" + r + "00" + t, 16)
}((X[n] || "") + e(t).toString(), this.n.bitLength() / 4);
if (null == r)
return null;
var o = this.doPrivate(r);
if (null == o)
return null;
var i = o.toString(16);
return 0 == (1 & i.length) ? i : "0" + i
}
,
t.prototype.verify = function(t, e, n) {
var r = I(e, 16)
, o = this.doPublic(r);
return null == o ? null : function(t) {
for (var e in X)
if (X.hasOwnProperty(e)) {
var n = X[e]
, r = n.length;
if (t.substr(0, r) == n)
return t.substr(r)
}
return t
}/*!
Copyright (c) 2011, Yahoo! Inc. All rights reserved.
Code licensed under the BSD License:
http://developer.yahoo.com/yui/license.html
version: 2.9.0
*/
(o.toString(16).replace(/^1f+00/, "")) == n(t).toString()
}
,
t
}()
, X = {
md2: "3020300c06082a864886f70d020205000410",
md5: "3020300c06082a864886f70d020505000410",
sha1: "3021300906052b0e03021a05000414",
sha224: "302d300d06096086480165030402040500041c",
sha256: "3031300d060960864801650304020105000420",
sha384: "3041300d060960864801650304020205000430",
sha512: "3051300d060960864801650304020305000440",
ripemd160: "3021300906052b2403020105000414"
}
, Y = {};
Y.lang = {
extend: function(t, e, n) {
if (!e || !t)
throw new Error("YAHOO.lang.extend failed, please check that all dependencies are included.");
var r = function() {};
if (r.prototype = e.prototype,
t.prototype = new r,
t.prototype.constructor = t,
t.superclass = e.prototype,
e.prototype.constructor == Object.prototype.constructor && (e.prototype.constructor = e),
n) {
var o;
for (o in n)
t.prototype[o] = n[o];
var i = function() {}
, a = ["toString", "valueOf"];
try {
/MSIE/.test(navigator.userAgent) && (i = function(t, e) {
for (o = 0; o < a.length; o += 1) {
var n = a[o]
, r = e[n];
"function" == typeof r && r != Object.prototype[n] && (t[n] = r)
}
}
)
} catch (t) {}
i(t.prototype, n)
}
}
};
/**
* @fileOverview
* @name asn1-1.0.js
* @author Kenji Urushima kenji.urushima@gmail.com
* @version asn1 1.0.13 (2017-Jun-02)
* @since jsrsasign 2.1
* @license <a >MIT License</a>
*/
var Q = {};
void 0 !== Q.asn1 && Q.asn1 || (Q.asn1 = {}),
Q.asn1.ASN1Util = new function() {
this.integerToByteHex = function(t) {
var e = t.toString(16);
return e.length % 2 == 1 && (e = "0" + e),
e
}
,
this.bigIntToMinTwosComplementsHex = function(t) {
var e = t.toString(16);
if ("-" != e.substr(0, 1))
e.length % 2 == 1 ? e = "0" + e : e.match(/^[0-7]/) || (e = "00" + e);
else {
var n = e.substr(1).length;
n % 2 == 1 ? n += 1 : e.match(/^[0-7]/) || (n += 2);
for (var r = "", o = 0; o < n; o++)
r += "f";
e = new T(r,16).xor(t).add(T.ONE).toString(16).replace(/^-/, "")
}
return e
}
,
this.getPEMStringFromHex = function(t, e) {
return hextopem(t, e)
}
,
this.newObject = function(t) {
var e = Q.asn1
, n = e.DERBoolean
, r = e.DERInteger
, o = e.DERBitString
, i = e.DEROctetString
, a = e.DERNull
, u = e.DERObjectIdentifier
, c = e.DEREnumerated
, s = e.DERUTF8String
, l = e.DERNumericString
, f = e.DERPrintableString
, p = e.DERTeletexString
, h = e.DERIA5String
, d = e.DERUTCTime
, v = e.DERGeneralizedTime
, g = e.DERSequence
, y = e.DERSet
, m = e.DERTaggedObject
, b = e.ASN1Util.newObject
, w = Object.keys(t);
if (1 != w.length)
throw "key of param shall be only one.";
var _ = w[0];
if (-1 == ":bool:int:bitstr:octstr:null:oid:enum:utf8str:numstr:prnstr:telstr:ia5str:utctime:gentime:seq:set:tag:".indexOf(":" + _ + ":"))
throw "undefined key: " + _;
if ("bool" == _)
return new n(t[_]);
if ("int" == _)
return new r(t[_]);
if ("bitstr" == _)
return new o(t[_]);
if ("octstr" == _)
return new i(t[_]);
if ("null" == _)
return new a(t[_]);
if ("oid" == _)
return new u(t[_]);
if ("enum" == _)
return new c(t[_]);
if ("utf8str" == _)
return new s(t[_]);
if ("numstr" == _)
return new l(t[_]);
if ("prnstr" == _)
return new f(t[_]);
if ("telstr" == _)
return new p(t[_]);
if ("ia5str" == _)
return new h(t[_]);
if ("utctime" == _)
return new d(t[_]);
if ("gentime" == _)
return new v(t[_]);
if ("seq" == _) {
for (var x = t[_], S = [], E = 0; E < x.length; E++) {
var O = b(x[E]);
S.push(O)
}
return new g({
array: S
})
}
if ("set" == _) {
for (x = t[_],
S = [],
E = 0; E < x.length; E++)
O = b(x[E]),
S.push(O);
return new y({
array: S
})
}
if ("tag" == _) {
var j = t[_];
if ("[object Array]" === Object.prototype.toString.call(j) && 3 == j.length) {
var T = b(j[2]);
return new m({
tag: j[0],
explicit: j[1],
obj: T
})
}
var P = {};
if (void 0 !== j.explicit && (P.explicit = j.explicit),
void 0 !== j.tag && (P.tag = j.tag),
void 0 === j.obj)
throw "obj shall be specified for 'tag'.";
return P.obj = b(j.obj),
new m(P)
}
}
,
this.jsonToASN1HEX = function(t) {
return this.newObject(t).getEncodedHex()
}
}
,
Q.asn1.ASN1Util.oidHexToInt = function(t) {
for (var e = "", n = parseInt(t.substr(0, 2), 16), r = (e = Math.floor(n / 40) + "." + n % 40,
""), o = 2; o < t.length; o += 2) {
var i = ("00000000" + parseInt(t.substr(o, 2), 16).toString(2)).slice(-8);
r += i.substr(1, 7),
"0" == i.substr(0, 1) && (e = e + "." + new T(r,2).toString(10),
r = "")
}
return e
}
,
Q.asn1.ASN1Util.oidIntToHex = function(t) {
var e = function(t) {
var e = t.toString(16);
return 1 == e.length && (e = "0" + e),
e
}
, n = function(t) {
var n = ""
, r = new T(t,10).toString(2)
, o = 7 - r.length % 7;
7 == o && (o = 0);
for (var i = "", a = 0; a < o; a++)
i += "0";
for (r = i + r,
a = 0; a < r.length - 1; a += 7) {
var u = r.substr(a, 7);
a != r.length - 7 && (u = "1" + u),
n += e(parseInt(u, 2))
}
return n
};
if (!t.match(/^[0-9.]+$/))
throw "malformed oid string: " + t;
var r = ""
, o = t.split(".")
, i = 40 * parseInt(o[0]) + parseInt(o[1]);
r += e(i),
o.splice(0, 2);
for (var a = 0; a < o.length; a++)
r += n(o[a]);
return r
}
,
Q.asn1.ASN1Object = function() {
this.getLengthHexFromValue = function() {
if (void 0 === this.hV || null == this.hV)
throw "this.hV is null or undefined.";
if (this.hV.length % 2 == 1)
throw "value hex must be even length: n=" + "".length + ",v=" + this.hV;
var t = this.hV.length / 2
, e = t.toString(16);
if (e.length % 2 == 1 && (e = "0" + e),
t < 128)
return e;
var n = e.length / 2;
if (n > 15)
throw "ASN.1 length too long to represent by 8x: n = " + t.toString(16);
return (128 + n).toString(16) + e
}
,
this.getEncodedHex = function() {
return (null == this.hTLV || this.isModified) && (this.hV = this.getFreshValueHex(),
this.hL = this.getLengthHexFromValue(),
this.hTLV = this.hT + this.hL + this.hV,
this.isModified = !1),
this.hTLV
}
,
this.getValueHex = function() {
return this.getEncodedHex(),
this.hV
}
,
this.getFreshValueHex = function() {
return ""
}
}
,
Q.asn1.DERAbstractString = function(t) {
Q.asn1.DERAbstractString.superclass.constructor.call(this),
this.getString = function() {
return this.s
}
,
this.setString = function(t) {
this.hTLV = null,
this.isModified = !0,
this.s = t,
this.hV = stohex(this.s)
}
,
this.setStringHex = function(t) {
this.hTLV = null,
this.isModified = !0,
this.s = null,
this.hV = t
}
,
this.getFreshValueHex = function() {
return this.hV
}
,
void 0 !== t && ("string" == typeof t ? this.setString(t) : void 0 !== t.str ? this.setString(t.str) : void 0 !== t.hex && this.setStringHex(t.hex))
}
,
Y.lang.extend(Q.asn1.DERAbstractString, Q.asn1.ASN1Object),
Q.asn1.DERAbstractTime = function(t) {
Q.asn1.DERAbstractTime.superclass.constructor.call(this),
this.localDateToUTC = function(t) {
return utc = t.getTime() + 6e4 * t.getTimezoneOffset(),
new Date(utc)
}
,
this.formatDate = function(t, e, n) {
var r = this.zeroPadding
, o = this.localDateToUTC(t)
, i = String(o.getFullYear());
"utc" == e && (i = i.substr(2, 2));
var a = i + r(String(o.getMonth() + 1), 2) + r(String(o.getDate()), 2) + r(String(o.getHours()), 2) + r(String(o.getMinutes()), 2) + r(String(o.getSeconds()), 2);
if (!0 === n) {
var u = o.getMilliseconds();
if (0 != u) {
var c = r(String(u), 3);
a = a + "." + (c = c.replace(/[0]+$/, ""))
}
}
return a + "Z"
}
,
this.zeroPadding = function(t, e) {
return t.length >= e ? t : new Array(e - t.length + 1).join("0") + t
}
,
this.getString = function() {
return this.s
}
,
this.setString = function(t) {
this.hTLV = null,
this.isModified = !0,
this.s = t,
this.hV = stohex(t)
}
,
this.setByDateValue = function(t, e, n, r, o, i) {
var a = new Date(Date.UTC(t, e - 1, n, r, o, i, 0));
this.setByDate(a)
}
,
this.getFreshValueHex = function() {
return this.hV
}
}
,
Y.lang.extend(Q.asn1.DERAbstractTime, Q.asn1.ASN1Object),
Q.asn1.DERAbstractStructured = function(t) {
Q.asn1.DERAbstractString.superclass.constructor.call(this),
this.setByASN1ObjectArray = function(t) {
this.hTLV = null,
this.isModified = !0,
this.asn1Array = t
}
,
this.appendASN1Object = function(t) {
this.hTLV = null,
this.isModified = !0,
this.asn1Array.push(t)
}
,
this.asn1Array = new Array,
void 0 !== t && void 0 !== t.array && (this.asn1Array = t.array)
}
,
Y.lang.extend(Q.asn1.DERAbstractStructured, Q.asn1.ASN1Object),
Q.asn1.DERBoolean = function() {
Q.asn1.DERBoolean.superclass.constructor.call(this),
this.hT = "01",
this.hTLV = "0101ff"
}
,
Y.lang.extend(Q.asn1.DERBoolean, Q.asn1.ASN1Object),
Q.asn1.DERInteger = function(t) {
Q.asn1.DERInteger.superclass.constructor.call(this),
this.hT = "02",
this.setByBigInteger = function(t) {
this.hTLV = null,
this.isModified = !0,
this.hV = Q.asn1.ASN1Util.bigIntToMinTwosComplementsHex(t)
}
,
this.setByInteger = function(t) {
var e = new T(String(t),10);
this.setByBigInteger(e)
}
,
this.setValueHex = function(t) {
this.hV = t
}
,
this.getFreshValueHex = function() {
return this.hV
}
,
void 0 !== t && (void 0 !== t.bigint ? this.setByBigInteger(t.bigint) : void 0 !== t.int ? this.setByInteger(t.int) : "number" == typeof t ? this.setByInteger(t) : void 0 !== t.hex && this.setValueHex(t.hex))
}
,
Y.lang.extend(Q.asn1.DERInteger, Q.asn1.ASN1Object),
Q.asn1.DERBitString = function(t) {
if (void 0 !== t && void 0 !== t.obj) {
var e = Q.asn1.ASN1Util.newObject(t.obj);
t.hex = "00" + e.getEncodedHex()
}
Q.asn1.DERBitString.superclass.constructor.call(this),
this.hT = "03",
this.setHexValueIncludingUnusedBits = function(t) {
this.hTLV = null,
this.isModified = !0,
this.hV = t
}
,
this.setUnusedBitsAndHexValue = function(t, e) {
if (t < 0 || 7 < t)
throw "unused bits shall be from 0 to 7: u = " + t;
var n = "0" + t;
this.hTLV = null,
this.isModified = !0,
this.hV = n + e
}
,
this.setByBinaryString = function(t) {
var e = 8 - (t = t.replace(/0+$/, "")).length % 8;
8 == e && (e = 0);
for (var n = 0; n <= e; n++)
t += "0";
var r = "";
for (n = 0; n < t.length - 1; n += 8) {
var o = t.substr(n, 8)
, i = parseInt(o, 2).toString(16);
1 == i.length && (i = "0" + i),
r += i
}
this.hTLV = null,
this.isModified = !0,
this.hV = "0" + e + r
}
,
this.setByBooleanArray = function(t) {
for (var e = "", n = 0; n < t.length; n++)
1 == t[n] ? e += "1" : e += "0";
this.setByBinaryString(e)
}
,
this.newFalseArray = function(t) {
for (var e = new Array(t), n = 0; n < t; n++)
e[n] = !1;
return e
}
,
this.getFreshValueHex = function() {
return this.hV
}
,
void 0 !== t && ("string" == typeof t && t.toLowerCase().match(/^[0-9a-f]+$/) ? this.setHexValueIncludingUnusedBits(t) : void 0 !== t.hex ? this.setHexValueIncludingUnusedBits(t.hex) : void 0 !== t.bin ? this.setByBinaryString(t.bin) : void 0 !== t.array && this.setByBooleanArray(t.array))
}
,
Y.lang.extend(Q.asn1.DERBitString, Q.asn1.ASN1Object),
Q.asn1.DEROctetString = function(t) {
if (void 0 !== t && void 0 !== t.obj) {
var e = Q.asn1.ASN1Util.newObject(t.obj);
t.hex = e.getEncodedHex()
}
Q.asn1.DEROctetString.superclass.constructor.call(this, t),
this.hT = "04"
}
,
Y.lang.extend(Q.asn1.DEROctetString, Q.asn1.DERAbstractString),
Q.asn1.DERNull = function() {
Q.asn1.DERNull.superclass.constructor.call(this),
this.hT = "05",
this.hTLV = "0500"
}
,
Y.lang.extend(Q.asn1.DERNull, Q.asn1.ASN1Object),
Q.asn1.DERObjectIdentifier = function(t) {
var e = function(t) {
var e = t.toString(16);
return 1 == e.length && (e = "0" + e),
e
}
, n = function(t) {
var n = ""
, r = new T(t,10).toString(2)
, o = 7 - r.length % 7;
7 == o && (o = 0);
for (var i = "", a = 0; a < o; a++)
i += "0";
for (r = i + r,
a = 0; a < r.length - 1; a += 7) {
var u = r.substr(a, 7);
a != r.length - 7 && (u = "1" + u),
n += e(parseInt(u, 2))
}
return n
};
Q.asn1.DERObjectIdentifier.superclass.constructor.call(this),
this.hT = "06",
this.setValueHex = function(t) {
this.hTLV = null,
this.isModified = !0,
this.s = null,
this.hV = t
}
,
this.setValueOidString = function(t) {
if (!t.match(/^[0-9.]+$/))
throw "malformed oid string: " + t;
var r = ""
, o = t.split(".")
, i = 40 * parseInt(o[0]) + parseInt(o[1]);
r += e(i),
o.splice(0, 2);
for (var a = 0; a < o.length; a++)
r += n(o[a]);
this.hTLV = null,
this.isModified = !0,
this.s = null,
this.hV = r
}
,
this.setValueName = function(t) {
var e = Q.asn1.x509.OID.name2oid(t);
if ("" === e)
throw "DERObjectIdentifier oidName undefined: " + t;
this.setValueOidString(e)
}
,
this.getFreshValueHex = function() {
return this.hV
}
,
void 0 !== t && ("string" == typeof t ? t.match(/^[0-2].[0-9.]+$/) ? this.setValueOidString(t) : this.setValueName(t) : void 0 !== t.oid ? this.setValueOidString(t.oid) : void 0 !== t.hex ? this.setValueHex(t.hex) : void 0 !== t.name && this.setValueName(t.name))
}
,
Y.lang.extend(Q.asn1.DERObjectIdentifier, Q.asn1.ASN1Object),
Q.asn1.DEREnumerated = function(t) {
Q.asn1.DEREnumerated.superclass.constructor.call(this),
this.hT = "0a",
this.setByBigInteger = function(t) {
this.hTLV = null,
this.isModified = !0,
this.hV = Q.asn1.ASN1Util.bigIntToMinTwosComplementsHex(t)
}
,
this.setByInteger = function(t) {
var e = new T(String(t),10);
this.setByBigInteger(e)
}
,
this.setValueHex = function(t) {
this.hV = t
}
,
this.getFreshValueHex = function() {
return this.hV
}
,
void 0 !== t && (void 0 !== t.int ? this.setByInteger(t.int) : "number" == typeof t ? this.setByInteger(t) : void 0 !== t.hex && this.setValueHex(t.hex))
}
,
Y.lang.extend(Q.asn1.DEREnumerated, Q.asn1.ASN1Object),
Q.asn1.DERUTF8String = function(t) {
Q.asn1.DERUTF8String.superclass.constructor.call(this, t),
this.hT = "0c"
}
,
Y.lang.extend(Q.asn1.DERUTF8String, Q.asn1.DERAbstractString),
Q.asn1.DERNumericString = function(t) {
Q.asn1.DERNumericString.superclass.constructor.call(this, t),
this.hT = "12"
}
,
Y.lang.extend(Q.asn1.DERNumericString, Q.asn1.DERAbstractString),
Q.asn1.DERPrintableString = function(t) {
Q.asn1.DERPrintableString.superclass.constructor.call(this, t),
this.hT = "13"
}
,
Y.lang.extend(Q.asn1.DERPrintableString, Q.asn1.DERAbstractString),
Q.asn1.DERTeletexString = function(t) {
Q.asn1.DERTeletexString.superclass.constructor.call(this, t),
this.hT = "14"
}
,
Y.lang.extend(Q.asn1.DERTeletexString, Q.asn1.DERAbstractString),
Q.asn1.DERIA5String = function(t) {
Q.asn1.DERIA5String.superclass.constructor.call(this, t),
this.hT = "16"
}
,
Y.lang.extend(Q.asn1.DERIA5String, Q.asn1.DERAbstractString),
Q.asn1.DERUTCTime = function(t) {
Q.asn1.DERUTCTime.superclass.constructor.call(this, t),
this.hT = "17",
this.setByDate = function(t) {
this.hTLV = null,
this.isModified = !0,
this.date = t,
this.s = this.formatDate(this.date, "utc"),
this.hV = stohex(this.s)
}
,
this.getFreshValueHex = function() {
return void 0 === this.date && void 0 === this.s && (this.date = new Date,
this.s = this.formatDate(this.date, "utc"),
this.hV = stohex(this.s)),
this.hV
}
,
void 0 !== t && (void 0 !== t.str ? this.setString(t.str) : "string" == typeof t && t.match(/^[0-9]{12}Z$/) ? this.setString(t) : void 0 !== t.hex ? this.setStringHex(t.hex) : void 0 !== t.date && this.setByDate(t.date))
}
,
Y.lang.extend(Q.asn1.DERUTCTime, Q.asn1.DERAbstractTime),
Q.asn1.DERGeneralizedTime = function(t) {
Q.asn1.DERGeneralizedTime.superclass.constructor.call(this, t),
this.hT = "18",
this.withMillis = !1,
this.setByDate = function(t) {
this.hTLV = null,
this.isModified = !0,
this.date = t,
this.s = this.formatDate(this.date, "gen", this.withMillis),
this.hV = stohex(this.s)
}
,
this.getFreshValueHex = function() {
return void 0 === this.date && void 0 === this.s && (this.date = new Date,
this.s = this.formatDate(this.date, "gen", this.withMillis),
this.hV = stohex(this.s)),
this.hV
}
,
void 0 !== t && (void 0 !== t.str ? this.setString(t.str) : "string" == typeof t && t.match(/^[0-9]{14}Z$/) ? this.setString(t) : void 0 !== t.hex ? this.setStringHex(t.hex) : void 0 !== t.date && this.setByDate(t.date),
!0 === t.millis && (this.withMillis = !0))
}
,
Y.lang.extend(Q.asn1.DERGeneralizedTime, Q.asn1.DERAbstractTime),
Q.asn1.DERSequence = function(t) {
Q.asn1.DERSequence.superclass.constructor.call(this, t),
this.hT = "30",
this.getFreshValueHex = function() {
for (var t = "", e = 0; e < this.asn1Array.length; e++)
t += this.asn1Array[e].getEncodedHex();
return this.hV = t,
this.hV
}
}
,
Y.lang.extend(Q.asn1.DERSequence, Q.asn1.DERAbstractStructured),
Q.asn1.DERSet = function(t) {
Q.asn1.DERSet.superclass.constructor.call(this, t),
this.hT = "31",
this.sortFlag = !0,
this.getFreshValueHex = function() {
for (var t = new Array, e = 0; e < this.asn1Array.length; e++) {
var n = this.asn1Array[e];
t.push(n.getEncodedHex())
}
return 1 == this.sortFlag && t.sort(),
this.hV = t.join(""),
this.hV
}
,
void 0 !== t && void 0 !== t.sortflag && 0 == t.sortflag && (this.sortFlag = !1)
}
,
Y.lang.extend(Q.asn1.DERSet, Q.asn1.DERAbstractStructured),
Q.asn1.DERTaggedObject = function(t) {
Q.asn1.DERTaggedObject.superclass.constructor.call(this),
this.hT = "a0",
this.hV = "",
this.isExplicit = !0,
this.asn1Object = null,
this.setASN1Object = function(t, e, n) {
this.hT = e,
this.isExplicit = t,
this.asn1Object = n,
this.isExplicit ? (this.hV = this.asn1Object.getEncodedHex(),
this.hTLV = null,
this.isModified = !0) : (this.hV = null,
this.hTLV = n.getEncodedHex(),
this.hTLV = this.hTLV.replace(/^../, e),
this.isModified = !1)
}
,
this.getFreshValueHex = function() {
return this.hV
}
,
void 0 !== t && (void 0 !== t.tag && (this.hT = t.tag),
void 0 !== t.explicit && (this.isExplicit = t.explicit),
void 0 !== t.obj && (this.asn1Object = t.obj,
this.setASN1Object(this.isExplicit, this.hT, this.asn1Object)))
}
,
Y.lang.extend(Q.asn1.DERTaggedObject, Q.asn1.ASN1Object);
var $ = function(t) {
function e(n) {
var r = t.call(this) || this;
return n && ("string" == typeof n ? r.parseKey(n) : (e.hasPrivateKeyProperty(n) || e.hasPublicKeyProperty(n)) && r.parsePropertiesFrom(n)),
r
}
return function(t, e) {
function n() {
this.constructor = t
}
h(t, e),
t.prototype = null === e ? Object.create(e) : (n.prototype = e.prototype,
new n)
}(e, t),
e.prototype.parseKey = function(t) {
try {
var e = 0
, n = 0
, r = /^\s*(?:[0-9A-Fa-f][0-9A-Fa-f]\s*)+$/.test(t) ? d(t) : v.unarmor(t)
, o = S.decode(r);
if (3 === o.sub.length && (o = o.sub[2].sub[0]),
9 === o.sub.length) {
e = o.sub[1].getHexStringValue(),
this.n = I(e, 16),
n = o.sub[2].getHexStringValue(),
this.e = parseInt(n, 16);
var i = o.sub[3].getHexStringValue();
this.d = I(i, 16);
var a = o.sub[4].getHexStringValue();
this.p = I(a, 16);
var u = o.sub[5].getHexStringValue();
this.q = I(u, 16);
var c = o.sub[6].getHexStringValue();
this.dmp1 = I(c, 16);
var s = o.sub[7].getHexStringValue();
this.dmq1 = I(s, 16);
var l = o.sub[8].getHexStringValue();
this.coeff = I(l, 16)
} else {
if (2 !== o.sub.length)
return !1;
var f = o.sub[1].sub[0];
e = f.sub[0].getHexStringValue(),
this.n = I(e, 16),
n = f.sub[1].getHexStringValue(),
this.e = parseInt(n, 16)
}
return !0
} catch (t) {
return !1
}
}
,
e.prototype.getPrivateBaseKey = function() {
var t = {
array: [new Q.asn1.DERInteger({
int: 0
}), new Q.asn1.DERInteger({
bigint: this.n
}), new Q.asn1.DERInteger({
int: this.e
}), new Q.asn1.DERInteger({
bigint: this.d
}), new Q.asn1.DERInteger({
bigint: this.p
}), new Q.asn1.DERInteger({
bigint: this.q
}), new Q.asn1.DERInteger({
bigint: this.dmp1
}), new Q.asn1.DERInteger({
bigint: this.dmq1
}), new Q.asn1.DERInteger({
bigint: this.coeff
})]
};
return new Q.asn1.DERSequence(t).getEncodedHex()
}
,
e.prototype.getPrivateBaseKeyB64 = function() {
return s(this.getPrivateBaseKey())
}
,
e.prototype.getPublicBaseKey = function() {
var t = new Q.asn1.DERSequence({
array: [new Q.asn1.DERObjectIdentifier({
oid: "1.2.840.113549.1.1.1"
}), new Q.asn1.DERNull]
})
, e = new Q.asn1.DERSequence({
array: [new Q.asn1.DERInteger({
bigint: this.n
}), new Q.asn1.DERInteger({
int: this.e
})]
})
, n = new Q.asn1.DERBitString({
hex: "00" + e.getEncodedHex()
});
return new Q.asn1.DERSequence({
array: [t, n]
}).getEncodedHex()
}
,
e.prototype.getPublicBaseKeyB64 = function() {
return s(this.getPublicBaseKey())
}
,
e.wordwrap = function(t, e) {
if (!t)
return t;
var n = "(.{1," + (e = e || 64) + "})( +|$\n?)|(.{1," + e + "})";
return t.match(RegExp(n, "g")).join("\n")
}
,
e.prototype.getPrivateKey = function() {
var t = "-----BEGIN RSA PRIVATE KEY-----\n";
return t += e.wordwrap(this.getPrivateBaseKeyB64()) + "\n",
t += "-----END RSA PRIVATE KEY-----"
}
,
e.prototype.getPublicKey = function() {
var t = "-----BEGIN PUBLIC KEY-----\n";
return t += e.wordwrap(this.getPublicBaseKeyB64()) + "\n",
t += "-----END PUBLIC KEY-----"
}
,
e.hasPublicKeyProperty = function(t) {
return (t = t || {}).hasOwnProperty("n") && t.hasOwnProperty("e")
}
,
e.hasPrivateKeyProperty = function(t) {
return (t = t || {}).hasOwnProperty("n") && t.hasOwnProperty("e") && t.hasOwnProperty("d") && t.hasOwnProperty("p") && t.hasOwnProperty("q") && t.hasOwnProperty("dmp1") && t.hasOwnProperty("dmq1") && t.hasOwnProperty("coeff")
}
,
e.prototype.parsePropertiesFrom = function(t) {
this.n = t.n,
this.e = t.e,
t.hasOwnProperty("d") && (this.d = t.d,
this.p = t.p,
this.q = t.q,
this.dmp1 = t.dmp1,
this.dmq1 = t.dmq1,
this.coeff = t.coeff)
}
,
e
}(J)
, tt = function() {
function t(t) {
t = t || {},
this.default_key_size = parseInt(t.default_key_size, 10) || 1024,
this.default_public_exponent = t.default_public_exponent || "010001",
this.log = t.log || !1,
this.key = null
}
return t.prototype.setKey = function(t) {
this.log && this.key,
this.key = new $(t)
}
,
t.prototype.setPrivateKey = function(t) {
this.setKey(t)
}
,
t.prototype.setPublicKey = function(t) {
this.setKey(t)
}
,
t.prototype.decrypt = function(t) {
try {
return this.getKey().decrypt(l(t))
} catch (t) {
return !1
}
}
,
t.prototype.encrypt = function(t) {
try {
return s(this.getKey().encrypt(t))
} catch (t) {
return !1
}
}
,
t.prototype.sign = function(t, e, n) {
try {
return s(this.getKey().sign(t, e, n))
} catch (t) {
return !1
}
}
,
t.prototype.verify = function(t, e, n) {
try {
return this.getKey().verify(t, l(e), n)
} catch (t) {
return !1
}
}
,
t.prototype.getKey = function(t) {
if (!this.key) {
if (this.key = new $,
t && "[object Function]" === {}.toString.call(t))
return void this.key.generateAsync(this.default_key_size, this.default_public_exponent, t);
this.key.generate(this.default_key_size, this.default_public_exponent)
}
return this.key
}
,
t.prototype.getPrivateKey = function() {
return this.getKey().getPrivateKey()
}
,
t.prototype.getPrivateKeyB64 = function() {
return this.getKey().getPrivateBaseKeyB64()
}
,
t.prototype.getPublicKey = function() {
return this.getKey().getPublicKey()
}
,
t.prototype.getPublicKeyB64 = function() {
return this.getKey().getPublicBaseKeyB64()
}
,
t.version = "3.0.0-rc.1",
lwd=t
}();
}()
function getp(pwd){
var n = new lwd;
// console.log(n)
return n.setPublicKey("\n MIGfMA0GCSqGSIb3DQEBAQUAA4GNADCBiQKBgQCCAGUAYFFTqlMwndAkJbO6GoOi\n PTPMreeYJ6JfWbx5rliI4PevlmMZNISOtmZm6Sv44wlA4l+1y1wqAE31jPhH2bZ2\n qqbJdiPB7VXpR5nQeSZGcNCSCK7N62A5b8ssEjbWd5jMBiqD/erLkc87/jQ0iqd3\n 42Oixc9y4LFn//ABWwIDAQAB\n"),
n.encrypt(pwd)
}
console.log(getp('123456')) |
|
[复制链接]
粤公网安备 44522102000125 增值电信业务经营许可证 粤B2-20192173
主题置顶卡
沉默卡
变色卡
楼主
扫一扫，关注易界动态