module-develop-kit 0.2.1 → 0.2.2
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.es.js +702 -699
- package/dist/index.umd.js +3 -3
- package/package.json +1 -1
package/dist/index.es.js
CHANGED
|
@@ -1,60 +1,60 @@
|
|
|
1
1
|
var xr = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
|
|
2
|
-
function
|
|
3
|
-
return
|
|
2
|
+
function $e(_) {
|
|
3
|
+
return _ && _.__esModule && Object.prototype.hasOwnProperty.call(_, "default") ? _.default : _;
|
|
4
4
|
}
|
|
5
|
-
function
|
|
6
|
-
if (Object.prototype.hasOwnProperty.call(
|
|
7
|
-
var
|
|
8
|
-
if (typeof
|
|
9
|
-
var A = function
|
|
10
|
-
return this instanceof
|
|
5
|
+
function Ue(_) {
|
|
6
|
+
if (Object.prototype.hasOwnProperty.call(_, "__esModule")) return _;
|
|
7
|
+
var N = _.default;
|
|
8
|
+
if (typeof N == "function") {
|
|
9
|
+
var A = function a() {
|
|
10
|
+
return this instanceof a ? Reflect.construct(N, arguments, this.constructor) : N.apply(this, arguments);
|
|
11
11
|
};
|
|
12
|
-
A.prototype =
|
|
12
|
+
A.prototype = N.prototype;
|
|
13
13
|
} else A = {};
|
|
14
|
-
return Object.defineProperty(A, "__esModule", { value: !0 }), Object.keys(
|
|
15
|
-
var
|
|
16
|
-
Object.defineProperty(A,
|
|
14
|
+
return Object.defineProperty(A, "__esModule", { value: !0 }), Object.keys(_).forEach(function(a) {
|
|
15
|
+
var w = Object.getOwnPropertyDescriptor(_, a);
|
|
16
|
+
Object.defineProperty(A, a, w.get ? w : {
|
|
17
17
|
enumerable: !0,
|
|
18
18
|
get: function() {
|
|
19
|
-
return
|
|
19
|
+
return _[a];
|
|
20
20
|
}
|
|
21
21
|
});
|
|
22
22
|
}), A;
|
|
23
23
|
}
|
|
24
|
-
var xt = { exports: {} },
|
|
25
|
-
function
|
|
26
|
-
return Cr || (Cr = 1, function(
|
|
24
|
+
var xt = { exports: {} }, Ve = xt.exports, Cr;
|
|
25
|
+
function Mt() {
|
|
26
|
+
return Cr || (Cr = 1, function(_, N) {
|
|
27
27
|
(function() {
|
|
28
|
-
var A,
|
|
29
|
-
function l(t, r,
|
|
30
|
-
t != null && (typeof t == "number" ? this.fromNumber(t, r,
|
|
28
|
+
var A, a = 244837814094590, w = (a & 16777215) == 15715070;
|
|
29
|
+
function l(t, r, s) {
|
|
30
|
+
t != null && (typeof t == "number" ? this.fromNumber(t, r, s) : r == null && typeof t != "string" ? this.fromString(t, 256) : this.fromString(t, r));
|
|
31
31
|
}
|
|
32
32
|
function m() {
|
|
33
33
|
return new l(null);
|
|
34
34
|
}
|
|
35
|
-
function h(t, r,
|
|
35
|
+
function h(t, r, s, g, P, I) {
|
|
36
36
|
for (; --I >= 0; ) {
|
|
37
|
-
var
|
|
38
|
-
P = Math.floor(
|
|
37
|
+
var M = r * this[t++] + s[g] + P;
|
|
38
|
+
P = Math.floor(M / 67108864), s[g++] = M & 67108863;
|
|
39
39
|
}
|
|
40
40
|
return P;
|
|
41
41
|
}
|
|
42
|
-
function B(t, r,
|
|
43
|
-
for (var
|
|
44
|
-
var J = this[t] & 32767, r0 = this[t++] >> 15, l0 = W * J + r0 *
|
|
45
|
-
J =
|
|
42
|
+
function B(t, r, s, g, P, I) {
|
|
43
|
+
for (var M = r & 32767, W = r >> 15; --I >= 0; ) {
|
|
44
|
+
var J = this[t] & 32767, r0 = this[t++] >> 15, l0 = W * J + r0 * M;
|
|
45
|
+
J = M * J + ((l0 & 32767) << 15) + s[g] + (P & 1073741823), P = (J >>> 30) + (l0 >>> 15) + W * r0 + (P >>> 30), s[g++] = J & 1073741823;
|
|
46
46
|
}
|
|
47
47
|
return P;
|
|
48
48
|
}
|
|
49
|
-
function e(t, r,
|
|
50
|
-
for (var
|
|
51
|
-
var J = this[t] & 16383, r0 = this[t++] >> 14, l0 = W * J + r0 *
|
|
52
|
-
J =
|
|
49
|
+
function e(t, r, s, g, P, I) {
|
|
50
|
+
for (var M = r & 16383, W = r >> 14; --I >= 0; ) {
|
|
51
|
+
var J = this[t] & 16383, r0 = this[t++] >> 14, l0 = W * J + r0 * M;
|
|
52
|
+
J = M * J + ((l0 & 16383) << 14) + s[g] + P, P = (J >> 28) + (l0 >> 14) + W * r0, s[g++] = J & 268435455;
|
|
53
53
|
}
|
|
54
54
|
return P;
|
|
55
55
|
}
|
|
56
56
|
var o = typeof navigator < "u";
|
|
57
|
-
o &&
|
|
57
|
+
o && w && navigator.appName == "Microsoft Internet Explorer" ? (l.prototype.am = B, A = 30) : o && w && navigator.appName != "Netscape" ? (l.prototype.am = h, A = 26) : (l.prototype.am = e, A = 28), l.prototype.DB = A, l.prototype.DM = (1 << A) - 1, l.prototype.DV = 1 << A;
|
|
58
58
|
var F = 52;
|
|
59
59
|
l.prototype.FV = Math.pow(2, F), l.prototype.F1 = F - A, l.prototype.F2 = 2 * A - F;
|
|
60
60
|
var c = "0123456789abcdefghijklmnopqrstuvwxyz", p = new Array(), v, E;
|
|
@@ -65,8 +65,8 @@ function Nt() {
|
|
|
65
65
|
return c.charAt(t);
|
|
66
66
|
}
|
|
67
67
|
function d(t, r) {
|
|
68
|
-
var
|
|
69
|
-
return
|
|
68
|
+
var s = p[t.charCodeAt(r)];
|
|
69
|
+
return s ?? -1;
|
|
70
70
|
}
|
|
71
71
|
function n(t) {
|
|
72
72
|
for (var r = this.t - 1; r >= 0; --r) t[r] = this[r];
|
|
@@ -80,27 +80,27 @@ function Nt() {
|
|
|
80
80
|
return r.fromInt(t), r;
|
|
81
81
|
}
|
|
82
82
|
function u(t, r) {
|
|
83
|
-
var
|
|
84
|
-
if (r == 16)
|
|
85
|
-
else if (r == 8)
|
|
86
|
-
else if (r == 256)
|
|
87
|
-
else if (r == 2)
|
|
88
|
-
else if (r == 32)
|
|
89
|
-
else if (r == 4)
|
|
83
|
+
var s;
|
|
84
|
+
if (r == 16) s = 4;
|
|
85
|
+
else if (r == 8) s = 3;
|
|
86
|
+
else if (r == 256) s = 8;
|
|
87
|
+
else if (r == 2) s = 1;
|
|
88
|
+
else if (r == 32) s = 5;
|
|
89
|
+
else if (r == 4) s = 2;
|
|
90
90
|
else {
|
|
91
91
|
this.fromRadix(t, r);
|
|
92
92
|
return;
|
|
93
93
|
}
|
|
94
94
|
this.t = 0, this.s = 0;
|
|
95
95
|
for (var g = t.length, P = !1, I = 0; --g >= 0; ) {
|
|
96
|
-
var
|
|
97
|
-
if (
|
|
96
|
+
var M = s == 8 ? t[g] & 255 : d(t, g);
|
|
97
|
+
if (M < 0) {
|
|
98
98
|
t.charAt(g) == "-" && (P = !0);
|
|
99
99
|
continue;
|
|
100
100
|
}
|
|
101
|
-
P = !1, I == 0 ? this[this.t++] =
|
|
101
|
+
P = !1, I == 0 ? this[this.t++] = M : I + s > this.DB ? (this[this.t - 1] |= (M & (1 << this.DB - I) - 1) << I, this[this.t++] = M >> this.DB - I) : this[this.t - 1] |= M << I, I += s, I >= this.DB && (I -= this.DB);
|
|
102
102
|
}
|
|
103
|
-
|
|
103
|
+
s == 8 && (t[0] & 128) != 0 && (this.s = -1, I > 0 && (this[this.t - 1] |= (1 << this.DB - I) - 1 << I)), this.clamp(), P && l.ZERO.subTo(this, this);
|
|
104
104
|
}
|
|
105
105
|
function C() {
|
|
106
106
|
for (var t = this.s & this.DM; this.t > 0 && this[this.t - 1] == t; ) --this.t;
|
|
@@ -114,10 +114,10 @@ function Nt() {
|
|
|
114
114
|
else if (t == 32) r = 5;
|
|
115
115
|
else if (t == 4) r = 2;
|
|
116
116
|
else return this.toRadix(t);
|
|
117
|
-
var
|
|
118
|
-
if (
|
|
119
|
-
for (W < this.DB && (g = this[
|
|
120
|
-
W < r ? (g = (this[
|
|
117
|
+
var s = (1 << r) - 1, g, P = !1, I = "", M = this.t, W = this.DB - M * this.DB % r;
|
|
118
|
+
if (M-- > 0)
|
|
119
|
+
for (W < this.DB && (g = this[M] >> W) > 0 && (P = !0, I = i(g)); M >= 0; )
|
|
120
|
+
W < r ? (g = (this[M] & (1 << W) - 1) << r - W, g |= this[--M] >> (W += this.DB - r)) : (g = this[M] >> (W -= r) & s, W <= 0 && (W += this.DB, --M)), g > 0 && (P = !0), P && (I += i(g));
|
|
121
121
|
return P ? I : "0";
|
|
122
122
|
}
|
|
123
123
|
function S() {
|
|
@@ -130,97 +130,97 @@ function Nt() {
|
|
|
130
130
|
function D(t) {
|
|
131
131
|
var r = this.s - t.s;
|
|
132
132
|
if (r != 0) return r;
|
|
133
|
-
var
|
|
134
|
-
if (r =
|
|
135
|
-
for (; --
|
|
133
|
+
var s = this.t;
|
|
134
|
+
if (r = s - t.t, r != 0) return this.s < 0 ? -r : r;
|
|
135
|
+
for (; --s >= 0; ) if ((r = this[s] - t[s]) != 0) return r;
|
|
136
136
|
return 0;
|
|
137
137
|
}
|
|
138
138
|
function b(t) {
|
|
139
|
-
var r = 1,
|
|
140
|
-
return (
|
|
139
|
+
var r = 1, s;
|
|
140
|
+
return (s = t >>> 16) != 0 && (t = s, r += 16), (s = t >> 8) != 0 && (t = s, r += 8), (s = t >> 4) != 0 && (t = s, r += 4), (s = t >> 2) != 0 && (t = s, r += 2), (s = t >> 1) != 0 && (t = s, r += 1), r;
|
|
141
141
|
}
|
|
142
142
|
function T() {
|
|
143
143
|
return this.t <= 0 ? 0 : this.DB * (this.t - 1) + b(this[this.t - 1] ^ this.s & this.DM);
|
|
144
144
|
}
|
|
145
145
|
function k(t, r) {
|
|
146
|
-
var
|
|
147
|
-
for (
|
|
148
|
-
for (
|
|
146
|
+
var s;
|
|
147
|
+
for (s = this.t - 1; s >= 0; --s) r[s + t] = this[s];
|
|
148
|
+
for (s = t - 1; s >= 0; --s) r[s] = 0;
|
|
149
149
|
r.t = this.t + t, r.s = this.s;
|
|
150
150
|
}
|
|
151
151
|
function L(t, r) {
|
|
152
|
-
for (var
|
|
152
|
+
for (var s = t; s < this.t; ++s) r[s - t] = this[s];
|
|
153
153
|
r.t = Math.max(this.t - t, 0), r.s = this.s;
|
|
154
154
|
}
|
|
155
155
|
function $(t, r) {
|
|
156
|
-
var
|
|
156
|
+
var s = t % this.DB, g = this.DB - s, P = (1 << g) - 1, I = Math.floor(t / this.DB), M = this.s << s & this.DM, W;
|
|
157
157
|
for (W = this.t - 1; W >= 0; --W)
|
|
158
|
-
r[W + I + 1] = this[W] >> g |
|
|
158
|
+
r[W + I + 1] = this[W] >> g | M, M = (this[W] & P) << s;
|
|
159
159
|
for (W = I - 1; W >= 0; --W) r[W] = 0;
|
|
160
|
-
r[I] =
|
|
160
|
+
r[I] = M, r.t = this.t + I + 1, r.s = this.s, r.clamp();
|
|
161
161
|
}
|
|
162
162
|
function U(t, r) {
|
|
163
163
|
r.s = this.s;
|
|
164
|
-
var
|
|
165
|
-
if (
|
|
164
|
+
var s = Math.floor(t / this.DB);
|
|
165
|
+
if (s >= this.t) {
|
|
166
166
|
r.t = 0;
|
|
167
167
|
return;
|
|
168
168
|
}
|
|
169
169
|
var g = t % this.DB, P = this.DB - g, I = (1 << g) - 1;
|
|
170
|
-
r[0] = this[
|
|
171
|
-
for (var
|
|
172
|
-
r[
|
|
173
|
-
g > 0 && (r[this.t -
|
|
170
|
+
r[0] = this[s] >> g;
|
|
171
|
+
for (var M = s + 1; M < this.t; ++M)
|
|
172
|
+
r[M - s - 1] |= (this[M] & I) << P, r[M - s] = this[M] >> g;
|
|
173
|
+
g > 0 && (r[this.t - s - 1] |= (this.s & I) << P), r.t = this.t - s, r.clamp();
|
|
174
174
|
}
|
|
175
175
|
function X(t, r) {
|
|
176
|
-
for (var
|
|
177
|
-
g += this[
|
|
176
|
+
for (var s = 0, g = 0, P = Math.min(t.t, this.t); s < P; )
|
|
177
|
+
g += this[s] - t[s], r[s++] = g & this.DM, g >>= this.DB;
|
|
178
178
|
if (t.t < this.t) {
|
|
179
|
-
for (g -= t.s;
|
|
180
|
-
g += this[
|
|
179
|
+
for (g -= t.s; s < this.t; )
|
|
180
|
+
g += this[s], r[s++] = g & this.DM, g >>= this.DB;
|
|
181
181
|
g += this.s;
|
|
182
182
|
} else {
|
|
183
|
-
for (g += this.s;
|
|
184
|
-
g -= t[
|
|
183
|
+
for (g += this.s; s < t.t; )
|
|
184
|
+
g -= t[s], r[s++] = g & this.DM, g >>= this.DB;
|
|
185
185
|
g -= t.s;
|
|
186
186
|
}
|
|
187
|
-
r.s = g < 0 ? -1 : 0, g < -1 ? r[
|
|
187
|
+
r.s = g < 0 ? -1 : 0, g < -1 ? r[s++] = this.DV + g : g > 0 && (r[s++] = g), r.t = s, r.clamp();
|
|
188
188
|
}
|
|
189
189
|
function Z(t, r) {
|
|
190
|
-
var
|
|
190
|
+
var s = this.abs(), g = t.abs(), P = s.t;
|
|
191
191
|
for (r.t = P + g.t; --P >= 0; ) r[P] = 0;
|
|
192
|
-
for (P = 0; P < g.t; ++P) r[P +
|
|
192
|
+
for (P = 0; P < g.t; ++P) r[P + s.t] = s.am(0, g[P], r, P, 0, s.t);
|
|
193
193
|
r.s = 0, r.clamp(), this.s != t.s && l.ZERO.subTo(r, r);
|
|
194
194
|
}
|
|
195
195
|
function G(t) {
|
|
196
|
-
for (var r = this.abs(),
|
|
197
|
-
for (
|
|
198
|
-
var g = r.am(
|
|
199
|
-
(t[
|
|
196
|
+
for (var r = this.abs(), s = t.t = 2 * r.t; --s >= 0; ) t[s] = 0;
|
|
197
|
+
for (s = 0; s < r.t - 1; ++s) {
|
|
198
|
+
var g = r.am(s, r[s], t, 2 * s, 0, 1);
|
|
199
|
+
(t[s + r.t] += r.am(s + 1, 2 * r[s], t, 2 * s + 1, g, r.t - s - 1)) >= r.DV && (t[s + r.t] -= r.DV, t[s + r.t + 1] = 1);
|
|
200
200
|
}
|
|
201
|
-
t.t > 0 && (t[t.t - 1] += r.am(
|
|
201
|
+
t.t > 0 && (t[t.t - 1] += r.am(s, r[s], t, 2 * s, 0, 1)), t.s = 0, t.clamp();
|
|
202
202
|
}
|
|
203
|
-
function K(t, r,
|
|
203
|
+
function K(t, r, s) {
|
|
204
204
|
var g = t.abs();
|
|
205
205
|
if (!(g.t <= 0)) {
|
|
206
206
|
var P = this.abs();
|
|
207
207
|
if (P.t < g.t) {
|
|
208
|
-
r != null && r.fromInt(0),
|
|
208
|
+
r != null && r.fromInt(0), s != null && this.copyTo(s);
|
|
209
209
|
return;
|
|
210
210
|
}
|
|
211
|
-
|
|
212
|
-
var I = m(),
|
|
213
|
-
J > 0 ? (g.lShiftTo(J, I), P.lShiftTo(J,
|
|
211
|
+
s == null && (s = m());
|
|
212
|
+
var I = m(), M = this.s, W = t.s, J = this.DB - b(g[g.t - 1]);
|
|
213
|
+
J > 0 ? (g.lShiftTo(J, I), P.lShiftTo(J, s)) : (g.copyTo(I), P.copyTo(s));
|
|
214
214
|
var r0 = I.t, l0 = I[r0 - 1];
|
|
215
215
|
if (l0 != 0) {
|
|
216
|
-
var h0 = l0 * (1 << this.F1) + (r0 > 1 ? I[r0 - 2] >> this.F2 : 0), C0 = this.FV / h0, rt = (1 << this.F1) / h0, d0 = 1 << this.F2, p0 =
|
|
217
|
-
for (I.dlShiftTo(et, g0),
|
|
216
|
+
var h0 = l0 * (1 << this.F1) + (r0 > 1 ? I[r0 - 2] >> this.F2 : 0), C0 = this.FV / h0, rt = (1 << this.F1) / h0, d0 = 1 << this.F2, p0 = s.t, et = p0 - r0, g0 = r ?? m();
|
|
217
|
+
for (I.dlShiftTo(et, g0), s.compareTo(g0) >= 0 && (s[s.t++] = 1, s.subTo(g0, s)), l.ONE.dlShiftTo(r0, g0), g0.subTo(I, I); I.t < r0; ) I[I.t++] = 0;
|
|
218
218
|
for (; --et >= 0; ) {
|
|
219
|
-
var er =
|
|
220
|
-
if ((
|
|
221
|
-
for (I.dlShiftTo(et, g0),
|
|
219
|
+
var er = s[--p0] == l0 ? this.DM : Math.floor(s[p0] * C0 + (s[p0 - 1] + d0) * rt);
|
|
220
|
+
if ((s[p0] += I.am(0, er, s, et, 0, r0)) < er)
|
|
221
|
+
for (I.dlShiftTo(et, g0), s.subTo(g0, s); s[p0] < --er; ) s.subTo(g0, s);
|
|
222
222
|
}
|
|
223
|
-
r != null && (
|
|
223
|
+
r != null && (s.drShiftTo(r0, r), M != W && l.ZERO.subTo(r, r)), s.t = r0, s.clamp(), J > 0 && s.rShiftTo(J, s), M < 0 && l.ZERO.subTo(s, s);
|
|
224
224
|
}
|
|
225
225
|
}
|
|
226
226
|
}
|
|
@@ -240,8 +240,8 @@ function Nt() {
|
|
|
240
240
|
function Q(t) {
|
|
241
241
|
t.divRemTo(this.m, null, t);
|
|
242
242
|
}
|
|
243
|
-
function Y(t, r,
|
|
244
|
-
t.multiplyTo(r,
|
|
243
|
+
function Y(t, r, s) {
|
|
244
|
+
t.multiplyTo(r, s), this.reduce(s);
|
|
245
245
|
}
|
|
246
246
|
function x0(t, r) {
|
|
247
247
|
t.squareTo(r), this.reduce(r);
|
|
@@ -269,17 +269,17 @@ function Nt() {
|
|
|
269
269
|
for (; t.t <= this.mt2; )
|
|
270
270
|
t[t.t++] = 0;
|
|
271
271
|
for (var r = 0; r < this.m.t; ++r) {
|
|
272
|
-
var
|
|
273
|
-
for (
|
|
274
|
-
t[
|
|
272
|
+
var s = t[r] & 32767, g = s * this.mpl + ((s * this.mph + (t[r] >> 15) * this.mpl & this.um) << 15) & t.DM;
|
|
273
|
+
for (s = r + this.m.t, t[s] += this.m.am(0, g, t, r, 0, this.m.t); t[s] >= t.DV; )
|
|
274
|
+
t[s] -= t.DV, t[++s]++;
|
|
275
275
|
}
|
|
276
276
|
t.clamp(), t.drShiftTo(this.m.t, t), t.compareTo(this.m) >= 0 && t.subTo(this.m, t);
|
|
277
277
|
}
|
|
278
278
|
function f0(t, r) {
|
|
279
279
|
t.squareTo(r), this.reduce(r);
|
|
280
280
|
}
|
|
281
|
-
function n0(t, r,
|
|
282
|
-
t.multiplyTo(r,
|
|
281
|
+
function n0(t, r, s) {
|
|
282
|
+
t.multiplyTo(r, s), this.reduce(s);
|
|
283
283
|
}
|
|
284
284
|
a0.prototype.convert = E0, a0.prototype.revert = O0, a0.prototype.reduce = y0, a0.prototype.mulTo = n0, a0.prototype.sqrTo = f0;
|
|
285
285
|
function q0() {
|
|
@@ -287,18 +287,18 @@ function Nt() {
|
|
|
287
287
|
}
|
|
288
288
|
function m0(t, r) {
|
|
289
289
|
if (t > 4294967295 || t < 1) return l.ONE;
|
|
290
|
-
var
|
|
291
|
-
for (P.copyTo(
|
|
292
|
-
if (r.sqrTo(
|
|
290
|
+
var s = m(), g = m(), P = r.convert(this), I = b(t) - 1;
|
|
291
|
+
for (P.copyTo(s); --I >= 0; )
|
|
292
|
+
if (r.sqrTo(s, g), (t & 1 << I) > 0) r.mulTo(g, P, s);
|
|
293
293
|
else {
|
|
294
|
-
var
|
|
295
|
-
|
|
294
|
+
var M = s;
|
|
295
|
+
s = g, g = M;
|
|
296
296
|
}
|
|
297
|
-
return r.revert(
|
|
297
|
+
return r.revert(s);
|
|
298
298
|
}
|
|
299
299
|
function P0(t, r) {
|
|
300
|
-
var
|
|
301
|
-
return t < 256 || r.isEven() ?
|
|
300
|
+
var s;
|
|
301
|
+
return t < 256 || r.isEven() ? s = new R(r) : s = new a0(r), this.exp(t, s);
|
|
302
302
|
}
|
|
303
303
|
l.prototype.copyTo = n, l.prototype.fromInt = x, l.prototype.fromString = u, l.prototype.clamp = C, l.prototype.dlShiftTo = k, l.prototype.drShiftTo = L, l.prototype.lShiftTo = $, l.prototype.rShiftTo = U, l.prototype.subTo = X, l.prototype.multiplyTo = Z, l.prototype.squareTo = G, l.prototype.divRemTo = K, l.prototype.invDigit = V, l.prototype.isEven = q0, l.prototype.exp = m0, l.prototype.toString = y, l.prototype.negate = S, l.prototype.abs = H, l.prototype.compareTo = D, l.prototype.bitLength = T, l.prototype.mod = q, l.prototype.modPowInt = P0, l.ZERO = f(0), l.ONE = f(1);
|
|
304
304
|
function _0() {
|
|
@@ -329,28 +329,28 @@ function Nt() {
|
|
|
329
329
|
}
|
|
330
330
|
function z0(t) {
|
|
331
331
|
if (t == null && (t = 10), this.signum() == 0 || t < 2 || t > 36) return "0";
|
|
332
|
-
var r = this.chunkSize(t),
|
|
332
|
+
var r = this.chunkSize(t), s = Math.pow(t, r), g = f(s), P = m(), I = m(), M = "";
|
|
333
333
|
for (this.divRemTo(g, P, I); P.signum() > 0; )
|
|
334
|
-
|
|
335
|
-
return I.intValue().toString(t) +
|
|
334
|
+
M = (s + I.intValue()).toString(t).substr(1) + M, P.divRemTo(g, P, I);
|
|
335
|
+
return I.intValue().toString(t) + M;
|
|
336
336
|
}
|
|
337
337
|
function $0(t, r) {
|
|
338
338
|
this.fromInt(0), r == null && (r = 10);
|
|
339
|
-
for (var
|
|
339
|
+
for (var s = this.chunkSize(r), g = Math.pow(r, s), P = !1, I = 0, M = 0, W = 0; W < t.length; ++W) {
|
|
340
340
|
var J = d(t, W);
|
|
341
341
|
if (J < 0) {
|
|
342
342
|
t.charAt(W) == "-" && this.signum() == 0 && (P = !0);
|
|
343
343
|
continue;
|
|
344
344
|
}
|
|
345
|
-
|
|
345
|
+
M = r * M + J, ++I >= s && (this.dMultiply(g), this.dAddOffset(M, 0), I = 0, M = 0);
|
|
346
346
|
}
|
|
347
|
-
I > 0 && (this.dMultiply(Math.pow(r, I)), this.dAddOffset(
|
|
347
|
+
I > 0 && (this.dMultiply(Math.pow(r, I)), this.dAddOffset(M, 0)), P && l.ZERO.subTo(this, this);
|
|
348
348
|
}
|
|
349
|
-
function A0(t, r,
|
|
349
|
+
function A0(t, r, s) {
|
|
350
350
|
if (typeof r == "number")
|
|
351
351
|
if (t < 2) this.fromInt(1);
|
|
352
352
|
else
|
|
353
|
-
for (this.fromNumber(t,
|
|
353
|
+
for (this.fromNumber(t, s), this.testBit(t - 1) || this.bitwiseTo(l.ONE.shiftLeft(t - 1), I0, this), this.isEven() && this.dAddOffset(1, 0); !this.isProbablePrime(r); )
|
|
354
354
|
this.dAddOffset(2, 0), this.bitLength() > t && this.subTo(l.ONE.shiftLeft(t - 1), this);
|
|
355
355
|
else {
|
|
356
356
|
var g = new Array(), P = t & 7;
|
|
@@ -360,10 +360,10 @@ function Nt() {
|
|
|
360
360
|
function S0() {
|
|
361
361
|
var t = this.t, r = new Array();
|
|
362
362
|
r[0] = this.s;
|
|
363
|
-
var
|
|
363
|
+
var s = this.DB - t * this.DB % 8, g, P = 0;
|
|
364
364
|
if (t-- > 0)
|
|
365
|
-
for (
|
|
366
|
-
|
|
365
|
+
for (s < this.DB && (g = this[t] >> s) != (this.s & this.DM) >> s && (r[P++] = g | this.s << this.DB - s); t >= 0; )
|
|
366
|
+
s < 8 ? (g = (this[t] & (1 << s) - 1) << 8 - s, g |= this[--t] >> (s += this.DB - 8)) : (g = this[t] >> (s -= 8) & 255, s <= 0 && (s += this.DB, --t)), (g & 128) != 0 && (g |= -256), P == 0 && (this.s & 128) != (g & 128) && ++P, (P > 0 || g != this.s) && (r[P++] = g);
|
|
367
367
|
return r;
|
|
368
368
|
}
|
|
369
369
|
function Wt(t) {
|
|
@@ -375,17 +375,17 @@ function Nt() {
|
|
|
375
375
|
function V0(t) {
|
|
376
376
|
return this.compareTo(t) > 0 ? this : t;
|
|
377
377
|
}
|
|
378
|
-
function D0(t, r,
|
|
378
|
+
function D0(t, r, s) {
|
|
379
379
|
var g, P, I = Math.min(t.t, this.t);
|
|
380
|
-
for (g = 0; g < I; ++g)
|
|
380
|
+
for (g = 0; g < I; ++g) s[g] = r(this[g], t[g]);
|
|
381
381
|
if (t.t < this.t) {
|
|
382
|
-
for (P = t.s & this.DM, g = I; g < this.t; ++g)
|
|
383
|
-
|
|
382
|
+
for (P = t.s & this.DM, g = I; g < this.t; ++g) s[g] = r(this[g], P);
|
|
383
|
+
s.t = this.t;
|
|
384
384
|
} else {
|
|
385
|
-
for (P = this.s & this.DM, g = I; g < t.t; ++g)
|
|
386
|
-
|
|
385
|
+
for (P = this.s & this.DM, g = I; g < t.t; ++g) s[g] = r(P, t[g]);
|
|
386
|
+
s.t = t.t;
|
|
387
387
|
}
|
|
388
|
-
|
|
388
|
+
s.s = r(this.s, t.s), s.clamp();
|
|
389
389
|
}
|
|
390
390
|
function T0(t, r) {
|
|
391
391
|
return t & r;
|
|
@@ -408,12 +408,12 @@ function Nt() {
|
|
|
408
408
|
var r = m();
|
|
409
409
|
return this.bitwiseTo(t, Z0, r), r;
|
|
410
410
|
}
|
|
411
|
-
function
|
|
411
|
+
function M0(t, r) {
|
|
412
412
|
return t & ~r;
|
|
413
413
|
}
|
|
414
414
|
function Vt(t) {
|
|
415
415
|
var r = m();
|
|
416
|
-
return this.bitwiseTo(t,
|
|
416
|
+
return this.bitwiseTo(t, M0, r), r;
|
|
417
417
|
}
|
|
418
418
|
function j0() {
|
|
419
419
|
for (var t = m(), r = 0; r < this.t; ++r) t[r] = this.DM & ~this[r];
|
|
@@ -443,7 +443,7 @@ function Nt() {
|
|
|
443
443
|
return r;
|
|
444
444
|
}
|
|
445
445
|
function G0() {
|
|
446
|
-
for (var t = 0, r = this.s & this.DM,
|
|
446
|
+
for (var t = 0, r = this.s & this.DM, s = 0; s < this.t; ++s) t += Kt(this[s] ^ r);
|
|
447
447
|
return t;
|
|
448
448
|
}
|
|
449
449
|
function Gt(t) {
|
|
@@ -451,31 +451,31 @@ function Nt() {
|
|
|
451
451
|
return r >= this.t ? this.s != 0 : (this[r] & 1 << t % this.DB) != 0;
|
|
452
452
|
}
|
|
453
453
|
function Yt(t, r) {
|
|
454
|
-
var
|
|
455
|
-
return this.bitwiseTo(
|
|
454
|
+
var s = l.ONE.shiftLeft(t);
|
|
455
|
+
return this.bitwiseTo(s, r, s), s;
|
|
456
456
|
}
|
|
457
457
|
function Y0(t) {
|
|
458
458
|
return this.changeBit(t, I0);
|
|
459
459
|
}
|
|
460
460
|
function Qt(t) {
|
|
461
|
-
return this.changeBit(t,
|
|
461
|
+
return this.changeBit(t, M0);
|
|
462
462
|
}
|
|
463
463
|
function Q0(t) {
|
|
464
464
|
return this.changeBit(t, Z0);
|
|
465
465
|
}
|
|
466
466
|
function i0(t, r) {
|
|
467
|
-
for (var
|
|
468
|
-
g += this[
|
|
467
|
+
for (var s = 0, g = 0, P = Math.min(t.t, this.t); s < P; )
|
|
468
|
+
g += this[s] + t[s], r[s++] = g & this.DM, g >>= this.DB;
|
|
469
469
|
if (t.t < this.t) {
|
|
470
|
-
for (g += t.s;
|
|
471
|
-
g += this[
|
|
470
|
+
for (g += t.s; s < this.t; )
|
|
471
|
+
g += this[s], r[s++] = g & this.DM, g >>= this.DB;
|
|
472
472
|
g += this.s;
|
|
473
473
|
} else {
|
|
474
|
-
for (g += this.s;
|
|
475
|
-
g += t[
|
|
474
|
+
for (g += this.s; s < t.t; )
|
|
475
|
+
g += t[s], r[s++] = g & this.DM, g >>= this.DB;
|
|
476
476
|
g += t.s;
|
|
477
477
|
}
|
|
478
|
-
r.s = g < 0 ? -1 : 0, g > 0 ? r[
|
|
478
|
+
r.s = g < 0 ? -1 : 0, g > 0 ? r[s++] = g : g < -1 && (r[s++] = this.DV + g), r.t = s, r.clamp();
|
|
479
479
|
}
|
|
480
480
|
function F0(t) {
|
|
481
481
|
var r = m();
|
|
@@ -489,141 +489,141 @@ function Nt() {
|
|
|
489
489
|
var r = m();
|
|
490
490
|
return this.multiplyTo(t, r), r;
|
|
491
491
|
}
|
|
492
|
-
function
|
|
492
|
+
function ve() {
|
|
493
493
|
var t = m();
|
|
494
494
|
return this.squareTo(t), t;
|
|
495
495
|
}
|
|
496
|
-
function
|
|
496
|
+
function de(t) {
|
|
497
497
|
var r = m();
|
|
498
498
|
return this.divRemTo(t, r, null), r;
|
|
499
499
|
}
|
|
500
|
-
function
|
|
500
|
+
function pe(t) {
|
|
501
501
|
var r = m();
|
|
502
502
|
return this.divRemTo(t, null, r), r;
|
|
503
503
|
}
|
|
504
|
-
function pe(t) {
|
|
505
|
-
var r = m(), a = m();
|
|
506
|
-
return this.divRemTo(t, r, a), new Array(r, a);
|
|
507
|
-
}
|
|
508
504
|
function Be(t) {
|
|
505
|
+
var r = m(), s = m();
|
|
506
|
+
return this.divRemTo(t, r, s), new Array(r, s);
|
|
507
|
+
}
|
|
508
|
+
function Fe(t) {
|
|
509
509
|
this[this.t] = this.am(0, t - 1, this, 0, 0, this.t), ++this.t, this.clamp();
|
|
510
510
|
}
|
|
511
|
-
function
|
|
511
|
+
function Ce(t, r) {
|
|
512
512
|
if (t != 0) {
|
|
513
513
|
for (; this.t <= r; ) this[this.t++] = 0;
|
|
514
514
|
for (this[r] += t; this[r] >= this.DV; )
|
|
515
515
|
this[r] -= this.DV, ++r >= this.t && (this[this.t++] = 0), ++this[r];
|
|
516
516
|
}
|
|
517
517
|
}
|
|
518
|
-
function
|
|
518
|
+
function N0() {
|
|
519
519
|
}
|
|
520
520
|
function vr(t) {
|
|
521
521
|
return t;
|
|
522
522
|
}
|
|
523
|
-
function
|
|
524
|
-
t.multiplyTo(r,
|
|
523
|
+
function Ee(t, r, s) {
|
|
524
|
+
t.multiplyTo(r, s);
|
|
525
525
|
}
|
|
526
|
-
function
|
|
526
|
+
function Ae(t, r) {
|
|
527
527
|
t.squareTo(r);
|
|
528
528
|
}
|
|
529
|
-
|
|
530
|
-
function
|
|
531
|
-
return this.exp(t, new
|
|
529
|
+
N0.prototype.convert = vr, N0.prototype.revert = vr, N0.prototype.mulTo = Ee, N0.prototype.sqrTo = Ae;
|
|
530
|
+
function De(t) {
|
|
531
|
+
return this.exp(t, new N0());
|
|
532
532
|
}
|
|
533
|
-
function
|
|
533
|
+
function ge(t, r, s) {
|
|
534
534
|
var g = Math.min(this.t + t.t, r);
|
|
535
|
-
for (
|
|
535
|
+
for (s.s = 0, s.t = g; g > 0; ) s[--g] = 0;
|
|
536
536
|
var P;
|
|
537
|
-
for (P =
|
|
538
|
-
for (P = Math.min(t.t, r); g < P; ++g) this.am(0, t[g],
|
|
539
|
-
|
|
537
|
+
for (P = s.t - this.t; g < P; ++g) s[g + this.t] = this.am(0, t[g], s, g, 0, this.t);
|
|
538
|
+
for (P = Math.min(t.t, r); g < P; ++g) this.am(0, t[g], s, g, 0, r - g);
|
|
539
|
+
s.clamp();
|
|
540
540
|
}
|
|
541
|
-
function
|
|
541
|
+
function be(t, r, s) {
|
|
542
542
|
--r;
|
|
543
|
-
var g =
|
|
544
|
-
for (
|
|
543
|
+
var g = s.t = this.t + t.t - r;
|
|
544
|
+
for (s.s = 0; --g >= 0; ) s[g] = 0;
|
|
545
545
|
for (g = Math.max(r - this.t, 0); g < t.t; ++g)
|
|
546
|
-
|
|
547
|
-
|
|
546
|
+
s[this.t + g - r] = this.am(r - g, t[g], s, 0, 0, this.t + g - r);
|
|
547
|
+
s.clamp(), s.drShiftTo(1, s);
|
|
548
548
|
}
|
|
549
549
|
function k0(t) {
|
|
550
550
|
this.r2 = m(), this.q3 = m(), l.ONE.dlShiftTo(2 * t.t, this.r2), this.mu = this.r2.divide(t), this.m = t;
|
|
551
551
|
}
|
|
552
|
-
function
|
|
552
|
+
function ye(t) {
|
|
553
553
|
if (t.s < 0 || t.t > 2 * this.m.t) return t.mod(this.m);
|
|
554
554
|
if (t.compareTo(this.m) < 0) return t;
|
|
555
555
|
var r = m();
|
|
556
556
|
return t.copyTo(r), this.reduce(r), r;
|
|
557
557
|
}
|
|
558
|
-
function
|
|
558
|
+
function me(t) {
|
|
559
559
|
return t;
|
|
560
560
|
}
|
|
561
|
-
function
|
|
561
|
+
function _e(t) {
|
|
562
562
|
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);
|
|
563
563
|
for (t.subTo(this.r2, t); t.compareTo(this.m) >= 0; ) t.subTo(this.m, t);
|
|
564
564
|
}
|
|
565
|
-
function
|
|
565
|
+
function we(t, r) {
|
|
566
566
|
t.squareTo(r), this.reduce(r);
|
|
567
567
|
}
|
|
568
|
-
function
|
|
569
|
-
t.multiplyTo(r,
|
|
568
|
+
function Se(t, r, s) {
|
|
569
|
+
t.multiplyTo(r, s), this.reduce(s);
|
|
570
570
|
}
|
|
571
|
-
k0.prototype.convert =
|
|
572
|
-
function
|
|
573
|
-
var
|
|
574
|
-
if (
|
|
575
|
-
|
|
576
|
-
var
|
|
577
|
-
if (
|
|
571
|
+
k0.prototype.convert = ye, k0.prototype.revert = me, k0.prototype.reduce = _e, k0.prototype.mulTo = Se, k0.prototype.sqrTo = we;
|
|
572
|
+
function Te(t, r) {
|
|
573
|
+
var s = t.bitLength(), g, P = f(1), I;
|
|
574
|
+
if (s <= 0) return P;
|
|
575
|
+
s < 18 ? g = 1 : s < 48 ? g = 3 : s < 144 ? g = 4 : s < 768 ? g = 5 : g = 6, s < 8 ? I = new R(r) : r.isEven() ? I = new k0(r) : I = new a0(r);
|
|
576
|
+
var M = new Array(), W = 3, J = g - 1, r0 = (1 << g) - 1;
|
|
577
|
+
if (M[1] = I.convert(this), g > 1) {
|
|
578
578
|
var l0 = m();
|
|
579
|
-
for (I.sqrTo(
|
|
580
|
-
|
|
579
|
+
for (I.sqrTo(M[1], l0); W <= r0; )
|
|
580
|
+
M[W] = m(), I.mulTo(l0, M[W - 2], M[W]), W += 2;
|
|
581
581
|
}
|
|
582
582
|
var h0 = t.t - 1, C0, rt = !0, d0 = m(), p0;
|
|
583
|
-
for (
|
|
584
|
-
for (
|
|
583
|
+
for (s = b(t[h0]) - 1; h0 >= 0; ) {
|
|
584
|
+
for (s >= J ? C0 = t[h0] >> s - J & r0 : (C0 = (t[h0] & (1 << s + 1) - 1) << J - s, h0 > 0 && (C0 |= t[h0 - 1] >> this.DB + s - J)), W = g; (C0 & 1) == 0; )
|
|
585
585
|
C0 >>= 1, --W;
|
|
586
|
-
if ((
|
|
587
|
-
|
|
586
|
+
if ((s -= W) < 0 && (s += this.DB, --h0), rt)
|
|
587
|
+
M[C0].copyTo(P), rt = !1;
|
|
588
588
|
else {
|
|
589
589
|
for (; W > 1; )
|
|
590
590
|
I.sqrTo(P, d0), I.sqrTo(d0, P), W -= 2;
|
|
591
|
-
W > 0 ? I.sqrTo(P, d0) : (p0 = P, P = d0, d0 = p0), I.mulTo(d0,
|
|
591
|
+
W > 0 ? I.sqrTo(P, d0) : (p0 = P, P = d0, d0 = p0), I.mulTo(d0, M[C0], P);
|
|
592
592
|
}
|
|
593
|
-
for (; h0 >= 0 && (t[h0] & 1 <<
|
|
594
|
-
I.sqrTo(P, d0), p0 = P, P = d0, d0 = p0, --
|
|
593
|
+
for (; h0 >= 0 && (t[h0] & 1 << s) == 0; )
|
|
594
|
+
I.sqrTo(P, d0), p0 = P, P = d0, d0 = p0, --s < 0 && (s = this.DB - 1, --h0);
|
|
595
595
|
}
|
|
596
596
|
return I.revert(P);
|
|
597
597
|
}
|
|
598
|
-
function
|
|
599
|
-
var r = this.s < 0 ? this.negate() : this.clone(),
|
|
600
|
-
if (r.compareTo(
|
|
598
|
+
function ke(t) {
|
|
599
|
+
var r = this.s < 0 ? this.negate() : this.clone(), s = t.s < 0 ? t.negate() : t.clone();
|
|
600
|
+
if (r.compareTo(s) < 0) {
|
|
601
601
|
var g = r;
|
|
602
|
-
r =
|
|
602
|
+
r = s, s = g;
|
|
603
603
|
}
|
|
604
|
-
var P = r.getLowestSetBit(), I =
|
|
604
|
+
var P = r.getLowestSetBit(), I = s.getLowestSetBit();
|
|
605
605
|
if (I < 0) return r;
|
|
606
|
-
for (P < I && (I = P), I > 0 && (r.rShiftTo(I, r),
|
|
607
|
-
(P = r.getLowestSetBit()) > 0 && r.rShiftTo(P, r), (P =
|
|
608
|
-
return I > 0 &&
|
|
606
|
+
for (P < I && (I = P), I > 0 && (r.rShiftTo(I, r), s.rShiftTo(I, s)); r.signum() > 0; )
|
|
607
|
+
(P = r.getLowestSetBit()) > 0 && r.rShiftTo(P, r), (P = s.getLowestSetBit()) > 0 && s.rShiftTo(P, s), r.compareTo(s) >= 0 ? (r.subTo(s, r), r.rShiftTo(1, r)) : (s.subTo(r, s), s.rShiftTo(1, s));
|
|
608
|
+
return I > 0 && s.lShiftTo(I, s), s;
|
|
609
609
|
}
|
|
610
|
-
function
|
|
610
|
+
function Re(t) {
|
|
611
611
|
if (t <= 0) return 0;
|
|
612
|
-
var r = this.DV % t,
|
|
612
|
+
var r = this.DV % t, s = this.s < 0 ? t - 1 : 0;
|
|
613
613
|
if (this.t > 0)
|
|
614
|
-
if (r == 0)
|
|
615
|
-
else for (var g = this.t - 1; g >= 0; --g)
|
|
616
|
-
return
|
|
614
|
+
if (r == 0) s = this[0] % t;
|
|
615
|
+
else for (var g = this.t - 1; g >= 0; --g) s = (r * s + this[g]) % t;
|
|
616
|
+
return s;
|
|
617
617
|
}
|
|
618
|
-
function
|
|
618
|
+
function He(t) {
|
|
619
619
|
var r = t.isEven();
|
|
620
620
|
if (this.isEven() && r || t.signum() == 0) return l.ZERO;
|
|
621
|
-
for (var
|
|
622
|
-
for (;
|
|
623
|
-
|
|
621
|
+
for (var s = t.clone(), g = this.clone(), P = f(1), I = f(0), M = f(0), W = f(1); s.signum() != 0; ) {
|
|
622
|
+
for (; s.isEven(); )
|
|
623
|
+
s.rShiftTo(1, s), r ? ((!P.isEven() || !I.isEven()) && (P.addTo(this, P), I.subTo(t, I)), P.rShiftTo(1, P)) : I.isEven() || I.subTo(t, I), I.rShiftTo(1, I);
|
|
624
624
|
for (; g.isEven(); )
|
|
625
|
-
g.rShiftTo(1, g), r ? ((!
|
|
626
|
-
|
|
625
|
+
g.rShiftTo(1, g), r ? ((!M.isEven() || !W.isEven()) && (M.addTo(this, M), W.subTo(t, W)), M.rShiftTo(1, M)) : W.isEven() || W.subTo(t, W), W.rShiftTo(1, W);
|
|
626
|
+
s.compareTo(g) >= 0 ? (s.subTo(g, s), r && P.subTo(M, P), I.subTo(W, I)) : (g.subTo(s, g), r && M.subTo(P, M), W.subTo(I, W));
|
|
627
627
|
}
|
|
628
628
|
if (g.compareTo(l.ONE) != 0) return l.ZERO;
|
|
629
629
|
if (W.compareTo(t) >= 0) return W.subtract(t);
|
|
@@ -631,44 +631,44 @@ function Nt() {
|
|
|
631
631
|
else return W;
|
|
632
632
|
return W.signum() < 0 ? W.add(t) : W;
|
|
633
633
|
}
|
|
634
|
-
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],
|
|
635
|
-
function
|
|
636
|
-
var r,
|
|
637
|
-
if (
|
|
634
|
+
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], qe = (1 << 26) / o0[o0.length - 1];
|
|
635
|
+
function Pe(t) {
|
|
636
|
+
var r, s = this.abs();
|
|
637
|
+
if (s.t == 1 && s[0] <= o0[o0.length - 1]) {
|
|
638
638
|
for (r = 0; r < o0.length; ++r)
|
|
639
|
-
if (
|
|
639
|
+
if (s[0] == o0[r]) return !0;
|
|
640
640
|
return !1;
|
|
641
641
|
}
|
|
642
|
-
if (
|
|
642
|
+
if (s.isEven()) return !1;
|
|
643
643
|
for (r = 1; r < o0.length; ) {
|
|
644
|
-
for (var g = o0[r], P = r + 1; P < o0.length && g <
|
|
645
|
-
for (g =
|
|
644
|
+
for (var g = o0[r], P = r + 1; P < o0.length && g < qe; ) g *= o0[P++];
|
|
645
|
+
for (g = s.modInt(g); r < P; ) if (g % o0[r++] == 0) return !1;
|
|
646
646
|
}
|
|
647
|
-
return
|
|
647
|
+
return s.millerRabin(t);
|
|
648
648
|
}
|
|
649
|
-
function
|
|
650
|
-
var r = this.subtract(l.ONE),
|
|
651
|
-
if (
|
|
652
|
-
var g = r.shiftRight(
|
|
649
|
+
function ze(t) {
|
|
650
|
+
var r = this.subtract(l.ONE), s = r.getLowestSetBit();
|
|
651
|
+
if (s <= 0) return !1;
|
|
652
|
+
var g = r.shiftRight(s);
|
|
653
653
|
t = t + 1 >> 1, t > o0.length && (t = o0.length);
|
|
654
654
|
for (var P = m(), I = 0; I < t; ++I) {
|
|
655
655
|
P.fromInt(o0[Math.floor(Math.random() * o0.length)]);
|
|
656
|
-
var
|
|
657
|
-
if (
|
|
658
|
-
for (var W = 1; W++ <
|
|
659
|
-
if (
|
|
660
|
-
if (
|
|
656
|
+
var M = P.modPow(g, this);
|
|
657
|
+
if (M.compareTo(l.ONE) != 0 && M.compareTo(r) != 0) {
|
|
658
|
+
for (var W = 1; W++ < s && M.compareTo(r) != 0; )
|
|
659
|
+
if (M = M.modPowInt(2, this), M.compareTo(l.ONE) == 0) return !1;
|
|
660
|
+
if (M.compareTo(r) != 0) return !1;
|
|
661
661
|
}
|
|
662
662
|
}
|
|
663
663
|
return !0;
|
|
664
664
|
}
|
|
665
|
-
l.prototype.chunkSize = s0, l.prototype.toRadix = z0, l.prototype.fromRadix = $0, l.prototype.fromNumber = A0, l.prototype.bitwiseTo = D0, l.prototype.changeBit = Yt, l.prototype.addTo = i0, l.prototype.dMultiply =
|
|
665
|
+
l.prototype.chunkSize = s0, l.prototype.toRadix = z0, l.prototype.fromRadix = $0, l.prototype.fromNumber = A0, l.prototype.bitwiseTo = D0, l.prototype.changeBit = Yt, l.prototype.addTo = i0, l.prototype.dMultiply = Fe, l.prototype.dAddOffset = Ce, l.prototype.multiplyLowerTo = ge, l.prototype.multiplyUpperTo = be, l.prototype.modInt = Re, l.prototype.millerRabin = ze, l.prototype.clone = _0, l.prototype.intValue = L0, l.prototype.byteValue = w0, l.prototype.shortValue = c0, l.prototype.signum = B0, l.prototype.toByteArray = S0, l.prototype.equals = Wt, l.prototype.min = U0, l.prototype.max = V0, l.prototype.and = $t, l.prototype.or = X0, l.prototype.xor = Ut, l.prototype.andNot = Vt, l.prototype.not = j0, l.prototype.shiftLeft = Xt, l.prototype.shiftRight = K0, l.prototype.getLowestSetBit = jt, l.prototype.bitCount = G0, l.prototype.testBit = Gt, l.prototype.setBit = Y0, l.prototype.clearBit = Qt, l.prototype.flipBit = Q0, l.prototype.add = F0, l.prototype.subtract = J0, l.prototype.multiply = Jt, l.prototype.divide = de, l.prototype.remainder = pe, l.prototype.divideAndRemainder = Be, l.prototype.modPow = Te, l.prototype.modInverse = He, l.prototype.pow = De, l.prototype.gcd = ke, l.prototype.isProbablePrime = Pe, l.prototype.square = ve, l.prototype.Barrett = k0;
|
|
666
666
|
var tt, u0, t0;
|
|
667
|
-
function
|
|
667
|
+
function Ie(t) {
|
|
668
668
|
u0[t0++] ^= t & 255, u0[t0++] ^= t >> 8 & 255, u0[t0++] ^= t >> 16 & 255, u0[t0++] ^= t >> 24 & 255, t0 >= rr && (t0 -= rr);
|
|
669
669
|
}
|
|
670
670
|
function dr() {
|
|
671
|
-
|
|
671
|
+
Ie((/* @__PURE__ */ new Date()).getTime());
|
|
672
672
|
}
|
|
673
673
|
if (u0 == null) {
|
|
674
674
|
u0 = new Array(), t0 = 0;
|
|
@@ -688,55 +688,55 @@ function Nt() {
|
|
|
688
688
|
v0 = Math.floor(65536 * Math.random()), u0[t0++] = v0 >>> 8, u0[t0++] = v0 & 255;
|
|
689
689
|
t0 = 0, dr();
|
|
690
690
|
}
|
|
691
|
-
function
|
|
691
|
+
function Oe() {
|
|
692
692
|
if (tt == null) {
|
|
693
|
-
for (dr(), tt =
|
|
693
|
+
for (dr(), tt = We(), tt.init(u0), t0 = 0; t0 < u0.length; ++t0)
|
|
694
694
|
u0[t0] = 0;
|
|
695
695
|
t0 = 0;
|
|
696
696
|
}
|
|
697
697
|
return tt.next();
|
|
698
698
|
}
|
|
699
|
-
function
|
|
699
|
+
function Le(t) {
|
|
700
700
|
var r;
|
|
701
|
-
for (r = 0; r < t.length; ++r) t[r] =
|
|
701
|
+
for (r = 0; r < t.length; ++r) t[r] = Oe();
|
|
702
702
|
}
|
|
703
703
|
function Fr() {
|
|
704
704
|
}
|
|
705
|
-
Fr.prototype.nextBytes =
|
|
705
|
+
Fr.prototype.nextBytes = Le;
|
|
706
706
|
function tr() {
|
|
707
707
|
this.i = 0, this.j = 0, this.S = new Array();
|
|
708
708
|
}
|
|
709
|
-
function
|
|
710
|
-
var r,
|
|
709
|
+
function Me(t) {
|
|
710
|
+
var r, s, g;
|
|
711
711
|
for (r = 0; r < 256; ++r)
|
|
712
712
|
this.S[r] = r;
|
|
713
|
-
for (
|
|
714
|
-
|
|
713
|
+
for (s = 0, r = 0; r < 256; ++r)
|
|
714
|
+
s = s + this.S[r] + t[r % t.length] & 255, g = this.S[r], this.S[r] = this.S[s], this.S[s] = g;
|
|
715
715
|
this.i = 0, this.j = 0;
|
|
716
716
|
}
|
|
717
717
|
function Ne() {
|
|
718
718
|
var t;
|
|
719
719
|
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];
|
|
720
720
|
}
|
|
721
|
-
tr.prototype.init =
|
|
722
|
-
function
|
|
721
|
+
tr.prototype.init = Me, tr.prototype.next = Ne;
|
|
722
|
+
function We() {
|
|
723
723
|
return new tr();
|
|
724
724
|
}
|
|
725
725
|
var rr = 256;
|
|
726
|
-
|
|
726
|
+
_.exports = {
|
|
727
727
|
default: l,
|
|
728
728
|
BigInteger: l,
|
|
729
729
|
SecureRandom: Fr
|
|
730
730
|
};
|
|
731
|
-
}).call(
|
|
731
|
+
}).call(Ve);
|
|
732
732
|
}(xt)), xt.exports;
|
|
733
733
|
}
|
|
734
734
|
var nr, Er;
|
|
735
|
-
function
|
|
735
|
+
function Xe() {
|
|
736
736
|
if (Er) return nr;
|
|
737
737
|
Er = 1;
|
|
738
|
-
const { BigInteger:
|
|
739
|
-
function
|
|
738
|
+
const { BigInteger: _ } = Mt();
|
|
739
|
+
function N(B) {
|
|
740
740
|
let e = B.toString(16);
|
|
741
741
|
if (e[0] !== "-")
|
|
742
742
|
e.length % 2 === 1 ? e = "0" + e : e.match(/^[0-7]/) || (e = "00" + e);
|
|
@@ -746,7 +746,7 @@ function Ve() {
|
|
|
746
746
|
o % 2 === 1 ? o += 1 : e.match(/^[0-7]/) || (o += 2);
|
|
747
747
|
let F = "";
|
|
748
748
|
for (let c = 0; c < o; c++) F += "f";
|
|
749
|
-
F = new
|
|
749
|
+
F = new _(F, 16), e = F.xor(B).add(_.ONE), e = e.toString(16).replace(/^-/, "");
|
|
750
750
|
}
|
|
751
751
|
return e;
|
|
752
752
|
}
|
|
@@ -769,15 +769,15 @@ function Ve() {
|
|
|
769
769
|
return "";
|
|
770
770
|
}
|
|
771
771
|
}
|
|
772
|
-
class
|
|
772
|
+
class a extends A {
|
|
773
773
|
constructor(e) {
|
|
774
|
-
super(), this.t = "02", e && (this.v =
|
|
774
|
+
super(), this.t = "02", e && (this.v = N(e));
|
|
775
775
|
}
|
|
776
776
|
getValue() {
|
|
777
777
|
return this.v;
|
|
778
778
|
}
|
|
779
779
|
}
|
|
780
|
-
class
|
|
780
|
+
class w extends A {
|
|
781
781
|
constructor(e) {
|
|
782
782
|
super(), this.t = "30", this.asn1Array = e;
|
|
783
783
|
}
|
|
@@ -790,7 +790,7 @@ function Ve() {
|
|
|
790
790
|
}
|
|
791
791
|
function m(B, e) {
|
|
792
792
|
const o = l(B, e), F = B.substr(e + 2, o * 2);
|
|
793
|
-
return F ? (+F[0] < 8 ? new
|
|
793
|
+
return F ? (+F[0] < 8 ? new _(F, 16) : new _(F.substr(2), 16)).intValue() : -1;
|
|
794
794
|
}
|
|
795
795
|
function h(B, e) {
|
|
796
796
|
const o = l(B, e);
|
|
@@ -801,24 +801,24 @@ function Ve() {
|
|
|
801
801
|
* ASN.1 der 编码,针对 sm2 签名
|
|
802
802
|
*/
|
|
803
803
|
encodeDer(B, e) {
|
|
804
|
-
const o = new
|
|
805
|
-
return new
|
|
804
|
+
const o = new a(B), F = new a(e);
|
|
805
|
+
return new w([o, F]).getEncodedHex();
|
|
806
806
|
},
|
|
807
807
|
/**
|
|
808
808
|
* 解析 ASN.1 der,针对 sm2 验签
|
|
809
809
|
*/
|
|
810
810
|
decodeDer(B) {
|
|
811
|
-
const e = h(B, 0), o = h(B, e), F = m(B, e), c = B.substr(o, F * 2), p = o + c.length, v = h(B, p), E = m(B, p), i = B.substr(v, E * 2), d = new
|
|
811
|
+
const e = h(B, 0), o = h(B, e), F = m(B, e), c = B.substr(o, F * 2), p = o + c.length, v = h(B, p), E = m(B, p), i = B.substr(v, E * 2), d = new _(c, 16), n = new _(i, 16);
|
|
812
812
|
return { r: d, s: n };
|
|
813
813
|
}
|
|
814
814
|
}, nr;
|
|
815
815
|
}
|
|
816
816
|
var ir, Ar;
|
|
817
|
-
function
|
|
817
|
+
function Ze() {
|
|
818
818
|
if (Ar) return ir;
|
|
819
819
|
Ar = 1;
|
|
820
|
-
const { BigInteger:
|
|
821
|
-
class
|
|
820
|
+
const { BigInteger: _ } = Mt(), N = new _("2"), A = new _("3");
|
|
821
|
+
class a {
|
|
822
822
|
constructor(h, B) {
|
|
823
823
|
this.x = B, this.q = h;
|
|
824
824
|
}
|
|
@@ -838,42 +838,42 @@ function Xe() {
|
|
|
838
838
|
* 取反
|
|
839
839
|
*/
|
|
840
840
|
negate() {
|
|
841
|
-
return new
|
|
841
|
+
return new a(this.q, this.x.negate().mod(this.q));
|
|
842
842
|
}
|
|
843
843
|
/**
|
|
844
844
|
* 相加
|
|
845
845
|
*/
|
|
846
846
|
add(h) {
|
|
847
|
-
return new
|
|
847
|
+
return new a(this.q, this.x.add(h.toBigInteger()).mod(this.q));
|
|
848
848
|
}
|
|
849
849
|
/**
|
|
850
850
|
* 相减
|
|
851
851
|
*/
|
|
852
852
|
subtract(h) {
|
|
853
|
-
return new
|
|
853
|
+
return new a(this.q, this.x.subtract(h.toBigInteger()).mod(this.q));
|
|
854
854
|
}
|
|
855
855
|
/**
|
|
856
856
|
* 相乘
|
|
857
857
|
*/
|
|
858
858
|
multiply(h) {
|
|
859
|
-
return new
|
|
859
|
+
return new a(this.q, this.x.multiply(h.toBigInteger()).mod(this.q));
|
|
860
860
|
}
|
|
861
861
|
/**
|
|
862
862
|
* 相除
|
|
863
863
|
*/
|
|
864
864
|
divide(h) {
|
|
865
|
-
return new
|
|
865
|
+
return new a(this.q, this.x.multiply(h.toBigInteger().modInverse(this.q)).mod(this.q));
|
|
866
866
|
}
|
|
867
867
|
/**
|
|
868
868
|
* 平方
|
|
869
869
|
*/
|
|
870
870
|
square() {
|
|
871
|
-
return new
|
|
871
|
+
return new a(this.q, this.x.square().mod(this.q));
|
|
872
872
|
}
|
|
873
873
|
}
|
|
874
|
-
class
|
|
874
|
+
class w {
|
|
875
875
|
constructor(h, B, e, o) {
|
|
876
|
-
this.curve = h, this.x = B, this.y = e, this.z = o ??
|
|
876
|
+
this.curve = h, this.x = B, this.y = e, this.z = o ?? _.ONE, this.zinv = null;
|
|
877
877
|
}
|
|
878
878
|
getX() {
|
|
879
879
|
return this.zinv === null && (this.zinv = this.z.modInverse(this.curve.q)), this.curve.fromBigInteger(this.x.toBigInteger().multiply(this.zinv).mod(this.curve.q));
|
|
@@ -885,19 +885,19 @@ function Xe() {
|
|
|
885
885
|
* 判断相等
|
|
886
886
|
*/
|
|
887
887
|
equals(h) {
|
|
888
|
-
return h === this ? !0 : this.isInfinity() ? h.isInfinity() : h.isInfinity() ? this.isInfinity() : h.y.toBigInteger().multiply(this.z).subtract(this.y.toBigInteger().multiply(h.z)).mod(this.curve.q).equals(
|
|
888
|
+
return h === this ? !0 : this.isInfinity() ? h.isInfinity() : h.isInfinity() ? this.isInfinity() : h.y.toBigInteger().multiply(this.z).subtract(this.y.toBigInteger().multiply(h.z)).mod(this.curve.q).equals(_.ZERO) ? h.x.toBigInteger().multiply(this.z).subtract(this.x.toBigInteger().multiply(h.z)).mod(this.curve.q).equals(_.ZERO) : !1;
|
|
889
889
|
}
|
|
890
890
|
/**
|
|
891
891
|
* 是否是无穷远点
|
|
892
892
|
*/
|
|
893
893
|
isInfinity() {
|
|
894
|
-
return this.x === null && this.y === null ? !0 : this.z.equals(
|
|
894
|
+
return this.x === null && this.y === null ? !0 : this.z.equals(_.ZERO) && !this.y.toBigInteger().equals(_.ZERO);
|
|
895
895
|
}
|
|
896
896
|
/**
|
|
897
897
|
* 取反,x 轴对称点
|
|
898
898
|
*/
|
|
899
899
|
negate() {
|
|
900
|
-
return new
|
|
900
|
+
return new w(this.curve, this.x, this.y.negate(), this.z);
|
|
901
901
|
}
|
|
902
902
|
/**
|
|
903
903
|
* 相加
|
|
@@ -923,10 +923,10 @@ function Xe() {
|
|
|
923
923
|
if (this.isInfinity()) return h;
|
|
924
924
|
if (h.isInfinity()) return this;
|
|
925
925
|
const B = this.x.toBigInteger(), e = this.y.toBigInteger(), o = this.z, F = h.x.toBigInteger(), c = h.y.toBigInteger(), p = h.z, v = this.curve.q, E = B.multiply(p).mod(v), i = F.multiply(o).mod(v), d = E.subtract(i), n = e.multiply(p).mod(v), x = c.multiply(o).mod(v), f = n.subtract(x);
|
|
926
|
-
if (
|
|
927
|
-
return
|
|
926
|
+
if (_.ZERO.equals(d))
|
|
927
|
+
return _.ZERO.equals(f) ? this.twice() : this.curve.infinity;
|
|
928
928
|
const u = E.add(i), C = o.multiply(p).mod(v), y = d.square().mod(v), S = d.multiply(y).mod(v), H = C.multiply(f.square()).subtract(u.multiply(y)).mod(v), D = d.multiply(H).mod(v), b = f.multiply(y.multiply(E).subtract(H)).subtract(n.multiply(S)).mod(v), T = S.multiply(C).mod(v);
|
|
929
|
-
return new
|
|
929
|
+
return new w(this.curve, this.curve.fromBigInteger(D), this.curve.fromBigInteger(b), T);
|
|
930
930
|
}
|
|
931
931
|
/**
|
|
932
932
|
* 自加
|
|
@@ -947,7 +947,7 @@ function Xe() {
|
|
|
947
947
|
if (this.isInfinity()) return this;
|
|
948
948
|
if (!this.y.toBigInteger().signum()) return this.curve.infinity;
|
|
949
949
|
const h = this.x.toBigInteger(), B = this.y.toBigInteger(), e = this.z, o = this.curve.q, F = this.curve.a.toBigInteger(), c = h.square().multiply(A).add(F.multiply(e.square())).mod(o), p = B.shiftLeft(1).multiply(e).mod(o), v = B.square().mod(o), E = v.multiply(h).multiply(e).mod(o), i = p.square().mod(o), d = c.square().subtract(E.shiftLeft(3)).mod(o), n = p.multiply(d).mod(o), x = c.multiply(E.shiftLeft(2).subtract(d)).subtract(i.shiftLeft(1).multiply(v)).mod(o), f = p.multiply(i).mod(o);
|
|
950
|
-
return new
|
|
950
|
+
return new w(this.curve, this.curve.fromBigInteger(n), this.curve.fromBigInteger(x), f);
|
|
951
951
|
}
|
|
952
952
|
/**
|
|
953
953
|
* 倍点计算
|
|
@@ -967,7 +967,7 @@ function Xe() {
|
|
|
967
967
|
}
|
|
968
968
|
class l {
|
|
969
969
|
constructor(h, B, e) {
|
|
970
|
-
this.q = h, this.a = this.fromBigInteger(B), this.b = this.fromBigInteger(e), this.infinity = new
|
|
970
|
+
this.q = h, this.a = this.fromBigInteger(B), this.b = this.fromBigInteger(e), this.infinity = new w(this, null, null);
|
|
971
971
|
}
|
|
972
972
|
/**
|
|
973
973
|
* 判断两个椭圆曲线是否相等
|
|
@@ -979,7 +979,7 @@ function Xe() {
|
|
|
979
979
|
* 生成椭圆曲线域元素
|
|
980
980
|
*/
|
|
981
981
|
fromBigInteger(h) {
|
|
982
|
-
return new
|
|
982
|
+
return new a(this.q, h);
|
|
983
983
|
}
|
|
984
984
|
/**
|
|
985
985
|
* 解析 16 进制串为椭圆曲线点
|
|
@@ -991,50 +991,50 @@ function Xe() {
|
|
|
991
991
|
return this.infinity;
|
|
992
992
|
case 2:
|
|
993
993
|
case 3:
|
|
994
|
-
const B = this.fromBigInteger(new
|
|
994
|
+
const B = this.fromBigInteger(new _(h.substr(2), 16));
|
|
995
995
|
let e = this.fromBigInteger(B.multiply(B.square()).add(
|
|
996
996
|
B.multiply(this.a)
|
|
997
997
|
).add(this.b).toBigInteger().modPow(
|
|
998
|
-
this.q.divide(new
|
|
998
|
+
this.q.divide(new _("4")).add(_.ONE),
|
|
999
999
|
this.q
|
|
1000
1000
|
));
|
|
1001
|
-
return e.toBigInteger().mod(
|
|
1001
|
+
return e.toBigInteger().mod(N).equals(new _(h.substr(0, 2), 16).subtract(N)) || (e = e.negate()), new w(this, B, e);
|
|
1002
1002
|
case 4:
|
|
1003
1003
|
case 6:
|
|
1004
1004
|
case 7:
|
|
1005
1005
|
const o = (h.length - 2) / 2, F = h.substr(2, o), c = h.substr(o + 2, o);
|
|
1006
|
-
return new
|
|
1006
|
+
return new w(this, this.fromBigInteger(new _(F, 16)), this.fromBigInteger(new _(c, 16)));
|
|
1007
1007
|
default:
|
|
1008
1008
|
return null;
|
|
1009
1009
|
}
|
|
1010
1010
|
}
|
|
1011
1011
|
}
|
|
1012
1012
|
return ir = {
|
|
1013
|
-
ECPointFp:
|
|
1013
|
+
ECPointFp: w,
|
|
1014
1014
|
ECCurveFp: l
|
|
1015
1015
|
}, ir;
|
|
1016
1016
|
}
|
|
1017
1017
|
var or, Dr;
|
|
1018
|
-
function
|
|
1018
|
+
function je() {
|
|
1019
1019
|
if (Dr) return or;
|
|
1020
1020
|
Dr = 1;
|
|
1021
|
-
const { BigInteger:
|
|
1021
|
+
const { BigInteger: _, SecureRandom: N } = Mt(), { ECCurveFp: A } = Ze(), a = new N(), { curve: w, G: l, n: m } = B();
|
|
1022
1022
|
function h() {
|
|
1023
|
-
return
|
|
1023
|
+
return w;
|
|
1024
1024
|
}
|
|
1025
1025
|
function B() {
|
|
1026
|
-
const n = new
|
|
1026
|
+
const n = new _("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFF", 16), x = new _("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFC", 16), f = new _("28E9FA9E9D9F5E344D5A9E4BCF6509A7F39789F515AB8F92DDBCBD414D940E93", 16), u = new A(n, x, f), S = u.decodePointHex("04" + "32C4AE2C1F1981195F9904466A39C9948FE30BBFF2660BE1715A4589334C74C7" + "BC3736A2F4F6779C59BDCEE36B692153D0A9877CC62A474002DF32E52139F0A0"), H = new _("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFF7203DF6B21C6052B53BBF40939D54123", 16);
|
|
1027
1027
|
return { curve: u, G: S, n: H };
|
|
1028
1028
|
}
|
|
1029
1029
|
function e(n, x, f) {
|
|
1030
|
-
const C = (n ? new
|
|
1030
|
+
const C = (n ? new _(n, x, f) : new _(m.bitLength(), a)).mod(m.subtract(_.ONE)).add(_.ONE), y = c(C.toString(16), 64), S = l.multiply(C), H = c(S.getX().toBigInteger().toString(16), 64), D = c(S.getY().toBigInteger().toString(16), 64), b = "04" + H + D;
|
|
1031
1031
|
return { privateKey: y, publicKey: b };
|
|
1032
1032
|
}
|
|
1033
1033
|
function o(n) {
|
|
1034
1034
|
if (n.length !== 130) throw new Error("Invalid public key to compress");
|
|
1035
|
-
const x = (n.length - 2) / 2, f = n.substr(2, x), u = new
|
|
1035
|
+
const x = (n.length - 2) / 2, f = n.substr(2, x), u = new _(n.substr(x + 2, x), 16);
|
|
1036
1036
|
let C = "03";
|
|
1037
|
-
return u.mod(new
|
|
1037
|
+
return u.mod(new _("2")).equals(_.ZERO) && (C = "02"), C + f;
|
|
1038
1038
|
}
|
|
1039
1039
|
function F(n) {
|
|
1040
1040
|
n = unescape(encodeURIComponent(n));
|
|
@@ -1079,15 +1079,15 @@ function Ze() {
|
|
|
1079
1079
|
return x;
|
|
1080
1080
|
}
|
|
1081
1081
|
function i(n) {
|
|
1082
|
-
const x =
|
|
1082
|
+
const x = w.decodePointHex(n);
|
|
1083
1083
|
if (!x) return !1;
|
|
1084
1084
|
const f = x.getX();
|
|
1085
|
-
return x.getY().square().equals(f.multiply(f.square()).add(f.multiply(
|
|
1085
|
+
return x.getY().square().equals(f.multiply(f.square()).add(f.multiply(w.a)).add(w.b));
|
|
1086
1086
|
}
|
|
1087
1087
|
function d(n, x) {
|
|
1088
|
-
const f =
|
|
1088
|
+
const f = w.decodePointHex(n);
|
|
1089
1089
|
if (!f) return !1;
|
|
1090
|
-
const u =
|
|
1090
|
+
const u = w.decodePointHex(x);
|
|
1091
1091
|
return u ? f.equals(u) : !1;
|
|
1092
1092
|
}
|
|
1093
1093
|
return or = {
|
|
@@ -1108,17 +1108,17 @@ var sr, gr;
|
|
|
1108
1108
|
function ce() {
|
|
1109
1109
|
if (gr) return sr;
|
|
1110
1110
|
gr = 1;
|
|
1111
|
-
const
|
|
1111
|
+
const _ = new Uint32Array(68), N = new Uint32Array(64);
|
|
1112
1112
|
function A(F, c) {
|
|
1113
1113
|
const p = c & 31;
|
|
1114
1114
|
return F << p | F >>> 32 - p;
|
|
1115
1115
|
}
|
|
1116
|
-
function
|
|
1116
|
+
function a(F, c) {
|
|
1117
1117
|
const p = [];
|
|
1118
1118
|
for (let v = F.length - 1; v >= 0; v--) p[v] = (F[v] ^ c[v]) & 255;
|
|
1119
1119
|
return p;
|
|
1120
1120
|
}
|
|
1121
|
-
function
|
|
1121
|
+
function w(F) {
|
|
1122
1122
|
return F ^ A(F, 9) ^ A(F, 17);
|
|
1123
1123
|
}
|
|
1124
1124
|
function l(F) {
|
|
@@ -1138,18 +1138,18 @@ function ce() {
|
|
|
1138
1138
|
} else c.length > 0 && (E[u] = parseInt(c, 2), c = "");
|
|
1139
1139
|
const i = new Uint8Array([...F, 128, ...v, ...E]), d = new DataView(i.buffer, 0), n = i.length / 64, x = new Uint32Array([1937774191, 1226093241, 388252375, 3666478592, 2842636476, 372324522, 3817729613, 2969243214]);
|
|
1140
1140
|
for (let u = 0; u < n; u++) {
|
|
1141
|
-
|
|
1141
|
+
_.fill(0), N.fill(0);
|
|
1142
1142
|
const C = 16 * u;
|
|
1143
1143
|
for (let R = 0; R < 16; R++)
|
|
1144
|
-
|
|
1144
|
+
_[R] = d.getUint32((C + R) * 4, !1);
|
|
1145
1145
|
for (let R = 16; R < 68; R++)
|
|
1146
|
-
|
|
1146
|
+
_[R] = l(_[R - 16] ^ _[R - 9] ^ A(_[R - 3], 15)) ^ A(_[R - 13], 7) ^ _[R - 6];
|
|
1147
1147
|
for (let R = 0; R < 64; R++)
|
|
1148
|
-
|
|
1148
|
+
N[R] = _[R] ^ _[R + 4];
|
|
1149
1149
|
const y = 2043430169, S = 2055708042;
|
|
1150
1150
|
let H = x[0], D = x[1], b = x[2], T = x[3], k = x[4], L = x[5], $ = x[6], U = x[7], X, Z, G, K, q;
|
|
1151
1151
|
for (let R = 0; R < 64; R++)
|
|
1152
|
-
q = R >= 0 && R <= 15 ? y : S, X = A(A(H, 12) + k + A(q, R), 7), Z = X ^ A(H, 12), G = (R >= 0 && R <= 15 ? H ^ D ^ b : H & D | H & b | D & b) + T + Z +
|
|
1152
|
+
q = R >= 0 && R <= 15 ? y : S, X = A(A(H, 12) + k + A(q, R), 7), Z = X ^ A(H, 12), G = (R >= 0 && R <= 15 ? H ^ D ^ b : H & D | H & b | D & b) + T + Z + N[R], K = (R >= 0 && R <= 15 ? k ^ L ^ $ : k & L | ~k & $) + U + X + _[R], T = b, b = A(D, 9), D = H, H = G, U = $, $ = A(L, 19), L = k, k = w(K);
|
|
1153
1153
|
x[0] ^= H, x[1] ^= D, x[2] ^= b, x[3] ^= T, x[4] ^= k, x[5] ^= L, x[6] ^= $, x[7] ^= U;
|
|
1154
1154
|
}
|
|
1155
1155
|
const f = [];
|
|
@@ -1164,7 +1164,7 @@ function ce() {
|
|
|
1164
1164
|
B[F] = 54, e[F] = 92;
|
|
1165
1165
|
function o(F, c) {
|
|
1166
1166
|
for (c.length > h && (c = m(c)); c.length < h; ) c.push(0);
|
|
1167
|
-
const p =
|
|
1167
|
+
const p = a(c, B), v = a(c, e), E = m([...p, ...F]);
|
|
1168
1168
|
return m([...v, ...E]);
|
|
1169
1169
|
}
|
|
1170
1170
|
return sr = {
|
|
@@ -1173,41 +1173,41 @@ function ce() {
|
|
|
1173
1173
|
}, sr;
|
|
1174
1174
|
}
|
|
1175
1175
|
var ar, br;
|
|
1176
|
-
function
|
|
1176
|
+
function Ke() {
|
|
1177
1177
|
if (br) return ar;
|
|
1178
1178
|
br = 1;
|
|
1179
|
-
const { BigInteger:
|
|
1179
|
+
const { BigInteger: _ } = Mt(), { encodeDer: N, decodeDer: A } = Xe(), a = je(), w = ce().sm3, { G: l, curve: m, n: h } = a.generateEcparam(), B = 0;
|
|
1180
1180
|
function e(i, d, n = 1) {
|
|
1181
|
-
i = typeof i == "string" ?
|
|
1182
|
-
const x =
|
|
1181
|
+
i = typeof i == "string" ? a.hexToArray(a.utf8ToHex(i)) : Array.prototype.slice.call(i), d = a.getGlobalCurve().decodePointHex(d);
|
|
1182
|
+
const x = a.generateKeyPairHex(), f = new _(x.privateKey, 16);
|
|
1183
1183
|
let u = x.publicKey;
|
|
1184
1184
|
u.length > 128 && (u = u.substr(u.length - 128));
|
|
1185
|
-
const C = d.multiply(f), y =
|
|
1185
|
+
const C = d.multiply(f), y = a.hexToArray(a.leftPad(C.getX().toBigInteger().toRadix(16), 64)), S = a.hexToArray(a.leftPad(C.getY().toBigInteger().toRadix(16), 64)), H = a.arrayToHex(w([].concat(y, i, S)));
|
|
1186
1186
|
let D = 1, b = 0, T = [];
|
|
1187
1187
|
const k = [].concat(y, S), L = () => {
|
|
1188
|
-
T =
|
|
1188
|
+
T = w([...k, D >> 24 & 255, D >> 16 & 255, D >> 8 & 255, D & 255]), D++, b = 0;
|
|
1189
1189
|
};
|
|
1190
1190
|
L();
|
|
1191
1191
|
for (let U = 0, X = i.length; U < X; U++)
|
|
1192
1192
|
b === T.length && L(), i[U] ^= T[b++] & 255;
|
|
1193
|
-
const $ =
|
|
1193
|
+
const $ = a.arrayToHex(i);
|
|
1194
1194
|
return n === B ? u + $ + H : u + H + $;
|
|
1195
1195
|
}
|
|
1196
1196
|
function o(i, d, n = 1, {
|
|
1197
1197
|
output: x = "string"
|
|
1198
1198
|
} = {}) {
|
|
1199
|
-
d = new
|
|
1199
|
+
d = new _(d, 16);
|
|
1200
1200
|
let f = i.substr(128, 64), u = i.substr(192);
|
|
1201
1201
|
n === B && (f = i.substr(i.length - 64), u = i.substr(128, i.length - 128 - 64));
|
|
1202
|
-
const C =
|
|
1202
|
+
const C = a.hexToArray(u), S = a.getGlobalCurve().decodePointHex("04" + i.substr(0, 128)).multiply(d), H = a.hexToArray(a.leftPad(S.getX().toBigInteger().toRadix(16), 64)), D = a.hexToArray(a.leftPad(S.getY().toBigInteger().toRadix(16), 64));
|
|
1203
1203
|
let b = 1, T = 0, k = [];
|
|
1204
1204
|
const L = [].concat(H, D), $ = () => {
|
|
1205
|
-
k =
|
|
1205
|
+
k = w([...L, b >> 24 & 255, b >> 16 & 255, b >> 8 & 255, b & 255]), b++, T = 0;
|
|
1206
1206
|
};
|
|
1207
1207
|
$();
|
|
1208
1208
|
for (let X = 0, Z = C.length; X < Z; X++)
|
|
1209
1209
|
T === k.length && $(), C[X] ^= k[T++] & 255;
|
|
1210
|
-
return
|
|
1210
|
+
return a.arrayToHex(w([].concat(H, C, D))) === f.toLowerCase() ? x === "array" ? C : a.arrayToUtf8(C) : x === "array" ? [] : "";
|
|
1211
1211
|
}
|
|
1212
1212
|
function F(i, d, {
|
|
1213
1213
|
pointPool: n,
|
|
@@ -1216,81 +1216,81 @@ function je() {
|
|
|
1216
1216
|
publicKey: u,
|
|
1217
1217
|
userId: C
|
|
1218
1218
|
} = {}) {
|
|
1219
|
-
let y = typeof i == "string" ?
|
|
1219
|
+
let y = typeof i == "string" ? a.utf8ToHex(i) : a.arrayToHex(i);
|
|
1220
1220
|
f && (u = u || v(d), y = p(y, u, C));
|
|
1221
|
-
const S = new
|
|
1221
|
+
const S = new _(d, 16), H = new _(y, 16);
|
|
1222
1222
|
let D = null, b = null, T = null;
|
|
1223
1223
|
do {
|
|
1224
1224
|
do {
|
|
1225
1225
|
let k;
|
|
1226
1226
|
n && n.length ? k = n.pop() : k = E(), D = k.k, b = H.add(k.x1).mod(h);
|
|
1227
|
-
} while (b.equals(
|
|
1228
|
-
T = S.add(
|
|
1229
|
-
} while (T.equals(
|
|
1230
|
-
return x ?
|
|
1227
|
+
} while (b.equals(_.ZERO) || b.add(D).equals(h));
|
|
1228
|
+
T = S.add(_.ONE).modInverse(h).multiply(D.subtract(b.multiply(S))).mod(h);
|
|
1229
|
+
} while (T.equals(_.ZERO));
|
|
1230
|
+
return x ? N(b, T) : a.leftPad(b.toString(16), 64) + a.leftPad(T.toString(16), 64);
|
|
1231
1231
|
}
|
|
1232
1232
|
function c(i, d, n, { der: x, hash: f, userId: u } = {}) {
|
|
1233
|
-
let C = typeof i == "string" ?
|
|
1233
|
+
let C = typeof i == "string" ? a.utf8ToHex(i) : a.arrayToHex(i);
|
|
1234
1234
|
f && (C = p(C, n, u));
|
|
1235
1235
|
let y, S;
|
|
1236
1236
|
if (x) {
|
|
1237
1237
|
const L = A(d);
|
|
1238
1238
|
y = L.r, S = L.s;
|
|
1239
1239
|
} else
|
|
1240
|
-
y = new
|
|
1241
|
-
const H = m.decodePointHex(n), D = new
|
|
1242
|
-
if (b.equals(
|
|
1240
|
+
y = new _(d.substring(0, 64), 16), S = new _(d.substring(64), 16);
|
|
1241
|
+
const H = m.decodePointHex(n), D = new _(C, 16), b = y.add(S).mod(h);
|
|
1242
|
+
if (b.equals(_.ZERO)) return !1;
|
|
1243
1243
|
const T = l.multiply(S).add(H.multiply(b)), k = D.add(T.getX().toBigInteger()).mod(h);
|
|
1244
1244
|
return y.equals(k);
|
|
1245
1245
|
}
|
|
1246
1246
|
function p(i, d, n = "1234567812345678") {
|
|
1247
|
-
n =
|
|
1248
|
-
const x =
|
|
1247
|
+
n = a.utf8ToHex(n);
|
|
1248
|
+
const x = a.leftPad(l.curve.a.toBigInteger().toRadix(16), 64), f = a.leftPad(l.curve.b.toBigInteger().toRadix(16), 64), u = a.leftPad(l.getX().toBigInteger().toRadix(16), 64), C = a.leftPad(l.getY().toBigInteger().toRadix(16), 64);
|
|
1249
1249
|
let y, S;
|
|
1250
1250
|
if (d.length === 128)
|
|
1251
1251
|
y = d.substr(0, 64), S = d.substr(64, 64);
|
|
1252
1252
|
else {
|
|
1253
1253
|
const T = l.curve.decodePointHex(d);
|
|
1254
|
-
y =
|
|
1254
|
+
y = a.leftPad(T.getX().toBigInteger().toRadix(16), 64), S = a.leftPad(T.getY().toBigInteger().toRadix(16), 64);
|
|
1255
1255
|
}
|
|
1256
|
-
const H =
|
|
1256
|
+
const H = a.hexToArray(n + x + f + u + C + y + S), D = n.length * 4;
|
|
1257
1257
|
H.unshift(D & 255), H.unshift(D >> 8 & 255);
|
|
1258
|
-
const b =
|
|
1259
|
-
return
|
|
1258
|
+
const b = w(H);
|
|
1259
|
+
return a.arrayToHex(w(b.concat(a.hexToArray(i))));
|
|
1260
1260
|
}
|
|
1261
1261
|
function v(i) {
|
|
1262
|
-
const d = l.multiply(new
|
|
1262
|
+
const d = l.multiply(new _(i, 16)), n = a.leftPad(d.getX().toBigInteger().toString(16), 64), x = a.leftPad(d.getY().toBigInteger().toString(16), 64);
|
|
1263
1263
|
return "04" + n + x;
|
|
1264
1264
|
}
|
|
1265
1265
|
function E() {
|
|
1266
|
-
const i =
|
|
1267
|
-
return i.k = new
|
|
1266
|
+
const i = a.generateKeyPairHex(), d = m.decodePointHex(i.publicKey);
|
|
1267
|
+
return i.k = new _(i.privateKey, 16), i.x1 = d.getX().toBigInteger(), i;
|
|
1268
1268
|
}
|
|
1269
1269
|
return ar = {
|
|
1270
|
-
generateKeyPairHex:
|
|
1271
|
-
compressPublicKeyHex:
|
|
1272
|
-
comparePublicKeyHex:
|
|
1270
|
+
generateKeyPairHex: a.generateKeyPairHex,
|
|
1271
|
+
compressPublicKeyHex: a.compressPublicKeyHex,
|
|
1272
|
+
comparePublicKeyHex: a.comparePublicKeyHex,
|
|
1273
1273
|
doEncrypt: e,
|
|
1274
1274
|
doDecrypt: o,
|
|
1275
1275
|
doSignature: F,
|
|
1276
1276
|
doVerifySignature: c,
|
|
1277
1277
|
getPublicKeyFromPrivateKey: v,
|
|
1278
1278
|
getPoint: E,
|
|
1279
|
-
verifyPublicKey:
|
|
1279
|
+
verifyPublicKey: a.verifyPublicKey
|
|
1280
1280
|
}, ar;
|
|
1281
1281
|
}
|
|
1282
1282
|
var fr, yr;
|
|
1283
|
-
function
|
|
1283
|
+
function Ge() {
|
|
1284
1284
|
if (yr) return fr;
|
|
1285
1285
|
yr = 1;
|
|
1286
|
-
const { sm3:
|
|
1286
|
+
const { sm3: _, hmac: N } = ce();
|
|
1287
1287
|
function A(m, h) {
|
|
1288
1288
|
return m.length >= h ? m : new Array(h - m.length + 1).join("0") + m;
|
|
1289
1289
|
}
|
|
1290
|
-
function
|
|
1290
|
+
function a(m) {
|
|
1291
1291
|
return m.map((h) => (h = h.toString(16), h.length === 1 ? "0" + h : h)).join("");
|
|
1292
1292
|
}
|
|
1293
|
-
function
|
|
1293
|
+
function w(m) {
|
|
1294
1294
|
const h = [];
|
|
1295
1295
|
let B = m.length;
|
|
1296
1296
|
B % 2 !== 0 && (m = A(m, B + 1)), B = m.length;
|
|
@@ -1320,16 +1320,16 @@ function Ke() {
|
|
|
1320
1320
|
if ((h.mode || "hmac") !== "hmac") throw new Error("invalid mode");
|
|
1321
1321
|
let e = h.key;
|
|
1322
1322
|
if (!e) throw new Error("invalid key");
|
|
1323
|
-
return e = typeof e == "string" ?
|
|
1323
|
+
return e = typeof e == "string" ? w(e) : Array.prototype.slice.call(e), a(N(m, e));
|
|
1324
1324
|
}
|
|
1325
|
-
return
|
|
1325
|
+
return a(_(m));
|
|
1326
1326
|
}, fr;
|
|
1327
1327
|
}
|
|
1328
1328
|
var cr, mr;
|
|
1329
|
-
function
|
|
1329
|
+
function Ye() {
|
|
1330
1330
|
if (mr) return cr;
|
|
1331
1331
|
mr = 1;
|
|
1332
|
-
const
|
|
1332
|
+
const _ = 0, N = 32, A = 16, a = [
|
|
1333
1333
|
214,
|
|
1334
1334
|
144,
|
|
1335
1335
|
233,
|
|
@@ -1586,7 +1586,7 @@ function Ge() {
|
|
|
1586
1586
|
203,
|
|
1587
1587
|
57,
|
|
1588
1588
|
72
|
|
1589
|
-
],
|
|
1589
|
+
], w = [
|
|
1590
1590
|
462357,
|
|
1591
1591
|
472066609,
|
|
1592
1592
|
943670861,
|
|
@@ -1657,7 +1657,7 @@ function Ge() {
|
|
|
1657
1657
|
return i << n | i >>> 32 - n;
|
|
1658
1658
|
}
|
|
1659
1659
|
function o(i) {
|
|
1660
|
-
return (
|
|
1660
|
+
return (a[i >>> 24 & 255] & 255) << 24 | (a[i >>> 16 & 255] & 255) << 16 | (a[i >>> 8 & 255] & 255) << 8 | a[i & 255] & 255;
|
|
1661
1661
|
}
|
|
1662
1662
|
function F(i) {
|
|
1663
1663
|
return i ^ e(i, 2) ^ e(i, 10) ^ e(i, 18) ^ e(i, 24);
|
|
@@ -1680,8 +1680,8 @@ function Ge() {
|
|
|
1680
1680
|
f[0] = i[0 + 4 * u] & 255, f[1] = i[1 + 4 * u] & 255, f[2] = i[2 + 4 * u] & 255, f[3] = i[3 + 4 * u] & 255, x[u] = f[0] << 24 | f[1] << 16 | f[2] << 8 | f[3];
|
|
1681
1681
|
x[0] ^= 2746333894, x[1] ^= 1453994832, x[2] ^= 1736282519, x[3] ^= 2993693404;
|
|
1682
1682
|
for (let u = 0, C; u < 32; u += 4)
|
|
1683
|
-
C = x[1] ^ x[2] ^ x[3] ^
|
|
1684
|
-
if (n ===
|
|
1683
|
+
C = x[1] ^ x[2] ^ x[3] ^ w[u + 0], d[u + 0] = x[0] ^= c(o(C)), C = x[2] ^ x[3] ^ x[0] ^ w[u + 1], d[u + 1] = x[1] ^= c(o(C)), C = x[3] ^ x[0] ^ x[1] ^ w[u + 2], d[u + 2] = x[2] ^= c(o(C)), C = x[0] ^ x[1] ^ x[2] ^ w[u + 3], d[u + 3] = x[3] ^= c(o(C));
|
|
1684
|
+
if (n === _)
|
|
1685
1685
|
for (let u = 0, C; u < 16; u++)
|
|
1686
1686
|
C = d[u], d[u] = d[31 - u], d[31 - u] = C;
|
|
1687
1687
|
}
|
|
@@ -1695,11 +1695,11 @@ function Ge() {
|
|
|
1695
1695
|
throw new Error("iv is invalid");
|
|
1696
1696
|
if (typeof d == "string" && (d = l(d)), d.length !== 128 / 8)
|
|
1697
1697
|
throw new Error("key is invalid");
|
|
1698
|
-
if (typeof i == "string" ? n !==
|
|
1698
|
+
if (typeof i == "string" ? n !== _ ? i = h(i) : i = l(i) : i = [...i], (x === "pkcs#5" || x === "pkcs#7") && n !== _) {
|
|
1699
1699
|
const T = A - i.length % A;
|
|
1700
1700
|
for (let k = 0; k < T; k++) i.push(T);
|
|
1701
1701
|
}
|
|
1702
|
-
const y = new Array(
|
|
1702
|
+
const y = new Array(N);
|
|
1703
1703
|
v(d, y, n);
|
|
1704
1704
|
const S = [];
|
|
1705
1705
|
let H = u, D = i.length, b = 0;
|
|
@@ -1707,19 +1707,19 @@ function Ge() {
|
|
|
1707
1707
|
const T = i.slice(b, b + 16), k = new Array(16);
|
|
1708
1708
|
if (f === "cbc")
|
|
1709
1709
|
for (let L = 0; L < A; L++)
|
|
1710
|
-
n !==
|
|
1710
|
+
n !== _ && (T[L] ^= H[L]);
|
|
1711
1711
|
p(T, k, y);
|
|
1712
1712
|
for (let L = 0; L < A; L++)
|
|
1713
|
-
f === "cbc" && n ===
|
|
1714
|
-
f === "cbc" && (n !==
|
|
1713
|
+
f === "cbc" && n === _ && (k[L] ^= H[L]), S[b + L] = k[L];
|
|
1714
|
+
f === "cbc" && (n !== _ ? H = k : H = T), D -= A, b += A;
|
|
1715
1715
|
}
|
|
1716
|
-
if ((x === "pkcs#5" || x === "pkcs#7") && n ===
|
|
1716
|
+
if ((x === "pkcs#5" || x === "pkcs#7") && n === _) {
|
|
1717
1717
|
const T = S.length, k = S[T - 1];
|
|
1718
1718
|
for (let L = 1; L <= k; L++)
|
|
1719
1719
|
if (S[T - L] !== k) throw new Error("padding is invalid");
|
|
1720
1720
|
S.splice(T - k, k);
|
|
1721
1721
|
}
|
|
1722
|
-
return C !== "array" ? n !==
|
|
1722
|
+
return C !== "array" ? n !== _ ? m(S) : B(S) : S;
|
|
1723
1723
|
}
|
|
1724
1724
|
return cr = {
|
|
1725
1725
|
encrypt(i, d, n) {
|
|
@@ -1731,33 +1731,33 @@ function Ge() {
|
|
|
1731
1731
|
}, cr;
|
|
1732
1732
|
}
|
|
1733
1733
|
var ur, _r;
|
|
1734
|
-
function
|
|
1734
|
+
function Qe() {
|
|
1735
1735
|
return _r || (_r = 1, ur = {
|
|
1736
|
-
sm2:
|
|
1737
|
-
sm3:
|
|
1738
|
-
sm4:
|
|
1736
|
+
sm2: Ke(),
|
|
1737
|
+
sm3: Ge(),
|
|
1738
|
+
sm4: Ye()
|
|
1739
1739
|
}), ur;
|
|
1740
1740
|
}
|
|
1741
|
-
var
|
|
1742
|
-
function
|
|
1743
|
-
throw new Error('Could not dynamically require "' +
|
|
1741
|
+
var Je = Qe(), nt = { exports: {} };
|
|
1742
|
+
function tx(_) {
|
|
1743
|
+
throw new Error('Could not dynamically require "' + _ + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
|
|
1744
1744
|
}
|
|
1745
1745
|
var it = { exports: {} };
|
|
1746
|
-
const
|
|
1746
|
+
const rx = {}, ex = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
1747
1747
|
__proto__: null,
|
|
1748
|
-
default:
|
|
1749
|
-
}, Symbol.toStringTag, { value: "Module" })),
|
|
1750
|
-
var
|
|
1748
|
+
default: rx
|
|
1749
|
+
}, Symbol.toStringTag, { value: "Module" })), xx = /* @__PURE__ */ Ue(ex);
|
|
1750
|
+
var nx = it.exports, wr;
|
|
1751
1751
|
function j() {
|
|
1752
|
-
return wr || (wr = 1, function(
|
|
1753
|
-
(function(A,
|
|
1754
|
-
|
|
1755
|
-
})(
|
|
1756
|
-
var A = A || function(
|
|
1752
|
+
return wr || (wr = 1, function(_, N) {
|
|
1753
|
+
(function(A, a) {
|
|
1754
|
+
_.exports = a();
|
|
1755
|
+
})(nx, function() {
|
|
1756
|
+
var A = A || function(a, w) {
|
|
1757
1757
|
var l;
|
|
1758
|
-
if (typeof window < "u" && window.crypto && (l = window.crypto), typeof self < "u" && self.crypto && (l = self.crypto), typeof globalThis < "u" && globalThis.crypto && (l = globalThis.crypto), !l && typeof window < "u" && window.msCrypto && (l = window.msCrypto), !l && typeof xr < "u" && xr.crypto && (l = xr.crypto), !l && typeof
|
|
1758
|
+
if (typeof window < "u" && window.crypto && (l = window.crypto), typeof self < "u" && self.crypto && (l = self.crypto), typeof globalThis < "u" && globalThis.crypto && (l = globalThis.crypto), !l && typeof window < "u" && window.msCrypto && (l = window.msCrypto), !l && typeof xr < "u" && xr.crypto && (l = xr.crypto), !l && typeof tx == "function")
|
|
1759
1759
|
try {
|
|
1760
|
-
l =
|
|
1760
|
+
l = xx;
|
|
1761
1761
|
} catch {
|
|
1762
1762
|
}
|
|
1763
1763
|
var m = function() {
|
|
@@ -1880,7 +1880,7 @@ function j() {
|
|
|
1880
1880
|
* var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607], 6);
|
|
1881
1881
|
*/
|
|
1882
1882
|
init: function(n, x) {
|
|
1883
|
-
n = this.words = n || [], x !=
|
|
1883
|
+
n = this.words = n || [], x != w ? this.sigBytes = x : this.sigBytes = n.length * 4;
|
|
1884
1884
|
},
|
|
1885
1885
|
/**
|
|
1886
1886
|
* Converts this word array to a string.
|
|
@@ -1930,7 +1930,7 @@ function j() {
|
|
|
1930
1930
|
*/
|
|
1931
1931
|
clamp: function() {
|
|
1932
1932
|
var n = this.words, x = this.sigBytes;
|
|
1933
|
-
n[x >>> 2] &= 4294967295 << 32 - x % 4 * 8, n.length =
|
|
1933
|
+
n[x >>> 2] &= 4294967295 << 32 - x % 4 * 8, n.length = a.ceil(x / 4);
|
|
1934
1934
|
},
|
|
1935
1935
|
/**
|
|
1936
1936
|
* Creates a copy of this word array.
|
|
@@ -2118,8 +2118,8 @@ function j() {
|
|
|
2118
2118
|
*/
|
|
2119
2119
|
_process: function(n) {
|
|
2120
2120
|
var x, f = this._data, u = f.words, C = f.sigBytes, y = this.blockSize, S = y * 4, H = C / S;
|
|
2121
|
-
n ? H =
|
|
2122
|
-
var D = H * y, b =
|
|
2121
|
+
n ? H = a.ceil(H) : H = a.max((H | 0) - this._minBufferSize, 0);
|
|
2122
|
+
var D = H * y, b = a.min(D * 4, C);
|
|
2123
2123
|
if (D) {
|
|
2124
2124
|
for (var T = 0; T < D; T += y)
|
|
2125
2125
|
this._doProcessBlock(u, T);
|
|
@@ -2248,14 +2248,14 @@ function j() {
|
|
|
2248
2248
|
});
|
|
2249
2249
|
}(it)), it.exports;
|
|
2250
2250
|
}
|
|
2251
|
-
var ot = { exports: {} },
|
|
2252
|
-
function
|
|
2253
|
-
return Sr || (Sr = 1, function(
|
|
2254
|
-
(function(A,
|
|
2255
|
-
|
|
2256
|
-
})(
|
|
2257
|
-
return function(
|
|
2258
|
-
var
|
|
2251
|
+
var ot = { exports: {} }, ix = ot.exports, Sr;
|
|
2252
|
+
function Nt() {
|
|
2253
|
+
return Sr || (Sr = 1, function(_, N) {
|
|
2254
|
+
(function(A, a) {
|
|
2255
|
+
_.exports = a(j());
|
|
2256
|
+
})(ix, function(A) {
|
|
2257
|
+
return function(a) {
|
|
2258
|
+
var w = A, l = w.lib, m = l.Base, h = l.WordArray, B = w.x64 = {};
|
|
2259
2259
|
B.Word = m.extend({
|
|
2260
2260
|
/**
|
|
2261
2261
|
* Initializes a newly created 64-bit word.
|
|
@@ -2441,7 +2441,7 @@ function Mt() {
|
|
|
2441
2441
|
* ], 10);
|
|
2442
2442
|
*/
|
|
2443
2443
|
init: function(e, o) {
|
|
2444
|
-
e = this.words = e || [], o !=
|
|
2444
|
+
e = this.words = e || [], o != a ? this.sigBytes = o : this.sigBytes = e.length * 8;
|
|
2445
2445
|
},
|
|
2446
2446
|
/**
|
|
2447
2447
|
* Converts this 64-bit word array to a 32-bit word array.
|
|
@@ -2478,15 +2478,15 @@ function Mt() {
|
|
|
2478
2478
|
});
|
|
2479
2479
|
}(ot)), ot.exports;
|
|
2480
2480
|
}
|
|
2481
|
-
var st = { exports: {} },
|
|
2482
|
-
function
|
|
2483
|
-
return Tr || (Tr = 1, function(
|
|
2484
|
-
(function(A,
|
|
2485
|
-
|
|
2486
|
-
})(
|
|
2481
|
+
var st = { exports: {} }, ox = st.exports, Tr;
|
|
2482
|
+
function sx() {
|
|
2483
|
+
return Tr || (Tr = 1, function(_, N) {
|
|
2484
|
+
(function(A, a) {
|
|
2485
|
+
_.exports = a(j());
|
|
2486
|
+
})(ox, function(A) {
|
|
2487
2487
|
return function() {
|
|
2488
2488
|
if (typeof ArrayBuffer == "function") {
|
|
2489
|
-
var
|
|
2489
|
+
var a = A, w = a.lib, l = w.WordArray, m = l.init, h = l.init = function(B) {
|
|
2490
2490
|
if (B instanceof ArrayBuffer && (B = new Uint8Array(B)), (B instanceof Int8Array || typeof Uint8ClampedArray < "u" && B instanceof Uint8ClampedArray || B instanceof Int16Array || B instanceof Uint16Array || B instanceof Int32Array || B instanceof Uint32Array || B instanceof Float32Array || B instanceof Float64Array) && (B = new Uint8Array(B.buffer, B.byteOffset, B.byteLength)), B instanceof Uint8Array) {
|
|
2491
2491
|
for (var e = B.byteLength, o = [], F = 0; F < e; F++)
|
|
2492
2492
|
o[F >>> 2] |= B[F] << 24 - F % 4 * 8;
|
|
@@ -2500,14 +2500,14 @@ function ox() {
|
|
|
2500
2500
|
});
|
|
2501
2501
|
}(st)), st.exports;
|
|
2502
2502
|
}
|
|
2503
|
-
var at = { exports: {} },
|
|
2504
|
-
function
|
|
2505
|
-
return kr || (kr = 1, function(
|
|
2506
|
-
(function(A,
|
|
2507
|
-
|
|
2508
|
-
})(
|
|
2503
|
+
var at = { exports: {} }, ax = at.exports, kr;
|
|
2504
|
+
function fx() {
|
|
2505
|
+
return kr || (kr = 1, function(_, N) {
|
|
2506
|
+
(function(A, a) {
|
|
2507
|
+
_.exports = a(j());
|
|
2508
|
+
})(ax, function(A) {
|
|
2509
2509
|
return function() {
|
|
2510
|
-
var
|
|
2510
|
+
var a = A, w = a.lib, l = w.WordArray, m = a.enc;
|
|
2511
2511
|
m.Utf16 = m.Utf16BE = {
|
|
2512
2512
|
/**
|
|
2513
2513
|
* Converts a word array to a UTF-16 BE string.
|
|
@@ -2594,14 +2594,14 @@ function ax() {
|
|
|
2594
2594
|
});
|
|
2595
2595
|
}(at)), at.exports;
|
|
2596
2596
|
}
|
|
2597
|
-
var ft = { exports: {} },
|
|
2597
|
+
var ft = { exports: {} }, cx = ft.exports, Rr;
|
|
2598
2598
|
function R0() {
|
|
2599
|
-
return Rr || (Rr = 1, function(
|
|
2600
|
-
(function(A,
|
|
2601
|
-
|
|
2602
|
-
})(
|
|
2599
|
+
return Rr || (Rr = 1, function(_, N) {
|
|
2600
|
+
(function(A, a) {
|
|
2601
|
+
_.exports = a(j());
|
|
2602
|
+
})(cx, function(A) {
|
|
2603
2603
|
return function() {
|
|
2604
|
-
var
|
|
2604
|
+
var a = A, w = a.lib, l = w.WordArray, m = a.enc;
|
|
2605
2605
|
m.Base64 = {
|
|
2606
2606
|
/**
|
|
2607
2607
|
* Converts a word array to a Base64 string.
|
|
@@ -2669,14 +2669,14 @@ function R0() {
|
|
|
2669
2669
|
});
|
|
2670
2670
|
}(ft)), ft.exports;
|
|
2671
2671
|
}
|
|
2672
|
-
var ct = { exports: {} },
|
|
2673
|
-
function
|
|
2674
|
-
return Hr || (Hr = 1, function(
|
|
2675
|
-
(function(A,
|
|
2676
|
-
|
|
2677
|
-
})(
|
|
2672
|
+
var ct = { exports: {} }, ux = ct.exports, Hr;
|
|
2673
|
+
function hx() {
|
|
2674
|
+
return Hr || (Hr = 1, function(_, N) {
|
|
2675
|
+
(function(A, a) {
|
|
2676
|
+
_.exports = a(j());
|
|
2677
|
+
})(ux, function(A) {
|
|
2678
2678
|
return function() {
|
|
2679
|
-
var
|
|
2679
|
+
var a = A, w = a.lib, l = w.WordArray, m = a.enc;
|
|
2680
2680
|
m.Base64url = {
|
|
2681
2681
|
/**
|
|
2682
2682
|
* Converts a word array to a Base64url string.
|
|
@@ -2751,17 +2751,17 @@ function ux() {
|
|
|
2751
2751
|
});
|
|
2752
2752
|
}(ct)), ct.exports;
|
|
2753
2753
|
}
|
|
2754
|
-
var ut = { exports: {} },
|
|
2754
|
+
var ut = { exports: {} }, lx = ut.exports, qr;
|
|
2755
2755
|
function H0() {
|
|
2756
|
-
return qr || (qr = 1, function(
|
|
2757
|
-
(function(A,
|
|
2758
|
-
|
|
2759
|
-
})(
|
|
2760
|
-
return function(
|
|
2761
|
-
var
|
|
2756
|
+
return qr || (qr = 1, function(_, N) {
|
|
2757
|
+
(function(A, a) {
|
|
2758
|
+
_.exports = a(j());
|
|
2759
|
+
})(lx, function(A) {
|
|
2760
|
+
return function(a) {
|
|
2761
|
+
var w = A, l = w.lib, m = l.WordArray, h = l.Hasher, B = w.algo, e = [];
|
|
2762
2762
|
(function() {
|
|
2763
2763
|
for (var E = 0; E < 64; E++)
|
|
2764
|
-
e[E] =
|
|
2764
|
+
e[E] = a.abs(a.sin(E + 1)) * 4294967296 | 0;
|
|
2765
2765
|
})();
|
|
2766
2766
|
var o = B.MD5 = h.extend({
|
|
2767
2767
|
_doReset: function() {
|
|
@@ -2783,7 +2783,7 @@ function H0() {
|
|
|
2783
2783
|
_doFinalize: function() {
|
|
2784
2784
|
var E = this._data, i = E.words, d = this._nDataBytes * 8, n = E.sigBytes * 8;
|
|
2785
2785
|
i[n >>> 5] |= 128 << 24 - n % 32;
|
|
2786
|
-
var x =
|
|
2786
|
+
var x = a.floor(d / 4294967296), f = d;
|
|
2787
2787
|
i[(n + 64 >>> 9 << 4) + 15] = (x << 8 | x >>> 24) & 16711935 | (x << 24 | x >>> 8) & 4278255360, i[(n + 64 >>> 9 << 4) + 14] = (f << 8 | f >>> 24) & 16711935 | (f << 24 | f >>> 8) & 4278255360, E.sigBytes = (i.length + 1) * 4, this._process();
|
|
2788
2788
|
for (var u = this._hash, C = u.words, y = 0; y < 4; y++) {
|
|
2789
2789
|
var S = C[y];
|
|
@@ -2812,19 +2812,19 @@ function H0() {
|
|
|
2812
2812
|
var C = E + (d ^ (i | ~n)) + x + u;
|
|
2813
2813
|
return (C << f | C >>> 32 - f) + i;
|
|
2814
2814
|
}
|
|
2815
|
-
|
|
2815
|
+
w.MD5 = h._createHelper(o), w.HmacMD5 = h._createHmacHelper(o);
|
|
2816
2816
|
}(Math), A.MD5;
|
|
2817
2817
|
});
|
|
2818
2818
|
}(ut)), ut.exports;
|
|
2819
2819
|
}
|
|
2820
|
-
var ht = { exports: {} },
|
|
2820
|
+
var ht = { exports: {} }, vx = ht.exports, Pr;
|
|
2821
2821
|
function ue() {
|
|
2822
|
-
return Pr || (Pr = 1, function(
|
|
2823
|
-
(function(A,
|
|
2824
|
-
|
|
2825
|
-
})(
|
|
2822
|
+
return Pr || (Pr = 1, function(_, N) {
|
|
2823
|
+
(function(A, a) {
|
|
2824
|
+
_.exports = a(j());
|
|
2825
|
+
})(vx, function(A) {
|
|
2826
2826
|
return function() {
|
|
2827
|
-
var
|
|
2827
|
+
var a = A, w = a.lib, l = w.WordArray, m = w.Hasher, h = a.algo, B = [], e = h.SHA1 = m.extend({
|
|
2828
2828
|
_doReset: function() {
|
|
2829
2829
|
this._hash = new l.init([
|
|
2830
2830
|
1732584193,
|
|
@@ -2856,22 +2856,22 @@ function ue() {
|
|
|
2856
2856
|
return o._hash = this._hash.clone(), o;
|
|
2857
2857
|
}
|
|
2858
2858
|
});
|
|
2859
|
-
|
|
2859
|
+
a.SHA1 = m._createHelper(e), a.HmacSHA1 = m._createHmacHelper(e);
|
|
2860
2860
|
}(), A.SHA1;
|
|
2861
2861
|
});
|
|
2862
2862
|
}(ht)), ht.exports;
|
|
2863
2863
|
}
|
|
2864
|
-
var lt = { exports: {} },
|
|
2864
|
+
var lt = { exports: {} }, dx = lt.exports, zr;
|
|
2865
2865
|
function hr() {
|
|
2866
|
-
return zr || (zr = 1, function(
|
|
2867
|
-
(function(A,
|
|
2868
|
-
|
|
2869
|
-
})(
|
|
2870
|
-
return function(
|
|
2871
|
-
var
|
|
2866
|
+
return zr || (zr = 1, function(_, N) {
|
|
2867
|
+
(function(A, a) {
|
|
2868
|
+
_.exports = a(j());
|
|
2869
|
+
})(dx, function(A) {
|
|
2870
|
+
return function(a) {
|
|
2871
|
+
var w = A, l = w.lib, m = l.WordArray, h = l.Hasher, B = w.algo, e = [], o = [];
|
|
2872
2872
|
(function() {
|
|
2873
2873
|
function p(d) {
|
|
2874
|
-
for (var n =
|
|
2874
|
+
for (var n = a.sqrt(d), x = 2; x <= n; x++)
|
|
2875
2875
|
if (!(d % x))
|
|
2876
2876
|
return !1;
|
|
2877
2877
|
return !0;
|
|
@@ -2880,7 +2880,7 @@ function hr() {
|
|
|
2880
2880
|
return (d - (d | 0)) * 4294967296 | 0;
|
|
2881
2881
|
}
|
|
2882
2882
|
for (var E = 2, i = 0; i < 64; )
|
|
2883
|
-
p(E) && (i < 8 && (e[i] = v(
|
|
2883
|
+
p(E) && (i < 8 && (e[i] = v(a.pow(E, 1 / 2))), o[i] = v(a.pow(E, 1 / 3)), i++), E++;
|
|
2884
2884
|
})();
|
|
2885
2885
|
var F = [], c = B.SHA256 = h.extend({
|
|
2886
2886
|
_doReset: function() {
|
|
@@ -2901,26 +2901,26 @@ function hr() {
|
|
|
2901
2901
|
},
|
|
2902
2902
|
_doFinalize: function() {
|
|
2903
2903
|
var p = this._data, v = p.words, E = this._nDataBytes * 8, i = p.sigBytes * 8;
|
|
2904
|
-
return v[i >>> 5] |= 128 << 24 - i % 32, v[(i + 64 >>> 9 << 4) + 14] =
|
|
2904
|
+
return v[i >>> 5] |= 128 << 24 - i % 32, v[(i + 64 >>> 9 << 4) + 14] = a.floor(E / 4294967296), v[(i + 64 >>> 9 << 4) + 15] = E, p.sigBytes = v.length * 4, this._process(), this._hash;
|
|
2905
2905
|
},
|
|
2906
2906
|
clone: function() {
|
|
2907
2907
|
var p = h.clone.call(this);
|
|
2908
2908
|
return p._hash = this._hash.clone(), p;
|
|
2909
2909
|
}
|
|
2910
2910
|
});
|
|
2911
|
-
|
|
2911
|
+
w.SHA256 = h._createHelper(c), w.HmacSHA256 = h._createHmacHelper(c);
|
|
2912
2912
|
}(Math), A.SHA256;
|
|
2913
2913
|
});
|
|
2914
2914
|
}(lt)), lt.exports;
|
|
2915
2915
|
}
|
|
2916
|
-
var vt = { exports: {} },
|
|
2917
|
-
function
|
|
2918
|
-
return Ir || (Ir = 1, function(
|
|
2919
|
-
(function(A,
|
|
2920
|
-
|
|
2921
|
-
})(
|
|
2916
|
+
var vt = { exports: {} }, px = vt.exports, Ir;
|
|
2917
|
+
function Bx() {
|
|
2918
|
+
return Ir || (Ir = 1, function(_, N) {
|
|
2919
|
+
(function(A, a, w) {
|
|
2920
|
+
_.exports = a(j(), hr());
|
|
2921
|
+
})(px, function(A) {
|
|
2922
2922
|
return function() {
|
|
2923
|
-
var
|
|
2923
|
+
var a = A, w = a.lib, l = w.WordArray, m = a.algo, h = m.SHA256, B = m.SHA224 = h.extend({
|
|
2924
2924
|
_doReset: function() {
|
|
2925
2925
|
this._hash = new l.init([
|
|
2926
2926
|
3238371032,
|
|
@@ -2938,19 +2938,19 @@ function px() {
|
|
|
2938
2938
|
return e.sigBytes -= 4, e;
|
|
2939
2939
|
}
|
|
2940
2940
|
});
|
|
2941
|
-
|
|
2941
|
+
a.SHA224 = h._createHelper(B), a.HmacSHA224 = h._createHmacHelper(B);
|
|
2942
2942
|
}(), A.SHA224;
|
|
2943
2943
|
});
|
|
2944
2944
|
}(vt)), vt.exports;
|
|
2945
2945
|
}
|
|
2946
|
-
var dt = { exports: {} },
|
|
2946
|
+
var dt = { exports: {} }, Fx = dt.exports, Or;
|
|
2947
2947
|
function he() {
|
|
2948
|
-
return Or || (Or = 1, function(
|
|
2949
|
-
(function(A,
|
|
2950
|
-
|
|
2951
|
-
})(
|
|
2948
|
+
return Or || (Or = 1, function(_, N) {
|
|
2949
|
+
(function(A, a, w) {
|
|
2950
|
+
_.exports = a(j(), Nt());
|
|
2951
|
+
})(Fx, function(A) {
|
|
2952
2952
|
return function() {
|
|
2953
|
-
var
|
|
2953
|
+
var a = A, w = a.lib, l = w.Hasher, m = a.x64, h = m.Word, B = m.WordArray, e = a.algo;
|
|
2954
2954
|
function o() {
|
|
2955
2955
|
return h.create.apply(h, arguments);
|
|
2956
2956
|
}
|
|
@@ -3059,7 +3059,7 @@ function he() {
|
|
|
3059
3059
|
if (c0 < 16)
|
|
3060
3060
|
B0 = z0.high = v[E + c0 * 2] | 0, s0 = z0.low = v[E + c0 * 2 + 1] | 0;
|
|
3061
3061
|
else {
|
|
3062
|
-
var $0 = c[c0 - 15], A0 = $0.high, S0 = $0.low, Wt = (A0 >>> 1 | S0 << 31) ^ (A0 >>> 8 | S0 << 24) ^ A0 >>> 7, U0 = (S0 >>> 1 | A0 << 31) ^ (S0 >>> 8 | A0 << 24) ^ (S0 >>> 7 | A0 << 25), V0 = c[c0 - 2], D0 = V0.high, T0 = V0.low, $t = (D0 >>> 19 | T0 << 13) ^ (D0 << 3 | T0 >>> 29) ^ D0 >>> 6, I0 = (T0 >>> 19 | D0 << 13) ^ (T0 << 3 | D0 >>> 29) ^ (T0 >>> 6 | D0 << 26), X0 = c[c0 - 7], Z0 = X0.high, Ut = X0.low,
|
|
3062
|
+
var $0 = c[c0 - 15], A0 = $0.high, S0 = $0.low, Wt = (A0 >>> 1 | S0 << 31) ^ (A0 >>> 8 | S0 << 24) ^ A0 >>> 7, U0 = (S0 >>> 1 | A0 << 31) ^ (S0 >>> 8 | A0 << 24) ^ (S0 >>> 7 | A0 << 25), V0 = c[c0 - 2], D0 = V0.high, T0 = V0.low, $t = (D0 >>> 19 | T0 << 13) ^ (D0 << 3 | T0 >>> 29) ^ D0 >>> 6, I0 = (T0 >>> 19 | D0 << 13) ^ (T0 << 3 | D0 >>> 29) ^ (T0 >>> 6 | D0 << 26), X0 = c[c0 - 7], Z0 = X0.high, Ut = X0.low, M0 = c[c0 - 16], Vt = M0.high, j0 = M0.low;
|
|
3063
3063
|
s0 = U0 + Ut, B0 = Wt + Z0 + (s0 >>> 0 < U0 >>> 0 ? 1 : 0), s0 = s0 + I0, B0 = B0 + $t + (s0 >>> 0 < I0 >>> 0 ? 1 : 0), s0 = s0 + j0, B0 = B0 + Vt + (s0 >>> 0 < j0 >>> 0 ? 1 : 0), z0.high = B0, z0.low = s0;
|
|
3064
3064
|
}
|
|
3065
3065
|
var Xt = f0 & q0 ^ ~f0 & P0, K0 = n0 & m0 ^ ~n0 & _0, Zt = Q & x0 ^ Q & a0 ^ x0 & a0, jt = Y & V ^ Y & E0 ^ V & E0, Kt = (Q >>> 28 | Y << 4) ^ (Q << 30 | Y >>> 2) ^ (Q << 25 | Y >>> 7), G0 = (Y >>> 28 | Q << 4) ^ (Y << 30 | Q >>> 2) ^ (Y << 25 | Q >>> 7), Gt = (f0 >>> 14 | n0 << 18) ^ (f0 >>> 18 | n0 << 14) ^ (f0 << 23 | n0 >>> 9), Yt = (n0 >>> 14 | f0 << 18) ^ (n0 >>> 18 | f0 << 14) ^ (n0 << 23 | f0 >>> 9), Y0 = F[c0], Qt = Y0.high, Q0 = Y0.low, i0 = w0 + Yt, F0 = L0 + Gt + (i0 >>> 0 < w0 >>> 0 ? 1 : 0), i0 = i0 + K0, F0 = F0 + Xt + (i0 >>> 0 < K0 >>> 0 ? 1 : 0), i0 = i0 + Q0, F0 = F0 + Qt + (i0 >>> 0 < Q0 >>> 0 ? 1 : 0), i0 = i0 + s0, F0 = F0 + B0 + (i0 >>> 0 < s0 >>> 0 ? 1 : 0), J0 = G0 + jt, Jt = Kt + Zt + (J0 >>> 0 < G0 >>> 0 ? 1 : 0);
|
|
@@ -3079,19 +3079,19 @@ function he() {
|
|
|
3079
3079
|
},
|
|
3080
3080
|
blockSize: 1024 / 32
|
|
3081
3081
|
});
|
|
3082
|
-
|
|
3082
|
+
a.SHA512 = l._createHelper(p), a.HmacSHA512 = l._createHmacHelper(p);
|
|
3083
3083
|
}(), A.SHA512;
|
|
3084
3084
|
});
|
|
3085
3085
|
}(dt)), dt.exports;
|
|
3086
3086
|
}
|
|
3087
|
-
var pt = { exports: {} },
|
|
3088
|
-
function
|
|
3089
|
-
return Lr || (Lr = 1, function(
|
|
3090
|
-
(function(A,
|
|
3091
|
-
|
|
3092
|
-
})(
|
|
3087
|
+
var pt = { exports: {} }, Cx = pt.exports, Lr;
|
|
3088
|
+
function Ex() {
|
|
3089
|
+
return Lr || (Lr = 1, function(_, N) {
|
|
3090
|
+
(function(A, a, w) {
|
|
3091
|
+
_.exports = a(j(), Nt(), he());
|
|
3092
|
+
})(Cx, function(A) {
|
|
3093
3093
|
return function() {
|
|
3094
|
-
var
|
|
3094
|
+
var a = A, w = a.x64, l = w.Word, m = w.WordArray, h = a.algo, B = h.SHA512, e = h.SHA384 = B.extend({
|
|
3095
3095
|
_doReset: function() {
|
|
3096
3096
|
this._hash = new m.init([
|
|
3097
3097
|
new l.init(3418070365, 3238371032),
|
|
@@ -3109,19 +3109,19 @@ function Cx() {
|
|
|
3109
3109
|
return o.sigBytes -= 16, o;
|
|
3110
3110
|
}
|
|
3111
3111
|
});
|
|
3112
|
-
|
|
3112
|
+
a.SHA384 = B._createHelper(e), a.HmacSHA384 = B._createHmacHelper(e);
|
|
3113
3113
|
}(), A.SHA384;
|
|
3114
3114
|
});
|
|
3115
3115
|
}(pt)), pt.exports;
|
|
3116
3116
|
}
|
|
3117
|
-
var Bt = { exports: {} },
|
|
3118
|
-
function
|
|
3119
|
-
return
|
|
3120
|
-
(function(A,
|
|
3121
|
-
|
|
3122
|
-
})(
|
|
3123
|
-
return function(
|
|
3124
|
-
var
|
|
3117
|
+
var Bt = { exports: {} }, Ax = Bt.exports, Mr;
|
|
3118
|
+
function Dx() {
|
|
3119
|
+
return Mr || (Mr = 1, function(_, N) {
|
|
3120
|
+
(function(A, a, w) {
|
|
3121
|
+
_.exports = a(j(), Nt());
|
|
3122
|
+
})(Ax, function(A) {
|
|
3123
|
+
return function(a) {
|
|
3124
|
+
var w = A, l = w.lib, m = l.WordArray, h = l.Hasher, B = w.x64, e = B.Word, o = w.algo, F = [], c = [], p = [];
|
|
3125
3125
|
(function() {
|
|
3126
3126
|
for (var i = 1, d = 0, n = 0; n < 24; n++) {
|
|
3127
3127
|
F[i + 5 * d] = (n + 1) * (n + 2) / 2 % 64;
|
|
@@ -3206,7 +3206,7 @@ function Ax() {
|
|
|
3206
3206
|
var i = this._data, d = i.words;
|
|
3207
3207
|
this._nDataBytes * 8;
|
|
3208
3208
|
var n = i.sigBytes * 8, x = this.blockSize * 32;
|
|
3209
|
-
d[n >>> 5] |= 1 << 24 - n % 32, d[(
|
|
3209
|
+
d[n >>> 5] |= 1 << 24 - n % 32, d[(a.ceil((n + 1) / x) * x >>> 5) - 1] |= 128, i.sigBytes = d.length * 4, this._process();
|
|
3210
3210
|
for (var f = this._state, u = this.cfg.outputLength / 8, C = u / 8, y = [], S = 0; S < C; S++) {
|
|
3211
3211
|
var H = f[S], D = H.high, b = H.low;
|
|
3212
3212
|
D = (D << 8 | D >>> 24) & 16711935 | (D << 24 | D >>> 8) & 4278255360, b = (b << 8 | b >>> 24) & 16711935 | (b << 24 | b >>> 8) & 4278255360, y.push(b), y.push(D);
|
|
@@ -3219,17 +3219,17 @@ function Ax() {
|
|
|
3219
3219
|
return i;
|
|
3220
3220
|
}
|
|
3221
3221
|
});
|
|
3222
|
-
|
|
3222
|
+
w.SHA3 = h._createHelper(E), w.HmacSHA3 = h._createHmacHelper(E);
|
|
3223
3223
|
}(Math), A.SHA3;
|
|
3224
3224
|
});
|
|
3225
3225
|
}(Bt)), Bt.exports;
|
|
3226
3226
|
}
|
|
3227
|
-
var Ft = { exports: {} },
|
|
3228
|
-
function
|
|
3229
|
-
return
|
|
3230
|
-
(function(A,
|
|
3231
|
-
|
|
3232
|
-
})(
|
|
3227
|
+
var Ft = { exports: {} }, gx = Ft.exports, Nr;
|
|
3228
|
+
function bx() {
|
|
3229
|
+
return Nr || (Nr = 1, function(_, N) {
|
|
3230
|
+
(function(A, a) {
|
|
3231
|
+
_.exports = a(j());
|
|
3232
|
+
})(gx, function(A) {
|
|
3233
3233
|
/** @preserve
|
|
3234
3234
|
(c) 2012 by Cédric Mesnil. All rights reserved.
|
|
3235
3235
|
|
|
@@ -3240,8 +3240,8 @@ function gx() {
|
|
|
3240
3240
|
|
|
3241
3241
|
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.
|
|
3242
3242
|
*/
|
|
3243
|
-
return function(
|
|
3244
|
-
var
|
|
3243
|
+
return function(a) {
|
|
3244
|
+
var w = A, l = w.lib, m = l.WordArray, h = l.Hasher, B = w.algo, e = m.create([
|
|
3245
3245
|
0,
|
|
3246
3246
|
1,
|
|
3247
3247
|
2,
|
|
@@ -3612,19 +3612,19 @@ function gx() {
|
|
|
3612
3612
|
function u(C, y) {
|
|
3613
3613
|
return C << y | C >>> 32 - y;
|
|
3614
3614
|
}
|
|
3615
|
-
|
|
3615
|
+
w.RIPEMD160 = h._createHelper(E), w.HmacRIPEMD160 = h._createHmacHelper(E);
|
|
3616
3616
|
}(), A.RIPEMD160;
|
|
3617
3617
|
});
|
|
3618
3618
|
}(Ft)), Ft.exports;
|
|
3619
3619
|
}
|
|
3620
|
-
var Ct = { exports: {} },
|
|
3620
|
+
var Ct = { exports: {} }, yx = Ct.exports, Wr;
|
|
3621
3621
|
function lr() {
|
|
3622
|
-
return Wr || (Wr = 1, function(
|
|
3623
|
-
(function(A,
|
|
3624
|
-
|
|
3625
|
-
})(
|
|
3622
|
+
return Wr || (Wr = 1, function(_, N) {
|
|
3623
|
+
(function(A, a) {
|
|
3624
|
+
_.exports = a(j());
|
|
3625
|
+
})(yx, function(A) {
|
|
3626
3626
|
(function() {
|
|
3627
|
-
var
|
|
3627
|
+
var a = A, w = a.lib, l = w.Base, m = a.enc, h = m.Utf8, B = a.algo;
|
|
3628
3628
|
B.HMAC = l.extend({
|
|
3629
3629
|
/**
|
|
3630
3630
|
* Initializes a newly created HMAC.
|
|
@@ -3695,14 +3695,14 @@ function lr() {
|
|
|
3695
3695
|
});
|
|
3696
3696
|
}(Ct)), Ct.exports;
|
|
3697
3697
|
}
|
|
3698
|
-
var Et = { exports: {} },
|
|
3699
|
-
function
|
|
3700
|
-
return $r || ($r = 1, function(
|
|
3701
|
-
(function(A,
|
|
3702
|
-
|
|
3703
|
-
})(
|
|
3698
|
+
var Et = { exports: {} }, mx = Et.exports, $r;
|
|
3699
|
+
function _x() {
|
|
3700
|
+
return $r || ($r = 1, function(_, N) {
|
|
3701
|
+
(function(A, a, w) {
|
|
3702
|
+
_.exports = a(j(), hr(), lr());
|
|
3703
|
+
})(mx, function(A) {
|
|
3704
3704
|
return function() {
|
|
3705
|
-
var
|
|
3705
|
+
var a = A, w = a.lib, l = w.Base, m = w.WordArray, h = a.algo, B = h.SHA256, e = h.HMAC, o = h.PBKDF2 = l.extend({
|
|
3706
3706
|
/**
|
|
3707
3707
|
* Configuration options.
|
|
3708
3708
|
*
|
|
@@ -3755,21 +3755,21 @@ function mx() {
|
|
|
3755
3755
|
return E.sigBytes = x * 4, E;
|
|
3756
3756
|
}
|
|
3757
3757
|
});
|
|
3758
|
-
|
|
3758
|
+
a.PBKDF2 = function(F, c, p) {
|
|
3759
3759
|
return o.create(p).compute(F, c);
|
|
3760
3760
|
};
|
|
3761
3761
|
}(), A.PBKDF2;
|
|
3762
3762
|
});
|
|
3763
3763
|
}(Et)), Et.exports;
|
|
3764
3764
|
}
|
|
3765
|
-
var At = { exports: {} },
|
|
3765
|
+
var At = { exports: {} }, wx = At.exports, Ur;
|
|
3766
3766
|
function b0() {
|
|
3767
|
-
return Ur || (Ur = 1, function(
|
|
3768
|
-
(function(A,
|
|
3769
|
-
|
|
3770
|
-
})(
|
|
3767
|
+
return Ur || (Ur = 1, function(_, N) {
|
|
3768
|
+
(function(A, a, w) {
|
|
3769
|
+
_.exports = a(j(), ue(), lr());
|
|
3770
|
+
})(wx, function(A) {
|
|
3771
3771
|
return function() {
|
|
3772
|
-
var
|
|
3772
|
+
var a = A, w = a.lib, l = w.Base, m = w.WordArray, h = a.algo, B = h.MD5, e = h.EvpKDF = l.extend({
|
|
3773
3773
|
/**
|
|
3774
3774
|
* Configuration options.
|
|
3775
3775
|
*
|
|
@@ -3818,23 +3818,23 @@ function b0() {
|
|
|
3818
3818
|
return E.sigBytes = d * 4, E;
|
|
3819
3819
|
}
|
|
3820
3820
|
});
|
|
3821
|
-
|
|
3821
|
+
a.EvpKDF = function(o, F, c) {
|
|
3822
3822
|
return e.create(c).compute(o, F);
|
|
3823
3823
|
};
|
|
3824
3824
|
}(), A.EvpKDF;
|
|
3825
3825
|
});
|
|
3826
3826
|
}(At)), At.exports;
|
|
3827
3827
|
}
|
|
3828
|
-
var Dt = { exports: {} },
|
|
3828
|
+
var Dt = { exports: {} }, Sx = Dt.exports, Vr;
|
|
3829
3829
|
function e0() {
|
|
3830
|
-
return Vr || (Vr = 1, function(
|
|
3831
|
-
(function(A,
|
|
3832
|
-
|
|
3833
|
-
})(
|
|
3834
|
-
A.lib.Cipher || function(
|
|
3835
|
-
var
|
|
3830
|
+
return Vr || (Vr = 1, function(_, N) {
|
|
3831
|
+
(function(A, a, w) {
|
|
3832
|
+
_.exports = a(j(), b0());
|
|
3833
|
+
})(Sx, function(A) {
|
|
3834
|
+
A.lib.Cipher || function(a) {
|
|
3835
|
+
var w = A, l = w.lib, m = l.Base, h = l.WordArray, B = l.BufferedBlockAlgorithm, e = w.enc;
|
|
3836
3836
|
e.Utf8;
|
|
3837
|
-
var o = e.Base64, F =
|
|
3837
|
+
var o = e.Base64, F = w.algo, c = F.EvpKDF, p = l.Cipher = B.extend({
|
|
3838
3838
|
/**
|
|
3839
3839
|
* Configuration options.
|
|
3840
3840
|
*
|
|
@@ -3973,7 +3973,7 @@ function e0() {
|
|
|
3973
3973
|
},
|
|
3974
3974
|
blockSize: 1
|
|
3975
3975
|
});
|
|
3976
|
-
var v =
|
|
3976
|
+
var v = w.mode = {}, E = l.BlockCipherMode = m.extend({
|
|
3977
3977
|
/**
|
|
3978
3978
|
* Creates this mode for encryption.
|
|
3979
3979
|
*
|
|
@@ -4052,12 +4052,12 @@ function e0() {
|
|
|
4052
4052
|
});
|
|
4053
4053
|
function b(T, k, L) {
|
|
4054
4054
|
var $, U = this._iv;
|
|
4055
|
-
U ? ($ = U, this._iv =
|
|
4055
|
+
U ? ($ = U, this._iv = a) : $ = this._prevBlock;
|
|
4056
4056
|
for (var X = 0; X < L; X++)
|
|
4057
4057
|
T[k + X] ^= $[X];
|
|
4058
4058
|
}
|
|
4059
4059
|
return D;
|
|
4060
|
-
}(), d =
|
|
4060
|
+
}(), d = w.pad = {}, n = d.Pkcs7 = {
|
|
4061
4061
|
/**
|
|
4062
4062
|
* Pads data using the algorithm defined in PKCS #5/7.
|
|
4063
4063
|
*
|
|
@@ -4159,7 +4159,7 @@ function e0() {
|
|
|
4159
4159
|
toString: function(D) {
|
|
4160
4160
|
return (D || this.formatter).stringify(this);
|
|
4161
4161
|
}
|
|
4162
|
-
}), f =
|
|
4162
|
+
}), f = w.format = {}, u = f.OpenSSL = {
|
|
4163
4163
|
/**
|
|
4164
4164
|
* Converts a cipher params object to an OpenSSL-compatible string.
|
|
4165
4165
|
*
|
|
@@ -4275,7 +4275,7 @@ function e0() {
|
|
|
4275
4275
|
_parse: function(D, b) {
|
|
4276
4276
|
return typeof D == "string" ? b.parse(D, this) : D;
|
|
4277
4277
|
}
|
|
4278
|
-
}), y =
|
|
4278
|
+
}), y = w.kdf = {}, S = y.OpenSSL = {
|
|
4279
4279
|
/**
|
|
4280
4280
|
* Derives a key and IV from a password.
|
|
4281
4281
|
*
|
|
@@ -4363,44 +4363,44 @@ function e0() {
|
|
|
4363
4363
|
});
|
|
4364
4364
|
}(Dt)), Dt.exports;
|
|
4365
4365
|
}
|
|
4366
|
-
var gt = { exports: {} },
|
|
4367
|
-
function
|
|
4368
|
-
return Xr || (Xr = 1, function(
|
|
4369
|
-
(function(A,
|
|
4370
|
-
|
|
4371
|
-
})(
|
|
4366
|
+
var gt = { exports: {} }, Tx = gt.exports, Xr;
|
|
4367
|
+
function kx() {
|
|
4368
|
+
return Xr || (Xr = 1, function(_, N) {
|
|
4369
|
+
(function(A, a, w) {
|
|
4370
|
+
_.exports = a(j(), e0());
|
|
4371
|
+
})(Tx, function(A) {
|
|
4372
4372
|
return A.mode.CFB = function() {
|
|
4373
|
-
var
|
|
4374
|
-
|
|
4373
|
+
var a = A.lib.BlockCipherMode.extend();
|
|
4374
|
+
a.Encryptor = a.extend({
|
|
4375
4375
|
processBlock: function(l, m) {
|
|
4376
4376
|
var h = this._cipher, B = h.blockSize;
|
|
4377
|
-
|
|
4377
|
+
w.call(this, l, m, B, h), this._prevBlock = l.slice(m, m + B);
|
|
4378
4378
|
}
|
|
4379
|
-
}),
|
|
4379
|
+
}), a.Decryptor = a.extend({
|
|
4380
4380
|
processBlock: function(l, m) {
|
|
4381
4381
|
var h = this._cipher, B = h.blockSize, e = l.slice(m, m + B);
|
|
4382
|
-
|
|
4382
|
+
w.call(this, l, m, B, h), this._prevBlock = e;
|
|
4383
4383
|
}
|
|
4384
4384
|
});
|
|
4385
|
-
function
|
|
4385
|
+
function w(l, m, h, B) {
|
|
4386
4386
|
var e, o = this._iv;
|
|
4387
4387
|
o ? (e = o.slice(0), this._iv = void 0) : e = this._prevBlock, B.encryptBlock(e, 0);
|
|
4388
4388
|
for (var F = 0; F < h; F++)
|
|
4389
4389
|
l[m + F] ^= e[F];
|
|
4390
4390
|
}
|
|
4391
|
-
return
|
|
4391
|
+
return a;
|
|
4392
4392
|
}(), A.mode.CFB;
|
|
4393
4393
|
});
|
|
4394
4394
|
}(gt)), gt.exports;
|
|
4395
4395
|
}
|
|
4396
|
-
var bt = { exports: {} },
|
|
4397
|
-
function
|
|
4398
|
-
return Zr || (Zr = 1, function(
|
|
4399
|
-
(function(A,
|
|
4400
|
-
|
|
4401
|
-
})(
|
|
4396
|
+
var bt = { exports: {} }, Rx = bt.exports, Zr;
|
|
4397
|
+
function Hx() {
|
|
4398
|
+
return Zr || (Zr = 1, function(_, N) {
|
|
4399
|
+
(function(A, a, w) {
|
|
4400
|
+
_.exports = a(j(), e0());
|
|
4401
|
+
})(Rx, function(A) {
|
|
4402
4402
|
return A.mode.CTR = function() {
|
|
4403
|
-
var
|
|
4403
|
+
var a = A.lib.BlockCipherMode.extend(), w = a.Encryptor = a.extend({
|
|
4404
4404
|
processBlock: function(l, m) {
|
|
4405
4405
|
var h = this._cipher, B = h.blockSize, e = this._iv, o = this._counter;
|
|
4406
4406
|
e && (o = this._counter = e.slice(0), this._iv = void 0);
|
|
@@ -4410,25 +4410,25 @@ function Rx() {
|
|
|
4410
4410
|
l[m + c] ^= F[c];
|
|
4411
4411
|
}
|
|
4412
4412
|
});
|
|
4413
|
-
return
|
|
4413
|
+
return a.Decryptor = w, a;
|
|
4414
4414
|
}(), A.mode.CTR;
|
|
4415
4415
|
});
|
|
4416
4416
|
}(bt)), bt.exports;
|
|
4417
4417
|
}
|
|
4418
|
-
var yt = { exports: {} },
|
|
4419
|
-
function
|
|
4420
|
-
return jr || (jr = 1, function(
|
|
4421
|
-
(function(A,
|
|
4422
|
-
|
|
4423
|
-
})(
|
|
4418
|
+
var yt = { exports: {} }, qx = yt.exports, jr;
|
|
4419
|
+
function Px() {
|
|
4420
|
+
return jr || (jr = 1, function(_, N) {
|
|
4421
|
+
(function(A, a, w) {
|
|
4422
|
+
_.exports = a(j(), e0());
|
|
4423
|
+
})(qx, function(A) {
|
|
4424
4424
|
/** @preserve
|
|
4425
4425
|
* Counter block mode compatible with Dr Brian Gladman fileenc.c
|
|
4426
4426
|
* derived from CryptoJS.mode.CTR
|
|
4427
4427
|
* Jan Hruby jhruby.web@gmail.com
|
|
4428
4428
|
*/
|
|
4429
4429
|
return A.mode.CTRGladman = function() {
|
|
4430
|
-
var
|
|
4431
|
-
function
|
|
4430
|
+
var a = A.lib.BlockCipherMode.extend();
|
|
4431
|
+
function w(h) {
|
|
4432
4432
|
if ((h >> 24 & 255) === 255) {
|
|
4433
4433
|
var B = h >> 16 & 255, e = h >> 8 & 255, o = h & 255;
|
|
4434
4434
|
B === 255 ? (B = 0, e === 255 ? (e = 0, o === 255 ? o = 0 : ++o) : ++e) : ++B, h = 0, h += B << 16, h += e << 8, h += o;
|
|
@@ -4437,9 +4437,9 @@ function qx() {
|
|
|
4437
4437
|
return h;
|
|
4438
4438
|
}
|
|
4439
4439
|
function l(h) {
|
|
4440
|
-
return (h[0] =
|
|
4440
|
+
return (h[0] = w(h[0])) === 0 && (h[1] = w(h[1])), h;
|
|
4441
4441
|
}
|
|
4442
|
-
var m =
|
|
4442
|
+
var m = a.Encryptor = a.extend({
|
|
4443
4443
|
processBlock: function(h, B) {
|
|
4444
4444
|
var e = this._cipher, o = e.blockSize, F = this._iv, c = this._counter;
|
|
4445
4445
|
F && (c = this._counter = F.slice(0), this._iv = void 0), l(c);
|
|
@@ -4449,19 +4449,19 @@ function qx() {
|
|
|
4449
4449
|
h[B + v] ^= p[v];
|
|
4450
4450
|
}
|
|
4451
4451
|
});
|
|
4452
|
-
return
|
|
4452
|
+
return a.Decryptor = m, a;
|
|
4453
4453
|
}(), A.mode.CTRGladman;
|
|
4454
4454
|
});
|
|
4455
4455
|
}(yt)), yt.exports;
|
|
4456
4456
|
}
|
|
4457
|
-
var mt = { exports: {} },
|
|
4458
|
-
function
|
|
4459
|
-
return Kr || (Kr = 1, function(
|
|
4460
|
-
(function(A,
|
|
4461
|
-
|
|
4462
|
-
})(
|
|
4457
|
+
var mt = { exports: {} }, zx = mt.exports, Kr;
|
|
4458
|
+
function Ix() {
|
|
4459
|
+
return Kr || (Kr = 1, function(_, N) {
|
|
4460
|
+
(function(A, a, w) {
|
|
4461
|
+
_.exports = a(j(), e0());
|
|
4462
|
+
})(zx, function(A) {
|
|
4463
4463
|
return A.mode.OFB = function() {
|
|
4464
|
-
var
|
|
4464
|
+
var a = A.lib.BlockCipherMode.extend(), w = a.Encryptor = a.extend({
|
|
4465
4465
|
processBlock: function(l, m) {
|
|
4466
4466
|
var h = this._cipher, B = h.blockSize, e = this._iv, o = this._keystream;
|
|
4467
4467
|
e && (o = this._keystream = e.slice(0), this._iv = void 0), h.encryptBlock(o, 0);
|
|
@@ -4469,102 +4469,102 @@ function zx() {
|
|
|
4469
4469
|
l[m + F] ^= o[F];
|
|
4470
4470
|
}
|
|
4471
4471
|
});
|
|
4472
|
-
return
|
|
4472
|
+
return a.Decryptor = w, a;
|
|
4473
4473
|
}(), A.mode.OFB;
|
|
4474
4474
|
});
|
|
4475
4475
|
}(mt)), mt.exports;
|
|
4476
4476
|
}
|
|
4477
|
-
var _t = { exports: {} },
|
|
4478
|
-
function
|
|
4479
|
-
return Gr || (Gr = 1, function(
|
|
4480
|
-
(function(A,
|
|
4481
|
-
|
|
4482
|
-
})(
|
|
4477
|
+
var _t = { exports: {} }, Ox = _t.exports, Gr;
|
|
4478
|
+
function Lx() {
|
|
4479
|
+
return Gr || (Gr = 1, function(_, N) {
|
|
4480
|
+
(function(A, a, w) {
|
|
4481
|
+
_.exports = a(j(), e0());
|
|
4482
|
+
})(Ox, function(A) {
|
|
4483
4483
|
return A.mode.ECB = function() {
|
|
4484
|
-
var
|
|
4485
|
-
return
|
|
4486
|
-
processBlock: function(
|
|
4487
|
-
this._cipher.encryptBlock(
|
|
4484
|
+
var a = A.lib.BlockCipherMode.extend();
|
|
4485
|
+
return a.Encryptor = a.extend({
|
|
4486
|
+
processBlock: function(w, l) {
|
|
4487
|
+
this._cipher.encryptBlock(w, l);
|
|
4488
4488
|
}
|
|
4489
|
-
}),
|
|
4490
|
-
processBlock: function(
|
|
4491
|
-
this._cipher.decryptBlock(
|
|
4489
|
+
}), a.Decryptor = a.extend({
|
|
4490
|
+
processBlock: function(w, l) {
|
|
4491
|
+
this._cipher.decryptBlock(w, l);
|
|
4492
4492
|
}
|
|
4493
|
-
}),
|
|
4493
|
+
}), a;
|
|
4494
4494
|
}(), A.mode.ECB;
|
|
4495
4495
|
});
|
|
4496
4496
|
}(_t)), _t.exports;
|
|
4497
4497
|
}
|
|
4498
|
-
var wt = { exports: {} },
|
|
4498
|
+
var wt = { exports: {} }, Mx = wt.exports, Yr;
|
|
4499
4499
|
function Nx() {
|
|
4500
|
-
return Yr || (Yr = 1, function(
|
|
4501
|
-
(function(A,
|
|
4502
|
-
|
|
4503
|
-
})(
|
|
4500
|
+
return Yr || (Yr = 1, function(_, N) {
|
|
4501
|
+
(function(A, a, w) {
|
|
4502
|
+
_.exports = a(j(), e0());
|
|
4503
|
+
})(Mx, function(A) {
|
|
4504
4504
|
return A.pad.AnsiX923 = {
|
|
4505
|
-
pad: function(
|
|
4506
|
-
var l =
|
|
4507
|
-
|
|
4505
|
+
pad: function(a, w) {
|
|
4506
|
+
var l = a.sigBytes, m = w * 4, h = m - l % m, B = l + h - 1;
|
|
4507
|
+
a.clamp(), a.words[B >>> 2] |= h << 24 - B % 4 * 8, a.sigBytes += h;
|
|
4508
4508
|
},
|
|
4509
|
-
unpad: function(
|
|
4510
|
-
var
|
|
4511
|
-
|
|
4509
|
+
unpad: function(a) {
|
|
4510
|
+
var w = a.words[a.sigBytes - 1 >>> 2] & 255;
|
|
4511
|
+
a.sigBytes -= w;
|
|
4512
4512
|
}
|
|
4513
4513
|
}, A.pad.Ansix923;
|
|
4514
4514
|
});
|
|
4515
4515
|
}(wt)), wt.exports;
|
|
4516
4516
|
}
|
|
4517
|
-
var St = { exports: {} },
|
|
4518
|
-
function
|
|
4519
|
-
return Qr || (Qr = 1, function(
|
|
4520
|
-
(function(A,
|
|
4521
|
-
|
|
4522
|
-
})(
|
|
4517
|
+
var St = { exports: {} }, Wx = St.exports, Qr;
|
|
4518
|
+
function $x() {
|
|
4519
|
+
return Qr || (Qr = 1, function(_, N) {
|
|
4520
|
+
(function(A, a, w) {
|
|
4521
|
+
_.exports = a(j(), e0());
|
|
4522
|
+
})(Wx, function(A) {
|
|
4523
4523
|
return A.pad.Iso10126 = {
|
|
4524
|
-
pad: function(
|
|
4525
|
-
var l =
|
|
4526
|
-
|
|
4524
|
+
pad: function(a, w) {
|
|
4525
|
+
var l = w * 4, m = l - a.sigBytes % l;
|
|
4526
|
+
a.concat(A.lib.WordArray.random(m - 1)).concat(A.lib.WordArray.create([m << 24], 1));
|
|
4527
4527
|
},
|
|
4528
|
-
unpad: function(
|
|
4529
|
-
var
|
|
4530
|
-
|
|
4528
|
+
unpad: function(a) {
|
|
4529
|
+
var w = a.words[a.sigBytes - 1 >>> 2] & 255;
|
|
4530
|
+
a.sigBytes -= w;
|
|
4531
4531
|
}
|
|
4532
4532
|
}, A.pad.Iso10126;
|
|
4533
4533
|
});
|
|
4534
4534
|
}(St)), St.exports;
|
|
4535
4535
|
}
|
|
4536
|
-
var Tt = { exports: {} },
|
|
4537
|
-
function
|
|
4538
|
-
return Jr || (Jr = 1, function(
|
|
4539
|
-
(function(A,
|
|
4540
|
-
|
|
4541
|
-
})(
|
|
4536
|
+
var Tt = { exports: {} }, Ux = Tt.exports, Jr;
|
|
4537
|
+
function Vx() {
|
|
4538
|
+
return Jr || (Jr = 1, function(_, N) {
|
|
4539
|
+
(function(A, a, w) {
|
|
4540
|
+
_.exports = a(j(), e0());
|
|
4541
|
+
})(Ux, function(A) {
|
|
4542
4542
|
return A.pad.Iso97971 = {
|
|
4543
|
-
pad: function(
|
|
4544
|
-
|
|
4543
|
+
pad: function(a, w) {
|
|
4544
|
+
a.concat(A.lib.WordArray.create([2147483648], 1)), A.pad.ZeroPadding.pad(a, w);
|
|
4545
4545
|
},
|
|
4546
|
-
unpad: function(
|
|
4547
|
-
A.pad.ZeroPadding.unpad(
|
|
4546
|
+
unpad: function(a) {
|
|
4547
|
+
A.pad.ZeroPadding.unpad(a), a.sigBytes--;
|
|
4548
4548
|
}
|
|
4549
4549
|
}, A.pad.Iso97971;
|
|
4550
4550
|
});
|
|
4551
4551
|
}(Tt)), Tt.exports;
|
|
4552
4552
|
}
|
|
4553
|
-
var kt = { exports: {} },
|
|
4554
|
-
function
|
|
4555
|
-
return te || (te = 1, function(
|
|
4556
|
-
(function(A,
|
|
4557
|
-
|
|
4558
|
-
})(
|
|
4553
|
+
var kt = { exports: {} }, Xx = kt.exports, te;
|
|
4554
|
+
function Zx() {
|
|
4555
|
+
return te || (te = 1, function(_, N) {
|
|
4556
|
+
(function(A, a, w) {
|
|
4557
|
+
_.exports = a(j(), e0());
|
|
4558
|
+
})(Xx, function(A) {
|
|
4559
4559
|
return A.pad.ZeroPadding = {
|
|
4560
|
-
pad: function(
|
|
4561
|
-
var l =
|
|
4562
|
-
|
|
4560
|
+
pad: function(a, w) {
|
|
4561
|
+
var l = w * 4;
|
|
4562
|
+
a.clamp(), a.sigBytes += l - (a.sigBytes % l || l);
|
|
4563
4563
|
},
|
|
4564
|
-
unpad: function(
|
|
4565
|
-
for (var
|
|
4566
|
-
if (
|
|
4567
|
-
|
|
4564
|
+
unpad: function(a) {
|
|
4565
|
+
for (var w = a.words, l = a.sigBytes - 1, l = a.sigBytes - 1; l >= 0; l--)
|
|
4566
|
+
if (w[l >>> 2] >>> 24 - l % 4 * 8 & 255) {
|
|
4567
|
+
a.sigBytes = l + 1;
|
|
4568
4568
|
break;
|
|
4569
4569
|
}
|
|
4570
4570
|
}
|
|
@@ -4572,12 +4572,12 @@ function Xx() {
|
|
|
4572
4572
|
});
|
|
4573
4573
|
}(kt)), kt.exports;
|
|
4574
4574
|
}
|
|
4575
|
-
var Rt = { exports: {} },
|
|
4576
|
-
function
|
|
4577
|
-
return re || (re = 1, function(
|
|
4578
|
-
(function(A,
|
|
4579
|
-
|
|
4580
|
-
})(
|
|
4575
|
+
var Rt = { exports: {} }, jx = Rt.exports, re;
|
|
4576
|
+
function Kx() {
|
|
4577
|
+
return re || (re = 1, function(_, N) {
|
|
4578
|
+
(function(A, a, w) {
|
|
4579
|
+
_.exports = a(j(), e0());
|
|
4580
|
+
})(jx, function(A) {
|
|
4581
4581
|
return A.pad.NoPadding = {
|
|
4582
4582
|
pad: function() {
|
|
4583
4583
|
},
|
|
@@ -4587,14 +4587,14 @@ function jx() {
|
|
|
4587
4587
|
});
|
|
4588
4588
|
}(Rt)), Rt.exports;
|
|
4589
4589
|
}
|
|
4590
|
-
var Ht = { exports: {} },
|
|
4591
|
-
function
|
|
4592
|
-
return ee || (ee = 1, function(
|
|
4593
|
-
(function(A,
|
|
4594
|
-
|
|
4595
|
-
})(
|
|
4596
|
-
return function(
|
|
4597
|
-
var
|
|
4590
|
+
var Ht = { exports: {} }, Gx = Ht.exports, ee;
|
|
4591
|
+
function Yx() {
|
|
4592
|
+
return ee || (ee = 1, function(_, N) {
|
|
4593
|
+
(function(A, a, w) {
|
|
4594
|
+
_.exports = a(j(), e0());
|
|
4595
|
+
})(Gx, function(A) {
|
|
4596
|
+
return function(a) {
|
|
4597
|
+
var w = A, l = w.lib, m = l.CipherParams, h = w.enc, B = h.Hex, e = w.format;
|
|
4598
4598
|
e.Hex = {
|
|
4599
4599
|
/**
|
|
4600
4600
|
* Converts the ciphertext of a cipher params object to a hexadecimally encoded string.
|
|
@@ -4634,14 +4634,14 @@ function Gx() {
|
|
|
4634
4634
|
});
|
|
4635
4635
|
}(Ht)), Ht.exports;
|
|
4636
4636
|
}
|
|
4637
|
-
var qt = { exports: {} },
|
|
4638
|
-
function
|
|
4639
|
-
return xe || (xe = 1, function(
|
|
4640
|
-
(function(A,
|
|
4641
|
-
|
|
4642
|
-
})(
|
|
4637
|
+
var qt = { exports: {} }, Qx = qt.exports, xe;
|
|
4638
|
+
function Jx() {
|
|
4639
|
+
return xe || (xe = 1, function(_, N) {
|
|
4640
|
+
(function(A, a, w) {
|
|
4641
|
+
_.exports = a(j(), R0(), H0(), b0(), e0());
|
|
4642
|
+
})(Qx, function(A) {
|
|
4643
4643
|
return function() {
|
|
4644
|
-
var
|
|
4644
|
+
var a = A, w = a.lib, l = w.BlockCipher, m = a.algo, h = [], B = [], e = [], o = [], F = [], c = [], p = [], v = [], E = [], i = [];
|
|
4645
4645
|
(function() {
|
|
4646
4646
|
for (var x = [], f = 0; f < 256; f++)
|
|
4647
4647
|
f < 128 ? x[f] = f << 1 : x[f] = f << 1 ^ 283;
|
|
@@ -4689,19 +4689,19 @@ function Qx() {
|
|
|
4689
4689
|
},
|
|
4690
4690
|
keySize: 256 / 32
|
|
4691
4691
|
});
|
|
4692
|
-
|
|
4692
|
+
a.AES = l._createHelper(n);
|
|
4693
4693
|
}(), A.AES;
|
|
4694
4694
|
});
|
|
4695
4695
|
}(qt)), qt.exports;
|
|
4696
4696
|
}
|
|
4697
|
-
var Pt = { exports: {} },
|
|
4698
|
-
function
|
|
4699
|
-
return ne || (ne = 1, function(
|
|
4700
|
-
(function(A,
|
|
4701
|
-
|
|
4702
|
-
})(
|
|
4697
|
+
var Pt = { exports: {} }, tn = Pt.exports, ne;
|
|
4698
|
+
function rn() {
|
|
4699
|
+
return ne || (ne = 1, function(_, N) {
|
|
4700
|
+
(function(A, a, w) {
|
|
4701
|
+
_.exports = a(j(), R0(), H0(), b0(), e0());
|
|
4702
|
+
})(tn, function(A) {
|
|
4703
4703
|
return function() {
|
|
4704
|
-
var
|
|
4704
|
+
var a = A, w = a.lib, l = w.WordArray, m = w.BlockCipher, h = a.algo, B = [
|
|
4705
4705
|
57,
|
|
4706
4706
|
49,
|
|
4707
4707
|
41,
|
|
@@ -5390,7 +5390,7 @@ function tn() {
|
|
|
5390
5390
|
var x = (this._rBlock >>> d ^ this._lBlock) & n;
|
|
5391
5391
|
this._lBlock ^= x, this._rBlock ^= x << d;
|
|
5392
5392
|
}
|
|
5393
|
-
|
|
5393
|
+
a.DES = m._createHelper(p);
|
|
5394
5394
|
var i = h.TripleDES = m.extend({
|
|
5395
5395
|
_doReset: function() {
|
|
5396
5396
|
var d = this._key, n = d.words;
|
|
@@ -5409,19 +5409,19 @@ function tn() {
|
|
|
5409
5409
|
ivSize: 64 / 32,
|
|
5410
5410
|
blockSize: 64 / 32
|
|
5411
5411
|
});
|
|
5412
|
-
|
|
5412
|
+
a.TripleDES = m._createHelper(i);
|
|
5413
5413
|
}(), A.TripleDES;
|
|
5414
5414
|
});
|
|
5415
5415
|
}(Pt)), Pt.exports;
|
|
5416
5416
|
}
|
|
5417
|
-
var zt = { exports: {} },
|
|
5418
|
-
function
|
|
5419
|
-
return ie || (ie = 1, function(
|
|
5420
|
-
(function(A,
|
|
5421
|
-
|
|
5422
|
-
})(
|
|
5417
|
+
var zt = { exports: {} }, en = zt.exports, ie;
|
|
5418
|
+
function xn() {
|
|
5419
|
+
return ie || (ie = 1, function(_, N) {
|
|
5420
|
+
(function(A, a, w) {
|
|
5421
|
+
_.exports = a(j(), R0(), H0(), b0(), e0());
|
|
5422
|
+
})(en, function(A) {
|
|
5423
5423
|
return function() {
|
|
5424
|
-
var
|
|
5424
|
+
var a = A, w = a.lib, l = w.StreamCipher, m = a.algo, h = m.RC4 = l.extend({
|
|
5425
5425
|
_doReset: function() {
|
|
5426
5426
|
for (var o = this._key, F = o.words, c = o.sigBytes, p = this._S = [], v = 0; v < 256; v++)
|
|
5427
5427
|
p[v] = v;
|
|
@@ -5447,7 +5447,7 @@ function en() {
|
|
|
5447
5447
|
}
|
|
5448
5448
|
return this._i = F, this._j = c, p;
|
|
5449
5449
|
}
|
|
5450
|
-
|
|
5450
|
+
a.RC4 = l._createHelper(h);
|
|
5451
5451
|
var e = m.RC4Drop = h.extend({
|
|
5452
5452
|
/**
|
|
5453
5453
|
* Configuration options.
|
|
@@ -5463,19 +5463,19 @@ function en() {
|
|
|
5463
5463
|
B.call(this);
|
|
5464
5464
|
}
|
|
5465
5465
|
});
|
|
5466
|
-
|
|
5466
|
+
a.RC4Drop = l._createHelper(e);
|
|
5467
5467
|
}(), A.RC4;
|
|
5468
5468
|
});
|
|
5469
5469
|
}(zt)), zt.exports;
|
|
5470
5470
|
}
|
|
5471
|
-
var It = { exports: {} },
|
|
5472
|
-
function
|
|
5473
|
-
return oe || (oe = 1, function(
|
|
5474
|
-
(function(A,
|
|
5475
|
-
|
|
5476
|
-
})(
|
|
5471
|
+
var It = { exports: {} }, nn = It.exports, oe;
|
|
5472
|
+
function on() {
|
|
5473
|
+
return oe || (oe = 1, function(_, N) {
|
|
5474
|
+
(function(A, a, w) {
|
|
5475
|
+
_.exports = a(j(), R0(), H0(), b0(), e0());
|
|
5476
|
+
})(nn, function(A) {
|
|
5477
5477
|
return function() {
|
|
5478
|
-
var
|
|
5478
|
+
var a = A, w = a.lib, l = w.StreamCipher, m = a.algo, h = [], B = [], e = [], o = m.Rabbit = l.extend({
|
|
5479
5479
|
_doReset: function() {
|
|
5480
5480
|
for (var c = this._key.words, p = this.cfg.iv, v = 0; v < 4; v++)
|
|
5481
5481
|
c[v] = (c[v] << 8 | c[v] >>> 24) & 16711935 | (c[v] << 24 | c[v] >>> 8) & 4278255360;
|
|
@@ -5529,19 +5529,19 @@ function nn() {
|
|
|
5529
5529
|
}
|
|
5530
5530
|
c[0] = e[0] + (e[7] << 16 | e[7] >>> 16) + (e[6] << 16 | e[6] >>> 16) | 0, c[1] = e[1] + (e[0] << 8 | e[0] >>> 24) + e[7] | 0, c[2] = e[2] + (e[1] << 16 | e[1] >>> 16) + (e[0] << 16 | e[0] >>> 16) | 0, c[3] = e[3] + (e[2] << 8 | e[2] >>> 24) + e[1] | 0, c[4] = e[4] + (e[3] << 16 | e[3] >>> 16) + (e[2] << 16 | e[2] >>> 16) | 0, c[5] = e[5] + (e[4] << 8 | e[4] >>> 24) + e[3] | 0, c[6] = e[6] + (e[5] << 16 | e[5] >>> 16) + (e[4] << 16 | e[4] >>> 16) | 0, c[7] = e[7] + (e[6] << 8 | e[6] >>> 24) + e[5] | 0;
|
|
5531
5531
|
}
|
|
5532
|
-
|
|
5532
|
+
a.Rabbit = l._createHelper(o);
|
|
5533
5533
|
}(), A.Rabbit;
|
|
5534
5534
|
});
|
|
5535
5535
|
}(It)), It.exports;
|
|
5536
5536
|
}
|
|
5537
|
-
var Ot = { exports: {} },
|
|
5538
|
-
function
|
|
5539
|
-
return se || (se = 1, function(
|
|
5540
|
-
(function(A,
|
|
5541
|
-
|
|
5542
|
-
})(
|
|
5537
|
+
var Ot = { exports: {} }, sn = Ot.exports, se;
|
|
5538
|
+
function an() {
|
|
5539
|
+
return se || (se = 1, function(_, N) {
|
|
5540
|
+
(function(A, a, w) {
|
|
5541
|
+
_.exports = a(j(), R0(), H0(), b0(), e0());
|
|
5542
|
+
})(sn, function(A) {
|
|
5543
5543
|
return function() {
|
|
5544
|
-
var
|
|
5544
|
+
var a = A, w = a.lib, l = w.StreamCipher, m = a.algo, h = [], B = [], e = [], o = m.RabbitLegacy = l.extend({
|
|
5545
5545
|
_doReset: function() {
|
|
5546
5546
|
var c = this._key.words, p = this.cfg.iv, v = this._X = [
|
|
5547
5547
|
c[0],
|
|
@@ -5593,19 +5593,19 @@ function sn() {
|
|
|
5593
5593
|
}
|
|
5594
5594
|
c[0] = e[0] + (e[7] << 16 | e[7] >>> 16) + (e[6] << 16 | e[6] >>> 16) | 0, c[1] = e[1] + (e[0] << 8 | e[0] >>> 24) + e[7] | 0, c[2] = e[2] + (e[1] << 16 | e[1] >>> 16) + (e[0] << 16 | e[0] >>> 16) | 0, c[3] = e[3] + (e[2] << 8 | e[2] >>> 24) + e[1] | 0, c[4] = e[4] + (e[3] << 16 | e[3] >>> 16) + (e[2] << 16 | e[2] >>> 16) | 0, c[5] = e[5] + (e[4] << 8 | e[4] >>> 24) + e[3] | 0, c[6] = e[6] + (e[5] << 16 | e[5] >>> 16) + (e[4] << 16 | e[4] >>> 16) | 0, c[7] = e[7] + (e[6] << 8 | e[6] >>> 24) + e[5] | 0;
|
|
5595
5595
|
}
|
|
5596
|
-
|
|
5596
|
+
a.RabbitLegacy = l._createHelper(o);
|
|
5597
5597
|
}(), A.RabbitLegacy;
|
|
5598
5598
|
});
|
|
5599
5599
|
}(Ot)), Ot.exports;
|
|
5600
5600
|
}
|
|
5601
|
-
var Lt = { exports: {} },
|
|
5602
|
-
function
|
|
5603
|
-
return ae || (ae = 1, function(
|
|
5604
|
-
(function(A,
|
|
5605
|
-
|
|
5606
|
-
})(
|
|
5601
|
+
var Lt = { exports: {} }, fn = Lt.exports, ae;
|
|
5602
|
+
function cn() {
|
|
5603
|
+
return ae || (ae = 1, function(_, N) {
|
|
5604
|
+
(function(A, a, w) {
|
|
5605
|
+
_.exports = a(j(), R0(), H0(), b0(), e0());
|
|
5606
|
+
})(fn, function(A) {
|
|
5607
5607
|
return function() {
|
|
5608
|
-
var
|
|
5608
|
+
var a = A, w = a.lib, l = w.BlockCipher, m = a.algo;
|
|
5609
5609
|
const h = 16, B = [
|
|
5610
5610
|
608135816,
|
|
5611
5611
|
2242054355,
|
|
@@ -6715,72 +6715,75 @@ function fn() {
|
|
|
6715
6715
|
keySize: 128 / 32,
|
|
6716
6716
|
ivSize: 64 / 32
|
|
6717
6717
|
});
|
|
6718
|
-
|
|
6718
|
+
a.Blowfish = l._createHelper(E);
|
|
6719
6719
|
}(), A.Blowfish;
|
|
6720
6720
|
});
|
|
6721
6721
|
}(Lt)), Lt.exports;
|
|
6722
6722
|
}
|
|
6723
|
-
var
|
|
6724
|
-
function
|
|
6725
|
-
return fe || (fe = 1, function(
|
|
6726
|
-
(function(A,
|
|
6727
|
-
|
|
6728
|
-
})(
|
|
6723
|
+
var un = nt.exports, fe;
|
|
6724
|
+
function hn() {
|
|
6725
|
+
return fe || (fe = 1, function(_, N) {
|
|
6726
|
+
(function(A, a, w) {
|
|
6727
|
+
_.exports = a(j(), Nt(), sx(), fx(), R0(), hx(), H0(), ue(), hr(), Bx(), he(), Ex(), Dx(), bx(), lr(), _x(), b0(), e0(), kx(), Hx(), Px(), Ix(), Lx(), Nx(), $x(), Vx(), Zx(), Kx(), Yx(), Jx(), rn(), xn(), on(), an(), cn());
|
|
6728
|
+
})(un, function(A) {
|
|
6729
6729
|
return A;
|
|
6730
6730
|
});
|
|
6731
6731
|
}(nt)), nt.exports;
|
|
6732
6732
|
}
|
|
6733
|
-
var
|
|
6734
|
-
const W0 = /* @__PURE__ */
|
|
6733
|
+
var ln = hn();
|
|
6734
|
+
const W0 = /* @__PURE__ */ $e(ln), vn = (_, N, A) => W0.AES.encrypt(N, W0.enc.Utf8.parse(_), {
|
|
6735
6735
|
iv: W0.enc.Utf8.parse(A),
|
|
6736
6736
|
mode: W0.mode.CBC,
|
|
6737
6737
|
padding: W0.pad.Pkcs7
|
|
6738
|
-
}).toString(),
|
|
6739
|
-
const
|
|
6738
|
+
}).toString(), dn = (_) => {
|
|
6739
|
+
const N = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
|
|
6740
6740
|
let A = "";
|
|
6741
|
-
for (let
|
|
6742
|
-
A +=
|
|
6741
|
+
for (let a = 0; a < _; a++)
|
|
6742
|
+
A += N.charAt(Math.floor(Math.random() * N.length));
|
|
6743
6743
|
return A;
|
|
6744
6744
|
};
|
|
6745
|
-
function
|
|
6746
|
-
|
|
6745
|
+
function le(_) {
|
|
6746
|
+
return typeof _ == "object" ? JSON.stringify(_ ?? {}) : typeof _ == "number" ? String(_) : _ ?? "";
|
|
6747
|
+
}
|
|
6748
|
+
function pn({ uid: _ = "", salt: N = "", ts: A = 0, data: a = "", ...w }) {
|
|
6749
|
+
const l = Date.now() + A, m = Math.random().toString(36).substring(2, 15), h = `${l}${_}${m}${le(a)}${N}`, B = Je.sm3(h);
|
|
6747
6750
|
return {
|
|
6748
|
-
...
|
|
6751
|
+
...w,
|
|
6749
6752
|
"X-Sign-Timestamp": String(l),
|
|
6750
6753
|
"X-Sign-Nonce": m,
|
|
6751
|
-
"X-Sign-Client":
|
|
6754
|
+
"X-Sign-Client": B
|
|
6752
6755
|
};
|
|
6753
6756
|
}
|
|
6754
|
-
function
|
|
6755
|
-
const A =
|
|
6757
|
+
function Bn(_, N) {
|
|
6758
|
+
const A = dn(16);
|
|
6756
6759
|
return {
|
|
6757
6760
|
headers: {
|
|
6758
6761
|
iv: A,
|
|
6759
6762
|
"Content-Type": "application/json"
|
|
6760
6763
|
},
|
|
6761
|
-
data: { body:
|
|
6764
|
+
data: { body: vn(_, le(N), A) }
|
|
6762
6765
|
};
|
|
6763
6766
|
}
|
|
6764
|
-
function
|
|
6765
|
-
const
|
|
6767
|
+
function Fn(_) {
|
|
6768
|
+
const N = ["script", "iframe", "object", "embed", "link", "meta", "style"], A = ["onerror", "onload", "onclick", "onmouseover", "onfocus", "onmouseenter", "onmouseleave"], a = (B) => /^javascript:/i.test(B) || /^data:text\/html/i.test(B), l = new DOMParser().parseFromString(`<div>${_}</div>`, "text/html"), m = l.body.firstChild;
|
|
6766
6769
|
function h(B) {
|
|
6767
6770
|
if (B.nodeType === Node.ELEMENT_NODE) {
|
|
6768
6771
|
const e = B, o = e.tagName.toLowerCase();
|
|
6769
|
-
if (
|
|
6772
|
+
if (N.includes(o)) {
|
|
6770
6773
|
const F = e.outerHTML, c = l.createTextNode(F);
|
|
6771
6774
|
e.replaceWith(c);
|
|
6772
6775
|
return;
|
|
6773
6776
|
}
|
|
6774
6777
|
[...e.attributes].forEach((F) => {
|
|
6775
6778
|
const c = F.name.toLowerCase(), p = F.value;
|
|
6776
|
-
(A.includes(c) ||
|
|
6779
|
+
(A.includes(c) || a(p)) && e.removeAttribute(F.name);
|
|
6777
6780
|
}), [...e.childNodes].forEach(h);
|
|
6778
6781
|
}
|
|
6779
6782
|
}
|
|
6780
6783
|
return [...m.childNodes].forEach(h), m.innerHTML;
|
|
6781
6784
|
}
|
|
6782
6785
|
export {
|
|
6783
|
-
|
|
6784
|
-
|
|
6785
|
-
|
|
6786
|
+
pn as createHeaders,
|
|
6787
|
+
Fn as htmlSanitize,
|
|
6788
|
+
Bn as transmissionDataEncryption
|
|
6786
6789
|
};
|