module-develop-kit 0.3.0 → 0.3.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/index.d.ts +67 -0
- package/dist/index.es.js +684 -671
- package/dist/index.umd.js +3 -3
- package/package.json +1 -1
package/dist/index.es.js
CHANGED
|
@@ -1,33 +1,33 @@
|
|
|
1
1
|
var nr = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
|
|
2
|
-
function
|
|
2
|
+
function Je(y) {
|
|
3
3
|
return y && y.__esModule && Object.prototype.hasOwnProperty.call(y, "default") ? y.default : y;
|
|
4
4
|
}
|
|
5
|
-
function
|
|
5
|
+
function tx(y) {
|
|
6
6
|
if (Object.prototype.hasOwnProperty.call(y, "__esModule")) return y;
|
|
7
|
-
var
|
|
8
|
-
if (typeof
|
|
9
|
-
var E = function
|
|
10
|
-
return this instanceof
|
|
7
|
+
var z = y.default;
|
|
8
|
+
if (typeof z == "function") {
|
|
9
|
+
var E = function a() {
|
|
10
|
+
return this instanceof a ? Reflect.construct(z, arguments, this.constructor) : z.apply(this, arguments);
|
|
11
11
|
};
|
|
12
|
-
E.prototype =
|
|
12
|
+
E.prototype = z.prototype;
|
|
13
13
|
} else E = {};
|
|
14
|
-
return Object.defineProperty(E, "__esModule", { value: !0 }), Object.keys(y).forEach(function(
|
|
15
|
-
var g = Object.getOwnPropertyDescriptor(y,
|
|
16
|
-
Object.defineProperty(E,
|
|
14
|
+
return Object.defineProperty(E, "__esModule", { value: !0 }), Object.keys(y).forEach(function(a) {
|
|
15
|
+
var g = Object.getOwnPropertyDescriptor(y, a);
|
|
16
|
+
Object.defineProperty(E, a, g.get ? g : {
|
|
17
17
|
enumerable: !0,
|
|
18
18
|
get: function() {
|
|
19
|
-
return y[
|
|
19
|
+
return y[a];
|
|
20
20
|
}
|
|
21
21
|
});
|
|
22
22
|
}), E;
|
|
23
23
|
}
|
|
24
|
-
var
|
|
25
|
-
function
|
|
26
|
-
if (
|
|
27
|
-
|
|
28
|
-
for (var y = [],
|
|
29
|
-
y[g] =
|
|
30
|
-
|
|
24
|
+
var W0 = {}, mr;
|
|
25
|
+
function rx() {
|
|
26
|
+
if (mr) return W0;
|
|
27
|
+
mr = 1, W0.byteLength = o, W0.toByteArray = r, W0.fromByteArray = f;
|
|
28
|
+
for (var y = [], z = [], E = typeof Uint8Array < "u" ? Uint8Array : Array, a = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", g = 0, B = a.length; g < B; ++g)
|
|
29
|
+
y[g] = a[g], z[a.charCodeAt(g)] = g;
|
|
30
|
+
z[45] = 62, z[95] = 63;
|
|
31
31
|
function m(l) {
|
|
32
32
|
var u = l.length;
|
|
33
33
|
if (u % 4 > 0)
|
|
@@ -47,8 +47,8 @@ function tx() {
|
|
|
47
47
|
function r(l) {
|
|
48
48
|
var u, F = m(l), i = F[0], p = F[1], x = new E(v(l, i, p)), n = 0, h = p > 0 ? i - 4 : i, d;
|
|
49
49
|
for (d = 0; d < h; d += 4)
|
|
50
|
-
u =
|
|
51
|
-
return p === 2 && (u =
|
|
50
|
+
u = z[l.charCodeAt(d)] << 18 | z[l.charCodeAt(d + 1)] << 12 | z[l.charCodeAt(d + 2)] << 6 | z[l.charCodeAt(d + 3)], x[n++] = u >> 16 & 255, x[n++] = u >> 8 & 255, x[n++] = u & 255;
|
|
51
|
+
return p === 2 && (u = z[l.charCodeAt(d)] << 2 | z[l.charCodeAt(d + 1)] >> 4, x[n++] = u & 255), p === 1 && (u = z[l.charCodeAt(d)] << 10 | z[l.charCodeAt(d + 1)] << 4 | z[l.charCodeAt(d + 2)] >> 2, x[n++] = u >> 8 & 255, x[n++] = u & 255), x;
|
|
52
52
|
}
|
|
53
53
|
function s(l) {
|
|
54
54
|
return y[l >> 18 & 63] + y[l >> 12 & 63] + y[l >> 6 & 63] + y[l & 63];
|
|
@@ -58,7 +58,7 @@ function tx() {
|
|
|
58
58
|
i = (l[x] << 16 & 16711680) + (l[x + 1] << 8 & 65280) + (l[x + 2] & 255), p.push(s(i));
|
|
59
59
|
return p.join("");
|
|
60
60
|
}
|
|
61
|
-
function
|
|
61
|
+
function f(l) {
|
|
62
62
|
for (var u, F = l.length, i = F % 3, p = [], x = 16383, n = 0, h = F - i; n < h; n += x)
|
|
63
63
|
p.push(C(l, n, n + x > h ? h : n + x));
|
|
64
64
|
return i === 1 ? (u = l[F - 1], p.push(
|
|
@@ -67,18 +67,18 @@ function tx() {
|
|
|
67
67
|
y[u >> 10] + y[u >> 4 & 63] + y[u << 2 & 63] + "="
|
|
68
68
|
)), p.join("");
|
|
69
69
|
}
|
|
70
|
-
return
|
|
70
|
+
return W0;
|
|
71
71
|
}
|
|
72
|
-
const
|
|
72
|
+
const ex = {}, xx = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
73
73
|
__proto__: null,
|
|
74
|
-
default:
|
|
75
|
-
}, Symbol.toStringTag, { value: "Module" })), pr = /* @__PURE__ */
|
|
76
|
-
var ir,
|
|
77
|
-
function
|
|
78
|
-
if (
|
|
79
|
-
|
|
80
|
-
const y =
|
|
81
|
-
class
|
|
74
|
+
default: ex
|
|
75
|
+
}, Symbol.toStringTag, { value: "Module" })), pr = /* @__PURE__ */ tx(xx);
|
|
76
|
+
var ir, _r;
|
|
77
|
+
function nx() {
|
|
78
|
+
if (_r) return ir;
|
|
79
|
+
_r = 1;
|
|
80
|
+
const y = rx();
|
|
81
|
+
class z {
|
|
82
82
|
/**
|
|
83
83
|
* Converts a JS string to an UTF-8 uint8array.
|
|
84
84
|
*
|
|
@@ -87,9 +87,9 @@ function xx() {
|
|
|
87
87
|
* @return {Uint8Array} UTF-8 Uint8Array.
|
|
88
88
|
* @memberof Crypt
|
|
89
89
|
*/
|
|
90
|
-
static stringToArrayBufferInUtf8(
|
|
90
|
+
static stringToArrayBufferInUtf8(a) {
|
|
91
91
|
const g = typeof window > "u" ? pr.TextEncoder : window.TextEncoder;
|
|
92
|
-
return new g().encode(
|
|
92
|
+
return new g().encode(a);
|
|
93
93
|
}
|
|
94
94
|
/**
|
|
95
95
|
* Converts an UTF-8 uint8array to a JS string.
|
|
@@ -99,9 +99,9 @@ function xx() {
|
|
|
99
99
|
* @return {String} 16-bit unicode string.
|
|
100
100
|
* @memberof Crypt
|
|
101
101
|
*/
|
|
102
|
-
static utf8ArrayBufferToString(
|
|
102
|
+
static utf8ArrayBufferToString(a) {
|
|
103
103
|
const g = typeof window > "u" ? pr.TextDecoder : window.TextDecoder;
|
|
104
|
-
return new g("utf-8").decode(
|
|
104
|
+
return new g("utf-8").decode(a);
|
|
105
105
|
}
|
|
106
106
|
/**
|
|
107
107
|
* crypt a utf8 byteArray to base64 string
|
|
@@ -111,8 +111,8 @@ function xx() {
|
|
|
111
111
|
* @returns {String} base64 str
|
|
112
112
|
* @memberof Crypt
|
|
113
113
|
*/
|
|
114
|
-
static arrayBufferToBase64(
|
|
115
|
-
return y.fromByteArray(
|
|
114
|
+
static arrayBufferToBase64(a) {
|
|
115
|
+
return y.fromByteArray(a);
|
|
116
116
|
}
|
|
117
117
|
/**
|
|
118
118
|
* crypt base64 stringa to utf8 byteArray
|
|
@@ -122,17 +122,17 @@ function xx() {
|
|
|
122
122
|
* @returns {Uint8Array} strBuffer UTF-8 Uint8Array.
|
|
123
123
|
* @memberof Crypt
|
|
124
124
|
*/
|
|
125
|
-
static base64ToArrayBuffer(
|
|
126
|
-
return y.toByteArray(
|
|
125
|
+
static base64ToArrayBuffer(a) {
|
|
126
|
+
return y.toByteArray(a);
|
|
127
127
|
}
|
|
128
128
|
}
|
|
129
|
-
return ir =
|
|
129
|
+
return ir = z, ir;
|
|
130
130
|
}
|
|
131
|
-
var or,
|
|
132
|
-
function
|
|
133
|
-
if (
|
|
134
|
-
|
|
135
|
-
const y =
|
|
131
|
+
var or, wr;
|
|
132
|
+
function ix() {
|
|
133
|
+
if (wr) return or;
|
|
134
|
+
wr = 1;
|
|
135
|
+
const y = nx(), z = 16, E = Uint8Array.from([
|
|
136
136
|
214,
|
|
137
137
|
144,
|
|
138
138
|
233,
|
|
@@ -389,7 +389,7 @@ function nx() {
|
|
|
389
389
|
203,
|
|
390
390
|
57,
|
|
391
391
|
72
|
|
392
|
-
]),
|
|
392
|
+
]), a = Uint32Array.from([
|
|
393
393
|
462357,
|
|
394
394
|
472066609,
|
|
395
395
|
943670861,
|
|
@@ -473,7 +473,7 @@ function nx() {
|
|
|
473
473
|
let v = new Uint32Array(36);
|
|
474
474
|
v[0] = o[0] ^ g[0], v[1] = o[1] ^ g[1], v[2] = o[2] ^ g[2], v[3] = o[3] ^ g[3];
|
|
475
475
|
for (let r = 0; r < 32; r++)
|
|
476
|
-
v[r + 4] = v[r] ^ this.tTransform2(v[r + 1] ^ v[r + 2] ^ v[r + 3] ^
|
|
476
|
+
v[r + 4] = v[r] ^ this.tTransform2(v[r + 1] ^ v[r + 2] ^ v[r + 3] ^ a[r]), this.encryptRoundKeys[r] = v[r + 4];
|
|
477
477
|
}
|
|
478
478
|
/**
|
|
479
479
|
* left rotate x by y bits
|
|
@@ -548,7 +548,7 @@ function nx() {
|
|
|
548
548
|
padding(o) {
|
|
549
549
|
if (o === null)
|
|
550
550
|
return null;
|
|
551
|
-
let v =
|
|
551
|
+
let v = z - o.length % z, r = new Uint8Array(o.length + v);
|
|
552
552
|
return r.set(o, 0), r.fill(v, o.length), r;
|
|
553
553
|
}
|
|
554
554
|
/**
|
|
@@ -584,23 +584,23 @@ function nx() {
|
|
|
584
584
|
* @return {String} ciphertext
|
|
585
585
|
*/
|
|
586
586
|
encrypt(o) {
|
|
587
|
-
let v = y.stringToArrayBufferInUtf8(o), r = this.padding(v), s = r.length /
|
|
587
|
+
let v = y.stringToArrayBufferInUtf8(o), r = this.padding(v), s = r.length / z, C = new Uint8Array(r.length);
|
|
588
588
|
if (this.mode === "cbc") {
|
|
589
589
|
if (this.iv === null || this.iv.length !== 16)
|
|
590
590
|
throw new Error("iv error");
|
|
591
|
-
let
|
|
591
|
+
let f = this.uint8ToUint32Block(this.iv);
|
|
592
592
|
for (let l = 0; l < s; l++) {
|
|
593
|
-
let u = l *
|
|
594
|
-
|
|
595
|
-
let i = this.doBlockCrypt(
|
|
596
|
-
|
|
597
|
-
for (let p = 0; p <
|
|
593
|
+
let u = l * z, F = this.uint8ToUint32Block(r, u);
|
|
594
|
+
f[0] = f[0] ^ F[0], f[1] = f[1] ^ F[1], f[2] = f[2] ^ F[2], f[3] = f[3] ^ F[3];
|
|
595
|
+
let i = this.doBlockCrypt(f, this.encryptRoundKeys);
|
|
596
|
+
f = i;
|
|
597
|
+
for (let p = 0; p < z; p++)
|
|
598
598
|
C[u + p] = i[parseInt(p / 4)] >> (3 - p) % 4 * 8 & 255;
|
|
599
599
|
}
|
|
600
600
|
} else
|
|
601
|
-
for (let
|
|
602
|
-
let l =
|
|
603
|
-
for (let i = 0; i <
|
|
601
|
+
for (let f = 0; f < s; f++) {
|
|
602
|
+
let l = f * z, u = this.uint8ToUint32Block(r, l), F = this.doBlockCrypt(u, this.encryptRoundKeys);
|
|
603
|
+
for (let i = 0; i < z; i++)
|
|
604
604
|
C[l + i] = F[parseInt(i / 4)] >> (3 - i) % 4 * 8 & 255;
|
|
605
605
|
}
|
|
606
606
|
return this.cipherType === "base64" ? y.arrayBufferToBase64(C) : y.utf8ArrayBufferToString(C);
|
|
@@ -614,21 +614,21 @@ function nx() {
|
|
|
614
614
|
decrypt(o) {
|
|
615
615
|
let v = new Uint8Array();
|
|
616
616
|
this.cipherType === "base64" ? v = y.base64ToArrayBuffer(o) : v = y.stringToArrayBufferInUtf8(o);
|
|
617
|
-
let r = v.length /
|
|
617
|
+
let r = v.length / z, s = new Uint8Array(v.length);
|
|
618
618
|
if (this.mode === "cbc") {
|
|
619
619
|
if (this.iv === null || this.iv.length !== 16)
|
|
620
620
|
throw new Error("iv error");
|
|
621
|
-
let
|
|
621
|
+
let f = this.uint8ToUint32Block(this.iv);
|
|
622
622
|
for (let l = 0; l < r; l++) {
|
|
623
|
-
let u = l *
|
|
624
|
-
p[0] =
|
|
625
|
-
for (let x = 0; x <
|
|
623
|
+
let u = l * z, F = this.uint8ToUint32Block(v, u), i = this.doBlockCrypt(F, this.decryptRoundKeys), p = new Uint32Array(4);
|
|
624
|
+
p[0] = f[0] ^ i[0], p[1] = f[1] ^ i[1], p[2] = f[2] ^ i[2], p[3] = f[3] ^ i[3], f = F;
|
|
625
|
+
for (let x = 0; x < z; x++)
|
|
626
626
|
s[u + x] = p[parseInt(x / 4)] >> (3 - x) % 4 * 8 & 255;
|
|
627
627
|
}
|
|
628
628
|
} else
|
|
629
|
-
for (let
|
|
630
|
-
let l =
|
|
631
|
-
for (let i = 0; i <
|
|
629
|
+
for (let f = 0; f < r; f++) {
|
|
630
|
+
let l = f * z, u = this.uint8ToUint32Block(v, l), F = this.doBlockCrypt(u, this.decryptRoundKeys);
|
|
631
|
+
for (let i = 0; i < z; i++)
|
|
632
632
|
s[l + i] = F[parseInt(i / 4)] >> (3 - i) % 4 * 8 & 255;
|
|
633
633
|
}
|
|
634
634
|
let C = this.dePadding(s);
|
|
@@ -637,17 +637,17 @@ function nx() {
|
|
|
637
637
|
}
|
|
638
638
|
return or = B, or;
|
|
639
639
|
}
|
|
640
|
-
var sr,
|
|
641
|
-
function
|
|
642
|
-
return
|
|
643
|
-
sm4:
|
|
640
|
+
var sr, Tr;
|
|
641
|
+
function ox() {
|
|
642
|
+
return Tr || (Tr = 1, sr = {
|
|
643
|
+
sm4: ix()
|
|
644
644
|
}), sr;
|
|
645
645
|
}
|
|
646
|
-
var
|
|
646
|
+
var Fr = ox(), nt = { exports: {} }, sx = nt.exports, Sr;
|
|
647
647
|
function Mt() {
|
|
648
|
-
return
|
|
648
|
+
return Sr || (Sr = 1, function(y, z) {
|
|
649
649
|
(function() {
|
|
650
|
-
var E,
|
|
650
|
+
var E, a = 244837814094590, g = (a & 16777215) == 15715070;
|
|
651
651
|
function B(t, e, c) {
|
|
652
652
|
t != null && (typeof t == "number" ? this.fromNumber(t, e, c) : e == null && typeof t != "string" ? this.fromString(t, 256) : this.fromString(t, e));
|
|
653
653
|
}
|
|
@@ -679,12 +679,12 @@ function Mt() {
|
|
|
679
679
|
s && g && navigator.appName == "Microsoft Internet Explorer" ? (B.prototype.am = v, E = 30) : s && g && navigator.appName != "Netscape" ? (B.prototype.am = o, E = 26) : (B.prototype.am = r, E = 28), B.prototype.DB = E, B.prototype.DM = (1 << E) - 1, B.prototype.DV = 1 << E;
|
|
680
680
|
var C = 52;
|
|
681
681
|
B.prototype.FV = Math.pow(2, C), B.prototype.F1 = C - E, B.prototype.F2 = 2 * E - C;
|
|
682
|
-
var
|
|
682
|
+
var f = "0123456789abcdefghijklmnopqrstuvwxyz", l = new Array(), u, F;
|
|
683
683
|
for (u = 48, F = 0; F <= 9; ++F) l[u++] = F;
|
|
684
684
|
for (u = 97, F = 10; F < 36; ++F) l[u++] = F;
|
|
685
685
|
for (u = 65, F = 10; F < 36; ++F) l[u++] = F;
|
|
686
686
|
function i(t) {
|
|
687
|
-
return
|
|
687
|
+
return f.charAt(t);
|
|
688
688
|
}
|
|
689
689
|
function p(t, e) {
|
|
690
690
|
var c = l[t.charCodeAt(e)];
|
|
@@ -835,12 +835,12 @@ function Mt() {
|
|
|
835
835
|
J > 0 ? (b.lShiftTo(J, L), P.lShiftTo(J, c)) : (b.copyTo(L), P.copyTo(c));
|
|
836
836
|
var r0 = L.t, l0 = L[r0 - 1];
|
|
837
837
|
if (l0 != 0) {
|
|
838
|
-
var u0 = l0 * (1 << this.F1) + (r0 > 1 ? L[r0 - 2] >> this.F2 : 0),
|
|
839
|
-
for (L.dlShiftTo(xt,
|
|
838
|
+
var u0 = l0 * (1 << this.F1) + (r0 > 1 ? L[r0 - 2] >> this.F2 : 0), A0 = this.FV / u0, et = (1 << this.F1) / u0, d0 = 1 << this.F2, p0 = c.t, xt = p0 - r0, g0 = e ?? m();
|
|
839
|
+
for (L.dlShiftTo(xt, g0), c.compareTo(g0) >= 0 && (c[c.t++] = 1, c.subTo(g0, c)), B.ONE.dlShiftTo(r0, g0), g0.subTo(L, L); L.t < r0; ) L[L.t++] = 0;
|
|
840
840
|
for (; --xt >= 0; ) {
|
|
841
|
-
var xr = c[--p0] == l0 ? this.DM : Math.floor(c[p0] *
|
|
841
|
+
var xr = c[--p0] == l0 ? this.DM : Math.floor(c[p0] * A0 + (c[p0 - 1] + d0) * et);
|
|
842
842
|
if ((c[p0] += L.am(0, xr, c, xt, 0, r0)) < xr)
|
|
843
|
-
for (L.dlShiftTo(xt,
|
|
843
|
+
for (L.dlShiftTo(xt, g0), c.subTo(g0, c); c[p0] < --xr; ) c.subTo(g0, c);
|
|
844
844
|
}
|
|
845
845
|
e != null && (c.drShiftTo(r0, e), M != N && B.ZERO.subTo(e, e)), c.t = r0, c.clamp(), J > 0 && c.rShiftTo(J, c), M < 0 && B.ZERO.subTo(c, c);
|
|
846
846
|
}
|
|
@@ -856,7 +856,7 @@ function Mt() {
|
|
|
856
856
|
function O(t) {
|
|
857
857
|
return t.s < 0 || t.compareTo(this.m) >= 0 ? t.mod(this.m) : t;
|
|
858
858
|
}
|
|
859
|
-
function
|
|
859
|
+
function I(t) {
|
|
860
860
|
return t;
|
|
861
861
|
}
|
|
862
862
|
function Q(t) {
|
|
@@ -868,7 +868,7 @@ function Mt() {
|
|
|
868
868
|
function x0(t, e) {
|
|
869
869
|
t.squareTo(e), this.reduce(e);
|
|
870
870
|
}
|
|
871
|
-
R.prototype.convert = O, R.prototype.revert =
|
|
871
|
+
R.prototype.convert = O, R.prototype.revert = I, R.prototype.reduce = Q, R.prototype.mulTo = Y, R.prototype.sqrTo = x0;
|
|
872
872
|
function K() {
|
|
873
873
|
if (this.t < 1) return 0;
|
|
874
874
|
var t = this[0];
|
|
@@ -879,15 +879,15 @@ function Mt() {
|
|
|
879
879
|
function a0(t) {
|
|
880
880
|
this.m = t, this.mp = t.invDigit(), this.mpl = this.mp & 32767, this.mph = this.mp >> 15, this.um = (1 << t.DB - 15) - 1, this.mt2 = 2 * t.t;
|
|
881
881
|
}
|
|
882
|
-
function
|
|
882
|
+
function E0(t) {
|
|
883
883
|
var e = m();
|
|
884
884
|
return t.abs().dlShiftTo(this.m.t, e), e.divRemTo(this.m, null, e), t.s < 0 && e.compareTo(B.ZERO) > 0 && this.m.subTo(e, e), e;
|
|
885
885
|
}
|
|
886
|
-
function
|
|
886
|
+
function O0(t) {
|
|
887
887
|
var e = m();
|
|
888
888
|
return t.copyTo(e), this.reduce(e), e;
|
|
889
889
|
}
|
|
890
|
-
function
|
|
890
|
+
function m0(t) {
|
|
891
891
|
for (; t.t <= this.mt2; )
|
|
892
892
|
t[t.t++] = 0;
|
|
893
893
|
for (var e = 0; e < this.m.t; ++e) {
|
|
@@ -903,11 +903,11 @@ function Mt() {
|
|
|
903
903
|
function n0(t, e, c) {
|
|
904
904
|
t.multiplyTo(e, c), this.reduce(c);
|
|
905
905
|
}
|
|
906
|
-
a0.prototype.convert =
|
|
907
|
-
function
|
|
906
|
+
a0.prototype.convert = E0, a0.prototype.revert = O0, a0.prototype.reduce = m0, a0.prototype.mulTo = n0, a0.prototype.sqrTo = f0;
|
|
907
|
+
function P0() {
|
|
908
908
|
return (this.t > 0 ? this[0] & 1 : this.s) == 0;
|
|
909
909
|
}
|
|
910
|
-
function
|
|
910
|
+
function _0(t, e) {
|
|
911
911
|
if (t > 4294967295 || t < 1) return B.ONE;
|
|
912
912
|
var c = m(), b = m(), P = e.convert(this), L = _(t) - 1;
|
|
913
913
|
for (P.copyTo(c); --L >= 0; )
|
|
@@ -918,16 +918,16 @@ function Mt() {
|
|
|
918
918
|
}
|
|
919
919
|
return e.revert(c);
|
|
920
920
|
}
|
|
921
|
-
function
|
|
921
|
+
function z0(t, e) {
|
|
922
922
|
var c;
|
|
923
923
|
return t < 256 || e.isEven() ? c = new R(e) : c = new a0(e), this.exp(t, c);
|
|
924
924
|
}
|
|
925
|
-
B.prototype.copyTo = x, B.prototype.fromInt = n, B.prototype.fromString = d, B.prototype.clamp = A, B.prototype.dlShiftTo = k, B.prototype.drShiftTo = U, B.prototype.lShiftTo = W, B.prototype.rShiftTo = $, B.prototype.subTo = V, B.prototype.multiplyTo = X, B.prototype.squareTo = G, B.prototype.divRemTo = Z, B.prototype.invDigit = K, B.prototype.isEven =
|
|
926
|
-
function
|
|
925
|
+
B.prototype.copyTo = x, B.prototype.fromInt = n, B.prototype.fromString = d, B.prototype.clamp = A, B.prototype.dlShiftTo = k, B.prototype.drShiftTo = U, B.prototype.lShiftTo = W, B.prototype.rShiftTo = $, B.prototype.subTo = V, B.prototype.multiplyTo = X, B.prototype.squareTo = G, B.prototype.divRemTo = Z, B.prototype.invDigit = K, B.prototype.isEven = P0, B.prototype.exp = _0, B.prototype.toString = w, B.prototype.negate = T, B.prototype.abs = q, B.prototype.compareTo = D, B.prototype.bitLength = S, B.prototype.mod = H, B.prototype.modPowInt = z0, B.ZERO = h(0), B.ONE = h(1);
|
|
926
|
+
function w0() {
|
|
927
927
|
var t = m();
|
|
928
928
|
return this.copyTo(t), t;
|
|
929
929
|
}
|
|
930
|
-
function
|
|
930
|
+
function U0() {
|
|
931
931
|
if (this.s < 0) {
|
|
932
932
|
if (this.t == 1) return this[0] - this.DV;
|
|
933
933
|
if (this.t == 0) return -1;
|
|
@@ -937,7 +937,7 @@ function Mt() {
|
|
|
937
937
|
}
|
|
938
938
|
return (this[1] & (1 << 32 - this.DB) - 1) << this.DB | this[0];
|
|
939
939
|
}
|
|
940
|
-
function
|
|
940
|
+
function T0() {
|
|
941
941
|
return this.t == 0 ? this.s : this[0] << 24 >> 24;
|
|
942
942
|
}
|
|
943
943
|
function c0() {
|
|
@@ -946,10 +946,10 @@ function Mt() {
|
|
|
946
946
|
function s0(t) {
|
|
947
947
|
return Math.floor(Math.LN2 * this.DB / Math.log(t));
|
|
948
948
|
}
|
|
949
|
-
function
|
|
949
|
+
function F0() {
|
|
950
950
|
return this.s < 0 ? -1 : this.t <= 0 || this.t == 1 && this[0] <= 0 ? 0 : 1;
|
|
951
951
|
}
|
|
952
|
-
function
|
|
952
|
+
function I0(t) {
|
|
953
953
|
if (t == null && (t = 10), this.signum() == 0 || t < 2 || t > 36) return "0";
|
|
954
954
|
var e = this.chunkSize(t), c = Math.pow(t, e), b = h(c), P = m(), L = m(), M = "";
|
|
955
955
|
for (this.divRemTo(b, P, L); P.signum() > 0; )
|
|
@@ -968,18 +968,18 @@ function Mt() {
|
|
|
968
968
|
}
|
|
969
969
|
L > 0 && (this.dMultiply(Math.pow(e, L)), this.dAddOffset(M, 0)), P && B.ZERO.subTo(this, this);
|
|
970
970
|
}
|
|
971
|
-
function
|
|
971
|
+
function y0(t, e, c) {
|
|
972
972
|
if (typeof e == "number")
|
|
973
973
|
if (t < 2) this.fromInt(1);
|
|
974
974
|
else
|
|
975
|
-
for (this.fromNumber(t, c), this.testBit(t - 1) || this.bitwiseTo(B.ONE.shiftLeft(t - 1),
|
|
975
|
+
for (this.fromNumber(t, c), this.testBit(t - 1) || this.bitwiseTo(B.ONE.shiftLeft(t - 1), L0, this), this.isEven() && this.dAddOffset(1, 0); !this.isProbablePrime(e); )
|
|
976
976
|
this.dAddOffset(2, 0), this.bitLength() > t && this.subTo(B.ONE.shiftLeft(t - 1), this);
|
|
977
977
|
else {
|
|
978
978
|
var b = new Array(), P = t & 7;
|
|
979
979
|
b.length = (t >> 3) + 1, e.nextBytes(b), P > 0 ? b[0] &= (1 << P) - 1 : b[0] = 0, this.fromString(b, 256);
|
|
980
980
|
}
|
|
981
981
|
}
|
|
982
|
-
function
|
|
982
|
+
function S0() {
|
|
983
983
|
var t = this.t, e = new Array();
|
|
984
984
|
e[0] = this.s;
|
|
985
985
|
var c = this.DB - t * this.DB % 8, b, P = 0;
|
|
@@ -997,7 +997,7 @@ function Mt() {
|
|
|
997
997
|
function V0(t) {
|
|
998
998
|
return this.compareTo(t) > 0 ? this : t;
|
|
999
999
|
}
|
|
1000
|
-
function
|
|
1000
|
+
function D0(t, e, c) {
|
|
1001
1001
|
var b, P, L = Math.min(t.t, this.t);
|
|
1002
1002
|
for (b = 0; b < L; ++b) c[b] = e(this[b], t[b]);
|
|
1003
1003
|
if (t.t < this.t) {
|
|
@@ -1009,19 +1009,19 @@ function Mt() {
|
|
|
1009
1009
|
}
|
|
1010
1010
|
c.s = e(this.s, t.s), c.clamp();
|
|
1011
1011
|
}
|
|
1012
|
-
function
|
|
1012
|
+
function k0(t, e) {
|
|
1013
1013
|
return t & e;
|
|
1014
1014
|
}
|
|
1015
1015
|
function $t(t) {
|
|
1016
1016
|
var e = m();
|
|
1017
|
-
return this.bitwiseTo(t,
|
|
1017
|
+
return this.bitwiseTo(t, k0, e), e;
|
|
1018
1018
|
}
|
|
1019
|
-
function
|
|
1019
|
+
function L0(t, e) {
|
|
1020
1020
|
return t | e;
|
|
1021
1021
|
}
|
|
1022
1022
|
function X0(t) {
|
|
1023
1023
|
var e = m();
|
|
1024
|
-
return this.bitwiseTo(t,
|
|
1024
|
+
return this.bitwiseTo(t, L0, e), e;
|
|
1025
1025
|
}
|
|
1026
1026
|
function j0(t, e) {
|
|
1027
1027
|
return t ^ e;
|
|
@@ -1030,12 +1030,12 @@ function Mt() {
|
|
|
1030
1030
|
var e = m();
|
|
1031
1031
|
return this.bitwiseTo(t, j0, e), e;
|
|
1032
1032
|
}
|
|
1033
|
-
function
|
|
1033
|
+
function M0(t, e) {
|
|
1034
1034
|
return t & ~e;
|
|
1035
1035
|
}
|
|
1036
1036
|
function Vt(t) {
|
|
1037
1037
|
var e = m();
|
|
1038
|
-
return this.bitwiseTo(t,
|
|
1038
|
+
return this.bitwiseTo(t, M0, e), e;
|
|
1039
1039
|
}
|
|
1040
1040
|
function Z0() {
|
|
1041
1041
|
for (var t = m(), e = 0; e < this.t; ++e) t[e] = this.DM & ~this[e];
|
|
@@ -1077,10 +1077,10 @@ function Mt() {
|
|
|
1077
1077
|
return this.bitwiseTo(c, e, c), c;
|
|
1078
1078
|
}
|
|
1079
1079
|
function Q0(t) {
|
|
1080
|
-
return this.changeBit(t,
|
|
1080
|
+
return this.changeBit(t, L0);
|
|
1081
1081
|
}
|
|
1082
1082
|
function Jt(t) {
|
|
1083
|
-
return this.changeBit(t,
|
|
1083
|
+
return this.changeBit(t, M0);
|
|
1084
1084
|
}
|
|
1085
1085
|
function J0(t) {
|
|
1086
1086
|
return this.changeBit(t, j0);
|
|
@@ -1099,7 +1099,7 @@ function Mt() {
|
|
|
1099
1099
|
}
|
|
1100
1100
|
e.s = b < 0 ? -1 : 0, b > 0 ? e[c++] = b : b < -1 && (e[c++] = this.DV + b), e.t = c, e.clamp();
|
|
1101
1101
|
}
|
|
1102
|
-
function
|
|
1102
|
+
function C0(t) {
|
|
1103
1103
|
var e = m();
|
|
1104
1104
|
return this.addTo(t, e), e;
|
|
1105
1105
|
}
|
|
@@ -1111,48 +1111,48 @@ function Mt() {
|
|
|
1111
1111
|
var e = m();
|
|
1112
1112
|
return this.multiplyTo(t, e), e;
|
|
1113
1113
|
}
|
|
1114
|
-
function
|
|
1114
|
+
function ge() {
|
|
1115
1115
|
var t = m();
|
|
1116
1116
|
return this.squareTo(t), t;
|
|
1117
1117
|
}
|
|
1118
|
-
function
|
|
1118
|
+
function be(t) {
|
|
1119
1119
|
var e = m();
|
|
1120
1120
|
return this.divRemTo(t, e, null), e;
|
|
1121
1121
|
}
|
|
1122
|
-
function
|
|
1122
|
+
function me(t) {
|
|
1123
1123
|
var e = m();
|
|
1124
1124
|
return this.divRemTo(t, null, e), e;
|
|
1125
1125
|
}
|
|
1126
|
-
function
|
|
1126
|
+
function _e(t) {
|
|
1127
1127
|
var e = m(), c = m();
|
|
1128
1128
|
return this.divRemTo(t, e, c), new Array(e, c);
|
|
1129
1129
|
}
|
|
1130
|
-
function
|
|
1130
|
+
function we(t) {
|
|
1131
1131
|
this[this.t] = this.am(0, t - 1, this, 0, 0, this.t), ++this.t, this.clamp();
|
|
1132
1132
|
}
|
|
1133
|
-
function
|
|
1133
|
+
function Te(t, e) {
|
|
1134
1134
|
if (t != 0) {
|
|
1135
1135
|
for (; this.t <= e; ) this[this.t++] = 0;
|
|
1136
1136
|
for (this[e] += t; this[e] >= this.DV; )
|
|
1137
1137
|
this[e] -= this.DV, ++e >= this.t && (this[this.t++] = 0), ++this[e];
|
|
1138
1138
|
}
|
|
1139
1139
|
}
|
|
1140
|
-
function
|
|
1140
|
+
function N0() {
|
|
1141
1141
|
}
|
|
1142
|
-
function
|
|
1142
|
+
function Er(t) {
|
|
1143
1143
|
return t;
|
|
1144
1144
|
}
|
|
1145
|
-
function
|
|
1145
|
+
function Se(t, e, c) {
|
|
1146
1146
|
t.multiplyTo(e, c);
|
|
1147
1147
|
}
|
|
1148
|
-
function
|
|
1148
|
+
function ke(t, e) {
|
|
1149
1149
|
t.squareTo(e);
|
|
1150
1150
|
}
|
|
1151
|
-
|
|
1152
|
-
function
|
|
1153
|
-
return this.exp(t, new
|
|
1151
|
+
N0.prototype.convert = Er, N0.prototype.revert = Er, N0.prototype.mulTo = Se, N0.prototype.sqrTo = ke;
|
|
1152
|
+
function Re(t) {
|
|
1153
|
+
return this.exp(t, new N0());
|
|
1154
1154
|
}
|
|
1155
|
-
function
|
|
1155
|
+
function qe(t, e, c) {
|
|
1156
1156
|
var b = Math.min(this.t + t.t, e);
|
|
1157
1157
|
for (c.s = 0, c.t = b; b > 0; ) c[--b] = 0;
|
|
1158
1158
|
var P;
|
|
@@ -1160,7 +1160,7 @@ function Mt() {
|
|
|
1160
1160
|
for (P = Math.min(t.t, e); b < P; ++b) this.am(0, t[b], c, b, 0, e - b);
|
|
1161
1161
|
c.clamp();
|
|
1162
1162
|
}
|
|
1163
|
-
function
|
|
1163
|
+
function He(t, e, c) {
|
|
1164
1164
|
--e;
|
|
1165
1165
|
var b = c.t = this.t + t.t - e;
|
|
1166
1166
|
for (c.s = 0; --b >= 0; ) c[b] = 0;
|
|
@@ -1168,56 +1168,56 @@ function Mt() {
|
|
|
1168
1168
|
c[this.t + b - e] = this.am(e - b, t[b], c, 0, 0, this.t + b - e);
|
|
1169
1169
|
c.clamp(), c.drShiftTo(1, c);
|
|
1170
1170
|
}
|
|
1171
|
-
function
|
|
1171
|
+
function R0(t) {
|
|
1172
1172
|
this.r2 = m(), this.q3 = m(), B.ONE.dlShiftTo(2 * t.t, this.r2), this.mu = this.r2.divide(t), this.m = t;
|
|
1173
1173
|
}
|
|
1174
|
-
function
|
|
1174
|
+
function Pe(t) {
|
|
1175
1175
|
if (t.s < 0 || t.t > 2 * this.m.t) return t.mod(this.m);
|
|
1176
1176
|
if (t.compareTo(this.m) < 0) return t;
|
|
1177
1177
|
var e = m();
|
|
1178
1178
|
return t.copyTo(e), this.reduce(e), e;
|
|
1179
1179
|
}
|
|
1180
|
-
function
|
|
1180
|
+
function ze(t) {
|
|
1181
1181
|
return t;
|
|
1182
1182
|
}
|
|
1183
|
-
function
|
|
1183
|
+
function Ie(t) {
|
|
1184
1184
|
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);
|
|
1185
1185
|
for (t.subTo(this.r2, t); t.compareTo(this.m) >= 0; ) t.subTo(this.m, t);
|
|
1186
1186
|
}
|
|
1187
|
-
function
|
|
1187
|
+
function Le(t, e) {
|
|
1188
1188
|
t.squareTo(e), this.reduce(e);
|
|
1189
1189
|
}
|
|
1190
|
-
function
|
|
1190
|
+
function Oe(t, e, c) {
|
|
1191
1191
|
t.multiplyTo(e, c), this.reduce(c);
|
|
1192
1192
|
}
|
|
1193
|
-
|
|
1194
|
-
function
|
|
1193
|
+
R0.prototype.convert = Pe, R0.prototype.revert = ze, R0.prototype.reduce = Ie, R0.prototype.mulTo = Oe, R0.prototype.sqrTo = Le;
|
|
1194
|
+
function Ue(t, e) {
|
|
1195
1195
|
var c = t.bitLength(), b, P = h(1), L;
|
|
1196
1196
|
if (c <= 0) return P;
|
|
1197
|
-
c < 18 ? b = 1 : c < 48 ? b = 3 : c < 144 ? b = 4 : c < 768 ? b = 5 : b = 6, c < 8 ? L = new R(e) : e.isEven() ? L = new
|
|
1197
|
+
c < 18 ? b = 1 : c < 48 ? b = 3 : c < 144 ? b = 4 : c < 768 ? b = 5 : b = 6, c < 8 ? L = new R(e) : e.isEven() ? L = new R0(e) : L = new a0(e);
|
|
1198
1198
|
var M = new Array(), N = 3, J = b - 1, r0 = (1 << b) - 1;
|
|
1199
1199
|
if (M[1] = L.convert(this), b > 1) {
|
|
1200
1200
|
var l0 = m();
|
|
1201
1201
|
for (L.sqrTo(M[1], l0); N <= r0; )
|
|
1202
1202
|
M[N] = m(), L.mulTo(l0, M[N - 2], M[N]), N += 2;
|
|
1203
1203
|
}
|
|
1204
|
-
var u0 = t.t - 1,
|
|
1204
|
+
var u0 = t.t - 1, A0, et = !0, d0 = m(), p0;
|
|
1205
1205
|
for (c = _(t[u0]) - 1; u0 >= 0; ) {
|
|
1206
|
-
for (c >= J ?
|
|
1207
|
-
|
|
1206
|
+
for (c >= J ? A0 = t[u0] >> c - J & r0 : (A0 = (t[u0] & (1 << c + 1) - 1) << J - c, u0 > 0 && (A0 |= t[u0 - 1] >> this.DB + c - J)), N = b; (A0 & 1) == 0; )
|
|
1207
|
+
A0 >>= 1, --N;
|
|
1208
1208
|
if ((c -= N) < 0 && (c += this.DB, --u0), et)
|
|
1209
|
-
M[
|
|
1209
|
+
M[A0].copyTo(P), et = !1;
|
|
1210
1210
|
else {
|
|
1211
1211
|
for (; N > 1; )
|
|
1212
1212
|
L.sqrTo(P, d0), L.sqrTo(d0, P), N -= 2;
|
|
1213
|
-
N > 0 ? L.sqrTo(P, d0) : (p0 = P, P = d0, d0 = p0), L.mulTo(d0, M[
|
|
1213
|
+
N > 0 ? L.sqrTo(P, d0) : (p0 = P, P = d0, d0 = p0), L.mulTo(d0, M[A0], P);
|
|
1214
1214
|
}
|
|
1215
1215
|
for (; u0 >= 0 && (t[u0] & 1 << c) == 0; )
|
|
1216
1216
|
L.sqrTo(P, d0), p0 = P, P = d0, d0 = p0, --c < 0 && (c = this.DB - 1, --u0);
|
|
1217
1217
|
}
|
|
1218
1218
|
return L.revert(P);
|
|
1219
1219
|
}
|
|
1220
|
-
function
|
|
1220
|
+
function Me(t) {
|
|
1221
1221
|
var e = this.s < 0 ? this.negate() : this.clone(), c = t.s < 0 ? t.negate() : t.clone();
|
|
1222
1222
|
if (e.compareTo(c) < 0) {
|
|
1223
1223
|
var b = e;
|
|
@@ -1229,7 +1229,7 @@ function Mt() {
|
|
|
1229
1229
|
(P = e.getLowestSetBit()) > 0 && e.rShiftTo(P, e), (P = c.getLowestSetBit()) > 0 && c.rShiftTo(P, c), e.compareTo(c) >= 0 ? (e.subTo(c, e), e.rShiftTo(1, e)) : (c.subTo(e, c), c.rShiftTo(1, c));
|
|
1230
1230
|
return L > 0 && c.lShiftTo(L, c), c;
|
|
1231
1231
|
}
|
|
1232
|
-
function
|
|
1232
|
+
function Ne(t) {
|
|
1233
1233
|
if (t <= 0) return 0;
|
|
1234
1234
|
var e = this.DV % t, c = this.s < 0 ? t - 1 : 0;
|
|
1235
1235
|
if (this.t > 0)
|
|
@@ -1237,7 +1237,7 @@ function Mt() {
|
|
|
1237
1237
|
else for (var b = this.t - 1; b >= 0; --b) c = (e * c + this[b]) % t;
|
|
1238
1238
|
return c;
|
|
1239
1239
|
}
|
|
1240
|
-
function
|
|
1240
|
+
function We(t) {
|
|
1241
1241
|
var e = t.isEven();
|
|
1242
1242
|
if (this.isEven() && e || t.signum() == 0) return B.ZERO;
|
|
1243
1243
|
for (var c = t.clone(), b = this.clone(), P = h(1), L = h(0), M = h(0), N = h(1); c.signum() != 0; ) {
|
|
@@ -1253,8 +1253,8 @@ function Mt() {
|
|
|
1253
1253
|
else return N;
|
|
1254
1254
|
return N.signum() < 0 ? N.add(t) : N;
|
|
1255
1255
|
}
|
|
1256
|
-
var o0 = [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],
|
|
1257
|
-
function
|
|
1256
|
+
var o0 = [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], $e = (1 << 26) / o0[o0.length - 1];
|
|
1257
|
+
function Ke(t) {
|
|
1258
1258
|
var e, c = this.abs();
|
|
1259
1259
|
if (c.t == 1 && c[0] <= o0[o0.length - 1]) {
|
|
1260
1260
|
for (e = 0; e < o0.length; ++e)
|
|
@@ -1263,12 +1263,12 @@ function Mt() {
|
|
|
1263
1263
|
}
|
|
1264
1264
|
if (c.isEven()) return !1;
|
|
1265
1265
|
for (e = 1; e < o0.length; ) {
|
|
1266
|
-
for (var b = o0[e], P = e + 1; P < o0.length && b <
|
|
1266
|
+
for (var b = o0[e], P = e + 1; P < o0.length && b < $e; ) b *= o0[P++];
|
|
1267
1267
|
for (b = c.modInt(b); e < P; ) if (b % o0[e++] == 0) return !1;
|
|
1268
1268
|
}
|
|
1269
1269
|
return c.millerRabin(t);
|
|
1270
1270
|
}
|
|
1271
|
-
function
|
|
1271
|
+
function Ve(t) {
|
|
1272
1272
|
var e = this.subtract(B.ONE), c = e.getLowestSetBit();
|
|
1273
1273
|
if (c <= 0) return !1;
|
|
1274
1274
|
var b = e.shiftRight(c);
|
|
@@ -1284,51 +1284,51 @@ function Mt() {
|
|
|
1284
1284
|
}
|
|
1285
1285
|
return !0;
|
|
1286
1286
|
}
|
|
1287
|
-
B.prototype.chunkSize = s0, B.prototype.toRadix =
|
|
1287
|
+
B.prototype.chunkSize = s0, B.prototype.toRadix = I0, B.prototype.fromRadix = $0, B.prototype.fromNumber = y0, B.prototype.bitwiseTo = D0, B.prototype.changeBit = Qt, B.prototype.addTo = i0, B.prototype.dMultiply = we, B.prototype.dAddOffset = Te, B.prototype.multiplyLowerTo = qe, B.prototype.multiplyUpperTo = He, B.prototype.modInt = Ne, B.prototype.millerRabin = Ve, B.prototype.clone = w0, B.prototype.intValue = U0, B.prototype.byteValue = T0, B.prototype.shortValue = c0, B.prototype.signum = F0, B.prototype.toByteArray = S0, B.prototype.equals = Wt, B.prototype.min = K0, B.prototype.max = V0, B.prototype.and = $t, B.prototype.or = X0, B.prototype.xor = Kt, B.prototype.andNot = Vt, B.prototype.not = Z0, B.prototype.shiftLeft = Xt, B.prototype.shiftRight = G0, B.prototype.getLowestSetBit = Zt, B.prototype.bitCount = Y0, B.prototype.testBit = Yt, B.prototype.setBit = Q0, B.prototype.clearBit = Jt, B.prototype.flipBit = J0, B.prototype.add = C0, B.prototype.subtract = tt, B.prototype.multiply = tr, B.prototype.divide = be, B.prototype.remainder = me, B.prototype.divideAndRemainder = _e, B.prototype.modPow = Ue, B.prototype.modInverse = We, B.prototype.pow = Re, B.prototype.gcd = Me, B.prototype.isProbablePrime = Ke, B.prototype.square = ge, B.prototype.Barrett = R0;
|
|
1288
1288
|
var rt, h0, t0;
|
|
1289
|
-
function
|
|
1289
|
+
function Xe(t) {
|
|
1290
1290
|
h0[t0++] ^= t & 255, h0[t0++] ^= t >> 8 & 255, h0[t0++] ^= t >> 16 & 255, h0[t0++] ^= t >> 24 & 255, t0 >= er && (t0 -= er);
|
|
1291
1291
|
}
|
|
1292
|
-
function
|
|
1293
|
-
|
|
1292
|
+
function yr() {
|
|
1293
|
+
Xe((/* @__PURE__ */ new Date()).getTime());
|
|
1294
1294
|
}
|
|
1295
1295
|
if (h0 == null) {
|
|
1296
1296
|
h0 = new Array(), t0 = 0;
|
|
1297
1297
|
var v0;
|
|
1298
1298
|
if (typeof window < "u" && window.crypto) {
|
|
1299
1299
|
if (window.crypto.getRandomValues) {
|
|
1300
|
-
var
|
|
1301
|
-
for (window.crypto.getRandomValues(
|
|
1302
|
-
h0[t0++] =
|
|
1300
|
+
var Dr = new Uint8Array(32);
|
|
1301
|
+
for (window.crypto.getRandomValues(Dr), v0 = 0; v0 < 32; ++v0)
|
|
1302
|
+
h0[t0++] = Dr[v0];
|
|
1303
1303
|
} else if (navigator.appName == "Netscape" && navigator.appVersion < "5") {
|
|
1304
|
-
var
|
|
1305
|
-
for (v0 = 0; v0 <
|
|
1306
|
-
h0[t0++] =
|
|
1304
|
+
var gr = window.crypto.random(32);
|
|
1305
|
+
for (v0 = 0; v0 < gr.length; ++v0)
|
|
1306
|
+
h0[t0++] = gr.charCodeAt(v0) & 255;
|
|
1307
1307
|
}
|
|
1308
1308
|
}
|
|
1309
1309
|
for (; t0 < er; )
|
|
1310
1310
|
v0 = Math.floor(65536 * Math.random()), h0[t0++] = v0 >>> 8, h0[t0++] = v0 & 255;
|
|
1311
|
-
t0 = 0,
|
|
1311
|
+
t0 = 0, yr();
|
|
1312
1312
|
}
|
|
1313
|
-
function
|
|
1313
|
+
function je() {
|
|
1314
1314
|
if (rt == null) {
|
|
1315
|
-
for (
|
|
1315
|
+
for (yr(), rt = Qe(), rt.init(h0), t0 = 0; t0 < h0.length; ++t0)
|
|
1316
1316
|
h0[t0] = 0;
|
|
1317
1317
|
t0 = 0;
|
|
1318
1318
|
}
|
|
1319
1319
|
return rt.next();
|
|
1320
1320
|
}
|
|
1321
|
-
function
|
|
1321
|
+
function Ze(t) {
|
|
1322
1322
|
var e;
|
|
1323
|
-
for (e = 0; e < t.length; ++e) t[e] =
|
|
1323
|
+
for (e = 0; e < t.length; ++e) t[e] = je();
|
|
1324
1324
|
}
|
|
1325
|
-
function
|
|
1325
|
+
function br() {
|
|
1326
1326
|
}
|
|
1327
|
-
|
|
1327
|
+
br.prototype.nextBytes = Ze;
|
|
1328
1328
|
function rr() {
|
|
1329
1329
|
this.i = 0, this.j = 0, this.S = new Array();
|
|
1330
1330
|
}
|
|
1331
|
-
function
|
|
1331
|
+
function Ge(t) {
|
|
1332
1332
|
var e, c, b;
|
|
1333
1333
|
for (e = 0; e < 256; ++e)
|
|
1334
1334
|
this.S[e] = e;
|
|
@@ -1336,29 +1336,29 @@ function Mt() {
|
|
|
1336
1336
|
c = c + this.S[e] + t[e % t.length] & 255, b = this.S[e], this.S[e] = this.S[c], this.S[c] = b;
|
|
1337
1337
|
this.i = 0, this.j = 0;
|
|
1338
1338
|
}
|
|
1339
|
-
function
|
|
1339
|
+
function Ye() {
|
|
1340
1340
|
var t;
|
|
1341
1341
|
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];
|
|
1342
1342
|
}
|
|
1343
|
-
rr.prototype.init =
|
|
1344
|
-
function
|
|
1343
|
+
rr.prototype.init = Ge, rr.prototype.next = Ye;
|
|
1344
|
+
function Qe() {
|
|
1345
1345
|
return new rr();
|
|
1346
1346
|
}
|
|
1347
1347
|
var er = 256;
|
|
1348
1348
|
y.exports = {
|
|
1349
1349
|
default: B,
|
|
1350
1350
|
BigInteger: B,
|
|
1351
|
-
SecureRandom:
|
|
1351
|
+
SecureRandom: br
|
|
1352
1352
|
};
|
|
1353
1353
|
}).call(sx);
|
|
1354
1354
|
}(nt)), nt.exports;
|
|
1355
1355
|
}
|
|
1356
|
-
var ar,
|
|
1356
|
+
var ar, kr;
|
|
1357
1357
|
function ax() {
|
|
1358
|
-
if (
|
|
1359
|
-
|
|
1358
|
+
if (kr) return ar;
|
|
1359
|
+
kr = 1;
|
|
1360
1360
|
const { BigInteger: y } = Mt();
|
|
1361
|
-
function
|
|
1361
|
+
function z(v) {
|
|
1362
1362
|
let r = v.toString(16);
|
|
1363
1363
|
if (r[0] !== "-")
|
|
1364
1364
|
r.length % 2 === 1 ? r = "0" + r : r.match(/^[0-7]/) || (r = "00" + r);
|
|
@@ -1367,7 +1367,7 @@ function ax() {
|
|
|
1367
1367
|
let s = r.length;
|
|
1368
1368
|
s % 2 === 1 ? s += 1 : r.match(/^[0-7]/) || (s += 2);
|
|
1369
1369
|
let C = "";
|
|
1370
|
-
for (let
|
|
1370
|
+
for (let f = 0; f < s; f++) C += "f";
|
|
1371
1371
|
C = new y(C, 16), r = C.xor(v).add(y.ONE), r = r.toString(16).replace(/^-/, "");
|
|
1372
1372
|
}
|
|
1373
1373
|
return r;
|
|
@@ -1391,9 +1391,9 @@ function ax() {
|
|
|
1391
1391
|
return "";
|
|
1392
1392
|
}
|
|
1393
1393
|
}
|
|
1394
|
-
class
|
|
1394
|
+
class a extends E {
|
|
1395
1395
|
constructor(r) {
|
|
1396
|
-
super(), this.t = "02", r && (this.v =
|
|
1396
|
+
super(), this.t = "02", r && (this.v = z(r));
|
|
1397
1397
|
}
|
|
1398
1398
|
getValue() {
|
|
1399
1399
|
return this.v;
|
|
@@ -1423,24 +1423,24 @@ function ax() {
|
|
|
1423
1423
|
* ASN.1 der 编码,针对 sm2 签名
|
|
1424
1424
|
*/
|
|
1425
1425
|
encodeDer(v, r) {
|
|
1426
|
-
const s = new
|
|
1426
|
+
const s = new a(v), C = new a(r);
|
|
1427
1427
|
return new g([s, C]).getEncodedHex();
|
|
1428
1428
|
},
|
|
1429
1429
|
/**
|
|
1430
1430
|
* 解析 ASN.1 der,针对 sm2 验签
|
|
1431
1431
|
*/
|
|
1432
1432
|
decodeDer(v) {
|
|
1433
|
-
const r = o(v, 0), s = o(v, r), C = m(v, r),
|
|
1433
|
+
const r = o(v, 0), s = o(v, r), C = m(v, r), f = v.substr(s, C * 2), l = s + f.length, u = o(v, l), F = m(v, l), i = v.substr(u, F * 2), p = new y(f, 16), x = new y(i, 16);
|
|
1434
1434
|
return { r: p, s: x };
|
|
1435
1435
|
}
|
|
1436
1436
|
}, ar;
|
|
1437
1437
|
}
|
|
1438
|
-
var fr,
|
|
1438
|
+
var fr, Rr;
|
|
1439
1439
|
function fx() {
|
|
1440
|
-
if (
|
|
1441
|
-
|
|
1442
|
-
const { BigInteger: y } = Mt(),
|
|
1443
|
-
class
|
|
1440
|
+
if (Rr) return fr;
|
|
1441
|
+
Rr = 1;
|
|
1442
|
+
const { BigInteger: y } = Mt(), z = new y("2"), E = new y("3");
|
|
1443
|
+
class a {
|
|
1444
1444
|
constructor(o, v) {
|
|
1445
1445
|
this.x = v, this.q = o;
|
|
1446
1446
|
}
|
|
@@ -1460,37 +1460,37 @@ function fx() {
|
|
|
1460
1460
|
* 取反
|
|
1461
1461
|
*/
|
|
1462
1462
|
negate() {
|
|
1463
|
-
return new
|
|
1463
|
+
return new a(this.q, this.x.negate().mod(this.q));
|
|
1464
1464
|
}
|
|
1465
1465
|
/**
|
|
1466
1466
|
* 相加
|
|
1467
1467
|
*/
|
|
1468
1468
|
add(o) {
|
|
1469
|
-
return new
|
|
1469
|
+
return new a(this.q, this.x.add(o.toBigInteger()).mod(this.q));
|
|
1470
1470
|
}
|
|
1471
1471
|
/**
|
|
1472
1472
|
* 相减
|
|
1473
1473
|
*/
|
|
1474
1474
|
subtract(o) {
|
|
1475
|
-
return new
|
|
1475
|
+
return new a(this.q, this.x.subtract(o.toBigInteger()).mod(this.q));
|
|
1476
1476
|
}
|
|
1477
1477
|
/**
|
|
1478
1478
|
* 相乘
|
|
1479
1479
|
*/
|
|
1480
1480
|
multiply(o) {
|
|
1481
|
-
return new
|
|
1481
|
+
return new a(this.q, this.x.multiply(o.toBigInteger()).mod(this.q));
|
|
1482
1482
|
}
|
|
1483
1483
|
/**
|
|
1484
1484
|
* 相除
|
|
1485
1485
|
*/
|
|
1486
1486
|
divide(o) {
|
|
1487
|
-
return new
|
|
1487
|
+
return new a(this.q, this.x.multiply(o.toBigInteger().modInverse(this.q)).mod(this.q));
|
|
1488
1488
|
}
|
|
1489
1489
|
/**
|
|
1490
1490
|
* 平方
|
|
1491
1491
|
*/
|
|
1492
1492
|
square() {
|
|
1493
|
-
return new
|
|
1493
|
+
return new a(this.q, this.x.square().mod(this.q));
|
|
1494
1494
|
}
|
|
1495
1495
|
}
|
|
1496
1496
|
class g {
|
|
@@ -1544,7 +1544,7 @@ function fx() {
|
|
|
1544
1544
|
add(o) {
|
|
1545
1545
|
if (this.isInfinity()) return o;
|
|
1546
1546
|
if (o.isInfinity()) return this;
|
|
1547
|
-
const v = this.x.toBigInteger(), r = this.y.toBigInteger(), s = this.z, C = o.x.toBigInteger(),
|
|
1547
|
+
const v = this.x.toBigInteger(), r = this.y.toBigInteger(), s = this.z, C = o.x.toBigInteger(), f = o.y.toBigInteger(), l = o.z, u = this.curve.q, F = v.multiply(l).mod(u), i = C.multiply(s).mod(u), p = F.subtract(i), x = r.multiply(l).mod(u), n = f.multiply(s).mod(u), h = x.subtract(n);
|
|
1548
1548
|
if (y.ZERO.equals(p))
|
|
1549
1549
|
return y.ZERO.equals(h) ? this.twice() : this.curve.infinity;
|
|
1550
1550
|
const d = F.add(i), A = s.multiply(l).mod(u), w = p.square().mod(u), T = p.multiply(w).mod(u), q = A.multiply(h.square()).subtract(d.multiply(w)).mod(u), D = p.multiply(q).mod(u), _ = h.multiply(w.multiply(F).subtract(q)).subtract(x.multiply(T)).mod(u), S = T.multiply(A).mod(u);
|
|
@@ -1568,7 +1568,7 @@ function fx() {
|
|
|
1568
1568
|
twice() {
|
|
1569
1569
|
if (this.isInfinity()) return this;
|
|
1570
1570
|
if (!this.y.toBigInteger().signum()) return this.curve.infinity;
|
|
1571
|
-
const o = this.x.toBigInteger(), v = this.y.toBigInteger(), r = this.z, s = this.curve.q, C = this.curve.a.toBigInteger(),
|
|
1571
|
+
const o = this.x.toBigInteger(), v = this.y.toBigInteger(), r = this.z, s = this.curve.q, C = this.curve.a.toBigInteger(), f = o.square().multiply(E).add(C.multiply(r.square())).mod(s), l = v.shiftLeft(1).multiply(r).mod(s), u = v.square().mod(s), F = u.multiply(o).multiply(r).mod(s), i = l.square().mod(s), p = f.square().subtract(F.shiftLeft(3)).mod(s), x = l.multiply(p).mod(s), n = f.multiply(F.shiftLeft(2).subtract(p)).subtract(i.shiftLeft(1).multiply(u)).mod(s), h = l.multiply(i).mod(s);
|
|
1572
1572
|
return new g(this.curve, this.curve.fromBigInteger(x), this.curve.fromBigInteger(n), h);
|
|
1573
1573
|
}
|
|
1574
1574
|
/**
|
|
@@ -1581,8 +1581,8 @@ function fx() {
|
|
|
1581
1581
|
let s = this;
|
|
1582
1582
|
for (let C = v.bitLength() - 2; C > 0; C--) {
|
|
1583
1583
|
s = s.twice();
|
|
1584
|
-
const
|
|
1585
|
-
|
|
1584
|
+
const f = v.testBit(C), l = o.testBit(C);
|
|
1585
|
+
f !== l && (s = s.add(f ? this : r));
|
|
1586
1586
|
}
|
|
1587
1587
|
return s;
|
|
1588
1588
|
}
|
|
@@ -1601,7 +1601,7 @@ function fx() {
|
|
|
1601
1601
|
* 生成椭圆曲线域元素
|
|
1602
1602
|
*/
|
|
1603
1603
|
fromBigInteger(o) {
|
|
1604
|
-
return new
|
|
1604
|
+
return new a(this.q, o);
|
|
1605
1605
|
}
|
|
1606
1606
|
/**
|
|
1607
1607
|
* 解析 16 进制串为椭圆曲线点
|
|
@@ -1620,12 +1620,12 @@ function fx() {
|
|
|
1620
1620
|
this.q.divide(new y("4")).add(y.ONE),
|
|
1621
1621
|
this.q
|
|
1622
1622
|
));
|
|
1623
|
-
return r.toBigInteger().mod(
|
|
1623
|
+
return r.toBigInteger().mod(z).equals(new y(o.substr(0, 2), 16).subtract(z)) || (r = r.negate()), new g(this, v, r);
|
|
1624
1624
|
case 4:
|
|
1625
1625
|
case 6:
|
|
1626
1626
|
case 7:
|
|
1627
|
-
const s = (o.length - 2) / 2, C = o.substr(2, s),
|
|
1628
|
-
return new g(this, this.fromBigInteger(new y(C, 16)), this.fromBigInteger(new y(
|
|
1627
|
+
const s = (o.length - 2) / 2, C = o.substr(2, s), f = o.substr(s + 2, s);
|
|
1628
|
+
return new g(this, this.fromBigInteger(new y(C, 16)), this.fromBigInteger(new y(f, 16)));
|
|
1629
1629
|
default:
|
|
1630
1630
|
return null;
|
|
1631
1631
|
}
|
|
@@ -1636,11 +1636,11 @@ function fx() {
|
|
|
1636
1636
|
ECCurveFp: B
|
|
1637
1637
|
}, fr;
|
|
1638
1638
|
}
|
|
1639
|
-
var cr,
|
|
1639
|
+
var cr, qr;
|
|
1640
1640
|
function cx() {
|
|
1641
|
-
if (
|
|
1642
|
-
|
|
1643
|
-
const { BigInteger: y, SecureRandom:
|
|
1641
|
+
if (qr) return cr;
|
|
1642
|
+
qr = 1;
|
|
1643
|
+
const { BigInteger: y, SecureRandom: z } = Mt(), { ECCurveFp: E } = fx(), a = new z(), { curve: g, G: B, n: m } = v();
|
|
1644
1644
|
function o() {
|
|
1645
1645
|
return g;
|
|
1646
1646
|
}
|
|
@@ -1649,7 +1649,7 @@ function cx() {
|
|
|
1649
1649
|
return { curve: d, G: T, n: q };
|
|
1650
1650
|
}
|
|
1651
1651
|
function r(x, n, h) {
|
|
1652
|
-
const A = (x ? new y(x, n, h) : new y(m.bitLength(),
|
|
1652
|
+
const A = (x ? new y(x, n, h) : new y(m.bitLength(), a)).mod(m.subtract(y.ONE)).add(y.ONE), w = f(A.toString(16), 64), T = B.multiply(A), q = f(T.getX().toBigInteger().toString(16), 64), D = f(T.getY().toBigInteger().toString(16), 64), _ = "04" + q + D;
|
|
1653
1653
|
return { privateKey: w, publicKey: _ };
|
|
1654
1654
|
}
|
|
1655
1655
|
function s(x) {
|
|
@@ -1670,7 +1670,7 @@ function cx() {
|
|
|
1670
1670
|
}
|
|
1671
1671
|
return d.join("");
|
|
1672
1672
|
}
|
|
1673
|
-
function
|
|
1673
|
+
function f(x, n) {
|
|
1674
1674
|
return x.length >= n ? x : new Array(n - x.length + 1).join("0") + x;
|
|
1675
1675
|
}
|
|
1676
1676
|
function l(x) {
|
|
@@ -1695,7 +1695,7 @@ function cx() {
|
|
|
1695
1695
|
function F(x) {
|
|
1696
1696
|
const n = [];
|
|
1697
1697
|
let h = x.length;
|
|
1698
|
-
h % 2 !== 0 && (x =
|
|
1698
|
+
h % 2 !== 0 && (x = f(x, h + 1)), h = x.length;
|
|
1699
1699
|
for (let d = 0; d < h; d += 2)
|
|
1700
1700
|
n.push(parseInt(x.substr(d, 2), 16));
|
|
1701
1701
|
return n;
|
|
@@ -1718,7 +1718,7 @@ function cx() {
|
|
|
1718
1718
|
generateKeyPairHex: r,
|
|
1719
1719
|
compressPublicKeyHex: s,
|
|
1720
1720
|
utf8ToHex: C,
|
|
1721
|
-
leftPad:
|
|
1721
|
+
leftPad: f,
|
|
1722
1722
|
arrayToHex: l,
|
|
1723
1723
|
arrayToUtf8: u,
|
|
1724
1724
|
hexToArray: F,
|
|
@@ -1726,18 +1726,18 @@ function cx() {
|
|
|
1726
1726
|
comparePublicKeyHex: p
|
|
1727
1727
|
}, cr;
|
|
1728
1728
|
}
|
|
1729
|
-
var hr,
|
|
1730
|
-
function
|
|
1731
|
-
if (
|
|
1732
|
-
|
|
1733
|
-
const y = new Uint32Array(68),
|
|
1734
|
-
function E(C,
|
|
1735
|
-
const l =
|
|
1729
|
+
var hr, Hr;
|
|
1730
|
+
function Ee() {
|
|
1731
|
+
if (Hr) return hr;
|
|
1732
|
+
Hr = 1;
|
|
1733
|
+
const y = new Uint32Array(68), z = new Uint32Array(64);
|
|
1734
|
+
function E(C, f) {
|
|
1735
|
+
const l = f & 31;
|
|
1736
1736
|
return C << l | C >>> 32 - l;
|
|
1737
1737
|
}
|
|
1738
|
-
function
|
|
1738
|
+
function a(C, f) {
|
|
1739
1739
|
const l = [];
|
|
1740
|
-
for (let u = C.length - 1; u >= 0; u--) l[u] = (C[u] ^
|
|
1740
|
+
for (let u = C.length - 1; u >= 0; u--) l[u] = (C[u] ^ f[u]) & 255;
|
|
1741
1741
|
return l;
|
|
1742
1742
|
}
|
|
1743
1743
|
function g(C) {
|
|
@@ -1747,31 +1747,31 @@ function Ae() {
|
|
|
1747
1747
|
return C ^ E(C, 15) ^ E(C, 23);
|
|
1748
1748
|
}
|
|
1749
1749
|
function m(C) {
|
|
1750
|
-
let
|
|
1750
|
+
let f = C.length * 8, l = f % 512;
|
|
1751
1751
|
l = l >= 448 ? 512 - l % 448 - 1 : 448 - l - 1;
|
|
1752
1752
|
const u = new Array((l - 7) / 8), F = new Array(8);
|
|
1753
1753
|
for (let d = 0, A = u.length; d < A; d++) u[d] = 0;
|
|
1754
1754
|
for (let d = 0, A = F.length; d < A; d++) F[d] = 0;
|
|
1755
|
-
|
|
1755
|
+
f = f.toString(2);
|
|
1756
1756
|
for (let d = 7; d >= 0; d--)
|
|
1757
|
-
if (
|
|
1758
|
-
const A =
|
|
1759
|
-
F[d] = parseInt(
|
|
1760
|
-
} else
|
|
1757
|
+
if (f.length > 8) {
|
|
1758
|
+
const A = f.length - 8;
|
|
1759
|
+
F[d] = parseInt(f.substr(A), 2), f = f.substr(0, A);
|
|
1760
|
+
} else f.length > 0 && (F[d] = parseInt(f, 2), f = "");
|
|
1761
1761
|
const i = new Uint8Array([...C, 128, ...u, ...F]), p = new DataView(i.buffer, 0), x = i.length / 64, n = new Uint32Array([1937774191, 1226093241, 388252375, 3666478592, 2842636476, 372324522, 3817729613, 2969243214]);
|
|
1762
1762
|
for (let d = 0; d < x; d++) {
|
|
1763
|
-
y.fill(0),
|
|
1763
|
+
y.fill(0), z.fill(0);
|
|
1764
1764
|
const A = 16 * d;
|
|
1765
1765
|
for (let R = 0; R < 16; R++)
|
|
1766
1766
|
y[R] = p.getUint32((A + R) * 4, !1);
|
|
1767
1767
|
for (let R = 16; R < 68; R++)
|
|
1768
1768
|
y[R] = B(y[R - 16] ^ y[R - 9] ^ E(y[R - 3], 15)) ^ E(y[R - 13], 7) ^ y[R - 6];
|
|
1769
1769
|
for (let R = 0; R < 64; R++)
|
|
1770
|
-
|
|
1770
|
+
z[R] = y[R] ^ y[R + 4];
|
|
1771
1771
|
const w = 2043430169, T = 2055708042;
|
|
1772
1772
|
let q = n[0], D = n[1], _ = n[2], S = n[3], k = n[4], U = n[5], W = n[6], $ = n[7], V, X, G, Z, H;
|
|
1773
1773
|
for (let R = 0; R < 64; R++)
|
|
1774
|
-
H = R >= 0 && R <= 15 ? w : T, V = E(E(q, 12) + k + E(H, R), 7), X = V ^ E(q, 12), G = (R >= 0 && R <= 15 ? q ^ D ^ _ : q & D | q & _ | D & _) + S + X +
|
|
1774
|
+
H = R >= 0 && R <= 15 ? w : T, V = E(E(q, 12) + k + E(H, R), 7), X = V ^ E(q, 12), G = (R >= 0 && R <= 15 ? q ^ D ^ _ : q & D | q & _ | D & _) + S + X + z[R], Z = (R >= 0 && R <= 15 ? k ^ U ^ W : k & U | ~k & W) + $ + V + y[R], S = _, _ = E(D, 9), D = q, q = G, $ = W, W = E(U, 19), U = k, k = g(Z);
|
|
1775
1775
|
n[0] ^= q, n[1] ^= D, n[2] ^= _, n[3] ^= S, n[4] ^= k, n[5] ^= U, n[6] ^= W, n[7] ^= $;
|
|
1776
1776
|
}
|
|
1777
1777
|
const h = [];
|
|
@@ -1784,9 +1784,9 @@ function Ae() {
|
|
|
1784
1784
|
const o = 64, v = new Uint8Array(o), r = new Uint8Array(o);
|
|
1785
1785
|
for (let C = 0; C < o; C++)
|
|
1786
1786
|
v[C] = 54, r[C] = 92;
|
|
1787
|
-
function s(C,
|
|
1788
|
-
for (
|
|
1789
|
-
const l = f
|
|
1787
|
+
function s(C, f) {
|
|
1788
|
+
for (f.length > o && (f = m(f)); f.length < o; ) f.push(0);
|
|
1789
|
+
const l = a(f, v), u = a(f, r), F = m([...l, ...C]);
|
|
1790
1790
|
return m([...u, ...F]);
|
|
1791
1791
|
}
|
|
1792
1792
|
return hr = {
|
|
@@ -1794,17 +1794,17 @@ function Ae() {
|
|
|
1794
1794
|
hmac: s
|
|
1795
1795
|
}, hr;
|
|
1796
1796
|
}
|
|
1797
|
-
var ur,
|
|
1797
|
+
var ur, Pr;
|
|
1798
1798
|
function hx() {
|
|
1799
|
-
if (
|
|
1800
|
-
|
|
1801
|
-
const { BigInteger: y } = Mt(), { encodeDer:
|
|
1799
|
+
if (Pr) return ur;
|
|
1800
|
+
Pr = 1;
|
|
1801
|
+
const { BigInteger: y } = Mt(), { encodeDer: z, decodeDer: E } = ax(), a = cx(), g = Ee().sm3, { G: B, curve: m, n: o } = a.generateEcparam(), v = 0;
|
|
1802
1802
|
function r(i, p, x = 1) {
|
|
1803
|
-
i = typeof i == "string" ?
|
|
1804
|
-
const n =
|
|
1803
|
+
i = typeof i == "string" ? a.hexToArray(a.utf8ToHex(i)) : Array.prototype.slice.call(i), p = a.getGlobalCurve().decodePointHex(p);
|
|
1804
|
+
const n = a.generateKeyPairHex(), h = new y(n.privateKey, 16);
|
|
1805
1805
|
let d = n.publicKey;
|
|
1806
1806
|
d.length > 128 && (d = d.substr(d.length - 128));
|
|
1807
|
-
const A = p.multiply(h), w =
|
|
1807
|
+
const A = p.multiply(h), w = a.hexToArray(a.leftPad(A.getX().toBigInteger().toRadix(16), 64)), T = a.hexToArray(a.leftPad(A.getY().toBigInteger().toRadix(16), 64)), q = a.arrayToHex(g([].concat(w, i, T)));
|
|
1808
1808
|
let D = 1, _ = 0, S = [];
|
|
1809
1809
|
const k = [].concat(w, T), U = () => {
|
|
1810
1810
|
S = g([...k, D >> 24 & 255, D >> 16 & 255, D >> 8 & 255, D & 255]), D++, _ = 0;
|
|
@@ -1812,7 +1812,7 @@ function hx() {
|
|
|
1812
1812
|
U();
|
|
1813
1813
|
for (let $ = 0, V = i.length; $ < V; $++)
|
|
1814
1814
|
_ === S.length && U(), i[$] ^= S[_++] & 255;
|
|
1815
|
-
const W =
|
|
1815
|
+
const W = a.arrayToHex(i);
|
|
1816
1816
|
return x === v ? d + W + q : d + q + W;
|
|
1817
1817
|
}
|
|
1818
1818
|
function s(i, p, x = 1, {
|
|
@@ -1821,7 +1821,7 @@ function hx() {
|
|
|
1821
1821
|
p = new y(p, 16);
|
|
1822
1822
|
let h = i.substr(128, 64), d = i.substr(192);
|
|
1823
1823
|
x === v && (h = i.substr(i.length - 64), d = i.substr(128, i.length - 128 - 64));
|
|
1824
|
-
const A =
|
|
1824
|
+
const A = a.hexToArray(d), T = a.getGlobalCurve().decodePointHex("04" + i.substr(0, 128)).multiply(p), q = a.hexToArray(a.leftPad(T.getX().toBigInteger().toRadix(16), 64)), D = a.hexToArray(a.leftPad(T.getY().toBigInteger().toRadix(16), 64));
|
|
1825
1825
|
let _ = 1, S = 0, k = [];
|
|
1826
1826
|
const U = [].concat(q, D), W = () => {
|
|
1827
1827
|
k = g([...U, _ >> 24 & 255, _ >> 16 & 255, _ >> 8 & 255, _ & 255]), _++, S = 0;
|
|
@@ -1829,7 +1829,7 @@ function hx() {
|
|
|
1829
1829
|
W();
|
|
1830
1830
|
for (let V = 0, X = A.length; V < X; V++)
|
|
1831
1831
|
S === k.length && W(), A[V] ^= k[S++] & 255;
|
|
1832
|
-
return
|
|
1832
|
+
return a.arrayToHex(g([].concat(q, A, D))) === h.toLowerCase() ? n === "array" ? A : a.arrayToUtf8(A) : n === "array" ? [] : "";
|
|
1833
1833
|
}
|
|
1834
1834
|
function C(i, p, {
|
|
1835
1835
|
pointPool: x,
|
|
@@ -1838,7 +1838,7 @@ function hx() {
|
|
|
1838
1838
|
publicKey: d,
|
|
1839
1839
|
userId: A
|
|
1840
1840
|
} = {}) {
|
|
1841
|
-
let w = typeof i == "string" ?
|
|
1841
|
+
let w = typeof i == "string" ? a.utf8ToHex(i) : a.arrayToHex(i);
|
|
1842
1842
|
h && (d = d || u(p), w = l(w, d, A));
|
|
1843
1843
|
const T = new y(p, 16), q = new y(w, 16);
|
|
1844
1844
|
let D = null, _ = null, S = null;
|
|
@@ -1849,10 +1849,10 @@ function hx() {
|
|
|
1849
1849
|
} while (_.equals(y.ZERO) || _.add(D).equals(o));
|
|
1850
1850
|
S = T.add(y.ONE).modInverse(o).multiply(D.subtract(_.multiply(T))).mod(o);
|
|
1851
1851
|
} while (S.equals(y.ZERO));
|
|
1852
|
-
return n ?
|
|
1852
|
+
return n ? z(_, S) : a.leftPad(_.toString(16), 64) + a.leftPad(S.toString(16), 64);
|
|
1853
1853
|
}
|
|
1854
|
-
function
|
|
1855
|
-
let A = typeof i == "string" ?
|
|
1854
|
+
function f(i, p, x, { der: n, hash: h, userId: d } = {}) {
|
|
1855
|
+
let A = typeof i == "string" ? a.utf8ToHex(i) : a.arrayToHex(i);
|
|
1856
1856
|
h && (A = l(A, x, d));
|
|
1857
1857
|
let w, T;
|
|
1858
1858
|
if (n) {
|
|
@@ -1866,50 +1866,50 @@ function hx() {
|
|
|
1866
1866
|
return w.equals(k);
|
|
1867
1867
|
}
|
|
1868
1868
|
function l(i, p, x = "1234567812345678") {
|
|
1869
|
-
x =
|
|
1870
|
-
const n =
|
|
1869
|
+
x = a.utf8ToHex(x);
|
|
1870
|
+
const n = a.leftPad(B.curve.a.toBigInteger().toRadix(16), 64), h = a.leftPad(B.curve.b.toBigInteger().toRadix(16), 64), d = a.leftPad(B.getX().toBigInteger().toRadix(16), 64), A = a.leftPad(B.getY().toBigInteger().toRadix(16), 64);
|
|
1871
1871
|
let w, T;
|
|
1872
1872
|
if (p.length === 128)
|
|
1873
1873
|
w = p.substr(0, 64), T = p.substr(64, 64);
|
|
1874
1874
|
else {
|
|
1875
1875
|
const S = B.curve.decodePointHex(p);
|
|
1876
|
-
w =
|
|
1876
|
+
w = a.leftPad(S.getX().toBigInteger().toRadix(16), 64), T = a.leftPad(S.getY().toBigInteger().toRadix(16), 64);
|
|
1877
1877
|
}
|
|
1878
|
-
const q =
|
|
1878
|
+
const q = a.hexToArray(x + n + h + d + A + w + T), D = x.length * 4;
|
|
1879
1879
|
q.unshift(D & 255), q.unshift(D >> 8 & 255);
|
|
1880
1880
|
const _ = g(q);
|
|
1881
|
-
return
|
|
1881
|
+
return a.arrayToHex(g(_.concat(a.hexToArray(i))));
|
|
1882
1882
|
}
|
|
1883
1883
|
function u(i) {
|
|
1884
|
-
const p = B.multiply(new y(i, 16)), x =
|
|
1884
|
+
const p = B.multiply(new y(i, 16)), x = a.leftPad(p.getX().toBigInteger().toString(16), 64), n = a.leftPad(p.getY().toBigInteger().toString(16), 64);
|
|
1885
1885
|
return "04" + x + n;
|
|
1886
1886
|
}
|
|
1887
1887
|
function F() {
|
|
1888
|
-
const i =
|
|
1888
|
+
const i = a.generateKeyPairHex(), p = m.decodePointHex(i.publicKey);
|
|
1889
1889
|
return i.k = new y(i.privateKey, 16), i.x1 = p.getX().toBigInteger(), i;
|
|
1890
1890
|
}
|
|
1891
1891
|
return ur = {
|
|
1892
|
-
generateKeyPairHex:
|
|
1893
|
-
compressPublicKeyHex:
|
|
1894
|
-
comparePublicKeyHex:
|
|
1892
|
+
generateKeyPairHex: a.generateKeyPairHex,
|
|
1893
|
+
compressPublicKeyHex: a.compressPublicKeyHex,
|
|
1894
|
+
comparePublicKeyHex: a.comparePublicKeyHex,
|
|
1895
1895
|
doEncrypt: r,
|
|
1896
1896
|
doDecrypt: s,
|
|
1897
1897
|
doSignature: C,
|
|
1898
|
-
doVerifySignature:
|
|
1898
|
+
doVerifySignature: f,
|
|
1899
1899
|
getPublicKeyFromPrivateKey: u,
|
|
1900
1900
|
getPoint: F,
|
|
1901
|
-
verifyPublicKey:
|
|
1901
|
+
verifyPublicKey: a.verifyPublicKey
|
|
1902
1902
|
}, ur;
|
|
1903
1903
|
}
|
|
1904
|
-
var lr,
|
|
1904
|
+
var lr, zr;
|
|
1905
1905
|
function ux() {
|
|
1906
|
-
if (
|
|
1907
|
-
|
|
1908
|
-
const { sm3: y, hmac:
|
|
1906
|
+
if (zr) return lr;
|
|
1907
|
+
zr = 1;
|
|
1908
|
+
const { sm3: y, hmac: z } = Ee();
|
|
1909
1909
|
function E(m, o) {
|
|
1910
1910
|
return m.length >= o ? m : new Array(o - m.length + 1).join("0") + m;
|
|
1911
1911
|
}
|
|
1912
|
-
function
|
|
1912
|
+
function a(m) {
|
|
1913
1913
|
return m.map((o) => (o = o.toString(16), o.length === 1 ? "0" + o : o)).join("");
|
|
1914
1914
|
}
|
|
1915
1915
|
function g(m) {
|
|
@@ -1942,16 +1942,16 @@ function ux() {
|
|
|
1942
1942
|
if ((o.mode || "hmac") !== "hmac") throw new Error("invalid mode");
|
|
1943
1943
|
let r = o.key;
|
|
1944
1944
|
if (!r) throw new Error("invalid key");
|
|
1945
|
-
return r = typeof r == "string" ? g(r) : Array.prototype.slice.call(r),
|
|
1945
|
+
return r = typeof r == "string" ? g(r) : Array.prototype.slice.call(r), a(z(m, r));
|
|
1946
1946
|
}
|
|
1947
|
-
return
|
|
1947
|
+
return a(y(m));
|
|
1948
1948
|
}, lr;
|
|
1949
1949
|
}
|
|
1950
|
-
var vr,
|
|
1950
|
+
var vr, Ir;
|
|
1951
1951
|
function lx() {
|
|
1952
|
-
if (
|
|
1953
|
-
|
|
1954
|
-
const y = 0,
|
|
1952
|
+
if (Ir) return vr;
|
|
1953
|
+
Ir = 1;
|
|
1954
|
+
const y = 0, z = 32, E = 16, a = [
|
|
1955
1955
|
214,
|
|
1956
1956
|
144,
|
|
1957
1957
|
233,
|
|
@@ -2279,12 +2279,12 @@ function lx() {
|
|
|
2279
2279
|
return i << x | i >>> 32 - x;
|
|
2280
2280
|
}
|
|
2281
2281
|
function s(i) {
|
|
2282
|
-
return (
|
|
2282
|
+
return (a[i >>> 24 & 255] & 255) << 24 | (a[i >>> 16 & 255] & 255) << 16 | (a[i >>> 8 & 255] & 255) << 8 | a[i & 255] & 255;
|
|
2283
2283
|
}
|
|
2284
2284
|
function C(i) {
|
|
2285
2285
|
return i ^ r(i, 2) ^ r(i, 10) ^ r(i, 18) ^ r(i, 24);
|
|
2286
2286
|
}
|
|
2287
|
-
function
|
|
2287
|
+
function f(i) {
|
|
2288
2288
|
return i ^ r(i, 13) ^ r(i, 23);
|
|
2289
2289
|
}
|
|
2290
2290
|
function l(i, p, x) {
|
|
@@ -2302,7 +2302,7 @@ function lx() {
|
|
|
2302
2302
|
h[0] = i[0 + 4 * d] & 255, h[1] = i[1 + 4 * d] & 255, h[2] = i[2 + 4 * d] & 255, h[3] = i[3 + 4 * d] & 255, n[d] = h[0] << 24 | h[1] << 16 | h[2] << 8 | h[3];
|
|
2303
2303
|
n[0] ^= 2746333894, n[1] ^= 1453994832, n[2] ^= 1736282519, n[3] ^= 2993693404;
|
|
2304
2304
|
for (let d = 0, A; d < 32; d += 4)
|
|
2305
|
-
A = n[1] ^ n[2] ^ n[3] ^ g[d + 0], p[d + 0] = n[0] ^=
|
|
2305
|
+
A = n[1] ^ n[2] ^ n[3] ^ g[d + 0], p[d + 0] = n[0] ^= f(s(A)), A = n[2] ^ n[3] ^ n[0] ^ g[d + 1], p[d + 1] = n[1] ^= f(s(A)), A = n[3] ^ n[0] ^ n[1] ^ g[d + 2], p[d + 2] = n[2] ^= f(s(A)), A = n[0] ^ n[1] ^ n[2] ^ g[d + 3], p[d + 3] = n[3] ^= f(s(A));
|
|
2306
2306
|
if (x === y)
|
|
2307
2307
|
for (let d = 0, A; d < 16; d++)
|
|
2308
2308
|
A = p[d], p[d] = p[31 - d], p[31 - d] = A;
|
|
@@ -2321,7 +2321,7 @@ function lx() {
|
|
|
2321
2321
|
const S = E - i.length % E;
|
|
2322
2322
|
for (let k = 0; k < S; k++) i.push(S);
|
|
2323
2323
|
}
|
|
2324
|
-
const w = new Array(
|
|
2324
|
+
const w = new Array(z);
|
|
2325
2325
|
u(p, w, x);
|
|
2326
2326
|
const T = [];
|
|
2327
2327
|
let q = d, D = i.length, _ = 0;
|
|
@@ -2352,9 +2352,9 @@ function lx() {
|
|
|
2352
2352
|
}
|
|
2353
2353
|
}, vr;
|
|
2354
2354
|
}
|
|
2355
|
-
var dr,
|
|
2355
|
+
var dr, Lr;
|
|
2356
2356
|
function vx() {
|
|
2357
|
-
return
|
|
2357
|
+
return Lr || (Lr = 1, dr = {
|
|
2358
2358
|
sm2: hx(),
|
|
2359
2359
|
sm3: ux(),
|
|
2360
2360
|
sm4: lx()
|
|
@@ -2364,13 +2364,13 @@ var dx = vx(), it = { exports: {} };
|
|
|
2364
2364
|
function px(y) {
|
|
2365
2365
|
throw new Error('Could not dynamically require "' + y + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
|
|
2366
2366
|
}
|
|
2367
|
-
var ot = { exports: {} }, Bx = ot.exports,
|
|
2367
|
+
var ot = { exports: {} }, Bx = ot.exports, Or;
|
|
2368
2368
|
function j() {
|
|
2369
|
-
return
|
|
2370
|
-
(function(E,
|
|
2371
|
-
y.exports =
|
|
2369
|
+
return Or || (Or = 1, function(y, z) {
|
|
2370
|
+
(function(E, a) {
|
|
2371
|
+
y.exports = a();
|
|
2372
2372
|
})(Bx, function() {
|
|
2373
|
-
var E = E || function(
|
|
2373
|
+
var E = E || function(a, g) {
|
|
2374
2374
|
var B;
|
|
2375
2375
|
if (typeof window < "u" && window.crypto && (B = window.crypto), typeof self < "u" && self.crypto && (B = self.crypto), typeof globalThis < "u" && globalThis.crypto && (B = globalThis.crypto), !B && typeof window < "u" && window.msCrypto && (B = window.msCrypto), !B && typeof nr < "u" && nr.crypto && (B = nr.crypto), !B && typeof px == "function")
|
|
2376
2376
|
try {
|
|
@@ -2547,7 +2547,7 @@ function j() {
|
|
|
2547
2547
|
*/
|
|
2548
2548
|
clamp: function() {
|
|
2549
2549
|
var x = this.words, n = this.sigBytes;
|
|
2550
|
-
x[n >>> 2] &= 4294967295 << 32 - n % 4 * 8, x.length =
|
|
2550
|
+
x[n >>> 2] &= 4294967295 << 32 - n % 4 * 8, x.length = a.ceil(n / 4);
|
|
2551
2551
|
},
|
|
2552
2552
|
/**
|
|
2553
2553
|
* Creates a copy of this word array.
|
|
@@ -2580,7 +2580,7 @@ function j() {
|
|
|
2580
2580
|
n.push(m());
|
|
2581
2581
|
return new C.init(n, x);
|
|
2582
2582
|
}
|
|
2583
|
-
}),
|
|
2583
|
+
}), f = v.enc = {}, l = f.Hex = {
|
|
2584
2584
|
/**
|
|
2585
2585
|
* Converts a word array to a hex string.
|
|
2586
2586
|
*
|
|
@@ -2619,7 +2619,7 @@ function j() {
|
|
|
2619
2619
|
h[d >>> 3] |= parseInt(x.substr(d, 2), 16) << 24 - d % 8 * 4;
|
|
2620
2620
|
return new C.init(h, n / 2);
|
|
2621
2621
|
}
|
|
2622
|
-
}, u =
|
|
2622
|
+
}, u = f.Latin1 = {
|
|
2623
2623
|
/**
|
|
2624
2624
|
* Converts a word array to a Latin1 string.
|
|
2625
2625
|
*
|
|
@@ -2658,7 +2658,7 @@ function j() {
|
|
|
2658
2658
|
h[d >>> 2] |= (x.charCodeAt(d) & 255) << 24 - d % 4 * 8;
|
|
2659
2659
|
return new C.init(h, n);
|
|
2660
2660
|
}
|
|
2661
|
-
}, F =
|
|
2661
|
+
}, F = f.Utf8 = {
|
|
2662
2662
|
/**
|
|
2663
2663
|
* Converts a word array to a UTF-8 string.
|
|
2664
2664
|
*
|
|
@@ -2735,8 +2735,8 @@ function j() {
|
|
|
2735
2735
|
*/
|
|
2736
2736
|
_process: function(x) {
|
|
2737
2737
|
var n, h = this._data, d = h.words, A = h.sigBytes, w = this.blockSize, T = w * 4, q = A / T;
|
|
2738
|
-
x ? q =
|
|
2739
|
-
var D = q * w, _ =
|
|
2738
|
+
x ? q = a.ceil(q) : q = a.max((q | 0) - this._minBufferSize, 0);
|
|
2739
|
+
var D = q * w, _ = a.min(D * 4, A);
|
|
2740
2740
|
if (D) {
|
|
2741
2741
|
for (var S = 0; S < D; S += w)
|
|
2742
2742
|
this._doProcessBlock(d, S);
|
|
@@ -2865,13 +2865,13 @@ function j() {
|
|
|
2865
2865
|
});
|
|
2866
2866
|
}(ot)), ot.exports;
|
|
2867
2867
|
}
|
|
2868
|
-
var st = { exports: {} }, Fx = st.exports,
|
|
2868
|
+
var st = { exports: {} }, Fx = st.exports, Ur;
|
|
2869
2869
|
function Nt() {
|
|
2870
|
-
return
|
|
2871
|
-
(function(E,
|
|
2872
|
-
y.exports =
|
|
2870
|
+
return Ur || (Ur = 1, function(y, z) {
|
|
2871
|
+
(function(E, a) {
|
|
2872
|
+
y.exports = a(j());
|
|
2873
2873
|
})(Fx, function(E) {
|
|
2874
|
-
return function(
|
|
2874
|
+
return function(a) {
|
|
2875
2875
|
var g = E, B = g.lib, m = B.Base, o = B.WordArray, v = g.x64 = {};
|
|
2876
2876
|
v.Word = m.extend({
|
|
2877
2877
|
/**
|
|
@@ -3058,7 +3058,7 @@ function Nt() {
|
|
|
3058
3058
|
* ], 10);
|
|
3059
3059
|
*/
|
|
3060
3060
|
init: function(r, s) {
|
|
3061
|
-
r = this.words = r || [], s !=
|
|
3061
|
+
r = this.words = r || [], s != a ? this.sigBytes = s : this.sigBytes = r.length * 8;
|
|
3062
3062
|
},
|
|
3063
3063
|
/**
|
|
3064
3064
|
* Converts this 64-bit word array to a 32-bit word array.
|
|
@@ -3070,8 +3070,8 @@ function Nt() {
|
|
|
3070
3070
|
* var x32WordArray = x64WordArray.toX32();
|
|
3071
3071
|
*/
|
|
3072
3072
|
toX32: function() {
|
|
3073
|
-
for (var r = this.words, s = r.length, C = [],
|
|
3074
|
-
var l = r[
|
|
3073
|
+
for (var r = this.words, s = r.length, C = [], f = 0; f < s; f++) {
|
|
3074
|
+
var l = r[f];
|
|
3075
3075
|
C.push(l.high), C.push(l.low);
|
|
3076
3076
|
}
|
|
3077
3077
|
return o.create(C, this.sigBytes);
|
|
@@ -3086,8 +3086,8 @@ function Nt() {
|
|
|
3086
3086
|
* var clone = x64WordArray.clone();
|
|
3087
3087
|
*/
|
|
3088
3088
|
clone: function() {
|
|
3089
|
-
for (var r = m.clone.call(this), s = r.words = this.words.slice(0), C = s.length,
|
|
3090
|
-
s[
|
|
3089
|
+
for (var r = m.clone.call(this), s = r.words = this.words.slice(0), C = s.length, f = 0; f < C; f++)
|
|
3090
|
+
s[f] = s[f].clone();
|
|
3091
3091
|
return r;
|
|
3092
3092
|
}
|
|
3093
3093
|
});
|
|
@@ -3095,15 +3095,15 @@ function Nt() {
|
|
|
3095
3095
|
});
|
|
3096
3096
|
}(st)), st.exports;
|
|
3097
3097
|
}
|
|
3098
|
-
var at = { exports: {} }, Cx = at.exports,
|
|
3098
|
+
var at = { exports: {} }, Cx = at.exports, Mr;
|
|
3099
3099
|
function Ax() {
|
|
3100
|
-
return
|
|
3101
|
-
(function(E,
|
|
3102
|
-
y.exports =
|
|
3100
|
+
return Mr || (Mr = 1, function(y, z) {
|
|
3101
|
+
(function(E, a) {
|
|
3102
|
+
y.exports = a(j());
|
|
3103
3103
|
})(Cx, function(E) {
|
|
3104
3104
|
return function() {
|
|
3105
3105
|
if (typeof ArrayBuffer == "function") {
|
|
3106
|
-
var
|
|
3106
|
+
var a = E, g = a.lib, B = g.WordArray, m = B.init, o = B.init = function(v) {
|
|
3107
3107
|
if (v instanceof ArrayBuffer && (v = new Uint8Array(v)), (v instanceof Int8Array || typeof Uint8ClampedArray < "u" && v instanceof Uint8ClampedArray || v instanceof Int16Array || v instanceof Uint16Array || v instanceof Int32Array || v instanceof Uint32Array || v instanceof Float32Array || v instanceof Float64Array) && (v = new Uint8Array(v.buffer, v.byteOffset, v.byteLength)), v instanceof Uint8Array) {
|
|
3108
3108
|
for (var r = v.byteLength, s = [], C = 0; C < r; C++)
|
|
3109
3109
|
s[C >>> 2] |= v[C] << 24 - C % 4 * 8;
|
|
@@ -3117,14 +3117,14 @@ function Ax() {
|
|
|
3117
3117
|
});
|
|
3118
3118
|
}(at)), at.exports;
|
|
3119
3119
|
}
|
|
3120
|
-
var ft = { exports: {} }, Ex = ft.exports,
|
|
3120
|
+
var ft = { exports: {} }, Ex = ft.exports, Nr;
|
|
3121
3121
|
function yx() {
|
|
3122
|
-
return
|
|
3123
|
-
(function(E,
|
|
3124
|
-
y.exports =
|
|
3122
|
+
return Nr || (Nr = 1, function(y, z) {
|
|
3123
|
+
(function(E, a) {
|
|
3124
|
+
y.exports = a(j());
|
|
3125
3125
|
})(Ex, function(E) {
|
|
3126
3126
|
return function() {
|
|
3127
|
-
var
|
|
3127
|
+
var a = E, g = a.lib, B = g.WordArray, m = a.enc;
|
|
3128
3128
|
m.Utf16 = m.Utf16BE = {
|
|
3129
3129
|
/**
|
|
3130
3130
|
* Converts a word array to a UTF-16 BE string.
|
|
@@ -3140,8 +3140,8 @@ function yx() {
|
|
|
3140
3140
|
* var utf16String = CryptoJS.enc.Utf16.stringify(wordArray);
|
|
3141
3141
|
*/
|
|
3142
3142
|
stringify: function(v) {
|
|
3143
|
-
for (var r = v.words, s = v.sigBytes, C = [],
|
|
3144
|
-
var l = r[
|
|
3143
|
+
for (var r = v.words, s = v.sigBytes, C = [], f = 0; f < s; f += 2) {
|
|
3144
|
+
var l = r[f >>> 2] >>> 16 - f % 4 * 8 & 65535;
|
|
3145
3145
|
C.push(String.fromCharCode(l));
|
|
3146
3146
|
}
|
|
3147
3147
|
return C.join("");
|
|
@@ -3179,8 +3179,8 @@ function yx() {
|
|
|
3179
3179
|
* var utf16Str = CryptoJS.enc.Utf16LE.stringify(wordArray);
|
|
3180
3180
|
*/
|
|
3181
3181
|
stringify: function(v) {
|
|
3182
|
-
for (var r = v.words, s = v.sigBytes, C = [],
|
|
3183
|
-
var l = o(r[
|
|
3182
|
+
for (var r = v.words, s = v.sigBytes, C = [], f = 0; f < s; f += 2) {
|
|
3183
|
+
var l = o(r[f >>> 2] >>> 16 - f % 4 * 8 & 65535);
|
|
3184
3184
|
C.push(String.fromCharCode(l));
|
|
3185
3185
|
}
|
|
3186
3186
|
return C.join("");
|
|
@@ -3211,14 +3211,14 @@ function yx() {
|
|
|
3211
3211
|
});
|
|
3212
3212
|
}(ft)), ft.exports;
|
|
3213
3213
|
}
|
|
3214
|
-
var ct = { exports: {} }, Dx = ct.exports,
|
|
3215
|
-
function
|
|
3216
|
-
return
|
|
3217
|
-
(function(E,
|
|
3218
|
-
y.exports =
|
|
3214
|
+
var ct = { exports: {} }, Dx = ct.exports, Wr;
|
|
3215
|
+
function q0() {
|
|
3216
|
+
return Wr || (Wr = 1, function(y, z) {
|
|
3217
|
+
(function(E, a) {
|
|
3218
|
+
y.exports = a(j());
|
|
3219
3219
|
})(Dx, function(E) {
|
|
3220
3220
|
return function() {
|
|
3221
|
-
var
|
|
3221
|
+
var a = E, g = a.lib, B = g.WordArray, m = a.enc;
|
|
3222
3222
|
m.Base64 = {
|
|
3223
3223
|
/**
|
|
3224
3224
|
* Converts a word array to a Base64 string.
|
|
@@ -3236,14 +3236,14 @@ function R0() {
|
|
|
3236
3236
|
stringify: function(v) {
|
|
3237
3237
|
var r = v.words, s = v.sigBytes, C = this._map;
|
|
3238
3238
|
v.clamp();
|
|
3239
|
-
for (var
|
|
3239
|
+
for (var f = [], l = 0; l < s; l += 3)
|
|
3240
3240
|
for (var u = r[l >>> 2] >>> 24 - l % 4 * 8 & 255, F = r[l + 1 >>> 2] >>> 24 - (l + 1) % 4 * 8 & 255, i = r[l + 2 >>> 2] >>> 24 - (l + 2) % 4 * 8 & 255, p = u << 16 | F << 8 | i, x = 0; x < 4 && l + x * 0.75 < s; x++)
|
|
3241
|
-
|
|
3241
|
+
f.push(C.charAt(p >>> 6 * (3 - x) & 63));
|
|
3242
3242
|
var n = C.charAt(64);
|
|
3243
3243
|
if (n)
|
|
3244
|
-
for (;
|
|
3245
|
-
|
|
3246
|
-
return
|
|
3244
|
+
for (; f.length % 4; )
|
|
3245
|
+
f.push(n);
|
|
3246
|
+
return f.join("");
|
|
3247
3247
|
},
|
|
3248
3248
|
/**
|
|
3249
3249
|
* Converts a Base64 string to a word array.
|
|
@@ -3262,8 +3262,8 @@ function R0() {
|
|
|
3262
3262
|
var r = v.length, s = this._map, C = this._reverseMap;
|
|
3263
3263
|
if (!C) {
|
|
3264
3264
|
C = this._reverseMap = [];
|
|
3265
|
-
for (var
|
|
3266
|
-
C[s.charCodeAt(
|
|
3265
|
+
for (var f = 0; f < s.length; f++)
|
|
3266
|
+
C[s.charCodeAt(f)] = f;
|
|
3267
3267
|
}
|
|
3268
3268
|
var l = s.charAt(64);
|
|
3269
3269
|
if (l) {
|
|
@@ -3275,25 +3275,25 @@ function R0() {
|
|
|
3275
3275
|
_map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="
|
|
3276
3276
|
};
|
|
3277
3277
|
function o(v, r, s) {
|
|
3278
|
-
for (var C = [],
|
|
3278
|
+
for (var C = [], f = 0, l = 0; l < r; l++)
|
|
3279
3279
|
if (l % 4) {
|
|
3280
3280
|
var u = s[v.charCodeAt(l - 1)] << l % 4 * 2, F = s[v.charCodeAt(l)] >>> 6 - l % 4 * 2, i = u | F;
|
|
3281
|
-
C[
|
|
3281
|
+
C[f >>> 2] |= i << 24 - f % 4 * 8, f++;
|
|
3282
3282
|
}
|
|
3283
|
-
return B.create(C,
|
|
3283
|
+
return B.create(C, f);
|
|
3284
3284
|
}
|
|
3285
3285
|
}(), E.enc.Base64;
|
|
3286
3286
|
});
|
|
3287
3287
|
}(ct)), ct.exports;
|
|
3288
3288
|
}
|
|
3289
|
-
var ht = { exports: {} }, gx = ht.exports,
|
|
3289
|
+
var ht = { exports: {} }, gx = ht.exports, $r;
|
|
3290
3290
|
function bx() {
|
|
3291
|
-
return
|
|
3292
|
-
(function(E,
|
|
3293
|
-
y.exports =
|
|
3291
|
+
return $r || ($r = 1, function(y, z) {
|
|
3292
|
+
(function(E, a) {
|
|
3293
|
+
y.exports = a(j());
|
|
3294
3294
|
})(gx, function(E) {
|
|
3295
3295
|
return function() {
|
|
3296
|
-
var
|
|
3296
|
+
var a = E, g = a.lib, B = g.WordArray, m = a.enc;
|
|
3297
3297
|
m.Base64url = {
|
|
3298
3298
|
/**
|
|
3299
3299
|
* Converts a word array to a Base64url string.
|
|
@@ -3312,12 +3312,12 @@ function bx() {
|
|
|
3312
3312
|
*/
|
|
3313
3313
|
stringify: function(v, r) {
|
|
3314
3314
|
r === void 0 && (r = !0);
|
|
3315
|
-
var s = v.words, C = v.sigBytes,
|
|
3315
|
+
var s = v.words, C = v.sigBytes, f = r ? this._safe_map : this._map;
|
|
3316
3316
|
v.clamp();
|
|
3317
3317
|
for (var l = [], u = 0; u < C; u += 3)
|
|
3318
3318
|
for (var F = s[u >>> 2] >>> 24 - u % 4 * 8 & 255, i = s[u + 1 >>> 2] >>> 24 - (u + 1) % 4 * 8 & 255, p = s[u + 2 >>> 2] >>> 24 - (u + 2) % 4 * 8 & 255, x = F << 16 | i << 8 | p, n = 0; n < 4 && u + n * 0.75 < C; n++)
|
|
3319
|
-
l.push(
|
|
3320
|
-
var h =
|
|
3319
|
+
l.push(f.charAt(x >>> 6 * (3 - n) & 63));
|
|
3320
|
+
var h = f.charAt(64);
|
|
3321
3321
|
if (h)
|
|
3322
3322
|
for (; l.length % 4; )
|
|
3323
3323
|
l.push(h);
|
|
@@ -3340,45 +3340,45 @@ function bx() {
|
|
|
3340
3340
|
*/
|
|
3341
3341
|
parse: function(v, r) {
|
|
3342
3342
|
r === void 0 && (r = !0);
|
|
3343
|
-
var s = v.length, C = r ? this._safe_map : this._map,
|
|
3344
|
-
if (!
|
|
3345
|
-
|
|
3343
|
+
var s = v.length, C = r ? this._safe_map : this._map, f = this._reverseMap;
|
|
3344
|
+
if (!f) {
|
|
3345
|
+
f = this._reverseMap = [];
|
|
3346
3346
|
for (var l = 0; l < C.length; l++)
|
|
3347
|
-
|
|
3347
|
+
f[C.charCodeAt(l)] = l;
|
|
3348
3348
|
}
|
|
3349
3349
|
var u = C.charAt(64);
|
|
3350
3350
|
if (u) {
|
|
3351
3351
|
var F = v.indexOf(u);
|
|
3352
3352
|
F !== -1 && (s = F);
|
|
3353
3353
|
}
|
|
3354
|
-
return o(v, s,
|
|
3354
|
+
return o(v, s, f);
|
|
3355
3355
|
},
|
|
3356
3356
|
_map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=",
|
|
3357
3357
|
_safe_map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"
|
|
3358
3358
|
};
|
|
3359
3359
|
function o(v, r, s) {
|
|
3360
|
-
for (var C = [],
|
|
3360
|
+
for (var C = [], f = 0, l = 0; l < r; l++)
|
|
3361
3361
|
if (l % 4) {
|
|
3362
3362
|
var u = s[v.charCodeAt(l - 1)] << l % 4 * 2, F = s[v.charCodeAt(l)] >>> 6 - l % 4 * 2, i = u | F;
|
|
3363
|
-
C[
|
|
3363
|
+
C[f >>> 2] |= i << 24 - f % 4 * 8, f++;
|
|
3364
3364
|
}
|
|
3365
|
-
return B.create(C,
|
|
3365
|
+
return B.create(C, f);
|
|
3366
3366
|
}
|
|
3367
3367
|
}(), E.enc.Base64url;
|
|
3368
3368
|
});
|
|
3369
3369
|
}(ht)), ht.exports;
|
|
3370
3370
|
}
|
|
3371
|
-
var ut = { exports: {} }, mx = ut.exports,
|
|
3372
|
-
function
|
|
3373
|
-
return
|
|
3374
|
-
(function(E,
|
|
3375
|
-
y.exports =
|
|
3371
|
+
var ut = { exports: {} }, mx = ut.exports, Kr;
|
|
3372
|
+
function H0() {
|
|
3373
|
+
return Kr || (Kr = 1, function(y, z) {
|
|
3374
|
+
(function(E, a) {
|
|
3375
|
+
y.exports = a(j());
|
|
3376
3376
|
})(mx, function(E) {
|
|
3377
|
-
return function(
|
|
3377
|
+
return function(a) {
|
|
3378
3378
|
var g = E, B = g.lib, m = B.WordArray, o = B.Hasher, v = g.algo, r = [];
|
|
3379
3379
|
(function() {
|
|
3380
3380
|
for (var F = 0; F < 64; F++)
|
|
3381
|
-
r[F] =
|
|
3381
|
+
r[F] = a.abs(a.sin(F + 1)) * 4294967296 | 0;
|
|
3382
3382
|
})();
|
|
3383
3383
|
var s = v.MD5 = o.extend({
|
|
3384
3384
|
_doReset: function() {
|
|
@@ -3394,13 +3394,13 @@ function q0() {
|
|
|
3394
3394
|
var x = i + p, n = F[x];
|
|
3395
3395
|
F[x] = (n << 8 | n >>> 24) & 16711935 | (n << 24 | n >>> 8) & 4278255360;
|
|
3396
3396
|
}
|
|
3397
|
-
var h = this._hash.words, d = F[i + 0], A = F[i + 1], w = F[i + 2], T = F[i + 3], q = F[i + 4], D = F[i + 5], _ = F[i + 6], S = F[i + 7], k = F[i + 8], U = F[i + 9], W = F[i + 10], $ = F[i + 11], V = F[i + 12], X = F[i + 13], G = F[i + 14], Z = F[i + 15], H = h[0], R = h[1], O = h[2],
|
|
3398
|
-
H = C(H, R, O,
|
|
3397
|
+
var h = this._hash.words, d = F[i + 0], A = F[i + 1], w = F[i + 2], T = F[i + 3], q = F[i + 4], D = F[i + 5], _ = F[i + 6], S = F[i + 7], k = F[i + 8], U = F[i + 9], W = F[i + 10], $ = F[i + 11], V = F[i + 12], X = F[i + 13], G = F[i + 14], Z = F[i + 15], H = h[0], R = h[1], O = h[2], I = h[3];
|
|
3398
|
+
H = C(H, R, O, I, d, 7, r[0]), I = C(I, H, R, O, A, 12, r[1]), O = C(O, I, H, R, w, 17, r[2]), R = C(R, O, I, H, T, 22, r[3]), H = C(H, R, O, I, q, 7, r[4]), I = C(I, H, R, O, D, 12, r[5]), O = C(O, I, H, R, _, 17, r[6]), R = C(R, O, I, H, S, 22, r[7]), H = C(H, R, O, I, k, 7, r[8]), I = C(I, H, R, O, U, 12, r[9]), O = C(O, I, H, R, W, 17, r[10]), R = C(R, O, I, H, $, 22, r[11]), H = C(H, R, O, I, V, 7, r[12]), I = C(I, H, R, O, X, 12, r[13]), O = C(O, I, H, R, G, 17, r[14]), R = C(R, O, I, H, Z, 22, r[15]), H = f(H, R, O, I, A, 5, r[16]), I = f(I, H, R, O, _, 9, r[17]), O = f(O, I, H, R, $, 14, r[18]), R = f(R, O, I, H, d, 20, r[19]), H = f(H, R, O, I, D, 5, r[20]), I = f(I, H, R, O, W, 9, r[21]), O = f(O, I, H, R, Z, 14, r[22]), R = f(R, O, I, H, q, 20, r[23]), H = f(H, R, O, I, U, 5, r[24]), I = f(I, H, R, O, G, 9, r[25]), O = f(O, I, H, R, T, 14, r[26]), R = f(R, O, I, H, k, 20, r[27]), H = f(H, R, O, I, X, 5, r[28]), I = f(I, H, R, O, w, 9, r[29]), O = f(O, I, H, R, S, 14, r[30]), R = f(R, O, I, H, V, 20, r[31]), H = l(H, R, O, I, D, 4, r[32]), I = l(I, H, R, O, k, 11, r[33]), O = l(O, I, H, R, $, 16, r[34]), R = l(R, O, I, H, G, 23, r[35]), H = l(H, R, O, I, A, 4, r[36]), I = l(I, H, R, O, q, 11, r[37]), O = l(O, I, H, R, S, 16, r[38]), R = l(R, O, I, H, W, 23, r[39]), H = l(H, R, O, I, X, 4, r[40]), I = l(I, H, R, O, d, 11, r[41]), O = l(O, I, H, R, T, 16, r[42]), R = l(R, O, I, H, _, 23, r[43]), H = l(H, R, O, I, U, 4, r[44]), I = l(I, H, R, O, V, 11, r[45]), O = l(O, I, H, R, Z, 16, r[46]), R = l(R, O, I, H, w, 23, r[47]), H = u(H, R, O, I, d, 6, r[48]), I = u(I, H, R, O, S, 10, r[49]), O = u(O, I, H, R, G, 15, r[50]), R = u(R, O, I, H, D, 21, r[51]), H = u(H, R, O, I, V, 6, r[52]), I = u(I, H, R, O, T, 10, r[53]), O = u(O, I, H, R, W, 15, r[54]), R = u(R, O, I, H, A, 21, r[55]), H = u(H, R, O, I, k, 6, r[56]), I = u(I, H, R, O, Z, 10, r[57]), O = u(O, I, H, R, _, 15, r[58]), R = u(R, O, I, H, X, 21, r[59]), H = u(H, R, O, I, q, 6, r[60]), I = u(I, H, R, O, $, 10, r[61]), O = u(O, I, H, R, w, 15, r[62]), R = u(R, O, I, H, U, 21, r[63]), h[0] = h[0] + H | 0, h[1] = h[1] + R | 0, h[2] = h[2] + O | 0, h[3] = h[3] + I | 0;
|
|
3399
3399
|
},
|
|
3400
3400
|
_doFinalize: function() {
|
|
3401
3401
|
var F = this._data, i = F.words, p = this._nDataBytes * 8, x = F.sigBytes * 8;
|
|
3402
3402
|
i[x >>> 5] |= 128 << 24 - x % 32;
|
|
3403
|
-
var n =
|
|
3403
|
+
var n = a.floor(p / 4294967296), h = p;
|
|
3404
3404
|
i[(x + 64 >>> 9 << 4) + 15] = (n << 8 | n >>> 24) & 16711935 | (n << 24 | n >>> 8) & 4278255360, i[(x + 64 >>> 9 << 4) + 14] = (h << 8 | h >>> 24) & 16711935 | (h << 24 | h >>> 8) & 4278255360, F.sigBytes = (i.length + 1) * 4, this._process();
|
|
3405
3405
|
for (var d = this._hash, A = d.words, w = 0; w < 4; w++) {
|
|
3406
3406
|
var T = A[w];
|
|
@@ -3417,7 +3417,7 @@ function q0() {
|
|
|
3417
3417
|
var A = F + (i & p | ~i & x) + n + d;
|
|
3418
3418
|
return (A << h | A >>> 32 - h) + i;
|
|
3419
3419
|
}
|
|
3420
|
-
function
|
|
3420
|
+
function f(F, i, p, x, n, h, d) {
|
|
3421
3421
|
var A = F + (i & x | p & ~x) + n + d;
|
|
3422
3422
|
return (A << h | A >>> 32 - h) + i;
|
|
3423
3423
|
}
|
|
@@ -3434,14 +3434,14 @@ function q0() {
|
|
|
3434
3434
|
});
|
|
3435
3435
|
}(ut)), ut.exports;
|
|
3436
3436
|
}
|
|
3437
|
-
var lt = { exports: {} }, _x = lt.exports,
|
|
3438
|
-
function
|
|
3439
|
-
return
|
|
3440
|
-
(function(E,
|
|
3441
|
-
y.exports =
|
|
3437
|
+
var lt = { exports: {} }, _x = lt.exports, Vr;
|
|
3438
|
+
function ye() {
|
|
3439
|
+
return Vr || (Vr = 1, function(y, z) {
|
|
3440
|
+
(function(E, a) {
|
|
3441
|
+
y.exports = a(j());
|
|
3442
3442
|
})(_x, function(E) {
|
|
3443
3443
|
return function() {
|
|
3444
|
-
var
|
|
3444
|
+
var a = E, g = a.lib, B = g.WordArray, m = g.Hasher, o = a.algo, v = [], r = o.SHA1 = m.extend({
|
|
3445
3445
|
_doReset: function() {
|
|
3446
3446
|
this._hash = new B.init([
|
|
3447
3447
|
1732584193,
|
|
@@ -3452,7 +3452,7 @@ function Ee() {
|
|
|
3452
3452
|
]);
|
|
3453
3453
|
},
|
|
3454
3454
|
_doProcessBlock: function(s, C) {
|
|
3455
|
-
for (var
|
|
3455
|
+
for (var f = this._hash.words, l = f[0], u = f[1], F = f[2], i = f[3], p = f[4], x = 0; x < 80; x++) {
|
|
3456
3456
|
if (x < 16)
|
|
3457
3457
|
v[x] = s[C + x] | 0;
|
|
3458
3458
|
else {
|
|
@@ -3462,33 +3462,33 @@ function Ee() {
|
|
|
3462
3462
|
var h = (l << 5 | l >>> 27) + p + v[x];
|
|
3463
3463
|
x < 20 ? h += (u & F | ~u & i) + 1518500249 : x < 40 ? h += (u ^ F ^ i) + 1859775393 : x < 60 ? h += (u & F | u & i | F & i) - 1894007588 : h += (u ^ F ^ i) - 899497514, p = i, i = F, F = u << 30 | u >>> 2, u = l, l = h;
|
|
3464
3464
|
}
|
|
3465
|
-
|
|
3465
|
+
f[0] = f[0] + l | 0, f[1] = f[1] + u | 0, f[2] = f[2] + F | 0, f[3] = f[3] + i | 0, f[4] = f[4] + p | 0;
|
|
3466
3466
|
},
|
|
3467
3467
|
_doFinalize: function() {
|
|
3468
|
-
var s = this._data, C = s.words,
|
|
3469
|
-
return C[l >>> 5] |= 128 << 24 - l % 32, C[(l + 64 >>> 9 << 4) + 14] = Math.floor(
|
|
3468
|
+
var s = this._data, C = s.words, f = this._nDataBytes * 8, l = s.sigBytes * 8;
|
|
3469
|
+
return C[l >>> 5] |= 128 << 24 - l % 32, C[(l + 64 >>> 9 << 4) + 14] = Math.floor(f / 4294967296), C[(l + 64 >>> 9 << 4) + 15] = f, s.sigBytes = C.length * 4, this._process(), this._hash;
|
|
3470
3470
|
},
|
|
3471
3471
|
clone: function() {
|
|
3472
3472
|
var s = m.clone.call(this);
|
|
3473
3473
|
return s._hash = this._hash.clone(), s;
|
|
3474
3474
|
}
|
|
3475
3475
|
});
|
|
3476
|
-
|
|
3476
|
+
a.SHA1 = m._createHelper(r), a.HmacSHA1 = m._createHmacHelper(r);
|
|
3477
3477
|
}(), E.SHA1;
|
|
3478
3478
|
});
|
|
3479
3479
|
}(lt)), lt.exports;
|
|
3480
3480
|
}
|
|
3481
|
-
var vt = { exports: {} }, wx = vt.exports,
|
|
3482
|
-
function
|
|
3483
|
-
return
|
|
3484
|
-
(function(E,
|
|
3485
|
-
y.exports =
|
|
3481
|
+
var vt = { exports: {} }, wx = vt.exports, Xr;
|
|
3482
|
+
function Cr() {
|
|
3483
|
+
return Xr || (Xr = 1, function(y, z) {
|
|
3484
|
+
(function(E, a) {
|
|
3485
|
+
y.exports = a(j());
|
|
3486
3486
|
})(wx, function(E) {
|
|
3487
|
-
return function(
|
|
3487
|
+
return function(a) {
|
|
3488
3488
|
var g = E, B = g.lib, m = B.WordArray, o = B.Hasher, v = g.algo, r = [], s = [];
|
|
3489
3489
|
(function() {
|
|
3490
3490
|
function l(p) {
|
|
3491
|
-
for (var x =
|
|
3491
|
+
for (var x = a.sqrt(p), n = 2; n <= x; n++)
|
|
3492
3492
|
if (!(p % n))
|
|
3493
3493
|
return !1;
|
|
3494
3494
|
return !0;
|
|
@@ -3497,9 +3497,9 @@ function Fr() {
|
|
|
3497
3497
|
return (p - (p | 0)) * 4294967296 | 0;
|
|
3498
3498
|
}
|
|
3499
3499
|
for (var F = 2, i = 0; i < 64; )
|
|
3500
|
-
l(F) && (i < 8 && (r[i] = u(
|
|
3500
|
+
l(F) && (i < 8 && (r[i] = u(a.pow(F, 1 / 2))), s[i] = u(a.pow(F, 1 / 3)), i++), F++;
|
|
3501
3501
|
})();
|
|
3502
|
-
var C = [],
|
|
3502
|
+
var C = [], f = v.SHA256 = o.extend({
|
|
3503
3503
|
_doReset: function() {
|
|
3504
3504
|
this._hash = new m.init(r.slice(0));
|
|
3505
3505
|
},
|
|
@@ -3518,26 +3518,26 @@ function Fr() {
|
|
|
3518
3518
|
},
|
|
3519
3519
|
_doFinalize: function() {
|
|
3520
3520
|
var l = this._data, u = l.words, F = this._nDataBytes * 8, i = l.sigBytes * 8;
|
|
3521
|
-
return u[i >>> 5] |= 128 << 24 - i % 32, u[(i + 64 >>> 9 << 4) + 14] =
|
|
3521
|
+
return u[i >>> 5] |= 128 << 24 - i % 32, u[(i + 64 >>> 9 << 4) + 14] = a.floor(F / 4294967296), u[(i + 64 >>> 9 << 4) + 15] = F, l.sigBytes = u.length * 4, this._process(), this._hash;
|
|
3522
3522
|
},
|
|
3523
3523
|
clone: function() {
|
|
3524
3524
|
var l = o.clone.call(this);
|
|
3525
3525
|
return l._hash = this._hash.clone(), l;
|
|
3526
3526
|
}
|
|
3527
3527
|
});
|
|
3528
|
-
g.SHA256 = o._createHelper(
|
|
3528
|
+
g.SHA256 = o._createHelper(f), g.HmacSHA256 = o._createHmacHelper(f);
|
|
3529
3529
|
}(Math), E.SHA256;
|
|
3530
3530
|
});
|
|
3531
3531
|
}(vt)), vt.exports;
|
|
3532
3532
|
}
|
|
3533
|
-
var dt = { exports: {} }, Tx = dt.exports,
|
|
3533
|
+
var dt = { exports: {} }, Tx = dt.exports, jr;
|
|
3534
3534
|
function Sx() {
|
|
3535
|
-
return
|
|
3536
|
-
(function(E,
|
|
3537
|
-
y.exports =
|
|
3535
|
+
return jr || (jr = 1, function(y, z) {
|
|
3536
|
+
(function(E, a, g) {
|
|
3537
|
+
y.exports = a(j(), Cr());
|
|
3538
3538
|
})(Tx, function(E) {
|
|
3539
3539
|
return function() {
|
|
3540
|
-
var
|
|
3540
|
+
var a = E, g = a.lib, B = g.WordArray, m = a.algo, o = m.SHA256, v = m.SHA224 = o.extend({
|
|
3541
3541
|
_doReset: function() {
|
|
3542
3542
|
this._hash = new B.init([
|
|
3543
3543
|
3238371032,
|
|
@@ -3555,19 +3555,19 @@ function Sx() {
|
|
|
3555
3555
|
return r.sigBytes -= 4, r;
|
|
3556
3556
|
}
|
|
3557
3557
|
});
|
|
3558
|
-
|
|
3558
|
+
a.SHA224 = o._createHelper(v), a.HmacSHA224 = o._createHmacHelper(v);
|
|
3559
3559
|
}(), E.SHA224;
|
|
3560
3560
|
});
|
|
3561
3561
|
}(dt)), dt.exports;
|
|
3562
3562
|
}
|
|
3563
|
-
var pt = { exports: {} }, kx = pt.exports,
|
|
3564
|
-
function
|
|
3565
|
-
return
|
|
3566
|
-
(function(E,
|
|
3567
|
-
y.exports =
|
|
3563
|
+
var pt = { exports: {} }, kx = pt.exports, Zr;
|
|
3564
|
+
function De() {
|
|
3565
|
+
return Zr || (Zr = 1, function(y, z) {
|
|
3566
|
+
(function(E, a, g) {
|
|
3567
|
+
y.exports = a(j(), Nt());
|
|
3568
3568
|
})(kx, function(E) {
|
|
3569
3569
|
return function() {
|
|
3570
|
-
var
|
|
3570
|
+
var a = E, g = a.lib, B = g.Hasher, m = a.x64, o = m.Word, v = m.WordArray, r = a.algo;
|
|
3571
3571
|
function s() {
|
|
3572
3572
|
return o.create.apply(o, arguments);
|
|
3573
3573
|
}
|
|
@@ -3652,10 +3652,10 @@ function ye() {
|
|
|
3652
3652
|
s(1501505948, 4234509866),
|
|
3653
3653
|
s(1607167915, 987167468),
|
|
3654
3654
|
s(1816402316, 1246189591)
|
|
3655
|
-
],
|
|
3655
|
+
], f = [];
|
|
3656
3656
|
(function() {
|
|
3657
3657
|
for (var u = 0; u < 80; u++)
|
|
3658
|
-
|
|
3658
|
+
f[u] = s();
|
|
3659
3659
|
})();
|
|
3660
3660
|
var l = r.SHA512 = B.extend({
|
|
3661
3661
|
_doReset: function() {
|
|
@@ -3671,18 +3671,18 @@ function ye() {
|
|
|
3671
3671
|
]);
|
|
3672
3672
|
},
|
|
3673
3673
|
_doProcessBlock: function(u, F) {
|
|
3674
|
-
for (var i = this._hash.words, p = i[0], x = i[1], n = i[2], h = i[3], d = i[4], A = i[5], w = i[6], T = i[7], q = p.high, D = p.low, _ = x.high, S = x.low, k = n.high, U = n.low, W = h.high, $ = h.low, V = d.high, X = d.low, G = A.high, Z = A.low, H = w.high, R = w.low, O = T.high,
|
|
3675
|
-
var s0,
|
|
3674
|
+
for (var i = this._hash.words, p = i[0], x = i[1], n = i[2], h = i[3], d = i[4], A = i[5], w = i[6], T = i[7], q = p.high, D = p.low, _ = x.high, S = x.low, k = n.high, U = n.low, W = h.high, $ = h.low, V = d.high, X = d.low, G = A.high, Z = A.low, H = w.high, R = w.low, O = T.high, I = T.low, Q = q, Y = D, x0 = _, K = S, a0 = k, E0 = U, O0 = W, m0 = $, f0 = V, n0 = X, P0 = G, _0 = Z, z0 = H, w0 = R, U0 = O, T0 = I, c0 = 0; c0 < 80; c0++) {
|
|
3675
|
+
var s0, F0, I0 = f[c0];
|
|
3676
3676
|
if (c0 < 16)
|
|
3677
|
-
|
|
3677
|
+
F0 = I0.high = u[F + c0 * 2] | 0, s0 = I0.low = u[F + c0 * 2 + 1] | 0;
|
|
3678
3678
|
else {
|
|
3679
|
-
var $0 =
|
|
3680
|
-
s0 = K0 + Kt,
|
|
3679
|
+
var $0 = f[c0 - 15], y0 = $0.high, S0 = $0.low, Wt = (y0 >>> 1 | S0 << 31) ^ (y0 >>> 8 | S0 << 24) ^ y0 >>> 7, K0 = (S0 >>> 1 | y0 << 31) ^ (S0 >>> 8 | y0 << 24) ^ (S0 >>> 7 | y0 << 25), V0 = f[c0 - 2], D0 = V0.high, k0 = V0.low, $t = (D0 >>> 19 | k0 << 13) ^ (D0 << 3 | k0 >>> 29) ^ D0 >>> 6, L0 = (k0 >>> 19 | D0 << 13) ^ (k0 << 3 | D0 >>> 29) ^ (k0 >>> 6 | D0 << 26), X0 = f[c0 - 7], j0 = X0.high, Kt = X0.low, M0 = f[c0 - 16], Vt = M0.high, Z0 = M0.low;
|
|
3680
|
+
s0 = K0 + Kt, F0 = Wt + j0 + (s0 >>> 0 < K0 >>> 0 ? 1 : 0), s0 = s0 + L0, F0 = F0 + $t + (s0 >>> 0 < L0 >>> 0 ? 1 : 0), s0 = s0 + Z0, F0 = F0 + Vt + (s0 >>> 0 < Z0 >>> 0 ? 1 : 0), I0.high = F0, I0.low = s0;
|
|
3681
3681
|
}
|
|
3682
|
-
var Xt = f0 &
|
|
3683
|
-
|
|
3682
|
+
var Xt = f0 & P0 ^ ~f0 & z0, G0 = n0 & _0 ^ ~n0 & w0, jt = Q & x0 ^ Q & a0 ^ x0 & a0, Zt = Y & K ^ Y & E0 ^ K & E0, Gt = (Q >>> 28 | Y << 4) ^ (Q << 30 | Y >>> 2) ^ (Q << 25 | Y >>> 7), Y0 = (Y >>> 28 | Q << 4) ^ (Y << 30 | Q >>> 2) ^ (Y << 25 | Q >>> 7), Yt = (f0 >>> 14 | n0 << 18) ^ (f0 >>> 18 | n0 << 14) ^ (f0 << 23 | n0 >>> 9), Qt = (n0 >>> 14 | f0 << 18) ^ (n0 >>> 18 | f0 << 14) ^ (n0 << 23 | f0 >>> 9), Q0 = C[c0], Jt = Q0.high, J0 = Q0.low, i0 = T0 + Qt, C0 = U0 + Yt + (i0 >>> 0 < T0 >>> 0 ? 1 : 0), i0 = i0 + G0, C0 = C0 + Xt + (i0 >>> 0 < G0 >>> 0 ? 1 : 0), i0 = i0 + J0, C0 = C0 + Jt + (i0 >>> 0 < J0 >>> 0 ? 1 : 0), i0 = i0 + s0, C0 = C0 + F0 + (i0 >>> 0 < s0 >>> 0 ? 1 : 0), tt = Y0 + Zt, tr = Gt + jt + (tt >>> 0 < Y0 >>> 0 ? 1 : 0);
|
|
3683
|
+
U0 = z0, T0 = w0, z0 = P0, w0 = _0, P0 = f0, _0 = n0, n0 = m0 + i0 | 0, f0 = O0 + C0 + (n0 >>> 0 < m0 >>> 0 ? 1 : 0) | 0, O0 = a0, m0 = E0, a0 = x0, E0 = K, x0 = Q, K = Y, Y = i0 + tt | 0, Q = C0 + tr + (Y >>> 0 < i0 >>> 0 ? 1 : 0) | 0;
|
|
3684
3684
|
}
|
|
3685
|
-
D = p.low = D + Y, p.high = q + Q + (D >>> 0 < Y >>> 0 ? 1 : 0), S = x.low = S + K, x.high = _ + x0 + (S >>> 0 < K >>> 0 ? 1 : 0), U = n.low = U +
|
|
3685
|
+
D = p.low = D + Y, p.high = q + Q + (D >>> 0 < Y >>> 0 ? 1 : 0), S = x.low = S + K, x.high = _ + x0 + (S >>> 0 < K >>> 0 ? 1 : 0), U = n.low = U + E0, n.high = k + a0 + (U >>> 0 < E0 >>> 0 ? 1 : 0), $ = h.low = $ + m0, h.high = W + O0 + ($ >>> 0 < m0 >>> 0 ? 1 : 0), X = d.low = X + n0, d.high = V + f0 + (X >>> 0 < n0 >>> 0 ? 1 : 0), Z = A.low = Z + _0, A.high = G + P0 + (Z >>> 0 < _0 >>> 0 ? 1 : 0), R = w.low = R + w0, w.high = H + z0 + (R >>> 0 < w0 >>> 0 ? 1 : 0), I = T.low = I + T0, T.high = O + U0 + (I >>> 0 < T0 >>> 0 ? 1 : 0);
|
|
3686
3686
|
},
|
|
3687
3687
|
_doFinalize: function() {
|
|
3688
3688
|
var u = this._data, F = u.words, i = this._nDataBytes * 8, p = u.sigBytes * 8;
|
|
@@ -3696,19 +3696,19 @@ function ye() {
|
|
|
3696
3696
|
},
|
|
3697
3697
|
blockSize: 1024 / 32
|
|
3698
3698
|
});
|
|
3699
|
-
|
|
3699
|
+
a.SHA512 = B._createHelper(l), a.HmacSHA512 = B._createHmacHelper(l);
|
|
3700
3700
|
}(), E.SHA512;
|
|
3701
3701
|
});
|
|
3702
3702
|
}(pt)), pt.exports;
|
|
3703
3703
|
}
|
|
3704
|
-
var Bt = { exports: {} }, Rx = Bt.exports,
|
|
3704
|
+
var Bt = { exports: {} }, Rx = Bt.exports, Gr;
|
|
3705
3705
|
function qx() {
|
|
3706
|
-
return
|
|
3707
|
-
(function(E,
|
|
3708
|
-
y.exports =
|
|
3706
|
+
return Gr || (Gr = 1, function(y, z) {
|
|
3707
|
+
(function(E, a, g) {
|
|
3708
|
+
y.exports = a(j(), Nt(), De());
|
|
3709
3709
|
})(Rx, function(E) {
|
|
3710
3710
|
return function() {
|
|
3711
|
-
var
|
|
3711
|
+
var a = E, g = a.x64, B = g.Word, m = g.WordArray, o = a.algo, v = o.SHA512, r = o.SHA384 = v.extend({
|
|
3712
3712
|
_doReset: function() {
|
|
3713
3713
|
this._hash = new m.init([
|
|
3714
3714
|
new B.init(3418070365, 3238371032),
|
|
@@ -3726,19 +3726,19 @@ function qx() {
|
|
|
3726
3726
|
return s.sigBytes -= 16, s;
|
|
3727
3727
|
}
|
|
3728
3728
|
});
|
|
3729
|
-
|
|
3729
|
+
a.SHA384 = v._createHelper(r), a.HmacSHA384 = v._createHmacHelper(r);
|
|
3730
3730
|
}(), E.SHA384;
|
|
3731
3731
|
});
|
|
3732
3732
|
}(Bt)), Bt.exports;
|
|
3733
3733
|
}
|
|
3734
|
-
var Ft = { exports: {} }, Hx = Ft.exports,
|
|
3734
|
+
var Ft = { exports: {} }, Hx = Ft.exports, Yr;
|
|
3735
3735
|
function Px() {
|
|
3736
|
-
return
|
|
3737
|
-
(function(E,
|
|
3738
|
-
y.exports =
|
|
3736
|
+
return Yr || (Yr = 1, function(y, z) {
|
|
3737
|
+
(function(E, a, g) {
|
|
3738
|
+
y.exports = a(j(), Nt());
|
|
3739
3739
|
})(Hx, function(E) {
|
|
3740
|
-
return function(
|
|
3741
|
-
var g = E, B = g.lib, m = B.WordArray, o = B.Hasher, v = g.x64, r = v.Word, s = g.algo, C = [],
|
|
3740
|
+
return function(a) {
|
|
3741
|
+
var g = E, B = g.lib, m = B.WordArray, o = B.Hasher, v = g.x64, r = v.Word, s = g.algo, C = [], f = [], l = [];
|
|
3742
3742
|
(function() {
|
|
3743
3743
|
for (var i = 1, p = 0, x = 0; x < 24; x++) {
|
|
3744
3744
|
C[i + 5 * p] = (x + 1) * (x + 2) / 2 % 64;
|
|
@@ -3747,7 +3747,7 @@ function Px() {
|
|
|
3747
3747
|
}
|
|
3748
3748
|
for (var i = 0; i < 5; i++)
|
|
3749
3749
|
for (var p = 0; p < 5; p++)
|
|
3750
|
-
|
|
3750
|
+
f[i + 5 * p] = p + (2 * i + 3 * p) % 5 * 5;
|
|
3751
3751
|
for (var d = 1, A = 0; A < 24; A++) {
|
|
3752
3752
|
for (var w = 0, T = 0, q = 0; q < 7; q++) {
|
|
3753
3753
|
if (d & 1) {
|
|
@@ -3805,11 +3805,11 @@ function Px() {
|
|
|
3805
3805
|
for (var X = 1; X < 25; X++) {
|
|
3806
3806
|
var D, _, w = x[X], G = w.high, Z = w.low, H = C[X];
|
|
3807
3807
|
H < 32 ? (D = G << H | Z >>> 32 - H, _ = Z << H | G >>> 32 - H) : (D = Z << H - 32 | G >>> 64 - H, _ = G << H - 32 | Z >>> 64 - H);
|
|
3808
|
-
var R = u[
|
|
3808
|
+
var R = u[f[X]];
|
|
3809
3809
|
R.high = D, R.low = _;
|
|
3810
3810
|
}
|
|
3811
|
-
var O = u[0],
|
|
3812
|
-
O.high =
|
|
3811
|
+
var O = u[0], I = x[0];
|
|
3812
|
+
O.high = I.high, O.low = I.low;
|
|
3813
3813
|
for (var q = 0; q < 5; q++)
|
|
3814
3814
|
for (var S = 0; S < 5; S++) {
|
|
3815
3815
|
var X = q + 5 * S, w = x[X], Q = u[X], Y = u[(q + 1) % 5 + 5 * S], x0 = u[(q + 2) % 5 + 5 * S];
|
|
@@ -3823,7 +3823,7 @@ function Px() {
|
|
|
3823
3823
|
var i = this._data, p = i.words;
|
|
3824
3824
|
this._nDataBytes * 8;
|
|
3825
3825
|
var x = i.sigBytes * 8, n = this.blockSize * 32;
|
|
3826
|
-
p[x >>> 5] |= 1 << 24 - x % 32, p[(
|
|
3826
|
+
p[x >>> 5] |= 1 << 24 - x % 32, p[(a.ceil((x + 1) / n) * n >>> 5) - 1] |= 128, i.sigBytes = p.length * 4, this._process();
|
|
3827
3827
|
for (var h = this._state, d = this.cfg.outputLength / 8, A = d / 8, w = [], T = 0; T < A; T++) {
|
|
3828
3828
|
var q = h[T], D = q.high, _ = q.low;
|
|
3829
3829
|
D = (D << 8 | D >>> 24) & 16711935 | (D << 24 | D >>> 8) & 4278255360, _ = (_ << 8 | _ >>> 24) & 16711935 | (_ << 24 | _ >>> 8) & 4278255360, w.push(_), w.push(D);
|
|
@@ -3841,11 +3841,11 @@ function Px() {
|
|
|
3841
3841
|
});
|
|
3842
3842
|
}(Ft)), Ft.exports;
|
|
3843
3843
|
}
|
|
3844
|
-
var Ct = { exports: {} }, zx = Ct.exports,
|
|
3844
|
+
var Ct = { exports: {} }, zx = Ct.exports, Qr;
|
|
3845
3845
|
function Ix() {
|
|
3846
|
-
return
|
|
3847
|
-
(function(E,
|
|
3848
|
-
y.exports =
|
|
3846
|
+
return Qr || (Qr = 1, function(y, z) {
|
|
3847
|
+
(function(E, a) {
|
|
3848
|
+
y.exports = a(j());
|
|
3849
3849
|
})(zx, function(E) {
|
|
3850
3850
|
/** @preserve
|
|
3851
3851
|
(c) 2012 by Cédric Mesnil. All rights reserved.
|
|
@@ -3857,7 +3857,7 @@ function Ix() {
|
|
|
3857
3857
|
|
|
3858
3858
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
3859
3859
|
*/
|
|
3860
|
-
return function(
|
|
3860
|
+
return function(a) {
|
|
3861
3861
|
var g = E, B = g.lib, m = B.WordArray, o = B.Hasher, v = g.algo, r = m.create([
|
|
3862
3862
|
0,
|
|
3863
3863
|
1,
|
|
@@ -4101,7 +4101,7 @@ function Ix() {
|
|
|
4101
4101
|
8,
|
|
4102
4102
|
5,
|
|
4103
4103
|
6
|
|
4104
|
-
]),
|
|
4104
|
+
]), f = m.create([
|
|
4105
4105
|
8,
|
|
4106
4106
|
9,
|
|
4107
4107
|
9,
|
|
@@ -4191,11 +4191,11 @@ function Ix() {
|
|
|
4191
4191
|
var q = w + T, D = A[q];
|
|
4192
4192
|
A[q] = (D << 8 | D >>> 24) & 16711935 | (D << 24 | D >>> 8) & 4278255360;
|
|
4193
4193
|
}
|
|
4194
|
-
var _ = this._hash.words, S = l.words, k = u.words, U = r.words, W = s.words, $ = C.words, V =
|
|
4195
|
-
O = X = _[0],
|
|
4194
|
+
var _ = this._hash.words, S = l.words, k = u.words, U = r.words, W = s.words, $ = C.words, V = f.words, X, G, Z, H, R, O, I, Q, Y, x0;
|
|
4195
|
+
O = X = _[0], I = G = _[1], Q = Z = _[2], Y = H = _[3], x0 = R = _[4];
|
|
4196
4196
|
for (var K, T = 0; T < 80; T += 1)
|
|
4197
|
-
K = X + A[w + U[T]] | 0, T < 16 ? K += i(G, Z, H) + S[0] : T < 32 ? K += p(G, Z, H) + S[1] : T < 48 ? K += x(G, Z, H) + S[2] : T < 64 ? K += n(G, Z, H) + S[3] : K += h(G, Z, H) + S[4], K = K | 0, K = d(K, $[T]), K = K + R | 0, X = R, R = H, H = d(Z, 10), Z = G, G = K, K = O + A[w + W[T]] | 0, T < 16 ? K += h(
|
|
4198
|
-
K = _[1] + Z + Y | 0, _[1] = _[2] + H + x0 | 0, _[2] = _[3] + R + O | 0, _[3] = _[4] + X +
|
|
4197
|
+
K = X + A[w + U[T]] | 0, T < 16 ? K += i(G, Z, H) + S[0] : T < 32 ? K += p(G, Z, H) + S[1] : T < 48 ? K += x(G, Z, H) + S[2] : T < 64 ? K += n(G, Z, H) + S[3] : K += h(G, Z, H) + S[4], K = K | 0, K = d(K, $[T]), K = K + R | 0, X = R, R = H, H = d(Z, 10), Z = G, G = K, K = O + A[w + W[T]] | 0, T < 16 ? K += h(I, Q, Y) + k[0] : T < 32 ? K += n(I, Q, Y) + k[1] : T < 48 ? K += x(I, Q, Y) + k[2] : T < 64 ? K += p(I, Q, Y) + k[3] : K += i(I, Q, Y) + k[4], K = K | 0, K = d(K, V[T]), K = K + x0 | 0, O = x0, x0 = Y, Y = d(Q, 10), Q = I, I = K;
|
|
4198
|
+
K = _[1] + Z + Y | 0, _[1] = _[2] + H + x0 | 0, _[2] = _[3] + R + O | 0, _[3] = _[4] + X + I | 0, _[4] = _[0] + G + Q | 0, _[0] = K;
|
|
4199
4199
|
},
|
|
4200
4200
|
_doFinalize: function() {
|
|
4201
4201
|
var A = this._data, w = A.words, T = this._nDataBytes * 8, q = A.sigBytes * 8;
|
|
@@ -4234,14 +4234,14 @@ function Ix() {
|
|
|
4234
4234
|
});
|
|
4235
4235
|
}(Ct)), Ct.exports;
|
|
4236
4236
|
}
|
|
4237
|
-
var At = { exports: {} }, Lx = At.exports,
|
|
4238
|
-
function
|
|
4239
|
-
return
|
|
4240
|
-
(function(E,
|
|
4241
|
-
y.exports =
|
|
4237
|
+
var At = { exports: {} }, Lx = At.exports, Jr;
|
|
4238
|
+
function Ar() {
|
|
4239
|
+
return Jr || (Jr = 1, function(y, z) {
|
|
4240
|
+
(function(E, a) {
|
|
4241
|
+
y.exports = a(j());
|
|
4242
4242
|
})(Lx, function(E) {
|
|
4243
4243
|
(function() {
|
|
4244
|
-
var
|
|
4244
|
+
var a = E, g = a.lib, B = g.Base, m = a.enc, o = m.Utf8, v = a.algo;
|
|
4245
4245
|
v.HMAC = B.extend({
|
|
4246
4246
|
/**
|
|
4247
4247
|
* Initializes a newly created HMAC.
|
|
@@ -4255,11 +4255,11 @@ function Cr() {
|
|
|
4255
4255
|
*/
|
|
4256
4256
|
init: function(r, s) {
|
|
4257
4257
|
r = this._hasher = new r.init(), typeof s == "string" && (s = o.parse(s));
|
|
4258
|
-
var C = r.blockSize,
|
|
4259
|
-
s.sigBytes >
|
|
4258
|
+
var C = r.blockSize, f = C * 4;
|
|
4259
|
+
s.sigBytes > f && (s = r.finalize(s)), s.clamp();
|
|
4260
4260
|
for (var l = this._oKey = s.clone(), u = this._iKey = s.clone(), F = l.words, i = u.words, p = 0; p < C; p++)
|
|
4261
4261
|
F[p] ^= 1549556828, i[p] ^= 909522486;
|
|
4262
|
-
l.sigBytes = u.sigBytes =
|
|
4262
|
+
l.sigBytes = u.sigBytes = f, this.reset();
|
|
4263
4263
|
},
|
|
4264
4264
|
/**
|
|
4265
4265
|
* Resets this HMAC to its initial state.
|
|
@@ -4304,22 +4304,22 @@ function Cr() {
|
|
|
4304
4304
|
finalize: function(r) {
|
|
4305
4305
|
var s = this._hasher, C = s.finalize(r);
|
|
4306
4306
|
s.reset();
|
|
4307
|
-
var
|
|
4308
|
-
return
|
|
4307
|
+
var f = s.finalize(this._oKey.clone().concat(C));
|
|
4308
|
+
return f;
|
|
4309
4309
|
}
|
|
4310
4310
|
});
|
|
4311
4311
|
})();
|
|
4312
4312
|
});
|
|
4313
4313
|
}(At)), At.exports;
|
|
4314
4314
|
}
|
|
4315
|
-
var Et = { exports: {} }, Ox = Et.exports,
|
|
4315
|
+
var Et = { exports: {} }, Ox = Et.exports, te;
|
|
4316
4316
|
function Ux() {
|
|
4317
|
-
return
|
|
4318
|
-
(function(E,
|
|
4319
|
-
y.exports =
|
|
4317
|
+
return te || (te = 1, function(y, z) {
|
|
4318
|
+
(function(E, a, g) {
|
|
4319
|
+
y.exports = a(j(), Cr(), Ar());
|
|
4320
4320
|
})(Ox, function(E) {
|
|
4321
4321
|
return function() {
|
|
4322
|
-
var
|
|
4322
|
+
var a = E, g = a.lib, B = g.Base, m = g.WordArray, o = a.algo, v = o.SHA256, r = o.HMAC, s = o.PBKDF2 = B.extend({
|
|
4323
4323
|
/**
|
|
4324
4324
|
* Configuration options.
|
|
4325
4325
|
*
|
|
@@ -4358,9 +4358,9 @@ function Ux() {
|
|
|
4358
4358
|
*
|
|
4359
4359
|
* var key = kdf.compute(password, salt);
|
|
4360
4360
|
*/
|
|
4361
|
-
compute: function(C,
|
|
4361
|
+
compute: function(C, f) {
|
|
4362
4362
|
for (var l = this.cfg, u = r.create(l.hasher, C), F = m.create(), i = m.create([1]), p = F.words, x = i.words, n = l.keySize, h = l.iterations; p.length < n; ) {
|
|
4363
|
-
var d = u.update(
|
|
4363
|
+
var d = u.update(f).finalize(i);
|
|
4364
4364
|
u.reset();
|
|
4365
4365
|
for (var A = d.words, w = A.length, T = d, q = 1; q < h; q++) {
|
|
4366
4366
|
T = u.finalize(T), u.reset();
|
|
@@ -4372,21 +4372,21 @@ function Ux() {
|
|
|
4372
4372
|
return F.sigBytes = n * 4, F;
|
|
4373
4373
|
}
|
|
4374
4374
|
});
|
|
4375
|
-
|
|
4376
|
-
return s.create(l).compute(C,
|
|
4375
|
+
a.PBKDF2 = function(C, f, l) {
|
|
4376
|
+
return s.create(l).compute(C, f);
|
|
4377
4377
|
};
|
|
4378
4378
|
}(), E.PBKDF2;
|
|
4379
4379
|
});
|
|
4380
4380
|
}(Et)), Et.exports;
|
|
4381
4381
|
}
|
|
4382
|
-
var yt = { exports: {} }, Mx = yt.exports,
|
|
4383
|
-
function
|
|
4384
|
-
return
|
|
4385
|
-
(function(E,
|
|
4386
|
-
y.exports =
|
|
4382
|
+
var yt = { exports: {} }, Mx = yt.exports, re;
|
|
4383
|
+
function b0() {
|
|
4384
|
+
return re || (re = 1, function(y, z) {
|
|
4385
|
+
(function(E, a, g) {
|
|
4386
|
+
y.exports = a(j(), ye(), Ar());
|
|
4387
4387
|
})(Mx, function(E) {
|
|
4388
4388
|
return function() {
|
|
4389
|
-
var
|
|
4389
|
+
var a = E, g = a.lib, B = g.Base, m = g.WordArray, o = a.algo, v = o.MD5, r = o.EvpKDF = B.extend({
|
|
4390
4390
|
/**
|
|
4391
4391
|
* Configuration options.
|
|
4392
4392
|
*
|
|
@@ -4426,32 +4426,32 @@ function g0() {
|
|
|
4426
4426
|
* var key = kdf.compute(password, salt);
|
|
4427
4427
|
*/
|
|
4428
4428
|
compute: function(s, C) {
|
|
4429
|
-
for (var
|
|
4430
|
-
|
|
4429
|
+
for (var f, l = this.cfg, u = l.hasher.create(), F = m.create(), i = F.words, p = l.keySize, x = l.iterations; i.length < p; ) {
|
|
4430
|
+
f && u.update(f), f = u.update(s).finalize(C), u.reset();
|
|
4431
4431
|
for (var n = 1; n < x; n++)
|
|
4432
|
-
|
|
4433
|
-
F.concat(
|
|
4432
|
+
f = u.finalize(f), u.reset();
|
|
4433
|
+
F.concat(f);
|
|
4434
4434
|
}
|
|
4435
4435
|
return F.sigBytes = p * 4, F;
|
|
4436
4436
|
}
|
|
4437
4437
|
});
|
|
4438
|
-
|
|
4439
|
-
return r.create(
|
|
4438
|
+
a.EvpKDF = function(s, C, f) {
|
|
4439
|
+
return r.create(f).compute(s, C);
|
|
4440
4440
|
};
|
|
4441
4441
|
}(), E.EvpKDF;
|
|
4442
4442
|
});
|
|
4443
4443
|
}(yt)), yt.exports;
|
|
4444
4444
|
}
|
|
4445
|
-
var Dt = { exports: {} }, Nx = Dt.exports,
|
|
4445
|
+
var Dt = { exports: {} }, Nx = Dt.exports, ee;
|
|
4446
4446
|
function e0() {
|
|
4447
|
-
return
|
|
4448
|
-
(function(E,
|
|
4449
|
-
y.exports =
|
|
4447
|
+
return ee || (ee = 1, function(y, z) {
|
|
4448
|
+
(function(E, a, g) {
|
|
4449
|
+
y.exports = a(j(), b0());
|
|
4450
4450
|
})(Nx, function(E) {
|
|
4451
|
-
E.lib.Cipher || function(
|
|
4451
|
+
E.lib.Cipher || function(a) {
|
|
4452
4452
|
var g = E, B = g.lib, m = B.Base, o = B.WordArray, v = B.BufferedBlockAlgorithm, r = g.enc;
|
|
4453
4453
|
r.Utf8;
|
|
4454
|
-
var s = r.Base64, C = g.algo,
|
|
4454
|
+
var s = r.Base64, C = g.algo, f = C.EvpKDF, l = B.Cipher = v.extend({
|
|
4455
4455
|
/**
|
|
4456
4456
|
* Configuration options.
|
|
4457
4457
|
*
|
|
@@ -4669,7 +4669,7 @@ function e0() {
|
|
|
4669
4669
|
});
|
|
4670
4670
|
function _(S, k, U) {
|
|
4671
4671
|
var W, $ = this._iv;
|
|
4672
|
-
$ ? (W = $, this._iv =
|
|
4672
|
+
$ ? (W = $, this._iv = a) : W = this._prevBlock;
|
|
4673
4673
|
for (var V = 0; V < U; V++)
|
|
4674
4674
|
S[k + V] ^= W[V];
|
|
4675
4675
|
}
|
|
@@ -4912,9 +4912,9 @@ function e0() {
|
|
|
4912
4912
|
*/
|
|
4913
4913
|
execute: function(D, _, S, k, U) {
|
|
4914
4914
|
if (k || (k = o.random(64 / 8)), U)
|
|
4915
|
-
var W =
|
|
4915
|
+
var W = f.create({ keySize: _ + S, hasher: U }).compute(D, k);
|
|
4916
4916
|
else
|
|
4917
|
-
var W =
|
|
4917
|
+
var W = f.create({ keySize: _ + S }).compute(D, k);
|
|
4918
4918
|
var $ = o.create(W.words.slice(_), S * 4);
|
|
4919
4919
|
return W.sigBytes = _ * 4, n.create({ key: W, iv: $, salt: k });
|
|
4920
4920
|
}
|
|
@@ -4980,20 +4980,20 @@ function e0() {
|
|
|
4980
4980
|
});
|
|
4981
4981
|
}(Dt)), Dt.exports;
|
|
4982
4982
|
}
|
|
4983
|
-
var gt = { exports: {} }, Wx = gt.exports,
|
|
4983
|
+
var gt = { exports: {} }, Wx = gt.exports, xe;
|
|
4984
4984
|
function $x() {
|
|
4985
|
-
return
|
|
4986
|
-
(function(E,
|
|
4987
|
-
y.exports =
|
|
4985
|
+
return xe || (xe = 1, function(y, z) {
|
|
4986
|
+
(function(E, a, g) {
|
|
4987
|
+
y.exports = a(j(), e0());
|
|
4988
4988
|
})(Wx, function(E) {
|
|
4989
4989
|
return E.mode.CFB = function() {
|
|
4990
|
-
var
|
|
4991
|
-
|
|
4990
|
+
var a = E.lib.BlockCipherMode.extend();
|
|
4991
|
+
a.Encryptor = a.extend({
|
|
4992
4992
|
processBlock: function(B, m) {
|
|
4993
4993
|
var o = this._cipher, v = o.blockSize;
|
|
4994
4994
|
g.call(this, B, m, v, o), this._prevBlock = B.slice(m, m + v);
|
|
4995
4995
|
}
|
|
4996
|
-
}),
|
|
4996
|
+
}), a.Decryptor = a.extend({
|
|
4997
4997
|
processBlock: function(B, m) {
|
|
4998
4998
|
var o = this._cipher, v = o.blockSize, r = B.slice(m, m + v);
|
|
4999
4999
|
g.call(this, B, m, v, o), this._prevBlock = r;
|
|
@@ -5005,38 +5005,38 @@ function $x() {
|
|
|
5005
5005
|
for (var C = 0; C < o; C++)
|
|
5006
5006
|
B[m + C] ^= r[C];
|
|
5007
5007
|
}
|
|
5008
|
-
return
|
|
5008
|
+
return a;
|
|
5009
5009
|
}(), E.mode.CFB;
|
|
5010
5010
|
});
|
|
5011
5011
|
}(gt)), gt.exports;
|
|
5012
5012
|
}
|
|
5013
|
-
var bt = { exports: {} }, Kx = bt.exports,
|
|
5013
|
+
var bt = { exports: {} }, Kx = bt.exports, ne;
|
|
5014
5014
|
function Vx() {
|
|
5015
|
-
return
|
|
5016
|
-
(function(E,
|
|
5017
|
-
y.exports =
|
|
5015
|
+
return ne || (ne = 1, function(y, z) {
|
|
5016
|
+
(function(E, a, g) {
|
|
5017
|
+
y.exports = a(j(), e0());
|
|
5018
5018
|
})(Kx, function(E) {
|
|
5019
5019
|
return E.mode.CTR = function() {
|
|
5020
|
-
var
|
|
5020
|
+
var a = E.lib.BlockCipherMode.extend(), g = a.Encryptor = a.extend({
|
|
5021
5021
|
processBlock: function(B, m) {
|
|
5022
5022
|
var o = this._cipher, v = o.blockSize, r = this._iv, s = this._counter;
|
|
5023
5023
|
r && (s = this._counter = r.slice(0), this._iv = void 0);
|
|
5024
5024
|
var C = s.slice(0);
|
|
5025
5025
|
o.encryptBlock(C, 0), s[v - 1] = s[v - 1] + 1 | 0;
|
|
5026
|
-
for (var
|
|
5027
|
-
B[m +
|
|
5026
|
+
for (var f = 0; f < v; f++)
|
|
5027
|
+
B[m + f] ^= C[f];
|
|
5028
5028
|
}
|
|
5029
5029
|
});
|
|
5030
|
-
return
|
|
5030
|
+
return a.Decryptor = g, a;
|
|
5031
5031
|
}(), E.mode.CTR;
|
|
5032
5032
|
});
|
|
5033
5033
|
}(bt)), bt.exports;
|
|
5034
5034
|
}
|
|
5035
|
-
var mt = { exports: {} }, Xx = mt.exports,
|
|
5035
|
+
var mt = { exports: {} }, Xx = mt.exports, ie;
|
|
5036
5036
|
function jx() {
|
|
5037
|
-
return
|
|
5038
|
-
(function(E,
|
|
5039
|
-
y.exports =
|
|
5037
|
+
return ie || (ie = 1, function(y, z) {
|
|
5038
|
+
(function(E, a, g) {
|
|
5039
|
+
y.exports = a(j(), e0());
|
|
5040
5040
|
})(Xx, function(E) {
|
|
5041
5041
|
/** @preserve
|
|
5042
5042
|
* Counter block mode compatible with Dr Brian Gladman fileenc.c
|
|
@@ -5044,7 +5044,7 @@ function jx() {
|
|
|
5044
5044
|
* Jan Hruby jhruby.web@gmail.com
|
|
5045
5045
|
*/
|
|
5046
5046
|
return E.mode.CTRGladman = function() {
|
|
5047
|
-
var
|
|
5047
|
+
var a = E.lib.BlockCipherMode.extend();
|
|
5048
5048
|
function g(o) {
|
|
5049
5049
|
if ((o >> 24 & 255) === 255) {
|
|
5050
5050
|
var v = o >> 16 & 255, r = o >> 8 & 255, s = o & 255;
|
|
@@ -5056,29 +5056,29 @@ function jx() {
|
|
|
5056
5056
|
function B(o) {
|
|
5057
5057
|
return (o[0] = g(o[0])) === 0 && (o[1] = g(o[1])), o;
|
|
5058
5058
|
}
|
|
5059
|
-
var m =
|
|
5059
|
+
var m = a.Encryptor = a.extend({
|
|
5060
5060
|
processBlock: function(o, v) {
|
|
5061
|
-
var r = this._cipher, s = r.blockSize, C = this._iv,
|
|
5062
|
-
C && (
|
|
5063
|
-
var l =
|
|
5061
|
+
var r = this._cipher, s = r.blockSize, C = this._iv, f = this._counter;
|
|
5062
|
+
C && (f = this._counter = C.slice(0), this._iv = void 0), B(f);
|
|
5063
|
+
var l = f.slice(0);
|
|
5064
5064
|
r.encryptBlock(l, 0);
|
|
5065
5065
|
for (var u = 0; u < s; u++)
|
|
5066
5066
|
o[v + u] ^= l[u];
|
|
5067
5067
|
}
|
|
5068
5068
|
});
|
|
5069
|
-
return
|
|
5069
|
+
return a.Decryptor = m, a;
|
|
5070
5070
|
}(), E.mode.CTRGladman;
|
|
5071
5071
|
});
|
|
5072
5072
|
}(mt)), mt.exports;
|
|
5073
5073
|
}
|
|
5074
|
-
var _t = { exports: {} }, Zx = _t.exports,
|
|
5074
|
+
var _t = { exports: {} }, Zx = _t.exports, oe;
|
|
5075
5075
|
function Gx() {
|
|
5076
|
-
return
|
|
5077
|
-
(function(E,
|
|
5078
|
-
y.exports =
|
|
5076
|
+
return oe || (oe = 1, function(y, z) {
|
|
5077
|
+
(function(E, a, g) {
|
|
5078
|
+
y.exports = a(j(), e0());
|
|
5079
5079
|
})(Zx, function(E) {
|
|
5080
5080
|
return E.mode.OFB = function() {
|
|
5081
|
-
var
|
|
5081
|
+
var a = E.lib.BlockCipherMode.extend(), g = a.Encryptor = a.extend({
|
|
5082
5082
|
processBlock: function(B, m) {
|
|
5083
5083
|
var o = this._cipher, v = o.blockSize, r = this._iv, s = this._keystream;
|
|
5084
5084
|
r && (s = this._keystream = r.slice(0), this._iv = void 0), o.encryptBlock(s, 0);
|
|
@@ -5086,102 +5086,102 @@ function Gx() {
|
|
|
5086
5086
|
B[m + C] ^= s[C];
|
|
5087
5087
|
}
|
|
5088
5088
|
});
|
|
5089
|
-
return
|
|
5089
|
+
return a.Decryptor = g, a;
|
|
5090
5090
|
}(), E.mode.OFB;
|
|
5091
5091
|
});
|
|
5092
5092
|
}(_t)), _t.exports;
|
|
5093
5093
|
}
|
|
5094
|
-
var wt = { exports: {} }, Yx = wt.exports,
|
|
5094
|
+
var wt = { exports: {} }, Yx = wt.exports, se;
|
|
5095
5095
|
function Qx() {
|
|
5096
|
-
return
|
|
5097
|
-
(function(E,
|
|
5098
|
-
y.exports =
|
|
5096
|
+
return se || (se = 1, function(y, z) {
|
|
5097
|
+
(function(E, a, g) {
|
|
5098
|
+
y.exports = a(j(), e0());
|
|
5099
5099
|
})(Yx, function(E) {
|
|
5100
5100
|
return E.mode.ECB = function() {
|
|
5101
|
-
var
|
|
5102
|
-
return
|
|
5101
|
+
var a = E.lib.BlockCipherMode.extend();
|
|
5102
|
+
return a.Encryptor = a.extend({
|
|
5103
5103
|
processBlock: function(g, B) {
|
|
5104
5104
|
this._cipher.encryptBlock(g, B);
|
|
5105
5105
|
}
|
|
5106
|
-
}),
|
|
5106
|
+
}), a.Decryptor = a.extend({
|
|
5107
5107
|
processBlock: function(g, B) {
|
|
5108
5108
|
this._cipher.decryptBlock(g, B);
|
|
5109
5109
|
}
|
|
5110
|
-
}),
|
|
5110
|
+
}), a;
|
|
5111
5111
|
}(), E.mode.ECB;
|
|
5112
5112
|
});
|
|
5113
5113
|
}(wt)), wt.exports;
|
|
5114
5114
|
}
|
|
5115
|
-
var Tt = { exports: {} }, Jx = Tt.exports,
|
|
5115
|
+
var Tt = { exports: {} }, Jx = Tt.exports, ae;
|
|
5116
5116
|
function tn() {
|
|
5117
|
-
return
|
|
5118
|
-
(function(E,
|
|
5119
|
-
y.exports =
|
|
5117
|
+
return ae || (ae = 1, function(y, z) {
|
|
5118
|
+
(function(E, a, g) {
|
|
5119
|
+
y.exports = a(j(), e0());
|
|
5120
5120
|
})(Jx, function(E) {
|
|
5121
5121
|
return E.pad.AnsiX923 = {
|
|
5122
|
-
pad: function(
|
|
5123
|
-
var B =
|
|
5124
|
-
|
|
5122
|
+
pad: function(a, g) {
|
|
5123
|
+
var B = a.sigBytes, m = g * 4, o = m - B % m, v = B + o - 1;
|
|
5124
|
+
a.clamp(), a.words[v >>> 2] |= o << 24 - v % 4 * 8, a.sigBytes += o;
|
|
5125
5125
|
},
|
|
5126
|
-
unpad: function(
|
|
5127
|
-
var g =
|
|
5128
|
-
|
|
5126
|
+
unpad: function(a) {
|
|
5127
|
+
var g = a.words[a.sigBytes - 1 >>> 2] & 255;
|
|
5128
|
+
a.sigBytes -= g;
|
|
5129
5129
|
}
|
|
5130
5130
|
}, E.pad.Ansix923;
|
|
5131
5131
|
});
|
|
5132
5132
|
}(Tt)), Tt.exports;
|
|
5133
5133
|
}
|
|
5134
|
-
var St = { exports: {} }, rn = St.exports,
|
|
5134
|
+
var St = { exports: {} }, rn = St.exports, fe;
|
|
5135
5135
|
function en() {
|
|
5136
|
-
return
|
|
5137
|
-
(function(E,
|
|
5138
|
-
y.exports =
|
|
5136
|
+
return fe || (fe = 1, function(y, z) {
|
|
5137
|
+
(function(E, a, g) {
|
|
5138
|
+
y.exports = a(j(), e0());
|
|
5139
5139
|
})(rn, function(E) {
|
|
5140
5140
|
return E.pad.Iso10126 = {
|
|
5141
|
-
pad: function(
|
|
5142
|
-
var B = g * 4, m = B -
|
|
5143
|
-
|
|
5141
|
+
pad: function(a, g) {
|
|
5142
|
+
var B = g * 4, m = B - a.sigBytes % B;
|
|
5143
|
+
a.concat(E.lib.WordArray.random(m - 1)).concat(E.lib.WordArray.create([m << 24], 1));
|
|
5144
5144
|
},
|
|
5145
|
-
unpad: function(
|
|
5146
|
-
var g =
|
|
5147
|
-
|
|
5145
|
+
unpad: function(a) {
|
|
5146
|
+
var g = a.words[a.sigBytes - 1 >>> 2] & 255;
|
|
5147
|
+
a.sigBytes -= g;
|
|
5148
5148
|
}
|
|
5149
5149
|
}, E.pad.Iso10126;
|
|
5150
5150
|
});
|
|
5151
5151
|
}(St)), St.exports;
|
|
5152
5152
|
}
|
|
5153
|
-
var kt = { exports: {} }, xn = kt.exports,
|
|
5153
|
+
var kt = { exports: {} }, xn = kt.exports, ce;
|
|
5154
5154
|
function nn() {
|
|
5155
|
-
return
|
|
5156
|
-
(function(E,
|
|
5157
|
-
y.exports =
|
|
5155
|
+
return ce || (ce = 1, function(y, z) {
|
|
5156
|
+
(function(E, a, g) {
|
|
5157
|
+
y.exports = a(j(), e0());
|
|
5158
5158
|
})(xn, function(E) {
|
|
5159
5159
|
return E.pad.Iso97971 = {
|
|
5160
|
-
pad: function(
|
|
5161
|
-
|
|
5160
|
+
pad: function(a, g) {
|
|
5161
|
+
a.concat(E.lib.WordArray.create([2147483648], 1)), E.pad.ZeroPadding.pad(a, g);
|
|
5162
5162
|
},
|
|
5163
|
-
unpad: function(
|
|
5164
|
-
E.pad.ZeroPadding.unpad(
|
|
5163
|
+
unpad: function(a) {
|
|
5164
|
+
E.pad.ZeroPadding.unpad(a), a.sigBytes--;
|
|
5165
5165
|
}
|
|
5166
5166
|
}, E.pad.Iso97971;
|
|
5167
5167
|
});
|
|
5168
5168
|
}(kt)), kt.exports;
|
|
5169
5169
|
}
|
|
5170
|
-
var Rt = { exports: {} }, on = Rt.exports,
|
|
5170
|
+
var Rt = { exports: {} }, on = Rt.exports, he;
|
|
5171
5171
|
function sn() {
|
|
5172
|
-
return
|
|
5173
|
-
(function(E,
|
|
5174
|
-
y.exports =
|
|
5172
|
+
return he || (he = 1, function(y, z) {
|
|
5173
|
+
(function(E, a, g) {
|
|
5174
|
+
y.exports = a(j(), e0());
|
|
5175
5175
|
})(on, function(E) {
|
|
5176
5176
|
return E.pad.ZeroPadding = {
|
|
5177
|
-
pad: function(
|
|
5177
|
+
pad: function(a, g) {
|
|
5178
5178
|
var B = g * 4;
|
|
5179
|
-
|
|
5179
|
+
a.clamp(), a.sigBytes += B - (a.sigBytes % B || B);
|
|
5180
5180
|
},
|
|
5181
|
-
unpad: function(
|
|
5182
|
-
for (var g =
|
|
5181
|
+
unpad: function(a) {
|
|
5182
|
+
for (var g = a.words, B = a.sigBytes - 1, B = a.sigBytes - 1; B >= 0; B--)
|
|
5183
5183
|
if (g[B >>> 2] >>> 24 - B % 4 * 8 & 255) {
|
|
5184
|
-
|
|
5184
|
+
a.sigBytes = B + 1;
|
|
5185
5185
|
break;
|
|
5186
5186
|
}
|
|
5187
5187
|
}
|
|
@@ -5189,11 +5189,11 @@ function sn() {
|
|
|
5189
5189
|
});
|
|
5190
5190
|
}(Rt)), Rt.exports;
|
|
5191
5191
|
}
|
|
5192
|
-
var qt = { exports: {} }, an = qt.exports,
|
|
5192
|
+
var qt = { exports: {} }, an = qt.exports, ue;
|
|
5193
5193
|
function fn() {
|
|
5194
|
-
return
|
|
5195
|
-
(function(E,
|
|
5196
|
-
y.exports =
|
|
5194
|
+
return ue || (ue = 1, function(y, z) {
|
|
5195
|
+
(function(E, a, g) {
|
|
5196
|
+
y.exports = a(j(), e0());
|
|
5197
5197
|
})(an, function(E) {
|
|
5198
5198
|
return E.pad.NoPadding = {
|
|
5199
5199
|
pad: function() {
|
|
@@ -5204,13 +5204,13 @@ function fn() {
|
|
|
5204
5204
|
});
|
|
5205
5205
|
}(qt)), qt.exports;
|
|
5206
5206
|
}
|
|
5207
|
-
var Ht = { exports: {} }, cn = Ht.exports,
|
|
5207
|
+
var Ht = { exports: {} }, cn = Ht.exports, le;
|
|
5208
5208
|
function hn() {
|
|
5209
|
-
return
|
|
5210
|
-
(function(E,
|
|
5211
|
-
y.exports =
|
|
5209
|
+
return le || (le = 1, function(y, z) {
|
|
5210
|
+
(function(E, a, g) {
|
|
5211
|
+
y.exports = a(j(), e0());
|
|
5212
5212
|
})(cn, function(E) {
|
|
5213
|
-
return function(
|
|
5213
|
+
return function(a) {
|
|
5214
5214
|
var g = E, B = g.lib, m = B.CipherParams, o = g.enc, v = o.Hex, r = g.format;
|
|
5215
5215
|
r.Hex = {
|
|
5216
5216
|
/**
|
|
@@ -5251,14 +5251,14 @@ function hn() {
|
|
|
5251
5251
|
});
|
|
5252
5252
|
}(Ht)), Ht.exports;
|
|
5253
5253
|
}
|
|
5254
|
-
var Pt = { exports: {} }, un = Pt.exports,
|
|
5254
|
+
var Pt = { exports: {} }, un = Pt.exports, ve;
|
|
5255
5255
|
function ln() {
|
|
5256
|
-
return
|
|
5257
|
-
(function(E,
|
|
5258
|
-
y.exports =
|
|
5256
|
+
return ve || (ve = 1, function(y, z) {
|
|
5257
|
+
(function(E, a, g) {
|
|
5258
|
+
y.exports = a(j(), q0(), H0(), b0(), e0());
|
|
5259
5259
|
})(un, function(E) {
|
|
5260
5260
|
return function() {
|
|
5261
|
-
var
|
|
5261
|
+
var a = E, g = a.lib, B = g.BlockCipher, m = a.algo, o = [], v = [], r = [], s = [], C = [], f = [], l = [], u = [], F = [], i = [];
|
|
5262
5262
|
(function() {
|
|
5263
5263
|
for (var n = [], h = 0; h < 256; h++)
|
|
5264
5264
|
h < 128 ? n[h] = h << 1 : n[h] = h << 1 ^ 283;
|
|
@@ -5266,7 +5266,7 @@ function ln() {
|
|
|
5266
5266
|
var w = A ^ A << 1 ^ A << 2 ^ A << 3 ^ A << 4;
|
|
5267
5267
|
w = w >>> 8 ^ w & 255 ^ 99, o[d] = w, v[w] = d;
|
|
5268
5268
|
var T = n[d], q = n[T], D = n[q], _ = n[w] * 257 ^ w * 16843008;
|
|
5269
|
-
r[d] = _ << 24 | _ >>> 8, s[d] = _ << 16 | _ >>> 16, C[d] = _ << 8 | _ >>> 24,
|
|
5269
|
+
r[d] = _ << 24 | _ >>> 8, s[d] = _ << 16 | _ >>> 16, C[d] = _ << 8 | _ >>> 24, f[d] = _;
|
|
5270
5270
|
var _ = D * 16843009 ^ q * 65537 ^ T * 257 ^ d * 16843008;
|
|
5271
5271
|
l[w] = _ << 24 | _ >>> 8, u[w] = _ << 16 | _ >>> 16, F[w] = _ << 8 | _ >>> 24, i[w] = _, d ? (d = T ^ n[n[n[D ^ T]]], A ^= n[n[A]]) : d = A = 1;
|
|
5272
5272
|
}
|
|
@@ -5288,7 +5288,7 @@ function ln() {
|
|
|
5288
5288
|
}
|
|
5289
5289
|
},
|
|
5290
5290
|
encryptBlock: function(n, h) {
|
|
5291
|
-
this._doCryptBlock(n, h, this._keySchedule, r, s, C,
|
|
5291
|
+
this._doCryptBlock(n, h, this._keySchedule, r, s, C, f, o);
|
|
5292
5292
|
},
|
|
5293
5293
|
decryptBlock: function(n, h) {
|
|
5294
5294
|
var d = n[h + 1];
|
|
@@ -5306,19 +5306,19 @@ function ln() {
|
|
|
5306
5306
|
},
|
|
5307
5307
|
keySize: 256 / 32
|
|
5308
5308
|
});
|
|
5309
|
-
|
|
5309
|
+
a.AES = B._createHelper(x);
|
|
5310
5310
|
}(), E.AES;
|
|
5311
5311
|
});
|
|
5312
5312
|
}(Pt)), Pt.exports;
|
|
5313
5313
|
}
|
|
5314
|
-
var zt = { exports: {} }, vn = zt.exports,
|
|
5314
|
+
var zt = { exports: {} }, vn = zt.exports, de;
|
|
5315
5315
|
function dn() {
|
|
5316
|
-
return
|
|
5317
|
-
(function(E,
|
|
5318
|
-
y.exports =
|
|
5316
|
+
return de || (de = 1, function(y, z) {
|
|
5317
|
+
(function(E, a, g) {
|
|
5318
|
+
y.exports = a(j(), q0(), H0(), b0(), e0());
|
|
5319
5319
|
})(vn, function(E) {
|
|
5320
5320
|
return function() {
|
|
5321
|
-
var
|
|
5321
|
+
var a = E, g = a.lib, B = g.WordArray, m = g.BlockCipher, o = a.algo, v = [
|
|
5322
5322
|
57,
|
|
5323
5323
|
49,
|
|
5324
5324
|
41,
|
|
@@ -5953,7 +5953,7 @@ function dn() {
|
|
|
5953
5953
|
2147483678: 131104,
|
|
5954
5954
|
2147483679: 134350848
|
|
5955
5955
|
}
|
|
5956
|
-
],
|
|
5956
|
+
], f = [
|
|
5957
5957
|
4160749569,
|
|
5958
5958
|
528482304,
|
|
5959
5959
|
33030144,
|
|
@@ -5989,7 +5989,7 @@ function dn() {
|
|
|
5989
5989
|
this._lBlock = p[x], this._rBlock = p[x + 1], u.call(this, 4, 252645135), u.call(this, 16, 65535), F.call(this, 2, 858993459), F.call(this, 8, 16711935), u.call(this, 1, 1431655765);
|
|
5990
5990
|
for (var h = 0; h < 16; h++) {
|
|
5991
5991
|
for (var d = n[h], A = this._lBlock, w = this._rBlock, T = 0, q = 0; q < 8; q++)
|
|
5992
|
-
T |= C[q][((w ^ d[q]) &
|
|
5992
|
+
T |= C[q][((w ^ d[q]) & f[q]) >>> 0];
|
|
5993
5993
|
this._lBlock = w, this._rBlock = A ^ T;
|
|
5994
5994
|
}
|
|
5995
5995
|
var D = this._lBlock;
|
|
@@ -6007,7 +6007,7 @@ function dn() {
|
|
|
6007
6007
|
var n = (this._rBlock >>> p ^ this._lBlock) & x;
|
|
6008
6008
|
this._lBlock ^= n, this._rBlock ^= n << p;
|
|
6009
6009
|
}
|
|
6010
|
-
|
|
6010
|
+
a.DES = m._createHelper(l);
|
|
6011
6011
|
var i = o.TripleDES = m.extend({
|
|
6012
6012
|
_doReset: function() {
|
|
6013
6013
|
var p = this._key, x = p.words;
|
|
@@ -6026,24 +6026,24 @@ function dn() {
|
|
|
6026
6026
|
ivSize: 64 / 32,
|
|
6027
6027
|
blockSize: 64 / 32
|
|
6028
6028
|
});
|
|
6029
|
-
|
|
6029
|
+
a.TripleDES = m._createHelper(i);
|
|
6030
6030
|
}(), E.TripleDES;
|
|
6031
6031
|
});
|
|
6032
6032
|
}(zt)), zt.exports;
|
|
6033
6033
|
}
|
|
6034
|
-
var It = { exports: {} }, pn = It.exports,
|
|
6034
|
+
var It = { exports: {} }, pn = It.exports, pe;
|
|
6035
6035
|
function Bn() {
|
|
6036
|
-
return
|
|
6037
|
-
(function(E,
|
|
6038
|
-
y.exports =
|
|
6036
|
+
return pe || (pe = 1, function(y, z) {
|
|
6037
|
+
(function(E, a, g) {
|
|
6038
|
+
y.exports = a(j(), q0(), H0(), b0(), e0());
|
|
6039
6039
|
})(pn, function(E) {
|
|
6040
6040
|
return function() {
|
|
6041
|
-
var
|
|
6041
|
+
var a = E, g = a.lib, B = g.StreamCipher, m = a.algo, o = m.RC4 = B.extend({
|
|
6042
6042
|
_doReset: function() {
|
|
6043
|
-
for (var s = this._key, C = s.words,
|
|
6043
|
+
for (var s = this._key, C = s.words, f = s.sigBytes, l = this._S = [], u = 0; u < 256; u++)
|
|
6044
6044
|
l[u] = u;
|
|
6045
6045
|
for (var u = 0, F = 0; u < 256; u++) {
|
|
6046
|
-
var i = u %
|
|
6046
|
+
var i = u % f, p = C[i >>> 2] >>> 24 - i % 4 * 8 & 255;
|
|
6047
6047
|
F = (F + l[u] + p) % 256;
|
|
6048
6048
|
var x = l[u];
|
|
6049
6049
|
l[u] = l[F], l[F] = x;
|
|
@@ -6057,14 +6057,14 @@ function Bn() {
|
|
|
6057
6057
|
ivSize: 0
|
|
6058
6058
|
});
|
|
6059
6059
|
function v() {
|
|
6060
|
-
for (var s = this._S, C = this._i,
|
|
6061
|
-
C = (C + 1) % 256,
|
|
6060
|
+
for (var s = this._S, C = this._i, f = this._j, l = 0, u = 0; u < 4; u++) {
|
|
6061
|
+
C = (C + 1) % 256, f = (f + s[C]) % 256;
|
|
6062
6062
|
var F = s[C];
|
|
6063
|
-
s[C] = s[
|
|
6063
|
+
s[C] = s[f], s[f] = F, l |= s[(s[C] + s[f]) % 256] << 24 - u * 8;
|
|
6064
6064
|
}
|
|
6065
|
-
return this._i = C, this._j =
|
|
6065
|
+
return this._i = C, this._j = f, l;
|
|
6066
6066
|
}
|
|
6067
|
-
|
|
6067
|
+
a.RC4 = B._createHelper(o);
|
|
6068
6068
|
var r = m.RC4Drop = o.extend({
|
|
6069
6069
|
/**
|
|
6070
6070
|
* Configuration options.
|
|
@@ -6080,40 +6080,40 @@ function Bn() {
|
|
|
6080
6080
|
v.call(this);
|
|
6081
6081
|
}
|
|
6082
6082
|
});
|
|
6083
|
-
|
|
6083
|
+
a.RC4Drop = B._createHelper(r);
|
|
6084
6084
|
}(), E.RC4;
|
|
6085
6085
|
});
|
|
6086
6086
|
}(It)), It.exports;
|
|
6087
6087
|
}
|
|
6088
|
-
var Lt = { exports: {} }, Fn = Lt.exports,
|
|
6088
|
+
var Lt = { exports: {} }, Fn = Lt.exports, Be;
|
|
6089
6089
|
function Cn() {
|
|
6090
|
-
return
|
|
6091
|
-
(function(E,
|
|
6092
|
-
y.exports =
|
|
6090
|
+
return Be || (Be = 1, function(y, z) {
|
|
6091
|
+
(function(E, a, g) {
|
|
6092
|
+
y.exports = a(j(), q0(), H0(), b0(), e0());
|
|
6093
6093
|
})(Fn, function(E) {
|
|
6094
6094
|
return function() {
|
|
6095
|
-
var
|
|
6095
|
+
var a = E, g = a.lib, B = g.StreamCipher, m = a.algo, o = [], v = [], r = [], s = m.Rabbit = B.extend({
|
|
6096
6096
|
_doReset: function() {
|
|
6097
|
-
for (var
|
|
6098
|
-
|
|
6097
|
+
for (var f = this._key.words, l = this.cfg.iv, u = 0; u < 4; u++)
|
|
6098
|
+
f[u] = (f[u] << 8 | f[u] >>> 24) & 16711935 | (f[u] << 24 | f[u] >>> 8) & 4278255360;
|
|
6099
6099
|
var F = this._X = [
|
|
6100
|
-
|
|
6101
|
-
|
|
6102
|
-
|
|
6103
|
-
|
|
6104
|
-
|
|
6105
|
-
|
|
6106
|
-
|
|
6107
|
-
|
|
6100
|
+
f[0],
|
|
6101
|
+
f[3] << 16 | f[2] >>> 16,
|
|
6102
|
+
f[1],
|
|
6103
|
+
f[0] << 16 | f[3] >>> 16,
|
|
6104
|
+
f[2],
|
|
6105
|
+
f[1] << 16 | f[0] >>> 16,
|
|
6106
|
+
f[3],
|
|
6107
|
+
f[2] << 16 | f[1] >>> 16
|
|
6108
6108
|
], i = this._C = [
|
|
6109
|
-
|
|
6110
|
-
|
|
6111
|
-
|
|
6112
|
-
|
|
6113
|
-
|
|
6114
|
-
|
|
6115
|
-
|
|
6116
|
-
|
|
6109
|
+
f[2] << 16 | f[2] >>> 16,
|
|
6110
|
+
f[0] & 4294901760 | f[1] & 65535,
|
|
6111
|
+
f[3] << 16 | f[3] >>> 16,
|
|
6112
|
+
f[1] & 4294901760 | f[2] & 65535,
|
|
6113
|
+
f[0] << 16 | f[0] >>> 16,
|
|
6114
|
+
f[2] & 4294901760 | f[3] & 65535,
|
|
6115
|
+
f[1] << 16 | f[1] >>> 16,
|
|
6116
|
+
f[3] & 4294901760 | f[0] & 65535
|
|
6117
6117
|
];
|
|
6118
6118
|
this._b = 0;
|
|
6119
6119
|
for (var u = 0; u < 4; u++)
|
|
@@ -6127,57 +6127,57 @@ function Cn() {
|
|
|
6127
6127
|
C.call(this);
|
|
6128
6128
|
}
|
|
6129
6129
|
},
|
|
6130
|
-
_doProcessBlock: function(
|
|
6130
|
+
_doProcessBlock: function(f, l) {
|
|
6131
6131
|
var u = this._X;
|
|
6132
6132
|
C.call(this), o[0] = u[0] ^ u[5] >>> 16 ^ u[3] << 16, o[1] = u[2] ^ u[7] >>> 16 ^ u[5] << 16, o[2] = u[4] ^ u[1] >>> 16 ^ u[7] << 16, o[3] = u[6] ^ u[3] >>> 16 ^ u[1] << 16;
|
|
6133
6133
|
for (var F = 0; F < 4; F++)
|
|
6134
|
-
o[F] = (o[F] << 8 | o[F] >>> 24) & 16711935 | (o[F] << 24 | o[F] >>> 8) & 4278255360,
|
|
6134
|
+
o[F] = (o[F] << 8 | o[F] >>> 24) & 16711935 | (o[F] << 24 | o[F] >>> 8) & 4278255360, f[l + F] ^= o[F];
|
|
6135
6135
|
},
|
|
6136
6136
|
blockSize: 128 / 32,
|
|
6137
6137
|
ivSize: 64 / 32
|
|
6138
6138
|
});
|
|
6139
6139
|
function C() {
|
|
6140
|
-
for (var
|
|
6140
|
+
for (var f = this._X, l = this._C, u = 0; u < 8; u++)
|
|
6141
6141
|
v[u] = l[u];
|
|
6142
6142
|
l[0] = l[0] + 1295307597 + this._b | 0, l[1] = l[1] + 3545052371 + (l[0] >>> 0 < v[0] >>> 0 ? 1 : 0) | 0, l[2] = l[2] + 886263092 + (l[1] >>> 0 < v[1] >>> 0 ? 1 : 0) | 0, l[3] = l[3] + 1295307597 + (l[2] >>> 0 < v[2] >>> 0 ? 1 : 0) | 0, l[4] = l[4] + 3545052371 + (l[3] >>> 0 < v[3] >>> 0 ? 1 : 0) | 0, l[5] = l[5] + 886263092 + (l[4] >>> 0 < v[4] >>> 0 ? 1 : 0) | 0, l[6] = l[6] + 1295307597 + (l[5] >>> 0 < v[5] >>> 0 ? 1 : 0) | 0, l[7] = l[7] + 3545052371 + (l[6] >>> 0 < v[6] >>> 0 ? 1 : 0) | 0, this._b = l[7] >>> 0 < v[7] >>> 0 ? 1 : 0;
|
|
6143
6143
|
for (var u = 0; u < 8; u++) {
|
|
6144
|
-
var F =
|
|
6144
|
+
var F = f[u] + l[u], i = F & 65535, p = F >>> 16, x = ((i * i >>> 17) + i * p >>> 15) + p * p, n = ((F & 4294901760) * F | 0) + ((F & 65535) * F | 0);
|
|
6145
6145
|
r[u] = x ^ n;
|
|
6146
6146
|
}
|
|
6147
|
-
|
|
6147
|
+
f[0] = r[0] + (r[7] << 16 | r[7] >>> 16) + (r[6] << 16 | r[6] >>> 16) | 0, f[1] = r[1] + (r[0] << 8 | r[0] >>> 24) + r[7] | 0, f[2] = r[2] + (r[1] << 16 | r[1] >>> 16) + (r[0] << 16 | r[0] >>> 16) | 0, f[3] = r[3] + (r[2] << 8 | r[2] >>> 24) + r[1] | 0, f[4] = r[4] + (r[3] << 16 | r[3] >>> 16) + (r[2] << 16 | r[2] >>> 16) | 0, f[5] = r[5] + (r[4] << 8 | r[4] >>> 24) + r[3] | 0, f[6] = r[6] + (r[5] << 16 | r[5] >>> 16) + (r[4] << 16 | r[4] >>> 16) | 0, f[7] = r[7] + (r[6] << 8 | r[6] >>> 24) + r[5] | 0;
|
|
6148
6148
|
}
|
|
6149
|
-
|
|
6149
|
+
a.Rabbit = B._createHelper(s);
|
|
6150
6150
|
}(), E.Rabbit;
|
|
6151
6151
|
});
|
|
6152
6152
|
}(Lt)), Lt.exports;
|
|
6153
6153
|
}
|
|
6154
|
-
var Ot = { exports: {} }, An = Ot.exports,
|
|
6154
|
+
var Ot = { exports: {} }, An = Ot.exports, Fe;
|
|
6155
6155
|
function En() {
|
|
6156
|
-
return
|
|
6157
|
-
(function(E,
|
|
6158
|
-
y.exports =
|
|
6156
|
+
return Fe || (Fe = 1, function(y, z) {
|
|
6157
|
+
(function(E, a, g) {
|
|
6158
|
+
y.exports = a(j(), q0(), H0(), b0(), e0());
|
|
6159
6159
|
})(An, function(E) {
|
|
6160
6160
|
return function() {
|
|
6161
|
-
var
|
|
6161
|
+
var a = E, g = a.lib, B = g.StreamCipher, m = a.algo, o = [], v = [], r = [], s = m.RabbitLegacy = B.extend({
|
|
6162
6162
|
_doReset: function() {
|
|
6163
|
-
var
|
|
6164
|
-
|
|
6165
|
-
|
|
6166
|
-
|
|
6167
|
-
|
|
6168
|
-
|
|
6169
|
-
|
|
6170
|
-
|
|
6171
|
-
|
|
6163
|
+
var f = this._key.words, l = this.cfg.iv, u = this._X = [
|
|
6164
|
+
f[0],
|
|
6165
|
+
f[3] << 16 | f[2] >>> 16,
|
|
6166
|
+
f[1],
|
|
6167
|
+
f[0] << 16 | f[3] >>> 16,
|
|
6168
|
+
f[2],
|
|
6169
|
+
f[1] << 16 | f[0] >>> 16,
|
|
6170
|
+
f[3],
|
|
6171
|
+
f[2] << 16 | f[1] >>> 16
|
|
6172
6172
|
], F = this._C = [
|
|
6173
|
-
|
|
6174
|
-
|
|
6175
|
-
|
|
6176
|
-
|
|
6177
|
-
|
|
6178
|
-
|
|
6179
|
-
|
|
6180
|
-
|
|
6173
|
+
f[2] << 16 | f[2] >>> 16,
|
|
6174
|
+
f[0] & 4294901760 | f[1] & 65535,
|
|
6175
|
+
f[3] << 16 | f[3] >>> 16,
|
|
6176
|
+
f[1] & 4294901760 | f[2] & 65535,
|
|
6177
|
+
f[0] << 16 | f[0] >>> 16,
|
|
6178
|
+
f[2] & 4294901760 | f[3] & 65535,
|
|
6179
|
+
f[1] << 16 | f[1] >>> 16,
|
|
6180
|
+
f[3] & 4294901760 | f[0] & 65535
|
|
6181
6181
|
];
|
|
6182
6182
|
this._b = 0;
|
|
6183
6183
|
for (var i = 0; i < 4; i++)
|
|
@@ -6191,38 +6191,38 @@ function En() {
|
|
|
6191
6191
|
C.call(this);
|
|
6192
6192
|
}
|
|
6193
6193
|
},
|
|
6194
|
-
_doProcessBlock: function(
|
|
6194
|
+
_doProcessBlock: function(f, l) {
|
|
6195
6195
|
var u = this._X;
|
|
6196
6196
|
C.call(this), o[0] = u[0] ^ u[5] >>> 16 ^ u[3] << 16, o[1] = u[2] ^ u[7] >>> 16 ^ u[5] << 16, o[2] = u[4] ^ u[1] >>> 16 ^ u[7] << 16, o[3] = u[6] ^ u[3] >>> 16 ^ u[1] << 16;
|
|
6197
6197
|
for (var F = 0; F < 4; F++)
|
|
6198
|
-
o[F] = (o[F] << 8 | o[F] >>> 24) & 16711935 | (o[F] << 24 | o[F] >>> 8) & 4278255360,
|
|
6198
|
+
o[F] = (o[F] << 8 | o[F] >>> 24) & 16711935 | (o[F] << 24 | o[F] >>> 8) & 4278255360, f[l + F] ^= o[F];
|
|
6199
6199
|
},
|
|
6200
6200
|
blockSize: 128 / 32,
|
|
6201
6201
|
ivSize: 64 / 32
|
|
6202
6202
|
});
|
|
6203
6203
|
function C() {
|
|
6204
|
-
for (var
|
|
6204
|
+
for (var f = this._X, l = this._C, u = 0; u < 8; u++)
|
|
6205
6205
|
v[u] = l[u];
|
|
6206
6206
|
l[0] = l[0] + 1295307597 + this._b | 0, l[1] = l[1] + 3545052371 + (l[0] >>> 0 < v[0] >>> 0 ? 1 : 0) | 0, l[2] = l[2] + 886263092 + (l[1] >>> 0 < v[1] >>> 0 ? 1 : 0) | 0, l[3] = l[3] + 1295307597 + (l[2] >>> 0 < v[2] >>> 0 ? 1 : 0) | 0, l[4] = l[4] + 3545052371 + (l[3] >>> 0 < v[3] >>> 0 ? 1 : 0) | 0, l[5] = l[5] + 886263092 + (l[4] >>> 0 < v[4] >>> 0 ? 1 : 0) | 0, l[6] = l[6] + 1295307597 + (l[5] >>> 0 < v[5] >>> 0 ? 1 : 0) | 0, l[7] = l[7] + 3545052371 + (l[6] >>> 0 < v[6] >>> 0 ? 1 : 0) | 0, this._b = l[7] >>> 0 < v[7] >>> 0 ? 1 : 0;
|
|
6207
6207
|
for (var u = 0; u < 8; u++) {
|
|
6208
|
-
var F =
|
|
6208
|
+
var F = f[u] + l[u], i = F & 65535, p = F >>> 16, x = ((i * i >>> 17) + i * p >>> 15) + p * p, n = ((F & 4294901760) * F | 0) + ((F & 65535) * F | 0);
|
|
6209
6209
|
r[u] = x ^ n;
|
|
6210
6210
|
}
|
|
6211
|
-
|
|
6211
|
+
f[0] = r[0] + (r[7] << 16 | r[7] >>> 16) + (r[6] << 16 | r[6] >>> 16) | 0, f[1] = r[1] + (r[0] << 8 | r[0] >>> 24) + r[7] | 0, f[2] = r[2] + (r[1] << 16 | r[1] >>> 16) + (r[0] << 16 | r[0] >>> 16) | 0, f[3] = r[3] + (r[2] << 8 | r[2] >>> 24) + r[1] | 0, f[4] = r[4] + (r[3] << 16 | r[3] >>> 16) + (r[2] << 16 | r[2] >>> 16) | 0, f[5] = r[5] + (r[4] << 8 | r[4] >>> 24) + r[3] | 0, f[6] = r[6] + (r[5] << 16 | r[5] >>> 16) + (r[4] << 16 | r[4] >>> 16) | 0, f[7] = r[7] + (r[6] << 8 | r[6] >>> 24) + r[5] | 0;
|
|
6212
6212
|
}
|
|
6213
|
-
|
|
6213
|
+
a.RabbitLegacy = B._createHelper(s);
|
|
6214
6214
|
}(), E.RabbitLegacy;
|
|
6215
6215
|
});
|
|
6216
6216
|
}(Ot)), Ot.exports;
|
|
6217
6217
|
}
|
|
6218
|
-
var Ut = { exports: {} }, yn = Ut.exports,
|
|
6218
|
+
var Ut = { exports: {} }, yn = Ut.exports, Ce;
|
|
6219
6219
|
function Dn() {
|
|
6220
|
-
return
|
|
6221
|
-
(function(E,
|
|
6222
|
-
y.exports =
|
|
6220
|
+
return Ce || (Ce = 1, function(y, z) {
|
|
6221
|
+
(function(E, a, g) {
|
|
6222
|
+
y.exports = a(j(), q0(), H0(), b0(), e0());
|
|
6223
6223
|
})(yn, function(E) {
|
|
6224
6224
|
return function() {
|
|
6225
|
-
var
|
|
6225
|
+
var a = E, g = a.lib, B = g.BlockCipher, m = a.algo;
|
|
6226
6226
|
const o = 16, v = [
|
|
6227
6227
|
608135816,
|
|
6228
6228
|
2242054355,
|
|
@@ -7284,7 +7284,7 @@ function Dn() {
|
|
|
7284
7284
|
let x = p >> 24 & 255, n = p >> 16 & 255, h = p >> 8 & 255, d = p & 255, A = i.sbox[0][x] + i.sbox[1][n];
|
|
7285
7285
|
return A = A ^ i.sbox[2][h], A = A + i.sbox[3][d], A;
|
|
7286
7286
|
}
|
|
7287
|
-
function
|
|
7287
|
+
function f(i, p, x) {
|
|
7288
7288
|
let n = p, h = x, d;
|
|
7289
7289
|
for (let A = 0; A < o; ++A)
|
|
7290
7290
|
n = n ^ i.pbox[A], h = C(i, n) ^ h, d = n, n = h, h = d;
|
|
@@ -7307,10 +7307,10 @@ function Dn() {
|
|
|
7307
7307
|
i.pbox[w] = v[w] ^ p[n], n++, n >= x && (n = 0);
|
|
7308
7308
|
let h = 0, d = 0, A = 0;
|
|
7309
7309
|
for (let w = 0; w < o + 2; w += 2)
|
|
7310
|
-
A =
|
|
7310
|
+
A = f(i, h, d), h = A.left, d = A.right, i.pbox[w] = h, i.pbox[w + 1] = d;
|
|
7311
7311
|
for (let w = 0; w < 4; w++)
|
|
7312
7312
|
for (let T = 0; T < 256; T += 2)
|
|
7313
|
-
A =
|
|
7313
|
+
A = f(i, h, d), h = A.left, d = A.right, i.sbox[w][T] = h, i.sbox[w][T + 1] = d;
|
|
7314
7314
|
return !0;
|
|
7315
7315
|
}
|
|
7316
7316
|
var F = m.Blowfish = B.extend({
|
|
@@ -7321,7 +7321,7 @@ function Dn() {
|
|
|
7321
7321
|
}
|
|
7322
7322
|
},
|
|
7323
7323
|
encryptBlock: function(i, p) {
|
|
7324
|
-
var x =
|
|
7324
|
+
var x = f(s, i[p], i[p + 1]);
|
|
7325
7325
|
i[p] = x.left, i[p + 1] = x.right;
|
|
7326
7326
|
},
|
|
7327
7327
|
decryptBlock: function(i, p) {
|
|
@@ -7332,38 +7332,46 @@ function Dn() {
|
|
|
7332
7332
|
keySize: 128 / 32,
|
|
7333
7333
|
ivSize: 64 / 32
|
|
7334
7334
|
});
|
|
7335
|
-
|
|
7335
|
+
a.Blowfish = B._createHelper(F);
|
|
7336
7336
|
}(), E.Blowfish;
|
|
7337
7337
|
});
|
|
7338
7338
|
}(Ut)), Ut.exports;
|
|
7339
7339
|
}
|
|
7340
|
-
var gn = it.exports,
|
|
7340
|
+
var gn = it.exports, Ae;
|
|
7341
7341
|
function bn() {
|
|
7342
|
-
return
|
|
7343
|
-
(function(E,
|
|
7344
|
-
y.exports =
|
|
7342
|
+
return Ae || (Ae = 1, function(y, z) {
|
|
7343
|
+
(function(E, a, g) {
|
|
7344
|
+
y.exports = a(j(), Nt(), Ax(), yx(), q0(), bx(), H0(), ye(), Cr(), Sx(), De(), qx(), Px(), Ix(), Ar(), Ux(), b0(), e0(), $x(), Vx(), jx(), Gx(), Qx(), tn(), en(), nn(), sn(), fn(), hn(), ln(), dn(), Bn(), Cn(), En(), Dn());
|
|
7345
7345
|
})(gn, function(E) {
|
|
7346
7346
|
return E;
|
|
7347
7347
|
});
|
|
7348
7348
|
}(it)), it.exports;
|
|
7349
7349
|
}
|
|
7350
7350
|
var mn = bn();
|
|
7351
|
-
const
|
|
7352
|
-
iv:
|
|
7353
|
-
mode:
|
|
7354
|
-
padding:
|
|
7355
|
-
}).toString(),
|
|
7356
|
-
|
|
7351
|
+
const B0 = /* @__PURE__ */ Je(mn), _n = (y, z, E) => B0.AES.encrypt(z, B0.enc.Utf8.parse(y), {
|
|
7352
|
+
iv: B0.enc.Utf8.parse(E),
|
|
7353
|
+
mode: B0.mode.CBC,
|
|
7354
|
+
padding: B0.pad.Pkcs7
|
|
7355
|
+
}).toString(), Tn = (y, z, E) => B0.AES.decrypt(z, B0.enc.Utf8.parse(y), {
|
|
7356
|
+
iv: B0.enc.Utf8.parse(E),
|
|
7357
|
+
mode: B0.mode.CBC,
|
|
7358
|
+
padding: B0.pad.Pkcs7
|
|
7359
|
+
}).toString(B0.enc.Utf8), wn = (y) => {
|
|
7360
|
+
const z = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
|
|
7357
7361
|
let E = "";
|
|
7358
|
-
for (let
|
|
7359
|
-
E +=
|
|
7362
|
+
for (let a = 0; a < y; a++)
|
|
7363
|
+
E += z.charAt(Math.floor(Math.random() * z.length));
|
|
7360
7364
|
return E;
|
|
7361
|
-
}
|
|
7365
|
+
}, Sn = (y, z) => new Fr.sm4({
|
|
7366
|
+
key: z.key,
|
|
7367
|
+
iv: z.iv,
|
|
7368
|
+
mode: z.mode || "cbc"
|
|
7369
|
+
}).decrypt(y), kn = (y, z) => new Fr.sm4({ key: z.key, iv: z.iv, mode: z.mode || "cbc" }).encrypt(y);
|
|
7362
7370
|
function Br(y) {
|
|
7363
7371
|
return typeof y == "object" ? JSON.stringify(y ?? {}) : typeof y == "number" ? String(y) : y ?? "";
|
|
7364
7372
|
}
|
|
7365
|
-
function
|
|
7366
|
-
const B = Date.now() + E, m = Math.random().toString(36).substring(2, 15), o = `${B}${y}${m}${Br(
|
|
7373
|
+
function Rn({ uid: y = "", salt: z = "", ts: E = 0, data: a = "", ...g }) {
|
|
7374
|
+
const B = Date.now() + E, m = Math.random().toString(36).substring(2, 15), o = `${B}${y}${m}${Br(a)}${z}`, v = dx.sm3(o);
|
|
7367
7375
|
return {
|
|
7368
7376
|
...g,
|
|
7369
7377
|
"X-Sign-Timestamp": String(B),
|
|
@@ -7371,47 +7379,52 @@ function Tn({ uid: y = "", salt: I = "", ts: E = 0, data: f = "", ...g }) {
|
|
|
7371
7379
|
"X-Sign-Client": v
|
|
7372
7380
|
};
|
|
7373
7381
|
}
|
|
7374
|
-
function
|
|
7375
|
-
const
|
|
7382
|
+
function qn(y, z, E) {
|
|
7383
|
+
const a = wn(16);
|
|
7376
7384
|
let g = {
|
|
7377
7385
|
body: ""
|
|
7378
7386
|
};
|
|
7379
7387
|
return E === "ase" && (g = {
|
|
7380
|
-
body: _n(y, Br(
|
|
7388
|
+
body: _n(y, Br(z), a)
|
|
7381
7389
|
}), E === "sm4" && (g = {
|
|
7382
|
-
body: new
|
|
7390
|
+
body: new Fr.sm4({
|
|
7383
7391
|
key: y,
|
|
7384
|
-
iv:
|
|
7392
|
+
iv: a,
|
|
7385
7393
|
mode: "cbc"
|
|
7386
|
-
}).encrypt(Br(
|
|
7394
|
+
}).encrypt(Br(z))
|
|
7387
7395
|
}), {
|
|
7388
7396
|
headers: {
|
|
7389
|
-
iv:
|
|
7397
|
+
iv: a,
|
|
7390
7398
|
"Content-Type": "application/json"
|
|
7391
7399
|
},
|
|
7392
7400
|
data: g
|
|
7393
7401
|
};
|
|
7394
7402
|
}
|
|
7395
|
-
function
|
|
7396
|
-
const
|
|
7403
|
+
function Hn(y) {
|
|
7404
|
+
const z = ["script", "iframe", "object", "embed", "link", "meta", "style"], E = ["onerror", "onload", "onclick", "onmouseover", "onfocus", "onmouseenter", "onmouseleave"], a = (v) => /^javascript:/i.test(v) || /^data:text\/html/i.test(v), B = new DOMParser().parseFromString(`<div>${y}</div>`, "text/html"), m = B.body.firstChild;
|
|
7397
7405
|
function o(v) {
|
|
7398
7406
|
if (v.nodeType === Node.ELEMENT_NODE) {
|
|
7399
7407
|
const r = v, s = r.tagName.toLowerCase();
|
|
7400
|
-
if (
|
|
7401
|
-
const C = r.outerHTML,
|
|
7402
|
-
r.replaceWith(
|
|
7408
|
+
if (z.includes(s)) {
|
|
7409
|
+
const C = r.outerHTML, f = B.createTextNode(C);
|
|
7410
|
+
r.replaceWith(f);
|
|
7403
7411
|
return;
|
|
7404
7412
|
}
|
|
7405
7413
|
[...r.attributes].forEach((C) => {
|
|
7406
|
-
const
|
|
7407
|
-
(E.includes(
|
|
7414
|
+
const f = C.name.toLowerCase(), l = C.value;
|
|
7415
|
+
(E.includes(f) || a(l)) && r.removeAttribute(C.name);
|
|
7408
7416
|
}), [...r.childNodes].forEach(o);
|
|
7409
7417
|
}
|
|
7410
7418
|
}
|
|
7411
7419
|
return [...m.childNodes].forEach(o), m.innerHTML;
|
|
7412
7420
|
}
|
|
7413
7421
|
export {
|
|
7414
|
-
Tn as
|
|
7415
|
-
|
|
7416
|
-
|
|
7422
|
+
Tn as aesDecryptString,
|
|
7423
|
+
_n as aesEncryptString,
|
|
7424
|
+
Rn as createHeaders,
|
|
7425
|
+
wn as generateRandomString,
|
|
7426
|
+
Hn as htmlSanitize,
|
|
7427
|
+
Sn as sm4Decrypt,
|
|
7428
|
+
kn as sm4Encrypt,
|
|
7429
|
+
qn as transmissionDataEncryption
|
|
7417
7430
|
};
|