module-develop-kit 0.3.2 → 0.3.3
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 +362 -371
- package/dist/index.umd.js +3 -3
- package/package.json +1 -1
package/dist/index.es.js
CHANGED
|
@@ -1,15 +1,15 @@
|
|
|
1
1
|
var nr = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
|
|
2
|
-
function
|
|
2
|
+
function Je(y) {
|
|
3
3
|
return y && y.__esModule && Object.prototype.hasOwnProperty.call(y, "default") ? y.default : y;
|
|
4
4
|
}
|
|
5
|
-
function
|
|
5
|
+
function tx(y) {
|
|
6
6
|
if (Object.prototype.hasOwnProperty.call(y, "__esModule")) return y;
|
|
7
|
-
var
|
|
8
|
-
if (typeof
|
|
7
|
+
var z = y.default;
|
|
8
|
+
if (typeof z == "function") {
|
|
9
9
|
var E = function a() {
|
|
10
|
-
return this instanceof a ? Reflect.construct(
|
|
10
|
+
return this instanceof a ? Reflect.construct(z, arguments, this.constructor) : z.apply(this, arguments);
|
|
11
11
|
};
|
|
12
|
-
E.prototype =
|
|
12
|
+
E.prototype = z.prototype;
|
|
13
13
|
} else E = {};
|
|
14
14
|
return Object.defineProperty(E, "__esModule", { value: !0 }), Object.keys(y).forEach(function(a) {
|
|
15
15
|
var g = Object.getOwnPropertyDescriptor(y, a);
|
|
@@ -22,12 +22,12 @@ function ex(y) {
|
|
|
22
22
|
}), E;
|
|
23
23
|
}
|
|
24
24
|
var W0 = {}, mr;
|
|
25
|
-
function
|
|
25
|
+
function rx() {
|
|
26
26
|
if (mr) return W0;
|
|
27
27
|
mr = 1, W0.byteLength = o, W0.toByteArray = r, W0.fromByteArray = f;
|
|
28
|
-
for (var y = [],
|
|
29
|
-
y[g] = a[g],
|
|
30
|
-
|
|
28
|
+
for (var y = [], z = [], E = typeof Uint8Array < "u" ? Uint8Array : Array, a = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", g = 0, B = a.length; g < B; ++g)
|
|
29
|
+
y[g] = a[g], z[a.charCodeAt(g)] = g;
|
|
30
|
+
z[45] = 62, z[95] = 63;
|
|
31
31
|
function m(l) {
|
|
32
32
|
var h = l.length;
|
|
33
33
|
if (h % 4 > 0)
|
|
@@ -47,8 +47,8 @@ function xx() {
|
|
|
47
47
|
function r(l) {
|
|
48
48
|
var h, F = m(l), i = F[0], p = F[1], x = new E(v(l, i, p)), n = 0, u = p > 0 ? i - 4 : i, d;
|
|
49
49
|
for (d = 0; d < u; d += 4)
|
|
50
|
-
h =
|
|
51
|
-
return p === 2 && (h =
|
|
50
|
+
h = z[l.charCodeAt(d)] << 18 | z[l.charCodeAt(d + 1)] << 12 | z[l.charCodeAt(d + 2)] << 6 | z[l.charCodeAt(d + 3)], x[n++] = h >> 16 & 255, x[n++] = h >> 8 & 255, x[n++] = h & 255;
|
|
51
|
+
return p === 2 && (h = z[l.charCodeAt(d)] << 2 | z[l.charCodeAt(d + 1)] >> 4, x[n++] = h & 255), p === 1 && (h = z[l.charCodeAt(d)] << 10 | z[l.charCodeAt(d + 1)] << 4 | z[l.charCodeAt(d + 2)] >> 2, x[n++] = h >> 8 & 255, x[n++] = h & 255), x;
|
|
52
52
|
}
|
|
53
53
|
function s(l) {
|
|
54
54
|
return y[l >> 18 & 63] + y[l >> 12 & 63] + y[l >> 6 & 63] + y[l & 63];
|
|
@@ -69,16 +69,16 @@ function xx() {
|
|
|
69
69
|
}
|
|
70
70
|
return W0;
|
|
71
71
|
}
|
|
72
|
-
const
|
|
72
|
+
const ex = {}, xx = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
73
73
|
__proto__: null,
|
|
74
|
-
default:
|
|
75
|
-
}, Symbol.toStringTag, { value: "Module" })), pr = /* @__PURE__ */
|
|
74
|
+
default: ex
|
|
75
|
+
}, Symbol.toStringTag, { value: "Module" })), pr = /* @__PURE__ */ tx(xx);
|
|
76
76
|
var ir, wr;
|
|
77
|
-
function
|
|
77
|
+
function nx() {
|
|
78
78
|
if (wr) return ir;
|
|
79
79
|
wr = 1;
|
|
80
|
-
const y =
|
|
81
|
-
class
|
|
80
|
+
const y = rx();
|
|
81
|
+
class z {
|
|
82
82
|
/**
|
|
83
83
|
* Converts a JS string to an UTF-8 uint8array.
|
|
84
84
|
*
|
|
@@ -126,13 +126,13 @@ function ox() {
|
|
|
126
126
|
return y.toByteArray(a);
|
|
127
127
|
}
|
|
128
128
|
}
|
|
129
|
-
return ir =
|
|
129
|
+
return ir = z, ir;
|
|
130
130
|
}
|
|
131
131
|
var or, _r;
|
|
132
|
-
function
|
|
132
|
+
function ix() {
|
|
133
133
|
if (_r) return or;
|
|
134
134
|
_r = 1;
|
|
135
|
-
const y =
|
|
135
|
+
const y = nx(), z = 16, E = Uint8Array.from([
|
|
136
136
|
214,
|
|
137
137
|
144,
|
|
138
138
|
233,
|
|
@@ -548,7 +548,7 @@ function sx() {
|
|
|
548
548
|
padding(o) {
|
|
549
549
|
if (o === null)
|
|
550
550
|
return null;
|
|
551
|
-
let v =
|
|
551
|
+
let v = z - o.length % z, r = new Uint8Array(o.length + v);
|
|
552
552
|
return r.set(o, 0), r.fill(v, o.length), r;
|
|
553
553
|
}
|
|
554
554
|
/**
|
|
@@ -584,23 +584,23 @@ function sx() {
|
|
|
584
584
|
* @return {String} ciphertext
|
|
585
585
|
*/
|
|
586
586
|
encrypt(o) {
|
|
587
|
-
let v = y.stringToArrayBufferInUtf8(o), r = this.padding(v), s = r.length /
|
|
587
|
+
let v = y.stringToArrayBufferInUtf8(o), r = this.padding(v), s = r.length / z, C = new Uint8Array(r.length);
|
|
588
588
|
if (this.mode === "cbc") {
|
|
589
589
|
if (this.iv === null || this.iv.length !== 16)
|
|
590
590
|
throw new Error("iv error");
|
|
591
591
|
let f = this.uint8ToUint32Block(this.iv);
|
|
592
592
|
for (let l = 0; l < s; l++) {
|
|
593
|
-
let h = l *
|
|
593
|
+
let h = l * z, F = this.uint8ToUint32Block(r, h);
|
|
594
594
|
f[0] = f[0] ^ F[0], f[1] = f[1] ^ F[1], f[2] = f[2] ^ F[2], f[3] = f[3] ^ F[3];
|
|
595
595
|
let i = this.doBlockCrypt(f, this.encryptRoundKeys);
|
|
596
596
|
f = i;
|
|
597
|
-
for (let p = 0; p <
|
|
597
|
+
for (let p = 0; p < z; p++)
|
|
598
598
|
C[h + p] = i[parseInt(p / 4)] >> (3 - p) % 4 * 8 & 255;
|
|
599
599
|
}
|
|
600
600
|
} else
|
|
601
601
|
for (let f = 0; f < s; f++) {
|
|
602
|
-
let l = f *
|
|
603
|
-
for (let i = 0; i <
|
|
602
|
+
let l = f * z, h = this.uint8ToUint32Block(r, l), F = this.doBlockCrypt(h, this.encryptRoundKeys);
|
|
603
|
+
for (let i = 0; i < z; i++)
|
|
604
604
|
C[l + i] = F[parseInt(i / 4)] >> (3 - i) % 4 * 8 & 255;
|
|
605
605
|
}
|
|
606
606
|
return this.cipherType === "base64" ? y.arrayBufferToBase64(C) : y.utf8ArrayBufferToString(C);
|
|
@@ -614,21 +614,21 @@ function sx() {
|
|
|
614
614
|
decrypt(o) {
|
|
615
615
|
let v = new Uint8Array();
|
|
616
616
|
this.cipherType === "base64" ? v = y.base64ToArrayBuffer(o) : v = y.stringToArrayBufferInUtf8(o);
|
|
617
|
-
let r = v.length /
|
|
617
|
+
let r = v.length / z, s = new Uint8Array(v.length);
|
|
618
618
|
if (this.mode === "cbc") {
|
|
619
619
|
if (this.iv === null || this.iv.length !== 16)
|
|
620
620
|
throw new Error("iv error");
|
|
621
621
|
let f = this.uint8ToUint32Block(this.iv);
|
|
622
622
|
for (let l = 0; l < r; l++) {
|
|
623
|
-
let h = l *
|
|
623
|
+
let h = l * z, F = this.uint8ToUint32Block(v, h), i = this.doBlockCrypt(F, this.decryptRoundKeys), p = new Uint32Array(4);
|
|
624
624
|
p[0] = f[0] ^ i[0], p[1] = f[1] ^ i[1], p[2] = f[2] ^ i[2], p[3] = f[3] ^ i[3], f = F;
|
|
625
|
-
for (let x = 0; x <
|
|
625
|
+
for (let x = 0; x < z; x++)
|
|
626
626
|
s[h + x] = p[parseInt(x / 4)] >> (3 - x) % 4 * 8 & 255;
|
|
627
627
|
}
|
|
628
628
|
} else
|
|
629
629
|
for (let f = 0; f < r; f++) {
|
|
630
|
-
let l = f *
|
|
631
|
-
for (let i = 0; i <
|
|
630
|
+
let l = f * z, h = this.uint8ToUint32Block(v, l), F = this.doBlockCrypt(h, this.decryptRoundKeys);
|
|
631
|
+
for (let i = 0; i < z; i++)
|
|
632
632
|
s[l + i] = F[parseInt(i / 4)] >> (3 - i) % 4 * 8 & 255;
|
|
633
633
|
}
|
|
634
634
|
let C = this.dePadding(s);
|
|
@@ -638,14 +638,14 @@ function sx() {
|
|
|
638
638
|
return or = B, or;
|
|
639
639
|
}
|
|
640
640
|
var sr, Tr;
|
|
641
|
-
function
|
|
641
|
+
function ox() {
|
|
642
642
|
return Tr || (Tr = 1, sr = {
|
|
643
|
-
sm4:
|
|
643
|
+
sm4: ix()
|
|
644
644
|
}), sr;
|
|
645
645
|
}
|
|
646
|
-
var Fr =
|
|
646
|
+
var Fr = ox(), nt = { exports: {} }, sx = nt.exports, kr;
|
|
647
647
|
function Mt() {
|
|
648
|
-
return kr || (kr = 1, function(y,
|
|
648
|
+
return kr || (kr = 1, function(y, z) {
|
|
649
649
|
(function() {
|
|
650
650
|
var E, a = 244837814094590, g = (a & 16777215) == 15715070;
|
|
651
651
|
function B(t, e, c) {
|
|
@@ -654,26 +654,26 @@ function Mt() {
|
|
|
654
654
|
function m() {
|
|
655
655
|
return new B(null);
|
|
656
656
|
}
|
|
657
|
-
function o(t, e, c, b,
|
|
657
|
+
function o(t, e, c, b, P, L) {
|
|
658
658
|
for (; --L >= 0; ) {
|
|
659
|
-
var M = e * this[t++] + c[b] +
|
|
660
|
-
|
|
659
|
+
var M = e * this[t++] + c[b] + P;
|
|
660
|
+
P = Math.floor(M / 67108864), c[b++] = M & 67108863;
|
|
661
661
|
}
|
|
662
|
-
return
|
|
662
|
+
return P;
|
|
663
663
|
}
|
|
664
|
-
function v(t, e, c, b,
|
|
664
|
+
function v(t, e, c, b, P, L) {
|
|
665
665
|
for (var M = e & 32767, N = e >> 15; --L >= 0; ) {
|
|
666
666
|
var J = this[t] & 32767, r0 = this[t++] >> 15, l0 = N * J + r0 * M;
|
|
667
|
-
J = M * J + ((l0 & 32767) << 15) + c[b] + (
|
|
667
|
+
J = M * J + ((l0 & 32767) << 15) + c[b] + (P & 1073741823), P = (J >>> 30) + (l0 >>> 15) + N * r0 + (P >>> 30), c[b++] = J & 1073741823;
|
|
668
668
|
}
|
|
669
|
-
return
|
|
669
|
+
return P;
|
|
670
670
|
}
|
|
671
|
-
function r(t, e, c, b,
|
|
671
|
+
function r(t, e, c, b, P, L) {
|
|
672
672
|
for (var M = e & 16383, N = e >> 14; --L >= 0; ) {
|
|
673
673
|
var J = this[t] & 16383, r0 = this[t++] >> 14, l0 = N * J + r0 * M;
|
|
674
|
-
J = M * J + ((l0 & 16383) << 14) + c[b] +
|
|
674
|
+
J = M * J + ((l0 & 16383) << 14) + c[b] + P, P = (J >> 28) + (l0 >> 14) + N * r0, c[b++] = J & 268435455;
|
|
675
675
|
}
|
|
676
|
-
return
|
|
676
|
+
return P;
|
|
677
677
|
}
|
|
678
678
|
var s = typeof navigator < "u";
|
|
679
679
|
s && g && navigator.appName == "Microsoft Internet Explorer" ? (B.prototype.am = v, E = 30) : s && g && navigator.appName != "Netscape" ? (B.prototype.am = o, E = 26) : (B.prototype.am = r, E = 28), B.prototype.DB = E, B.prototype.DM = (1 << E) - 1, B.prototype.DV = 1 << E;
|
|
@@ -714,15 +714,15 @@ function Mt() {
|
|
|
714
714
|
return;
|
|
715
715
|
}
|
|
716
716
|
this.t = 0, this.s = 0;
|
|
717
|
-
for (var b = t.length,
|
|
717
|
+
for (var b = t.length, P = !1, L = 0; --b >= 0; ) {
|
|
718
718
|
var M = c == 8 ? t[b] & 255 : p(t, b);
|
|
719
719
|
if (M < 0) {
|
|
720
|
-
t.charAt(b) == "-" && (
|
|
720
|
+
t.charAt(b) == "-" && (P = !0);
|
|
721
721
|
continue;
|
|
722
722
|
}
|
|
723
|
-
|
|
723
|
+
P = !1, L == 0 ? this[this.t++] = M : L + c > this.DB ? (this[this.t - 1] |= (M & (1 << this.DB - L) - 1) << L, this[this.t++] = M >> this.DB - L) : this[this.t - 1] |= M << L, L += c, L >= this.DB && (L -= this.DB);
|
|
724
724
|
}
|
|
725
|
-
c == 8 && (t[0] & 128) != 0 && (this.s = -1, L > 0 && (this[this.t - 1] |= (1 << this.DB - L) - 1 << L)), this.clamp(),
|
|
725
|
+
c == 8 && (t[0] & 128) != 0 && (this.s = -1, L > 0 && (this[this.t - 1] |= (1 << this.DB - L) - 1 << L)), this.clamp(), P && B.ZERO.subTo(this, this);
|
|
726
726
|
}
|
|
727
727
|
function A() {
|
|
728
728
|
for (var t = this.s & this.DM; this.t > 0 && this[this.t - 1] == t; ) --this.t;
|
|
@@ -736,11 +736,11 @@ function Mt() {
|
|
|
736
736
|
else if (t == 32) e = 5;
|
|
737
737
|
else if (t == 4) e = 2;
|
|
738
738
|
else return this.toRadix(t);
|
|
739
|
-
var c = (1 << e) - 1, b,
|
|
739
|
+
var c = (1 << e) - 1, b, P = !1, L = "", M = this.t, N = this.DB - M * this.DB % e;
|
|
740
740
|
if (M-- > 0)
|
|
741
|
-
for (N < this.DB && (b = this[M] >> N) > 0 && (
|
|
742
|
-
N < e ? (b = (this[M] & (1 << N) - 1) << e - N, b |= this[--M] >> (N += this.DB - e)) : (b = this[M] >> (N -= e) & c, N <= 0 && (N += this.DB, --M)), b > 0 && (
|
|
743
|
-
return
|
|
741
|
+
for (N < this.DB && (b = this[M] >> N) > 0 && (P = !0, L = i(b)); M >= 0; )
|
|
742
|
+
N < e ? (b = (this[M] & (1 << N) - 1) << e - N, b |= this[--M] >> (N += this.DB - e)) : (b = this[M] >> (N -= e) & c, N <= 0 && (N += this.DB, --M)), b > 0 && (P = !0), P && (L += i(b));
|
|
743
|
+
return P ? L : "0";
|
|
744
744
|
}
|
|
745
745
|
function T() {
|
|
746
746
|
var t = m();
|
|
@@ -775,9 +775,9 @@ function Mt() {
|
|
|
775
775
|
e.t = Math.max(this.t - t, 0), e.s = this.s;
|
|
776
776
|
}
|
|
777
777
|
function W(t, e) {
|
|
778
|
-
var c = t % this.DB, b = this.DB - c,
|
|
778
|
+
var c = t % this.DB, b = this.DB - c, P = (1 << b) - 1, L = Math.floor(t / this.DB), M = this.s << c & this.DM, N;
|
|
779
779
|
for (N = this.t - 1; N >= 0; --N)
|
|
780
|
-
e[N + L + 1] = this[N] >> b | M, M = (this[N] &
|
|
780
|
+
e[N + L + 1] = this[N] >> b | M, M = (this[N] & P) << c;
|
|
781
781
|
for (N = L - 1; N >= 0; --N) e[N] = 0;
|
|
782
782
|
e[L] = M, e.t = this.t + L + 1, e.s = this.s, e.clamp();
|
|
783
783
|
}
|
|
@@ -788,14 +788,14 @@ function Mt() {
|
|
|
788
788
|
e.t = 0;
|
|
789
789
|
return;
|
|
790
790
|
}
|
|
791
|
-
var b = t % this.DB,
|
|
791
|
+
var b = t % this.DB, P = this.DB - b, L = (1 << b) - 1;
|
|
792
792
|
e[0] = this[c] >> b;
|
|
793
793
|
for (var M = c + 1; M < this.t; ++M)
|
|
794
|
-
e[M - c - 1] |= (this[M] & L) <<
|
|
795
|
-
b > 0 && (e[this.t - c - 1] |= (this.s & L) <<
|
|
794
|
+
e[M - c - 1] |= (this[M] & L) << P, e[M - c] = this[M] >> b;
|
|
795
|
+
b > 0 && (e[this.t - c - 1] |= (this.s & L) << P), e.t = this.t - c, e.clamp();
|
|
796
796
|
}
|
|
797
797
|
function V(t, e) {
|
|
798
|
-
for (var c = 0, b = 0,
|
|
798
|
+
for (var c = 0, b = 0, P = Math.min(t.t, this.t); c < P; )
|
|
799
799
|
b += this[c] - t[c], e[c++] = b & this.DM, b >>= this.DB;
|
|
800
800
|
if (t.t < this.t) {
|
|
801
801
|
for (b -= t.s; c < this.t; )
|
|
@@ -809,9 +809,9 @@ function Mt() {
|
|
|
809
809
|
e.s = b < 0 ? -1 : 0, b < -1 ? e[c++] = this.DV + b : b > 0 && (e[c++] = b), e.t = c, e.clamp();
|
|
810
810
|
}
|
|
811
811
|
function X(t, e) {
|
|
812
|
-
var c = this.abs(), b = t.abs(),
|
|
813
|
-
for (e.t =
|
|
814
|
-
for (
|
|
812
|
+
var c = this.abs(), b = t.abs(), P = c.t;
|
|
813
|
+
for (e.t = P + b.t; --P >= 0; ) e[P] = 0;
|
|
814
|
+
for (P = 0; P < b.t; ++P) e[P + c.t] = c.am(0, b[P], e, P, 0, c.t);
|
|
815
815
|
e.s = 0, e.clamp(), this.s != t.s && B.ZERO.subTo(e, e);
|
|
816
816
|
}
|
|
817
817
|
function G(t) {
|
|
@@ -825,14 +825,14 @@ function Mt() {
|
|
|
825
825
|
function Z(t, e, c) {
|
|
826
826
|
var b = t.abs();
|
|
827
827
|
if (!(b.t <= 0)) {
|
|
828
|
-
var
|
|
829
|
-
if (
|
|
828
|
+
var P = this.abs();
|
|
829
|
+
if (P.t < b.t) {
|
|
830
830
|
e != null && e.fromInt(0), c != null && this.copyTo(c);
|
|
831
831
|
return;
|
|
832
832
|
}
|
|
833
833
|
c == null && (c = m());
|
|
834
834
|
var L = m(), M = this.s, N = t.s, J = this.DB - w(b[b.t - 1]);
|
|
835
|
-
J > 0 ? (b.lShiftTo(J, L),
|
|
835
|
+
J > 0 ? (b.lShiftTo(J, L), P.lShiftTo(J, c)) : (b.copyTo(L), P.copyTo(c));
|
|
836
836
|
var r0 = L.t, l0 = L[r0 - 1];
|
|
837
837
|
if (l0 != 0) {
|
|
838
838
|
var h0 = l0 * (1 << this.F1) + (r0 > 1 ? L[r0 - 2] >> this.F2 : 0), A0 = this.FV / h0, et = (1 << this.F1) / h0, d0 = 1 << this.F2, p0 = c.t, xt = p0 - r0, g0 = e ?? m();
|
|
@@ -846,7 +846,7 @@ function Mt() {
|
|
|
846
846
|
}
|
|
847
847
|
}
|
|
848
848
|
}
|
|
849
|
-
function
|
|
849
|
+
function H(t) {
|
|
850
850
|
var e = m();
|
|
851
851
|
return this.abs().divRemTo(t, null, e), this.s < 0 && e.compareTo(B.ZERO) > 0 && t.subTo(e, e), e;
|
|
852
852
|
}
|
|
@@ -909,9 +909,9 @@ function Mt() {
|
|
|
909
909
|
}
|
|
910
910
|
function w0(t, e) {
|
|
911
911
|
if (t > 4294967295 || t < 1) return B.ONE;
|
|
912
|
-
var c = m(), b = m(),
|
|
913
|
-
for (
|
|
914
|
-
if (e.sqrTo(c, b), (t & 1 << L) > 0) e.mulTo(b,
|
|
912
|
+
var c = m(), b = m(), P = e.convert(this), L = w(t) - 1;
|
|
913
|
+
for (P.copyTo(c); --L >= 0; )
|
|
914
|
+
if (e.sqrTo(c, b), (t & 1 << L) > 0) e.mulTo(b, P, c);
|
|
915
915
|
else {
|
|
916
916
|
var M = c;
|
|
917
917
|
c = b, b = M;
|
|
@@ -922,7 +922,7 @@ function Mt() {
|
|
|
922
922
|
var c;
|
|
923
923
|
return t < 256 || e.isEven() ? c = new R(e) : c = new a0(e), this.exp(t, c);
|
|
924
924
|
}
|
|
925
|
-
B.prototype.copyTo = x, B.prototype.fromInt = n, B.prototype.fromString = d, B.prototype.clamp = A, B.prototype.dlShiftTo = S, B.prototype.drShiftTo = U, B.prototype.lShiftTo = W, B.prototype.rShiftTo = $, B.prototype.subTo = V, B.prototype.multiplyTo = X, B.prototype.squareTo = G, B.prototype.divRemTo = Z, B.prototype.invDigit = K, B.prototype.isEven = P0, B.prototype.exp = w0, B.prototype.toString = _, B.prototype.negate = T, B.prototype.abs = q, B.prototype.compareTo = D, B.prototype.bitLength = k, B.prototype.mod =
|
|
925
|
+
B.prototype.copyTo = x, B.prototype.fromInt = n, B.prototype.fromString = d, B.prototype.clamp = A, B.prototype.dlShiftTo = S, B.prototype.drShiftTo = U, B.prototype.lShiftTo = W, B.prototype.rShiftTo = $, B.prototype.subTo = V, B.prototype.multiplyTo = X, B.prototype.squareTo = G, B.prototype.divRemTo = Z, B.prototype.invDigit = K, B.prototype.isEven = P0, B.prototype.exp = w0, B.prototype.toString = _, B.prototype.negate = T, B.prototype.abs = q, B.prototype.compareTo = D, B.prototype.bitLength = k, B.prototype.mod = H, B.prototype.modPowInt = z0, B.ZERO = u(0), B.ONE = u(1);
|
|
926
926
|
function _0() {
|
|
927
927
|
var t = m();
|
|
928
928
|
return this.copyTo(t), t;
|
|
@@ -951,22 +951,22 @@ function Mt() {
|
|
|
951
951
|
}
|
|
952
952
|
function I0(t) {
|
|
953
953
|
if (t == null && (t = 10), this.signum() == 0 || t < 2 || t > 36) return "0";
|
|
954
|
-
var e = this.chunkSize(t), c = Math.pow(t, e), b = u(c),
|
|
955
|
-
for (this.divRemTo(b,
|
|
956
|
-
M = (c + L.intValue()).toString(t).substr(1) + M,
|
|
954
|
+
var e = this.chunkSize(t), c = Math.pow(t, e), b = u(c), P = m(), L = m(), M = "";
|
|
955
|
+
for (this.divRemTo(b, P, L); P.signum() > 0; )
|
|
956
|
+
M = (c + L.intValue()).toString(t).substr(1) + M, P.divRemTo(b, P, L);
|
|
957
957
|
return L.intValue().toString(t) + M;
|
|
958
958
|
}
|
|
959
959
|
function $0(t, e) {
|
|
960
960
|
this.fromInt(0), e == null && (e = 10);
|
|
961
|
-
for (var c = this.chunkSize(e), b = Math.pow(e, c),
|
|
961
|
+
for (var c = this.chunkSize(e), b = Math.pow(e, c), P = !1, L = 0, M = 0, N = 0; N < t.length; ++N) {
|
|
962
962
|
var J = p(t, N);
|
|
963
963
|
if (J < 0) {
|
|
964
|
-
t.charAt(N) == "-" && this.signum() == 0 && (
|
|
964
|
+
t.charAt(N) == "-" && this.signum() == 0 && (P = !0);
|
|
965
965
|
continue;
|
|
966
966
|
}
|
|
967
967
|
M = e * M + J, ++L >= c && (this.dMultiply(b), this.dAddOffset(M, 0), L = 0, M = 0);
|
|
968
968
|
}
|
|
969
|
-
L > 0 && (this.dMultiply(Math.pow(e, L)), this.dAddOffset(M, 0)),
|
|
969
|
+
L > 0 && (this.dMultiply(Math.pow(e, L)), this.dAddOffset(M, 0)), P && B.ZERO.subTo(this, this);
|
|
970
970
|
}
|
|
971
971
|
function y0(t, e, c) {
|
|
972
972
|
if (typeof e == "number")
|
|
@@ -975,17 +975,17 @@ function Mt() {
|
|
|
975
975
|
for (this.fromNumber(t, c), this.testBit(t - 1) || this.bitwiseTo(B.ONE.shiftLeft(t - 1), L0, this), this.isEven() && this.dAddOffset(1, 0); !this.isProbablePrime(e); )
|
|
976
976
|
this.dAddOffset(2, 0), this.bitLength() > t && this.subTo(B.ONE.shiftLeft(t - 1), this);
|
|
977
977
|
else {
|
|
978
|
-
var b = new Array(),
|
|
979
|
-
b.length = (t >> 3) + 1, e.nextBytes(b),
|
|
978
|
+
var b = new Array(), P = t & 7;
|
|
979
|
+
b.length = (t >> 3) + 1, e.nextBytes(b), P > 0 ? b[0] &= (1 << P) - 1 : b[0] = 0, this.fromString(b, 256);
|
|
980
980
|
}
|
|
981
981
|
}
|
|
982
982
|
function k0() {
|
|
983
983
|
var t = this.t, e = new Array();
|
|
984
984
|
e[0] = this.s;
|
|
985
|
-
var c = this.DB - t * this.DB % 8, b,
|
|
985
|
+
var c = this.DB - t * this.DB % 8, b, P = 0;
|
|
986
986
|
if (t-- > 0)
|
|
987
|
-
for (c < this.DB && (b = this[t] >> c) != (this.s & this.DM) >> c && (e[
|
|
988
|
-
c < 8 ? (b = (this[t] & (1 << c) - 1) << 8 - c, b |= this[--t] >> (c += this.DB - 8)) : (b = this[t] >> (c -= 8) & 255, c <= 0 && (c += this.DB, --t)), (b & 128) != 0 && (b |= -256),
|
|
987
|
+
for (c < this.DB && (b = this[t] >> c) != (this.s & this.DM) >> c && (e[P++] = b | this.s << this.DB - c); t >= 0; )
|
|
988
|
+
c < 8 ? (b = (this[t] & (1 << c) - 1) << 8 - c, b |= this[--t] >> (c += this.DB - 8)) : (b = this[t] >> (c -= 8) & 255, c <= 0 && (c += this.DB, --t)), (b & 128) != 0 && (b |= -256), P == 0 && (this.s & 128) != (b & 128) && ++P, (P > 0 || b != this.s) && (e[P++] = b);
|
|
989
989
|
return e;
|
|
990
990
|
}
|
|
991
991
|
function Wt(t) {
|
|
@@ -998,13 +998,13 @@ function Mt() {
|
|
|
998
998
|
return this.compareTo(t) > 0 ? this : t;
|
|
999
999
|
}
|
|
1000
1000
|
function D0(t, e, c) {
|
|
1001
|
-
var b,
|
|
1001
|
+
var b, P, L = Math.min(t.t, this.t);
|
|
1002
1002
|
for (b = 0; b < L; ++b) c[b] = e(this[b], t[b]);
|
|
1003
1003
|
if (t.t < this.t) {
|
|
1004
|
-
for (
|
|
1004
|
+
for (P = t.s & this.DM, b = L; b < this.t; ++b) c[b] = e(this[b], P);
|
|
1005
1005
|
c.t = this.t;
|
|
1006
1006
|
} else {
|
|
1007
|
-
for (
|
|
1007
|
+
for (P = this.s & this.DM, b = L; b < t.t; ++b) c[b] = e(P, t[b]);
|
|
1008
1008
|
c.t = t.t;
|
|
1009
1009
|
}
|
|
1010
1010
|
c.s = e(this.s, t.s), c.clamp();
|
|
@@ -1086,7 +1086,7 @@ function Mt() {
|
|
|
1086
1086
|
return this.changeBit(t, j0);
|
|
1087
1087
|
}
|
|
1088
1088
|
function i0(t, e) {
|
|
1089
|
-
for (var c = 0, b = 0,
|
|
1089
|
+
for (var c = 0, b = 0, P = Math.min(t.t, this.t); c < P; )
|
|
1090
1090
|
b += this[c] + t[c], e[c++] = b & this.DM, b >>= this.DB;
|
|
1091
1091
|
if (t.t < this.t) {
|
|
1092
1092
|
for (b += t.s; c < this.t; )
|
|
@@ -1111,26 +1111,26 @@ function Mt() {
|
|
|
1111
1111
|
var e = m();
|
|
1112
1112
|
return this.multiplyTo(t, e), e;
|
|
1113
1113
|
}
|
|
1114
|
-
function
|
|
1114
|
+
function ge() {
|
|
1115
1115
|
var t = m();
|
|
1116
1116
|
return this.squareTo(t), t;
|
|
1117
1117
|
}
|
|
1118
|
-
function
|
|
1118
|
+
function be(t) {
|
|
1119
1119
|
var e = m();
|
|
1120
1120
|
return this.divRemTo(t, e, null), e;
|
|
1121
1121
|
}
|
|
1122
|
-
function
|
|
1122
|
+
function me(t) {
|
|
1123
1123
|
var e = m();
|
|
1124
1124
|
return this.divRemTo(t, null, e), e;
|
|
1125
1125
|
}
|
|
1126
|
-
function
|
|
1126
|
+
function we(t) {
|
|
1127
1127
|
var e = m(), c = m();
|
|
1128
1128
|
return this.divRemTo(t, e, c), new Array(e, c);
|
|
1129
1129
|
}
|
|
1130
|
-
function
|
|
1130
|
+
function _e(t) {
|
|
1131
1131
|
this[this.t] = this.am(0, t - 1, this, 0, 0, this.t), ++this.t, this.clamp();
|
|
1132
1132
|
}
|
|
1133
|
-
function
|
|
1133
|
+
function Te(t, e) {
|
|
1134
1134
|
if (t != 0) {
|
|
1135
1135
|
for (; this.t <= e; ) this[this.t++] = 0;
|
|
1136
1136
|
for (this[e] += t; this[e] >= this.DV; )
|
|
@@ -1142,25 +1142,25 @@ function Mt() {
|
|
|
1142
1142
|
function Er(t) {
|
|
1143
1143
|
return t;
|
|
1144
1144
|
}
|
|
1145
|
-
function
|
|
1145
|
+
function ke(t, e, c) {
|
|
1146
1146
|
t.multiplyTo(e, c);
|
|
1147
1147
|
}
|
|
1148
|
-
function
|
|
1148
|
+
function Se(t, e) {
|
|
1149
1149
|
t.squareTo(e);
|
|
1150
1150
|
}
|
|
1151
|
-
N0.prototype.convert = Er, N0.prototype.revert = Er, N0.prototype.mulTo =
|
|
1152
|
-
function
|
|
1151
|
+
N0.prototype.convert = Er, N0.prototype.revert = Er, N0.prototype.mulTo = ke, N0.prototype.sqrTo = Se;
|
|
1152
|
+
function Re(t) {
|
|
1153
1153
|
return this.exp(t, new N0());
|
|
1154
1154
|
}
|
|
1155
|
-
function
|
|
1155
|
+
function qe(t, e, c) {
|
|
1156
1156
|
var b = Math.min(this.t + t.t, e);
|
|
1157
1157
|
for (c.s = 0, c.t = b; b > 0; ) c[--b] = 0;
|
|
1158
|
-
var
|
|
1159
|
-
for (
|
|
1160
|
-
for (
|
|
1158
|
+
var P;
|
|
1159
|
+
for (P = c.t - this.t; b < P; ++b) c[b + this.t] = this.am(0, t[b], c, b, 0, this.t);
|
|
1160
|
+
for (P = Math.min(t.t, e); b < P; ++b) this.am(0, t[b], c, b, 0, e - b);
|
|
1161
1161
|
c.clamp();
|
|
1162
1162
|
}
|
|
1163
|
-
function
|
|
1163
|
+
function He(t, e, c) {
|
|
1164
1164
|
--e;
|
|
1165
1165
|
var b = c.t = this.t + t.t - e;
|
|
1166
1166
|
for (c.s = 0; --b >= 0; ) c[b] = 0;
|
|
@@ -1171,29 +1171,29 @@ function Mt() {
|
|
|
1171
1171
|
function R0(t) {
|
|
1172
1172
|
this.r2 = m(), this.q3 = m(), B.ONE.dlShiftTo(2 * t.t, this.r2), this.mu = this.r2.divide(t), this.m = t;
|
|
1173
1173
|
}
|
|
1174
|
-
function
|
|
1174
|
+
function Pe(t) {
|
|
1175
1175
|
if (t.s < 0 || t.t > 2 * this.m.t) return t.mod(this.m);
|
|
1176
1176
|
if (t.compareTo(this.m) < 0) return t;
|
|
1177
1177
|
var e = m();
|
|
1178
1178
|
return t.copyTo(e), this.reduce(e), e;
|
|
1179
1179
|
}
|
|
1180
|
-
function
|
|
1180
|
+
function ze(t) {
|
|
1181
1181
|
return t;
|
|
1182
1182
|
}
|
|
1183
|
-
function
|
|
1183
|
+
function Ie(t) {
|
|
1184
1184
|
for (t.drShiftTo(this.m.t - 1, this.r2), t.t > this.m.t + 1 && (t.t = this.m.t + 1, t.clamp()), this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3), this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2); t.compareTo(this.r2) < 0; ) t.dAddOffset(1, this.m.t + 1);
|
|
1185
1185
|
for (t.subTo(this.r2, t); t.compareTo(this.m) >= 0; ) t.subTo(this.m, t);
|
|
1186
1186
|
}
|
|
1187
|
-
function
|
|
1187
|
+
function Le(t, e) {
|
|
1188
1188
|
t.squareTo(e), this.reduce(e);
|
|
1189
1189
|
}
|
|
1190
|
-
function
|
|
1190
|
+
function Oe(t, e, c) {
|
|
1191
1191
|
t.multiplyTo(e, c), this.reduce(c);
|
|
1192
1192
|
}
|
|
1193
|
-
R0.prototype.convert =
|
|
1194
|
-
function
|
|
1195
|
-
var c = t.bitLength(), b,
|
|
1196
|
-
if (c <= 0) return
|
|
1193
|
+
R0.prototype.convert = Pe, R0.prototype.revert = ze, R0.prototype.reduce = Ie, R0.prototype.mulTo = Oe, R0.prototype.sqrTo = Le;
|
|
1194
|
+
function Ue(t, e) {
|
|
1195
|
+
var c = t.bitLength(), b, P = u(1), L;
|
|
1196
|
+
if (c <= 0) return P;
|
|
1197
1197
|
c < 18 ? b = 1 : c < 48 ? b = 3 : c < 144 ? b = 4 : c < 768 ? b = 5 : b = 6, c < 8 ? L = new R(e) : e.isEven() ? L = new R0(e) : L = new a0(e);
|
|
1198
1198
|
var M = new Array(), N = 3, J = b - 1, r0 = (1 << b) - 1;
|
|
1199
1199
|
if (M[1] = L.convert(this), b > 1) {
|
|
@@ -1206,30 +1206,30 @@ function Mt() {
|
|
|
1206
1206
|
for (c >= J ? A0 = t[h0] >> c - J & r0 : (A0 = (t[h0] & (1 << c + 1) - 1) << J - c, h0 > 0 && (A0 |= t[h0 - 1] >> this.DB + c - J)), N = b; (A0 & 1) == 0; )
|
|
1207
1207
|
A0 >>= 1, --N;
|
|
1208
1208
|
if ((c -= N) < 0 && (c += this.DB, --h0), et)
|
|
1209
|
-
M[A0].copyTo(
|
|
1209
|
+
M[A0].copyTo(P), et = !1;
|
|
1210
1210
|
else {
|
|
1211
1211
|
for (; N > 1; )
|
|
1212
|
-
L.sqrTo(
|
|
1213
|
-
N > 0 ? L.sqrTo(
|
|
1212
|
+
L.sqrTo(P, d0), L.sqrTo(d0, P), N -= 2;
|
|
1213
|
+
N > 0 ? L.sqrTo(P, d0) : (p0 = P, P = d0, d0 = p0), L.mulTo(d0, M[A0], P);
|
|
1214
1214
|
}
|
|
1215
1215
|
for (; h0 >= 0 && (t[h0] & 1 << c) == 0; )
|
|
1216
|
-
L.sqrTo(
|
|
1216
|
+
L.sqrTo(P, d0), p0 = P, P = d0, d0 = p0, --c < 0 && (c = this.DB - 1, --h0);
|
|
1217
1217
|
}
|
|
1218
|
-
return L.revert(
|
|
1218
|
+
return L.revert(P);
|
|
1219
1219
|
}
|
|
1220
|
-
function
|
|
1220
|
+
function Me(t) {
|
|
1221
1221
|
var e = this.s < 0 ? this.negate() : this.clone(), c = t.s < 0 ? t.negate() : t.clone();
|
|
1222
1222
|
if (e.compareTo(c) < 0) {
|
|
1223
1223
|
var b = e;
|
|
1224
1224
|
e = c, c = b;
|
|
1225
1225
|
}
|
|
1226
|
-
var
|
|
1226
|
+
var P = e.getLowestSetBit(), L = c.getLowestSetBit();
|
|
1227
1227
|
if (L < 0) return e;
|
|
1228
|
-
for (
|
|
1229
|
-
(
|
|
1228
|
+
for (P < L && (L = P), L > 0 && (e.rShiftTo(L, e), c.rShiftTo(L, c)); e.signum() > 0; )
|
|
1229
|
+
(P = e.getLowestSetBit()) > 0 && e.rShiftTo(P, e), (P = c.getLowestSetBit()) > 0 && c.rShiftTo(P, c), e.compareTo(c) >= 0 ? (e.subTo(c, e), e.rShiftTo(1, e)) : (c.subTo(e, c), c.rShiftTo(1, c));
|
|
1230
1230
|
return L > 0 && c.lShiftTo(L, c), c;
|
|
1231
1231
|
}
|
|
1232
|
-
function
|
|
1232
|
+
function Ne(t) {
|
|
1233
1233
|
if (t <= 0) return 0;
|
|
1234
1234
|
var e = this.DV % t, c = this.s < 0 ? t - 1 : 0;
|
|
1235
1235
|
if (this.t > 0)
|
|
@@ -1237,15 +1237,15 @@ function Mt() {
|
|
|
1237
1237
|
else for (var b = this.t - 1; b >= 0; --b) c = (e * c + this[b]) % t;
|
|
1238
1238
|
return c;
|
|
1239
1239
|
}
|
|
1240
|
-
function
|
|
1240
|
+
function We(t) {
|
|
1241
1241
|
var e = t.isEven();
|
|
1242
1242
|
if (this.isEven() && e || t.signum() == 0) return B.ZERO;
|
|
1243
|
-
for (var c = t.clone(), b = this.clone(),
|
|
1243
|
+
for (var c = t.clone(), b = this.clone(), P = u(1), L = u(0), M = u(0), N = u(1); c.signum() != 0; ) {
|
|
1244
1244
|
for (; c.isEven(); )
|
|
1245
|
-
c.rShiftTo(1, c), e ? ((!
|
|
1245
|
+
c.rShiftTo(1, c), e ? ((!P.isEven() || !L.isEven()) && (P.addTo(this, P), L.subTo(t, L)), P.rShiftTo(1, P)) : L.isEven() || L.subTo(t, L), L.rShiftTo(1, L);
|
|
1246
1246
|
for (; b.isEven(); )
|
|
1247
1247
|
b.rShiftTo(1, b), e ? ((!M.isEven() || !N.isEven()) && (M.addTo(this, M), N.subTo(t, N)), M.rShiftTo(1, M)) : N.isEven() || N.subTo(t, N), N.rShiftTo(1, N);
|
|
1248
|
-
c.compareTo(b) >= 0 ? (c.subTo(b, c), e &&
|
|
1248
|
+
c.compareTo(b) >= 0 ? (c.subTo(b, c), e && P.subTo(M, P), L.subTo(N, L)) : (b.subTo(c, b), e && M.subTo(P, M), N.subTo(L, N));
|
|
1249
1249
|
}
|
|
1250
1250
|
if (b.compareTo(B.ONE) != 0) return B.ZERO;
|
|
1251
1251
|
if (N.compareTo(t) >= 0) return N.subtract(t);
|
|
@@ -1253,8 +1253,8 @@ function Mt() {
|
|
|
1253
1253
|
else return N;
|
|
1254
1254
|
return N.signum() < 0 ? N.add(t) : N;
|
|
1255
1255
|
}
|
|
1256
|
-
var o0 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997],
|
|
1257
|
-
function
|
|
1256
|
+
var o0 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997], $e = (1 << 26) / o0[o0.length - 1];
|
|
1257
|
+
function Ke(t) {
|
|
1258
1258
|
var e, c = this.abs();
|
|
1259
1259
|
if (c.t == 1 && c[0] <= o0[o0.length - 1]) {
|
|
1260
1260
|
for (e = 0; e < o0.length; ++e)
|
|
@@ -1263,19 +1263,19 @@ function Mt() {
|
|
|
1263
1263
|
}
|
|
1264
1264
|
if (c.isEven()) return !1;
|
|
1265
1265
|
for (e = 1; e < o0.length; ) {
|
|
1266
|
-
for (var b = o0[e],
|
|
1267
|
-
for (b = c.modInt(b); e <
|
|
1266
|
+
for (var b = o0[e], P = e + 1; P < o0.length && b < $e; ) b *= o0[P++];
|
|
1267
|
+
for (b = c.modInt(b); e < P; ) if (b % o0[e++] == 0) return !1;
|
|
1268
1268
|
}
|
|
1269
1269
|
return c.millerRabin(t);
|
|
1270
1270
|
}
|
|
1271
|
-
function
|
|
1271
|
+
function Ve(t) {
|
|
1272
1272
|
var e = this.subtract(B.ONE), c = e.getLowestSetBit();
|
|
1273
1273
|
if (c <= 0) return !1;
|
|
1274
1274
|
var b = e.shiftRight(c);
|
|
1275
1275
|
t = t + 1 >> 1, t > o0.length && (t = o0.length);
|
|
1276
|
-
for (var
|
|
1277
|
-
|
|
1278
|
-
var M =
|
|
1276
|
+
for (var P = m(), L = 0; L < t; ++L) {
|
|
1277
|
+
P.fromInt(o0[Math.floor(Math.random() * o0.length)]);
|
|
1278
|
+
var M = P.modPow(b, this);
|
|
1279
1279
|
if (M.compareTo(B.ONE) != 0 && M.compareTo(e) != 0) {
|
|
1280
1280
|
for (var N = 1; N++ < c && M.compareTo(e) != 0; )
|
|
1281
1281
|
if (M = M.modPowInt(2, this), M.compareTo(B.ONE) == 0) return !1;
|
|
@@ -1284,13 +1284,13 @@ function Mt() {
|
|
|
1284
1284
|
}
|
|
1285
1285
|
return !0;
|
|
1286
1286
|
}
|
|
1287
|
-
B.prototype.chunkSize = s0, B.prototype.toRadix = I0, B.prototype.fromRadix = $0, B.prototype.fromNumber = y0, B.prototype.bitwiseTo = D0, B.prototype.changeBit = Qt, B.prototype.addTo = i0, B.prototype.dMultiply =
|
|
1287
|
+
B.prototype.chunkSize = s0, B.prototype.toRadix = I0, B.prototype.fromRadix = $0, B.prototype.fromNumber = y0, B.prototype.bitwiseTo = D0, B.prototype.changeBit = Qt, B.prototype.addTo = i0, B.prototype.dMultiply = _e, B.prototype.dAddOffset = Te, B.prototype.multiplyLowerTo = qe, B.prototype.multiplyUpperTo = He, B.prototype.modInt = Ne, B.prototype.millerRabin = Ve, B.prototype.clone = _0, B.prototype.intValue = U0, B.prototype.byteValue = T0, B.prototype.shortValue = c0, B.prototype.signum = F0, B.prototype.toByteArray = k0, B.prototype.equals = Wt, B.prototype.min = K0, B.prototype.max = V0, B.prototype.and = $t, B.prototype.or = X0, B.prototype.xor = Kt, B.prototype.andNot = Vt, B.prototype.not = Z0, B.prototype.shiftLeft = Xt, B.prototype.shiftRight = G0, B.prototype.getLowestSetBit = Zt, B.prototype.bitCount = Y0, B.prototype.testBit = Yt, B.prototype.setBit = Q0, B.prototype.clearBit = Jt, B.prototype.flipBit = J0, B.prototype.add = C0, B.prototype.subtract = tt, B.prototype.multiply = tr, B.prototype.divide = be, B.prototype.remainder = me, B.prototype.divideAndRemainder = we, B.prototype.modPow = Ue, B.prototype.modInverse = We, B.prototype.pow = Re, B.prototype.gcd = Me, B.prototype.isProbablePrime = Ke, B.prototype.square = ge, B.prototype.Barrett = R0;
|
|
1288
1288
|
var rt, u0, t0;
|
|
1289
|
-
function
|
|
1289
|
+
function Xe(t) {
|
|
1290
1290
|
u0[t0++] ^= t & 255, u0[t0++] ^= t >> 8 & 255, u0[t0++] ^= t >> 16 & 255, u0[t0++] ^= t >> 24 & 255, t0 >= er && (t0 -= er);
|
|
1291
1291
|
}
|
|
1292
1292
|
function yr() {
|
|
1293
|
-
|
|
1293
|
+
Xe((/* @__PURE__ */ new Date()).getTime());
|
|
1294
1294
|
}
|
|
1295
1295
|
if (u0 == null) {
|
|
1296
1296
|
u0 = new Array(), t0 = 0;
|
|
@@ -1310,25 +1310,25 @@ function Mt() {
|
|
|
1310
1310
|
v0 = Math.floor(65536 * Math.random()), u0[t0++] = v0 >>> 8, u0[t0++] = v0 & 255;
|
|
1311
1311
|
t0 = 0, yr();
|
|
1312
1312
|
}
|
|
1313
|
-
function
|
|
1313
|
+
function je() {
|
|
1314
1314
|
if (rt == null) {
|
|
1315
|
-
for (yr(), rt =
|
|
1315
|
+
for (yr(), rt = Qe(), rt.init(u0), t0 = 0; t0 < u0.length; ++t0)
|
|
1316
1316
|
u0[t0] = 0;
|
|
1317
1317
|
t0 = 0;
|
|
1318
1318
|
}
|
|
1319
1319
|
return rt.next();
|
|
1320
1320
|
}
|
|
1321
|
-
function
|
|
1321
|
+
function Ze(t) {
|
|
1322
1322
|
var e;
|
|
1323
|
-
for (e = 0; e < t.length; ++e) t[e] =
|
|
1323
|
+
for (e = 0; e < t.length; ++e) t[e] = je();
|
|
1324
1324
|
}
|
|
1325
1325
|
function br() {
|
|
1326
1326
|
}
|
|
1327
|
-
br.prototype.nextBytes =
|
|
1327
|
+
br.prototype.nextBytes = Ze;
|
|
1328
1328
|
function rr() {
|
|
1329
1329
|
this.i = 0, this.j = 0, this.S = new Array();
|
|
1330
1330
|
}
|
|
1331
|
-
function
|
|
1331
|
+
function Ge(t) {
|
|
1332
1332
|
var e, c, b;
|
|
1333
1333
|
for (e = 0; e < 256; ++e)
|
|
1334
1334
|
this.S[e] = e;
|
|
@@ -1336,12 +1336,12 @@ function Mt() {
|
|
|
1336
1336
|
c = c + this.S[e] + t[e % t.length] & 255, b = this.S[e], this.S[e] = this.S[c], this.S[c] = b;
|
|
1337
1337
|
this.i = 0, this.j = 0;
|
|
1338
1338
|
}
|
|
1339
|
-
function
|
|
1339
|
+
function Ye() {
|
|
1340
1340
|
var t;
|
|
1341
1341
|
return this.i = this.i + 1 & 255, this.j = this.j + this.S[this.i] & 255, t = this.S[this.i], this.S[this.i] = this.S[this.j], this.S[this.j] = t, this.S[t + this.S[this.i] & 255];
|
|
1342
1342
|
}
|
|
1343
|
-
rr.prototype.init =
|
|
1344
|
-
function
|
|
1343
|
+
rr.prototype.init = Ge, rr.prototype.next = Ye;
|
|
1344
|
+
function Qe() {
|
|
1345
1345
|
return new rr();
|
|
1346
1346
|
}
|
|
1347
1347
|
var er = 256;
|
|
@@ -1350,15 +1350,15 @@ function Mt() {
|
|
|
1350
1350
|
BigInteger: B,
|
|
1351
1351
|
SecureRandom: br
|
|
1352
1352
|
};
|
|
1353
|
-
}).call(
|
|
1353
|
+
}).call(sx);
|
|
1354
1354
|
}(nt)), nt.exports;
|
|
1355
1355
|
}
|
|
1356
1356
|
var ar, Sr;
|
|
1357
|
-
function
|
|
1357
|
+
function ax() {
|
|
1358
1358
|
if (Sr) return ar;
|
|
1359
1359
|
Sr = 1;
|
|
1360
1360
|
const { BigInteger: y } = Mt();
|
|
1361
|
-
function
|
|
1361
|
+
function z(v) {
|
|
1362
1362
|
let r = v.toString(16);
|
|
1363
1363
|
if (r[0] !== "-")
|
|
1364
1364
|
r.length % 2 === 1 ? r = "0" + r : r.match(/^[0-7]/) || (r = "00" + r);
|
|
@@ -1393,7 +1393,7 @@ function cx() {
|
|
|
1393
1393
|
}
|
|
1394
1394
|
class a extends E {
|
|
1395
1395
|
constructor(r) {
|
|
1396
|
-
super(), this.t = "02", r && (this.v =
|
|
1396
|
+
super(), this.t = "02", r && (this.v = z(r));
|
|
1397
1397
|
}
|
|
1398
1398
|
getValue() {
|
|
1399
1399
|
return this.v;
|
|
@@ -1436,10 +1436,10 @@ function cx() {
|
|
|
1436
1436
|
}, ar;
|
|
1437
1437
|
}
|
|
1438
1438
|
var fr, Rr;
|
|
1439
|
-
function
|
|
1439
|
+
function fx() {
|
|
1440
1440
|
if (Rr) return fr;
|
|
1441
1441
|
Rr = 1;
|
|
1442
|
-
const { BigInteger: y } = Mt(),
|
|
1442
|
+
const { BigInteger: y } = Mt(), z = new y("2"), E = new y("3");
|
|
1443
1443
|
class a {
|
|
1444
1444
|
constructor(o, v) {
|
|
1445
1445
|
this.x = v, this.q = o;
|
|
@@ -1620,7 +1620,7 @@ function ux() {
|
|
|
1620
1620
|
this.q.divide(new y("4")).add(y.ONE),
|
|
1621
1621
|
this.q
|
|
1622
1622
|
));
|
|
1623
|
-
return r.toBigInteger().mod(
|
|
1623
|
+
return r.toBigInteger().mod(z).equals(new y(o.substr(0, 2), 16).subtract(z)) || (r = r.negate()), new g(this, v, r);
|
|
1624
1624
|
case 4:
|
|
1625
1625
|
case 6:
|
|
1626
1626
|
case 7:
|
|
@@ -1637,10 +1637,10 @@ function ux() {
|
|
|
1637
1637
|
}, fr;
|
|
1638
1638
|
}
|
|
1639
1639
|
var cr, qr;
|
|
1640
|
-
function
|
|
1640
|
+
function cx() {
|
|
1641
1641
|
if (qr) return cr;
|
|
1642
1642
|
qr = 1;
|
|
1643
|
-
const { BigInteger: y, SecureRandom:
|
|
1643
|
+
const { BigInteger: y, SecureRandom: z } = Mt(), { ECCurveFp: E } = fx(), a = new z(), { curve: g, G: B, n: m } = v();
|
|
1644
1644
|
function o() {
|
|
1645
1645
|
return g;
|
|
1646
1646
|
}
|
|
@@ -1727,10 +1727,10 @@ function hx() {
|
|
|
1727
1727
|
}, cr;
|
|
1728
1728
|
}
|
|
1729
1729
|
var ur, Hr;
|
|
1730
|
-
function
|
|
1730
|
+
function Ee() {
|
|
1731
1731
|
if (Hr) return ur;
|
|
1732
1732
|
Hr = 1;
|
|
1733
|
-
const y = new Uint32Array(68),
|
|
1733
|
+
const y = new Uint32Array(68), z = new Uint32Array(64);
|
|
1734
1734
|
function E(C, f) {
|
|
1735
1735
|
const l = f & 31;
|
|
1736
1736
|
return C << l | C >>> 32 - l;
|
|
@@ -1760,18 +1760,18 @@ function De() {
|
|
|
1760
1760
|
} else f.length > 0 && (F[d] = parseInt(f, 2), f = "");
|
|
1761
1761
|
const i = new Uint8Array([...C, 128, ...h, ...F]), p = new DataView(i.buffer, 0), x = i.length / 64, n = new Uint32Array([1937774191, 1226093241, 388252375, 3666478592, 2842636476, 372324522, 3817729613, 2969243214]);
|
|
1762
1762
|
for (let d = 0; d < x; d++) {
|
|
1763
|
-
y.fill(0),
|
|
1763
|
+
y.fill(0), z.fill(0);
|
|
1764
1764
|
const A = 16 * d;
|
|
1765
1765
|
for (let R = 0; R < 16; R++)
|
|
1766
1766
|
y[R] = p.getUint32((A + R) * 4, !1);
|
|
1767
1767
|
for (let R = 16; R < 68; R++)
|
|
1768
1768
|
y[R] = B(y[R - 16] ^ y[R - 9] ^ E(y[R - 3], 15)) ^ E(y[R - 13], 7) ^ y[R - 6];
|
|
1769
1769
|
for (let R = 0; R < 64; R++)
|
|
1770
|
-
|
|
1770
|
+
z[R] = y[R] ^ y[R + 4];
|
|
1771
1771
|
const _ = 2043430169, T = 2055708042;
|
|
1772
|
-
let q = n[0], D = n[1], w = n[2], k = n[3], S = n[4], U = n[5], W = n[6], $ = n[7], V, X, G, Z,
|
|
1772
|
+
let q = n[0], D = n[1], w = n[2], k = n[3], S = n[4], U = n[5], W = n[6], $ = n[7], V, X, G, Z, H;
|
|
1773
1773
|
for (let R = 0; R < 64; R++)
|
|
1774
|
-
|
|
1774
|
+
H = R >= 0 && R <= 15 ? _ : T, V = E(E(q, 12) + S + E(H, R), 7), X = V ^ E(q, 12), G = (R >= 0 && R <= 15 ? q ^ D ^ w : q & D | q & w | D & w) + k + X + z[R], Z = (R >= 0 && R <= 15 ? S ^ U ^ W : S & U | ~S & W) + $ + V + y[R], k = w, w = E(D, 9), D = q, q = G, $ = W, W = E(U, 19), U = S, S = g(Z);
|
|
1775
1775
|
n[0] ^= q, n[1] ^= D, n[2] ^= w, n[3] ^= k, n[4] ^= S, n[5] ^= U, n[6] ^= W, n[7] ^= $;
|
|
1776
1776
|
}
|
|
1777
1777
|
const u = [];
|
|
@@ -1795,10 +1795,10 @@ function De() {
|
|
|
1795
1795
|
}, ur;
|
|
1796
1796
|
}
|
|
1797
1797
|
var hr, Pr;
|
|
1798
|
-
function
|
|
1798
|
+
function ux() {
|
|
1799
1799
|
if (Pr) return hr;
|
|
1800
1800
|
Pr = 1;
|
|
1801
|
-
const { BigInteger: y } = Mt(), { encodeDer:
|
|
1801
|
+
const { BigInteger: y } = Mt(), { encodeDer: z, decodeDer: E } = ax(), a = cx(), g = Ee().sm3, { G: B, curve: m, n: o } = a.generateEcparam(), v = 0;
|
|
1802
1802
|
function r(i, p, x = 1) {
|
|
1803
1803
|
i = typeof i == "string" ? a.hexToArray(a.utf8ToHex(i)) : Array.prototype.slice.call(i), p = a.getGlobalCurve().decodePointHex(p);
|
|
1804
1804
|
const n = a.generateKeyPairHex(), u = new y(n.privateKey, 16);
|
|
@@ -1849,7 +1849,7 @@ function lx() {
|
|
|
1849
1849
|
} while (w.equals(y.ZERO) || w.add(D).equals(o));
|
|
1850
1850
|
k = T.add(y.ONE).modInverse(o).multiply(D.subtract(w.multiply(T))).mod(o);
|
|
1851
1851
|
} while (k.equals(y.ZERO));
|
|
1852
|
-
return n ?
|
|
1852
|
+
return n ? z(w, k) : a.leftPad(w.toString(16), 64) + a.leftPad(k.toString(16), 64);
|
|
1853
1853
|
}
|
|
1854
1854
|
function f(i, p, x, { der: n, hash: u, userId: d } = {}) {
|
|
1855
1855
|
let A = typeof i == "string" ? a.utf8ToHex(i) : a.arrayToHex(i);
|
|
@@ -1902,10 +1902,10 @@ function lx() {
|
|
|
1902
1902
|
}, hr;
|
|
1903
1903
|
}
|
|
1904
1904
|
var lr, zr;
|
|
1905
|
-
function
|
|
1905
|
+
function hx() {
|
|
1906
1906
|
if (zr) return lr;
|
|
1907
1907
|
zr = 1;
|
|
1908
|
-
const { sm3: y, hmac:
|
|
1908
|
+
const { sm3: y, hmac: z } = Ee();
|
|
1909
1909
|
function E(m, o) {
|
|
1910
1910
|
return m.length >= o ? m : new Array(o - m.length + 1).join("0") + m;
|
|
1911
1911
|
}
|
|
@@ -1942,16 +1942,16 @@ function vx() {
|
|
|
1942
1942
|
if ((o.mode || "hmac") !== "hmac") throw new Error("invalid mode");
|
|
1943
1943
|
let r = o.key;
|
|
1944
1944
|
if (!r) throw new Error("invalid key");
|
|
1945
|
-
return r = typeof r == "string" ? g(r) : Array.prototype.slice.call(r), a(
|
|
1945
|
+
return r = typeof r == "string" ? g(r) : Array.prototype.slice.call(r), a(z(m, r));
|
|
1946
1946
|
}
|
|
1947
1947
|
return a(y(m));
|
|
1948
1948
|
}, lr;
|
|
1949
1949
|
}
|
|
1950
1950
|
var vr, Ir;
|
|
1951
|
-
function
|
|
1951
|
+
function lx() {
|
|
1952
1952
|
if (Ir) return vr;
|
|
1953
1953
|
Ir = 1;
|
|
1954
|
-
const y = 0,
|
|
1954
|
+
const y = 0, z = 32, E = 16, a = [
|
|
1955
1955
|
214,
|
|
1956
1956
|
144,
|
|
1957
1957
|
233,
|
|
@@ -2321,7 +2321,7 @@ function dx() {
|
|
|
2321
2321
|
const k = E - i.length % E;
|
|
2322
2322
|
for (let S = 0; S < k; S++) i.push(k);
|
|
2323
2323
|
}
|
|
2324
|
-
const _ = new Array(
|
|
2324
|
+
const _ = new Array(z);
|
|
2325
2325
|
h(p, _, x);
|
|
2326
2326
|
const T = [];
|
|
2327
2327
|
let q = d, D = i.length, w = 0;
|
|
@@ -2353,26 +2353,26 @@ function dx() {
|
|
|
2353
2353
|
}, vr;
|
|
2354
2354
|
}
|
|
2355
2355
|
var dr, Lr;
|
|
2356
|
-
function
|
|
2356
|
+
function vx() {
|
|
2357
2357
|
return Lr || (Lr = 1, dr = {
|
|
2358
|
-
sm2:
|
|
2359
|
-
sm3:
|
|
2360
|
-
sm4:
|
|
2358
|
+
sm2: ux(),
|
|
2359
|
+
sm3: hx(),
|
|
2360
|
+
sm4: lx()
|
|
2361
2361
|
}), dr;
|
|
2362
2362
|
}
|
|
2363
|
-
var
|
|
2364
|
-
function
|
|
2363
|
+
var dx = vx(), it = { exports: {} };
|
|
2364
|
+
function px(y) {
|
|
2365
2365
|
throw new Error('Could not dynamically require "' + y + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
|
|
2366
2366
|
}
|
|
2367
|
-
var ot = { exports: {} },
|
|
2367
|
+
var ot = { exports: {} }, Bx = ot.exports, Or;
|
|
2368
2368
|
function j() {
|
|
2369
|
-
return Or || (Or = 1, function(y,
|
|
2369
|
+
return Or || (Or = 1, function(y, z) {
|
|
2370
2370
|
(function(E, a) {
|
|
2371
2371
|
y.exports = a();
|
|
2372
|
-
})(
|
|
2372
|
+
})(Bx, function() {
|
|
2373
2373
|
var E = E || function(a, g) {
|
|
2374
2374
|
var B;
|
|
2375
|
-
if (typeof window < "u" && window.crypto && (B = window.crypto), typeof self < "u" && self.crypto && (B = self.crypto), typeof globalThis < "u" && globalThis.crypto && (B = globalThis.crypto), !B && typeof window < "u" && window.msCrypto && (B = window.msCrypto), !B && typeof nr < "u" && nr.crypto && (B = nr.crypto), !B && typeof
|
|
2375
|
+
if (typeof window < "u" && window.crypto && (B = window.crypto), typeof self < "u" && self.crypto && (B = self.crypto), typeof globalThis < "u" && globalThis.crypto && (B = globalThis.crypto), !B && typeof window < "u" && window.msCrypto && (B = window.msCrypto), !B && typeof nr < "u" && nr.crypto && (B = nr.crypto), !B && typeof px == "function")
|
|
2376
2376
|
try {
|
|
2377
2377
|
B = pr;
|
|
2378
2378
|
} catch {
|
|
@@ -2865,12 +2865,12 @@ function j() {
|
|
|
2865
2865
|
});
|
|
2866
2866
|
}(ot)), ot.exports;
|
|
2867
2867
|
}
|
|
2868
|
-
var st = { exports: {} },
|
|
2868
|
+
var st = { exports: {} }, Fx = st.exports, Ur;
|
|
2869
2869
|
function Nt() {
|
|
2870
|
-
return Ur || (Ur = 1, function(y,
|
|
2870
|
+
return Ur || (Ur = 1, function(y, z) {
|
|
2871
2871
|
(function(E, a) {
|
|
2872
2872
|
y.exports = a(j());
|
|
2873
|
-
})(
|
|
2873
|
+
})(Fx, function(E) {
|
|
2874
2874
|
return function(a) {
|
|
2875
2875
|
var g = E, B = g.lib, m = B.Base, o = B.WordArray, v = g.x64 = {};
|
|
2876
2876
|
v.Word = m.extend({
|
|
@@ -3095,12 +3095,12 @@ function Nt() {
|
|
|
3095
3095
|
});
|
|
3096
3096
|
}(st)), st.exports;
|
|
3097
3097
|
}
|
|
3098
|
-
var at = { exports: {} },
|
|
3099
|
-
function
|
|
3100
|
-
return Mr || (Mr = 1, function(y,
|
|
3098
|
+
var at = { exports: {} }, Cx = at.exports, Mr;
|
|
3099
|
+
function Ax() {
|
|
3100
|
+
return Mr || (Mr = 1, function(y, z) {
|
|
3101
3101
|
(function(E, a) {
|
|
3102
3102
|
y.exports = a(j());
|
|
3103
|
-
})(
|
|
3103
|
+
})(Cx, function(E) {
|
|
3104
3104
|
return function() {
|
|
3105
3105
|
if (typeof ArrayBuffer == "function") {
|
|
3106
3106
|
var a = E, g = a.lib, B = g.WordArray, m = B.init, o = B.init = function(v) {
|
|
@@ -3117,12 +3117,12 @@ function yx() {
|
|
|
3117
3117
|
});
|
|
3118
3118
|
}(at)), at.exports;
|
|
3119
3119
|
}
|
|
3120
|
-
var ft = { exports: {} },
|
|
3121
|
-
function
|
|
3122
|
-
return Nr || (Nr = 1, function(y,
|
|
3120
|
+
var ft = { exports: {} }, Ex = ft.exports, Nr;
|
|
3121
|
+
function yx() {
|
|
3122
|
+
return Nr || (Nr = 1, function(y, z) {
|
|
3123
3123
|
(function(E, a) {
|
|
3124
3124
|
y.exports = a(j());
|
|
3125
|
-
})(
|
|
3125
|
+
})(Ex, function(E) {
|
|
3126
3126
|
return function() {
|
|
3127
3127
|
var a = E, g = a.lib, B = g.WordArray, m = a.enc;
|
|
3128
3128
|
m.Utf16 = m.Utf16BE = {
|
|
@@ -3211,12 +3211,12 @@ function gx() {
|
|
|
3211
3211
|
});
|
|
3212
3212
|
}(ft)), ft.exports;
|
|
3213
3213
|
}
|
|
3214
|
-
var ct = { exports: {} },
|
|
3214
|
+
var ct = { exports: {} }, Dx = ct.exports, Wr;
|
|
3215
3215
|
function q0() {
|
|
3216
|
-
return Wr || (Wr = 1, function(y,
|
|
3216
|
+
return Wr || (Wr = 1, function(y, z) {
|
|
3217
3217
|
(function(E, a) {
|
|
3218
3218
|
y.exports = a(j());
|
|
3219
|
-
})(
|
|
3219
|
+
})(Dx, function(E) {
|
|
3220
3220
|
return function() {
|
|
3221
3221
|
var a = E, g = a.lib, B = g.WordArray, m = a.enc;
|
|
3222
3222
|
m.Base64 = {
|
|
@@ -3286,12 +3286,12 @@ function q0() {
|
|
|
3286
3286
|
});
|
|
3287
3287
|
}(ct)), ct.exports;
|
|
3288
3288
|
}
|
|
3289
|
-
var ut = { exports: {} },
|
|
3290
|
-
function
|
|
3291
|
-
return $r || ($r = 1, function(y,
|
|
3289
|
+
var ut = { exports: {} }, gx = ut.exports, $r;
|
|
3290
|
+
function bx() {
|
|
3291
|
+
return $r || ($r = 1, function(y, z) {
|
|
3292
3292
|
(function(E, a) {
|
|
3293
3293
|
y.exports = a(j());
|
|
3294
|
-
})(
|
|
3294
|
+
})(gx, function(E) {
|
|
3295
3295
|
return function() {
|
|
3296
3296
|
var a = E, g = a.lib, B = g.WordArray, m = a.enc;
|
|
3297
3297
|
m.Base64url = {
|
|
@@ -3368,12 +3368,12 @@ function wx() {
|
|
|
3368
3368
|
});
|
|
3369
3369
|
}(ut)), ut.exports;
|
|
3370
3370
|
}
|
|
3371
|
-
var ht = { exports: {} },
|
|
3371
|
+
var ht = { exports: {} }, mx = ht.exports, Kr;
|
|
3372
3372
|
function H0() {
|
|
3373
|
-
return Kr || (Kr = 1, function(y,
|
|
3373
|
+
return Kr || (Kr = 1, function(y, z) {
|
|
3374
3374
|
(function(E, a) {
|
|
3375
3375
|
y.exports = a(j());
|
|
3376
|
-
})(
|
|
3376
|
+
})(mx, function(E) {
|
|
3377
3377
|
return function(a) {
|
|
3378
3378
|
var g = E, B = g.lib, m = B.WordArray, o = B.Hasher, v = g.algo, r = [];
|
|
3379
3379
|
(function() {
|
|
@@ -3394,8 +3394,8 @@ function H0() {
|
|
|
3394
3394
|
var x = i + p, n = F[x];
|
|
3395
3395
|
F[x] = (n << 8 | n >>> 24) & 16711935 | (n << 24 | n >>> 8) & 4278255360;
|
|
3396
3396
|
}
|
|
3397
|
-
var u = this._hash.words, d = F[i + 0], A = F[i + 1], _ = F[i + 2], T = F[i + 3], q = F[i + 4], D = F[i + 5], w = F[i + 6], k = F[i + 7], S = F[i + 8], U = F[i + 9], W = F[i + 10], $ = F[i + 11], V = F[i + 12], X = F[i + 13], G = F[i + 14], Z = F[i + 15],
|
|
3398
|
-
|
|
3397
|
+
var u = this._hash.words, d = F[i + 0], A = F[i + 1], _ = F[i + 2], T = F[i + 3], q = F[i + 4], D = F[i + 5], w = F[i + 6], k = F[i + 7], S = F[i + 8], U = F[i + 9], W = F[i + 10], $ = F[i + 11], V = F[i + 12], X = F[i + 13], G = F[i + 14], Z = F[i + 15], H = u[0], R = u[1], O = u[2], I = u[3];
|
|
3398
|
+
H = C(H, R, O, I, d, 7, r[0]), I = C(I, H, R, O, A, 12, r[1]), O = C(O, I, H, R, _, 17, r[2]), R = C(R, O, I, H, T, 22, r[3]), H = C(H, R, O, I, q, 7, r[4]), I = C(I, H, R, O, D, 12, r[5]), O = C(O, I, H, R, w, 17, r[6]), R = C(R, O, I, H, k, 22, r[7]), H = C(H, R, O, I, S, 7, r[8]), I = C(I, H, R, O, U, 12, r[9]), O = C(O, I, H, R, W, 17, r[10]), R = C(R, O, I, H, $, 22, r[11]), H = C(H, R, O, I, V, 7, r[12]), I = C(I, H, R, O, X, 12, r[13]), O = C(O, I, H, R, G, 17, r[14]), R = C(R, O, I, H, Z, 22, r[15]), H = f(H, R, O, I, A, 5, r[16]), I = f(I, H, R, O, w, 9, r[17]), O = f(O, I, H, R, $, 14, r[18]), R = f(R, O, I, H, d, 20, r[19]), H = f(H, R, O, I, D, 5, r[20]), I = f(I, H, R, O, W, 9, r[21]), O = f(O, I, H, R, Z, 14, r[22]), R = f(R, O, I, H, q, 20, r[23]), H = f(H, R, O, I, U, 5, r[24]), I = f(I, H, R, O, G, 9, r[25]), O = f(O, I, H, R, T, 14, r[26]), R = f(R, O, I, H, S, 20, r[27]), H = f(H, R, O, I, X, 5, r[28]), I = f(I, H, R, O, _, 9, r[29]), O = f(O, I, H, R, k, 14, r[30]), R = f(R, O, I, H, V, 20, r[31]), H = l(H, R, O, I, D, 4, r[32]), I = l(I, H, R, O, S, 11, r[33]), O = l(O, I, H, R, $, 16, r[34]), R = l(R, O, I, H, G, 23, r[35]), H = l(H, R, O, I, A, 4, r[36]), I = l(I, H, R, O, q, 11, r[37]), O = l(O, I, H, R, k, 16, r[38]), R = l(R, O, I, H, W, 23, r[39]), H = l(H, R, O, I, X, 4, r[40]), I = l(I, H, R, O, d, 11, r[41]), O = l(O, I, H, R, T, 16, r[42]), R = l(R, O, I, H, w, 23, r[43]), H = l(H, R, O, I, U, 4, r[44]), I = l(I, H, R, O, V, 11, r[45]), O = l(O, I, H, R, Z, 16, r[46]), R = l(R, O, I, H, _, 23, r[47]), H = h(H, R, O, I, d, 6, r[48]), I = h(I, H, R, O, k, 10, r[49]), O = h(O, I, H, R, G, 15, r[50]), R = h(R, O, I, H, D, 21, r[51]), H = h(H, R, O, I, V, 6, r[52]), I = h(I, H, R, O, T, 10, r[53]), O = h(O, I, H, R, W, 15, r[54]), R = h(R, O, I, H, A, 21, r[55]), H = h(H, R, O, I, S, 6, r[56]), I = h(I, H, R, O, Z, 10, r[57]), O = h(O, I, H, R, w, 15, r[58]), R = h(R, O, I, H, X, 21, r[59]), H = h(H, R, O, I, q, 6, r[60]), I = h(I, H, R, O, $, 10, r[61]), O = h(O, I, H, R, _, 15, r[62]), R = h(R, O, I, H, U, 21, r[63]), u[0] = u[0] + H | 0, u[1] = u[1] + R | 0, u[2] = u[2] + O | 0, u[3] = u[3] + I | 0;
|
|
3399
3399
|
},
|
|
3400
3400
|
_doFinalize: function() {
|
|
3401
3401
|
var F = this._data, i = F.words, p = this._nDataBytes * 8, x = F.sigBytes * 8;
|
|
@@ -3434,12 +3434,12 @@ function H0() {
|
|
|
3434
3434
|
});
|
|
3435
3435
|
}(ht)), ht.exports;
|
|
3436
3436
|
}
|
|
3437
|
-
var lt = { exports: {} },
|
|
3438
|
-
function
|
|
3439
|
-
return Vr || (Vr = 1, function(y,
|
|
3437
|
+
var lt = { exports: {} }, wx = lt.exports, Vr;
|
|
3438
|
+
function ye() {
|
|
3439
|
+
return Vr || (Vr = 1, function(y, z) {
|
|
3440
3440
|
(function(E, a) {
|
|
3441
3441
|
y.exports = a(j());
|
|
3442
|
-
})(
|
|
3442
|
+
})(wx, function(E) {
|
|
3443
3443
|
return function() {
|
|
3444
3444
|
var a = E, g = a.lib, B = g.WordArray, m = g.Hasher, o = a.algo, v = [], r = o.SHA1 = m.extend({
|
|
3445
3445
|
_doReset: function() {
|
|
@@ -3478,12 +3478,12 @@ function ge() {
|
|
|
3478
3478
|
});
|
|
3479
3479
|
}(lt)), lt.exports;
|
|
3480
3480
|
}
|
|
3481
|
-
var vt = { exports: {} },
|
|
3481
|
+
var vt = { exports: {} }, _x = vt.exports, Xr;
|
|
3482
3482
|
function Cr() {
|
|
3483
|
-
return Xr || (Xr = 1, function(y,
|
|
3483
|
+
return Xr || (Xr = 1, function(y, z) {
|
|
3484
3484
|
(function(E, a) {
|
|
3485
3485
|
y.exports = a(j());
|
|
3486
|
-
})(
|
|
3486
|
+
})(_x, function(E) {
|
|
3487
3487
|
return function(a) {
|
|
3488
3488
|
var g = E, B = g.lib, m = B.WordArray, o = B.Hasher, v = g.algo, r = [], s = [];
|
|
3489
3489
|
(function() {
|
|
@@ -3530,12 +3530,12 @@ function Cr() {
|
|
|
3530
3530
|
});
|
|
3531
3531
|
}(vt)), vt.exports;
|
|
3532
3532
|
}
|
|
3533
|
-
var dt = { exports: {} },
|
|
3534
|
-
function
|
|
3535
|
-
return jr || (jr = 1, function(y,
|
|
3533
|
+
var dt = { exports: {} }, Tx = dt.exports, jr;
|
|
3534
|
+
function kx() {
|
|
3535
|
+
return jr || (jr = 1, function(y, z) {
|
|
3536
3536
|
(function(E, a, g) {
|
|
3537
3537
|
y.exports = a(j(), Cr());
|
|
3538
|
-
})(
|
|
3538
|
+
})(Tx, function(E) {
|
|
3539
3539
|
return function() {
|
|
3540
3540
|
var a = E, g = a.lib, B = g.WordArray, m = a.algo, o = m.SHA256, v = m.SHA224 = o.extend({
|
|
3541
3541
|
_doReset: function() {
|
|
@@ -3560,12 +3560,12 @@ function Rx() {
|
|
|
3560
3560
|
});
|
|
3561
3561
|
}(dt)), dt.exports;
|
|
3562
3562
|
}
|
|
3563
|
-
var pt = { exports: {} },
|
|
3564
|
-
function
|
|
3565
|
-
return Zr || (Zr = 1, function(y,
|
|
3563
|
+
var pt = { exports: {} }, Sx = pt.exports, Zr;
|
|
3564
|
+
function De() {
|
|
3565
|
+
return Zr || (Zr = 1, function(y, z) {
|
|
3566
3566
|
(function(E, a, g) {
|
|
3567
3567
|
y.exports = a(j(), Nt());
|
|
3568
|
-
})(
|
|
3568
|
+
})(Sx, function(E) {
|
|
3569
3569
|
return function() {
|
|
3570
3570
|
var a = E, g = a.lib, B = g.Hasher, m = a.x64, o = m.Word, v = m.WordArray, r = a.algo;
|
|
3571
3571
|
function s() {
|
|
@@ -3671,7 +3671,7 @@ function be() {
|
|
|
3671
3671
|
]);
|
|
3672
3672
|
},
|
|
3673
3673
|
_doProcessBlock: function(h, F) {
|
|
3674
|
-
for (var i = this._hash.words, p = i[0], x = i[1], n = i[2], u = i[3], d = i[4], A = i[5], _ = i[6], T = i[7], q = p.high, D = p.low, w = x.high, k = x.low, S = n.high, U = n.low, W = u.high, $ = u.low, V = d.high, X = d.low, G = A.high, Z = A.low,
|
|
3674
|
+
for (var i = this._hash.words, p = i[0], x = i[1], n = i[2], u = i[3], d = i[4], A = i[5], _ = i[6], T = i[7], q = p.high, D = p.low, w = x.high, k = x.low, S = n.high, U = n.low, W = u.high, $ = u.low, V = d.high, X = d.low, G = A.high, Z = A.low, H = _.high, R = _.low, O = T.high, I = T.low, Q = q, Y = D, x0 = w, K = k, a0 = S, E0 = U, O0 = W, m0 = $, f0 = V, n0 = X, P0 = G, w0 = Z, z0 = H, _0 = R, U0 = O, T0 = I, c0 = 0; c0 < 80; c0++) {
|
|
3675
3675
|
var s0, F0, I0 = f[c0];
|
|
3676
3676
|
if (c0 < 16)
|
|
3677
3677
|
F0 = I0.high = h[F + c0 * 2] | 0, s0 = I0.low = h[F + c0 * 2 + 1] | 0;
|
|
@@ -3682,7 +3682,7 @@ function be() {
|
|
|
3682
3682
|
var Xt = f0 & P0 ^ ~f0 & z0, G0 = n0 & w0 ^ ~n0 & _0, jt = Q & x0 ^ Q & a0 ^ x0 & a0, Zt = Y & K ^ Y & E0 ^ K & E0, Gt = (Q >>> 28 | Y << 4) ^ (Q << 30 | Y >>> 2) ^ (Q << 25 | Y >>> 7), Y0 = (Y >>> 28 | Q << 4) ^ (Y << 30 | Q >>> 2) ^ (Y << 25 | Q >>> 7), Yt = (f0 >>> 14 | n0 << 18) ^ (f0 >>> 18 | n0 << 14) ^ (f0 << 23 | n0 >>> 9), Qt = (n0 >>> 14 | f0 << 18) ^ (n0 >>> 18 | f0 << 14) ^ (n0 << 23 | f0 >>> 9), Q0 = C[c0], Jt = Q0.high, J0 = Q0.low, i0 = T0 + Qt, C0 = U0 + Yt + (i0 >>> 0 < T0 >>> 0 ? 1 : 0), i0 = i0 + G0, C0 = C0 + Xt + (i0 >>> 0 < G0 >>> 0 ? 1 : 0), i0 = i0 + J0, C0 = C0 + Jt + (i0 >>> 0 < J0 >>> 0 ? 1 : 0), i0 = i0 + s0, C0 = C0 + F0 + (i0 >>> 0 < s0 >>> 0 ? 1 : 0), tt = Y0 + Zt, tr = Gt + jt + (tt >>> 0 < Y0 >>> 0 ? 1 : 0);
|
|
3683
3683
|
U0 = z0, T0 = _0, z0 = P0, _0 = w0, P0 = f0, w0 = n0, n0 = m0 + i0 | 0, f0 = O0 + C0 + (n0 >>> 0 < m0 >>> 0 ? 1 : 0) | 0, O0 = a0, m0 = E0, a0 = x0, E0 = K, x0 = Q, K = Y, Y = i0 + tt | 0, Q = C0 + tr + (Y >>> 0 < i0 >>> 0 ? 1 : 0) | 0;
|
|
3684
3684
|
}
|
|
3685
|
-
D = p.low = D + Y, p.high = q + Q + (D >>> 0 < Y >>> 0 ? 1 : 0), k = x.low = k + K, x.high = w + x0 + (k >>> 0 < K >>> 0 ? 1 : 0), U = n.low = U + E0, n.high = S + a0 + (U >>> 0 < E0 >>> 0 ? 1 : 0), $ = u.low = $ + m0, u.high = W + O0 + ($ >>> 0 < m0 >>> 0 ? 1 : 0), X = d.low = X + n0, d.high = V + f0 + (X >>> 0 < n0 >>> 0 ? 1 : 0), Z = A.low = Z + w0, A.high = G + P0 + (Z >>> 0 < w0 >>> 0 ? 1 : 0), R = _.low = R + _0, _.high =
|
|
3685
|
+
D = p.low = D + Y, p.high = q + Q + (D >>> 0 < Y >>> 0 ? 1 : 0), k = x.low = k + K, x.high = w + x0 + (k >>> 0 < K >>> 0 ? 1 : 0), U = n.low = U + E0, n.high = S + a0 + (U >>> 0 < E0 >>> 0 ? 1 : 0), $ = u.low = $ + m0, u.high = W + O0 + ($ >>> 0 < m0 >>> 0 ? 1 : 0), X = d.low = X + n0, d.high = V + f0 + (X >>> 0 < n0 >>> 0 ? 1 : 0), Z = A.low = Z + w0, A.high = G + P0 + (Z >>> 0 < w0 >>> 0 ? 1 : 0), R = _.low = R + _0, _.high = H + z0 + (R >>> 0 < _0 >>> 0 ? 1 : 0), I = T.low = I + T0, T.high = O + U0 + (I >>> 0 < T0 >>> 0 ? 1 : 0);
|
|
3686
3686
|
},
|
|
3687
3687
|
_doFinalize: function() {
|
|
3688
3688
|
var h = this._data, F = h.words, i = this._nDataBytes * 8, p = h.sigBytes * 8;
|
|
@@ -3701,12 +3701,12 @@ function be() {
|
|
|
3701
3701
|
});
|
|
3702
3702
|
}(pt)), pt.exports;
|
|
3703
3703
|
}
|
|
3704
|
-
var Bt = { exports: {} },
|
|
3705
|
-
function
|
|
3706
|
-
return Gr || (Gr = 1, function(y,
|
|
3704
|
+
var Bt = { exports: {} }, Rx = Bt.exports, Gr;
|
|
3705
|
+
function qx() {
|
|
3706
|
+
return Gr || (Gr = 1, function(y, z) {
|
|
3707
3707
|
(function(E, a, g) {
|
|
3708
|
-
y.exports = a(j(), Nt(),
|
|
3709
|
-
})(
|
|
3708
|
+
y.exports = a(j(), Nt(), De());
|
|
3709
|
+
})(Rx, function(E) {
|
|
3710
3710
|
return function() {
|
|
3711
3711
|
var a = E, g = a.x64, B = g.Word, m = g.WordArray, o = a.algo, v = o.SHA512, r = o.SHA384 = v.extend({
|
|
3712
3712
|
_doReset: function() {
|
|
@@ -3731,12 +3731,12 @@ function Px() {
|
|
|
3731
3731
|
});
|
|
3732
3732
|
}(Bt)), Bt.exports;
|
|
3733
3733
|
}
|
|
3734
|
-
var Ft = { exports: {} },
|
|
3735
|
-
function
|
|
3736
|
-
return Yr || (Yr = 1, function(y,
|
|
3734
|
+
var Ft = { exports: {} }, Hx = Ft.exports, Yr;
|
|
3735
|
+
function Px() {
|
|
3736
|
+
return Yr || (Yr = 1, function(y, z) {
|
|
3737
3737
|
(function(E, a, g) {
|
|
3738
3738
|
y.exports = a(j(), Nt());
|
|
3739
|
-
})(
|
|
3739
|
+
})(Hx, function(E) {
|
|
3740
3740
|
return function(a) {
|
|
3741
3741
|
var g = E, B = g.lib, m = B.WordArray, o = B.Hasher, v = g.x64, r = v.Word, s = g.algo, C = [], f = [], l = [];
|
|
3742
3742
|
(function() {
|
|
@@ -3803,8 +3803,8 @@ function Ix() {
|
|
|
3803
3803
|
_.high ^= D, _.low ^= w;
|
|
3804
3804
|
}
|
|
3805
3805
|
for (var X = 1; X < 25; X++) {
|
|
3806
|
-
var D, w, _ = x[X], G = _.high, Z = _.low,
|
|
3807
|
-
|
|
3806
|
+
var D, w, _ = x[X], G = _.high, Z = _.low, H = C[X];
|
|
3807
|
+
H < 32 ? (D = G << H | Z >>> 32 - H, w = Z << H | G >>> 32 - H) : (D = Z << H - 32 | G >>> 64 - H, w = G << H - 32 | Z >>> 64 - H);
|
|
3808
3808
|
var R = h[f[X]];
|
|
3809
3809
|
R.high = D, R.low = w;
|
|
3810
3810
|
}
|
|
@@ -3841,12 +3841,12 @@ function Ix() {
|
|
|
3841
3841
|
});
|
|
3842
3842
|
}(Ft)), Ft.exports;
|
|
3843
3843
|
}
|
|
3844
|
-
var Ct = { exports: {} },
|
|
3845
|
-
function
|
|
3846
|
-
return Qr || (Qr = 1, function(y,
|
|
3844
|
+
var Ct = { exports: {} }, zx = Ct.exports, Qr;
|
|
3845
|
+
function Ix() {
|
|
3846
|
+
return Qr || (Qr = 1, function(y, z) {
|
|
3847
3847
|
(function(E, a) {
|
|
3848
3848
|
y.exports = a(j());
|
|
3849
|
-
})(
|
|
3849
|
+
})(zx, function(E) {
|
|
3850
3850
|
/** @preserve
|
|
3851
3851
|
(c) 2012 by Cédric Mesnil. All rights reserved.
|
|
3852
3852
|
|
|
@@ -4191,11 +4191,11 @@ function Ox() {
|
|
|
4191
4191
|
var q = _ + T, D = A[q];
|
|
4192
4192
|
A[q] = (D << 8 | D >>> 24) & 16711935 | (D << 24 | D >>> 8) & 4278255360;
|
|
4193
4193
|
}
|
|
4194
|
-
var w = this._hash.words, k = l.words, S = h.words, U = r.words, W = s.words, $ = C.words, V = f.words, X, G, Z,
|
|
4195
|
-
O = X = w[0], I = G = w[1], Q = Z = w[2], Y =
|
|
4194
|
+
var w = this._hash.words, k = l.words, S = h.words, U = r.words, W = s.words, $ = C.words, V = f.words, X, G, Z, H, R, O, I, Q, Y, x0;
|
|
4195
|
+
O = X = w[0], I = G = w[1], Q = Z = w[2], Y = H = w[3], x0 = R = w[4];
|
|
4196
4196
|
for (var K, T = 0; T < 80; T += 1)
|
|
4197
|
-
K = X + A[_ + U[T]] | 0, T < 16 ? K += i(G, Z,
|
|
4198
|
-
K = w[1] + Z + Y | 0, w[1] = w[2] +
|
|
4197
|
+
K = X + A[_ + U[T]] | 0, T < 16 ? K += i(G, Z, H) + k[0] : T < 32 ? K += p(G, Z, H) + k[1] : T < 48 ? K += x(G, Z, H) + k[2] : T < 64 ? K += n(G, Z, H) + k[3] : K += u(G, Z, H) + k[4], K = K | 0, K = d(K, $[T]), K = K + R | 0, X = R, R = H, H = d(Z, 10), Z = G, G = K, K = O + A[_ + W[T]] | 0, T < 16 ? K += u(I, Q, Y) + S[0] : T < 32 ? K += n(I, Q, Y) + S[1] : T < 48 ? K += x(I, Q, Y) + S[2] : T < 64 ? K += p(I, Q, Y) + S[3] : K += i(I, Q, Y) + S[4], K = K | 0, K = d(K, V[T]), K = K + x0 | 0, O = x0, x0 = Y, Y = d(Q, 10), Q = I, I = K;
|
|
4198
|
+
K = w[1] + Z + Y | 0, w[1] = w[2] + H + x0 | 0, w[2] = w[3] + R + O | 0, w[3] = w[4] + X + I | 0, w[4] = w[0] + G + Q | 0, w[0] = K;
|
|
4199
4199
|
},
|
|
4200
4200
|
_doFinalize: function() {
|
|
4201
4201
|
var A = this._data, _ = A.words, T = this._nDataBytes * 8, q = A.sigBytes * 8;
|
|
@@ -4234,12 +4234,12 @@ function Ox() {
|
|
|
4234
4234
|
});
|
|
4235
4235
|
}(Ct)), Ct.exports;
|
|
4236
4236
|
}
|
|
4237
|
-
var At = { exports: {} },
|
|
4237
|
+
var At = { exports: {} }, Lx = At.exports, Jr;
|
|
4238
4238
|
function Ar() {
|
|
4239
|
-
return Jr || (Jr = 1, function(y,
|
|
4239
|
+
return Jr || (Jr = 1, function(y, z) {
|
|
4240
4240
|
(function(E, a) {
|
|
4241
4241
|
y.exports = a(j());
|
|
4242
|
-
})(
|
|
4242
|
+
})(Lx, function(E) {
|
|
4243
4243
|
(function() {
|
|
4244
4244
|
var a = E, g = a.lib, B = g.Base, m = a.enc, o = m.Utf8, v = a.algo;
|
|
4245
4245
|
v.HMAC = B.extend({
|
|
@@ -4312,12 +4312,12 @@ function Ar() {
|
|
|
4312
4312
|
});
|
|
4313
4313
|
}(At)), At.exports;
|
|
4314
4314
|
}
|
|
4315
|
-
var Et = { exports: {} },
|
|
4316
|
-
function
|
|
4317
|
-
return te || (te = 1, function(y,
|
|
4315
|
+
var Et = { exports: {} }, Ox = Et.exports, te;
|
|
4316
|
+
function Ux() {
|
|
4317
|
+
return te || (te = 1, function(y, z) {
|
|
4318
4318
|
(function(E, a, g) {
|
|
4319
4319
|
y.exports = a(j(), Cr(), Ar());
|
|
4320
|
-
})(
|
|
4320
|
+
})(Ox, function(E) {
|
|
4321
4321
|
return function() {
|
|
4322
4322
|
var a = E, g = a.lib, B = g.Base, m = g.WordArray, o = a.algo, v = o.SHA256, r = o.HMAC, s = o.PBKDF2 = B.extend({
|
|
4323
4323
|
/**
|
|
@@ -4379,12 +4379,12 @@ function Nx() {
|
|
|
4379
4379
|
});
|
|
4380
4380
|
}(Et)), Et.exports;
|
|
4381
4381
|
}
|
|
4382
|
-
var yt = { exports: {} },
|
|
4382
|
+
var yt = { exports: {} }, Mx = yt.exports, re;
|
|
4383
4383
|
function b0() {
|
|
4384
|
-
return re || (re = 1, function(y,
|
|
4384
|
+
return re || (re = 1, function(y, z) {
|
|
4385
4385
|
(function(E, a, g) {
|
|
4386
|
-
y.exports = a(j(),
|
|
4387
|
-
})(
|
|
4386
|
+
y.exports = a(j(), ye(), Ar());
|
|
4387
|
+
})(Mx, function(E) {
|
|
4388
4388
|
return function() {
|
|
4389
4389
|
var a = E, g = a.lib, B = g.Base, m = g.WordArray, o = a.algo, v = o.MD5, r = o.EvpKDF = B.extend({
|
|
4390
4390
|
/**
|
|
@@ -4442,12 +4442,12 @@ function b0() {
|
|
|
4442
4442
|
});
|
|
4443
4443
|
}(yt)), yt.exports;
|
|
4444
4444
|
}
|
|
4445
|
-
var Dt = { exports: {} },
|
|
4445
|
+
var Dt = { exports: {} }, Nx = Dt.exports, ee;
|
|
4446
4446
|
function e0() {
|
|
4447
|
-
return ee || (ee = 1, function(y,
|
|
4447
|
+
return ee || (ee = 1, function(y, z) {
|
|
4448
4448
|
(function(E, a, g) {
|
|
4449
4449
|
y.exports = a(j(), b0());
|
|
4450
|
-
})(
|
|
4450
|
+
})(Nx, function(E) {
|
|
4451
4451
|
E.lib.Cipher || function(a) {
|
|
4452
4452
|
var g = E, B = g.lib, m = B.Base, o = B.WordArray, v = B.BufferedBlockAlgorithm, r = g.enc;
|
|
4453
4453
|
r.Utf8;
|
|
@@ -4980,12 +4980,12 @@ function e0() {
|
|
|
4980
4980
|
});
|
|
4981
4981
|
}(Dt)), Dt.exports;
|
|
4982
4982
|
}
|
|
4983
|
-
var gt = { exports: {} },
|
|
4984
|
-
function
|
|
4985
|
-
return xe || (xe = 1, function(y,
|
|
4983
|
+
var gt = { exports: {} }, Wx = gt.exports, xe;
|
|
4984
|
+
function $x() {
|
|
4985
|
+
return xe || (xe = 1, function(y, z) {
|
|
4986
4986
|
(function(E, a, g) {
|
|
4987
4987
|
y.exports = a(j(), e0());
|
|
4988
|
-
})(
|
|
4988
|
+
})(Wx, function(E) {
|
|
4989
4989
|
return E.mode.CFB = function() {
|
|
4990
4990
|
var a = E.lib.BlockCipherMode.extend();
|
|
4991
4991
|
a.Encryptor = a.extend({
|
|
@@ -5010,12 +5010,12 @@ function Vx() {
|
|
|
5010
5010
|
});
|
|
5011
5011
|
}(gt)), gt.exports;
|
|
5012
5012
|
}
|
|
5013
|
-
var bt = { exports: {} },
|
|
5014
|
-
function
|
|
5015
|
-
return ne || (ne = 1, function(y,
|
|
5013
|
+
var bt = { exports: {} }, Kx = bt.exports, ne;
|
|
5014
|
+
function Vx() {
|
|
5015
|
+
return ne || (ne = 1, function(y, z) {
|
|
5016
5016
|
(function(E, a, g) {
|
|
5017
5017
|
y.exports = a(j(), e0());
|
|
5018
|
-
})(
|
|
5018
|
+
})(Kx, function(E) {
|
|
5019
5019
|
return E.mode.CTR = function() {
|
|
5020
5020
|
var a = E.lib.BlockCipherMode.extend(), g = a.Encryptor = a.extend({
|
|
5021
5021
|
processBlock: function(B, m) {
|
|
@@ -5032,12 +5032,12 @@ function jx() {
|
|
|
5032
5032
|
});
|
|
5033
5033
|
}(bt)), bt.exports;
|
|
5034
5034
|
}
|
|
5035
|
-
var mt = { exports: {} },
|
|
5036
|
-
function
|
|
5037
|
-
return ie || (ie = 1, function(y,
|
|
5035
|
+
var mt = { exports: {} }, Xx = mt.exports, ie;
|
|
5036
|
+
function jx() {
|
|
5037
|
+
return ie || (ie = 1, function(y, z) {
|
|
5038
5038
|
(function(E, a, g) {
|
|
5039
5039
|
y.exports = a(j(), e0());
|
|
5040
|
-
})(
|
|
5040
|
+
})(Xx, function(E) {
|
|
5041
5041
|
/** @preserve
|
|
5042
5042
|
* Counter block mode compatible with Dr Brian Gladman fileenc.c
|
|
5043
5043
|
* derived from CryptoJS.mode.CTR
|
|
@@ -5071,12 +5071,12 @@ function Gx() {
|
|
|
5071
5071
|
});
|
|
5072
5072
|
}(mt)), mt.exports;
|
|
5073
5073
|
}
|
|
5074
|
-
var wt = { exports: {} },
|
|
5075
|
-
function
|
|
5076
|
-
return oe || (oe = 1, function(y,
|
|
5074
|
+
var wt = { exports: {} }, Zx = wt.exports, oe;
|
|
5075
|
+
function Gx() {
|
|
5076
|
+
return oe || (oe = 1, function(y, z) {
|
|
5077
5077
|
(function(E, a, g) {
|
|
5078
5078
|
y.exports = a(j(), e0());
|
|
5079
|
-
})(
|
|
5079
|
+
})(Zx, function(E) {
|
|
5080
5080
|
return E.mode.OFB = function() {
|
|
5081
5081
|
var a = E.lib.BlockCipherMode.extend(), g = a.Encryptor = a.extend({
|
|
5082
5082
|
processBlock: function(B, m) {
|
|
@@ -5091,12 +5091,12 @@ function Qx() {
|
|
|
5091
5091
|
});
|
|
5092
5092
|
}(wt)), wt.exports;
|
|
5093
5093
|
}
|
|
5094
|
-
var _t = { exports: {} },
|
|
5095
|
-
function
|
|
5096
|
-
return se || (se = 1, function(y,
|
|
5094
|
+
var _t = { exports: {} }, Yx = _t.exports, se;
|
|
5095
|
+
function Qx() {
|
|
5096
|
+
return se || (se = 1, function(y, z) {
|
|
5097
5097
|
(function(E, a, g) {
|
|
5098
5098
|
y.exports = a(j(), e0());
|
|
5099
|
-
})(
|
|
5099
|
+
})(Yx, function(E) {
|
|
5100
5100
|
return E.mode.ECB = function() {
|
|
5101
5101
|
var a = E.lib.BlockCipherMode.extend();
|
|
5102
5102
|
return a.Encryptor = a.extend({
|
|
@@ -5112,12 +5112,12 @@ function tn() {
|
|
|
5112
5112
|
});
|
|
5113
5113
|
}(_t)), _t.exports;
|
|
5114
5114
|
}
|
|
5115
|
-
var Tt = { exports: {} },
|
|
5116
|
-
function
|
|
5117
|
-
return ae || (ae = 1, function(y,
|
|
5115
|
+
var Tt = { exports: {} }, Jx = Tt.exports, ae;
|
|
5116
|
+
function tn() {
|
|
5117
|
+
return ae || (ae = 1, function(y, z) {
|
|
5118
5118
|
(function(E, a, g) {
|
|
5119
5119
|
y.exports = a(j(), e0());
|
|
5120
|
-
})(
|
|
5120
|
+
})(Jx, function(E) {
|
|
5121
5121
|
return E.pad.AnsiX923 = {
|
|
5122
5122
|
pad: function(a, g) {
|
|
5123
5123
|
var B = a.sigBytes, m = g * 4, o = m - B % m, v = B + o - 1;
|
|
@@ -5131,12 +5131,12 @@ function en() {
|
|
|
5131
5131
|
});
|
|
5132
5132
|
}(Tt)), Tt.exports;
|
|
5133
5133
|
}
|
|
5134
|
-
var kt = { exports: {} },
|
|
5135
|
-
function
|
|
5136
|
-
return fe || (fe = 1, function(y,
|
|
5134
|
+
var kt = { exports: {} }, rn = kt.exports, fe;
|
|
5135
|
+
function en() {
|
|
5136
|
+
return fe || (fe = 1, function(y, z) {
|
|
5137
5137
|
(function(E, a, g) {
|
|
5138
5138
|
y.exports = a(j(), e0());
|
|
5139
|
-
})(
|
|
5139
|
+
})(rn, function(E) {
|
|
5140
5140
|
return E.pad.Iso10126 = {
|
|
5141
5141
|
pad: function(a, g) {
|
|
5142
5142
|
var B = g * 4, m = B - a.sigBytes % B;
|
|
@@ -5150,12 +5150,12 @@ function nn() {
|
|
|
5150
5150
|
});
|
|
5151
5151
|
}(kt)), kt.exports;
|
|
5152
5152
|
}
|
|
5153
|
-
var St = { exports: {} },
|
|
5154
|
-
function
|
|
5155
|
-
return ce || (ce = 1, function(y,
|
|
5153
|
+
var St = { exports: {} }, xn = St.exports, ce;
|
|
5154
|
+
function nn() {
|
|
5155
|
+
return ce || (ce = 1, function(y, z) {
|
|
5156
5156
|
(function(E, a, g) {
|
|
5157
5157
|
y.exports = a(j(), e0());
|
|
5158
|
-
})(
|
|
5158
|
+
})(xn, function(E) {
|
|
5159
5159
|
return E.pad.Iso97971 = {
|
|
5160
5160
|
pad: function(a, g) {
|
|
5161
5161
|
a.concat(E.lib.WordArray.create([2147483648], 1)), E.pad.ZeroPadding.pad(a, g);
|
|
@@ -5167,12 +5167,12 @@ function sn() {
|
|
|
5167
5167
|
});
|
|
5168
5168
|
}(St)), St.exports;
|
|
5169
5169
|
}
|
|
5170
|
-
var Rt = { exports: {} },
|
|
5171
|
-
function
|
|
5172
|
-
return ue || (ue = 1, function(y,
|
|
5170
|
+
var Rt = { exports: {} }, on = Rt.exports, ue;
|
|
5171
|
+
function sn() {
|
|
5172
|
+
return ue || (ue = 1, function(y, z) {
|
|
5173
5173
|
(function(E, a, g) {
|
|
5174
5174
|
y.exports = a(j(), e0());
|
|
5175
|
-
})(
|
|
5175
|
+
})(on, function(E) {
|
|
5176
5176
|
return E.pad.ZeroPadding = {
|
|
5177
5177
|
pad: function(a, g) {
|
|
5178
5178
|
var B = g * 4;
|
|
@@ -5189,12 +5189,12 @@ function fn() {
|
|
|
5189
5189
|
});
|
|
5190
5190
|
}(Rt)), Rt.exports;
|
|
5191
5191
|
}
|
|
5192
|
-
var qt = { exports: {} },
|
|
5193
|
-
function
|
|
5194
|
-
return he || (he = 1, function(y,
|
|
5192
|
+
var qt = { exports: {} }, an = qt.exports, he;
|
|
5193
|
+
function fn() {
|
|
5194
|
+
return he || (he = 1, function(y, z) {
|
|
5195
5195
|
(function(E, a, g) {
|
|
5196
5196
|
y.exports = a(j(), e0());
|
|
5197
|
-
})(
|
|
5197
|
+
})(an, function(E) {
|
|
5198
5198
|
return E.pad.NoPadding = {
|
|
5199
5199
|
pad: function() {
|
|
5200
5200
|
},
|
|
@@ -5204,12 +5204,12 @@ function un() {
|
|
|
5204
5204
|
});
|
|
5205
5205
|
}(qt)), qt.exports;
|
|
5206
5206
|
}
|
|
5207
|
-
var Ht = { exports: {} },
|
|
5208
|
-
function
|
|
5209
|
-
return le || (le = 1, function(y,
|
|
5207
|
+
var Ht = { exports: {} }, cn = Ht.exports, le;
|
|
5208
|
+
function un() {
|
|
5209
|
+
return le || (le = 1, function(y, z) {
|
|
5210
5210
|
(function(E, a, g) {
|
|
5211
5211
|
y.exports = a(j(), e0());
|
|
5212
|
-
})(
|
|
5212
|
+
})(cn, function(E) {
|
|
5213
5213
|
return function(a) {
|
|
5214
5214
|
var g = E, B = g.lib, m = B.CipherParams, o = g.enc, v = o.Hex, r = g.format;
|
|
5215
5215
|
r.Hex = {
|
|
@@ -5251,12 +5251,12 @@ function ln() {
|
|
|
5251
5251
|
});
|
|
5252
5252
|
}(Ht)), Ht.exports;
|
|
5253
5253
|
}
|
|
5254
|
-
var Pt = { exports: {} },
|
|
5255
|
-
function
|
|
5256
|
-
return ve || (ve = 1, function(y,
|
|
5254
|
+
var Pt = { exports: {} }, hn = Pt.exports, ve;
|
|
5255
|
+
function ln() {
|
|
5256
|
+
return ve || (ve = 1, function(y, z) {
|
|
5257
5257
|
(function(E, a, g) {
|
|
5258
5258
|
y.exports = a(j(), q0(), H0(), b0(), e0());
|
|
5259
|
-
})(
|
|
5259
|
+
})(hn, function(E) {
|
|
5260
5260
|
return function() {
|
|
5261
5261
|
var a = E, g = a.lib, B = g.BlockCipher, m = a.algo, o = [], v = [], r = [], s = [], C = [], f = [], l = [], h = [], F = [], i = [];
|
|
5262
5262
|
(function() {
|
|
@@ -5298,11 +5298,11 @@ function dn() {
|
|
|
5298
5298
|
},
|
|
5299
5299
|
_doCryptBlock: function(n, u, d, A, _, T, q, D) {
|
|
5300
5300
|
for (var w = this._nRounds, k = n[u] ^ d[0], S = n[u + 1] ^ d[1], U = n[u + 2] ^ d[2], W = n[u + 3] ^ d[3], $ = 4, V = 1; V < w; V++) {
|
|
5301
|
-
var X = A[k >>> 24] ^ _[S >>> 16 & 255] ^ T[U >>> 8 & 255] ^ q[W & 255] ^ d[$++], G = A[S >>> 24] ^ _[U >>> 16 & 255] ^ T[W >>> 8 & 255] ^ q[k & 255] ^ d[$++], Z = A[U >>> 24] ^ _[W >>> 16 & 255] ^ T[k >>> 8 & 255] ^ q[S & 255] ^ d[$++],
|
|
5302
|
-
k = X, S = G, U = Z, W =
|
|
5301
|
+
var X = A[k >>> 24] ^ _[S >>> 16 & 255] ^ T[U >>> 8 & 255] ^ q[W & 255] ^ d[$++], G = A[S >>> 24] ^ _[U >>> 16 & 255] ^ T[W >>> 8 & 255] ^ q[k & 255] ^ d[$++], Z = A[U >>> 24] ^ _[W >>> 16 & 255] ^ T[k >>> 8 & 255] ^ q[S & 255] ^ d[$++], H = A[W >>> 24] ^ _[k >>> 16 & 255] ^ T[S >>> 8 & 255] ^ q[U & 255] ^ d[$++];
|
|
5302
|
+
k = X, S = G, U = Z, W = H;
|
|
5303
5303
|
}
|
|
5304
|
-
var X = (D[k >>> 24] << 24 | D[S >>> 16 & 255] << 16 | D[U >>> 8 & 255] << 8 | D[W & 255]) ^ d[$++], G = (D[S >>> 24] << 24 | D[U >>> 16 & 255] << 16 | D[W >>> 8 & 255] << 8 | D[k & 255]) ^ d[$++], Z = (D[U >>> 24] << 24 | D[W >>> 16 & 255] << 16 | D[k >>> 8 & 255] << 8 | D[S & 255]) ^ d[$++],
|
|
5305
|
-
n[u] = X, n[u + 1] = G, n[u + 2] = Z, n[u + 3] =
|
|
5304
|
+
var X = (D[k >>> 24] << 24 | D[S >>> 16 & 255] << 16 | D[U >>> 8 & 255] << 8 | D[W & 255]) ^ d[$++], G = (D[S >>> 24] << 24 | D[U >>> 16 & 255] << 16 | D[W >>> 8 & 255] << 8 | D[k & 255]) ^ d[$++], Z = (D[U >>> 24] << 24 | D[W >>> 16 & 255] << 16 | D[k >>> 8 & 255] << 8 | D[S & 255]) ^ d[$++], H = (D[W >>> 24] << 24 | D[k >>> 16 & 255] << 16 | D[S >>> 8 & 255] << 8 | D[U & 255]) ^ d[$++];
|
|
5305
|
+
n[u] = X, n[u + 1] = G, n[u + 2] = Z, n[u + 3] = H;
|
|
5306
5306
|
},
|
|
5307
5307
|
keySize: 256 / 32
|
|
5308
5308
|
});
|
|
@@ -5311,12 +5311,12 @@ function dn() {
|
|
|
5311
5311
|
});
|
|
5312
5312
|
}(Pt)), Pt.exports;
|
|
5313
5313
|
}
|
|
5314
|
-
var zt = { exports: {} },
|
|
5315
|
-
function
|
|
5316
|
-
return de || (de = 1, function(y,
|
|
5314
|
+
var zt = { exports: {} }, vn = zt.exports, de;
|
|
5315
|
+
function dn() {
|
|
5316
|
+
return de || (de = 1, function(y, z) {
|
|
5317
5317
|
(function(E, a, g) {
|
|
5318
5318
|
y.exports = a(j(), q0(), H0(), b0(), e0());
|
|
5319
|
-
})(
|
|
5319
|
+
})(vn, function(E) {
|
|
5320
5320
|
return function() {
|
|
5321
5321
|
var a = E, g = a.lib, B = g.WordArray, m = g.BlockCipher, o = a.algo, v = [
|
|
5322
5322
|
57,
|
|
@@ -6031,12 +6031,12 @@ function Bn() {
|
|
|
6031
6031
|
});
|
|
6032
6032
|
}(zt)), zt.exports;
|
|
6033
6033
|
}
|
|
6034
|
-
var It = { exports: {} },
|
|
6035
|
-
function
|
|
6036
|
-
return pe || (pe = 1, function(y,
|
|
6034
|
+
var It = { exports: {} }, pn = It.exports, pe;
|
|
6035
|
+
function Bn() {
|
|
6036
|
+
return pe || (pe = 1, function(y, z) {
|
|
6037
6037
|
(function(E, a, g) {
|
|
6038
6038
|
y.exports = a(j(), q0(), H0(), b0(), e0());
|
|
6039
|
-
})(
|
|
6039
|
+
})(pn, function(E) {
|
|
6040
6040
|
return function() {
|
|
6041
6041
|
var a = E, g = a.lib, B = g.StreamCipher, m = a.algo, o = m.RC4 = B.extend({
|
|
6042
6042
|
_doReset: function() {
|
|
@@ -6085,12 +6085,12 @@ function Cn() {
|
|
|
6085
6085
|
});
|
|
6086
6086
|
}(It)), It.exports;
|
|
6087
6087
|
}
|
|
6088
|
-
var Lt = { exports: {} },
|
|
6089
|
-
function
|
|
6090
|
-
return Be || (Be = 1, function(y,
|
|
6088
|
+
var Lt = { exports: {} }, Fn = Lt.exports, Be;
|
|
6089
|
+
function Cn() {
|
|
6090
|
+
return Be || (Be = 1, function(y, z) {
|
|
6091
6091
|
(function(E, a, g) {
|
|
6092
6092
|
y.exports = a(j(), q0(), H0(), b0(), e0());
|
|
6093
|
-
})(
|
|
6093
|
+
})(Fn, function(E) {
|
|
6094
6094
|
return function() {
|
|
6095
6095
|
var a = E, g = a.lib, B = g.StreamCipher, m = a.algo, o = [], v = [], r = [], s = m.Rabbit = B.extend({
|
|
6096
6096
|
_doReset: function() {
|
|
@@ -6151,12 +6151,12 @@ function En() {
|
|
|
6151
6151
|
});
|
|
6152
6152
|
}(Lt)), Lt.exports;
|
|
6153
6153
|
}
|
|
6154
|
-
var Ot = { exports: {} },
|
|
6155
|
-
function
|
|
6156
|
-
return Fe || (Fe = 1, function(y,
|
|
6154
|
+
var Ot = { exports: {} }, An = Ot.exports, Fe;
|
|
6155
|
+
function En() {
|
|
6156
|
+
return Fe || (Fe = 1, function(y, z) {
|
|
6157
6157
|
(function(E, a, g) {
|
|
6158
6158
|
y.exports = a(j(), q0(), H0(), b0(), e0());
|
|
6159
|
-
})(
|
|
6159
|
+
})(An, function(E) {
|
|
6160
6160
|
return function() {
|
|
6161
6161
|
var a = E, g = a.lib, B = g.StreamCipher, m = a.algo, o = [], v = [], r = [], s = m.RabbitLegacy = B.extend({
|
|
6162
6162
|
_doReset: function() {
|
|
@@ -6215,12 +6215,12 @@ function Dn() {
|
|
|
6215
6215
|
});
|
|
6216
6216
|
}(Ot)), Ot.exports;
|
|
6217
6217
|
}
|
|
6218
|
-
var Ut = { exports: {} },
|
|
6219
|
-
function
|
|
6220
|
-
return Ce || (Ce = 1, function(y,
|
|
6218
|
+
var Ut = { exports: {} }, yn = Ut.exports, Ce;
|
|
6219
|
+
function Dn() {
|
|
6220
|
+
return Ce || (Ce = 1, function(y, z) {
|
|
6221
6221
|
(function(E, a, g) {
|
|
6222
6222
|
y.exports = a(j(), q0(), H0(), b0(), e0());
|
|
6223
|
-
})(
|
|
6223
|
+
})(yn, function(E) {
|
|
6224
6224
|
return function() {
|
|
6225
6225
|
var a = E, g = a.lib, B = g.BlockCipher, m = a.algo;
|
|
6226
6226
|
const o = 16, v = [
|
|
@@ -7337,41 +7337,41 @@ function bn() {
|
|
|
7337
7337
|
});
|
|
7338
7338
|
}(Ut)), Ut.exports;
|
|
7339
7339
|
}
|
|
7340
|
-
var
|
|
7341
|
-
function
|
|
7342
|
-
return Ae || (Ae = 1, function(y,
|
|
7340
|
+
var gn = it.exports, Ae;
|
|
7341
|
+
function bn() {
|
|
7342
|
+
return Ae || (Ae = 1, function(y, z) {
|
|
7343
7343
|
(function(E, a, g) {
|
|
7344
|
-
y.exports = a(j(), Nt(),
|
|
7345
|
-
})(
|
|
7344
|
+
y.exports = a(j(), Nt(), Ax(), yx(), q0(), bx(), H0(), ye(), Cr(), kx(), De(), qx(), Px(), Ix(), Ar(), Ux(), b0(), e0(), $x(), Vx(), jx(), Gx(), Qx(), tn(), en(), nn(), sn(), fn(), un(), ln(), dn(), Bn(), Cn(), En(), Dn());
|
|
7345
|
+
})(gn, function(E) {
|
|
7346
7346
|
return E;
|
|
7347
7347
|
});
|
|
7348
7348
|
}(it)), it.exports;
|
|
7349
7349
|
}
|
|
7350
|
-
var
|
|
7351
|
-
const B0 = /* @__PURE__ */
|
|
7350
|
+
var mn = bn();
|
|
7351
|
+
const B0 = /* @__PURE__ */ Je(mn), wn = (y, z, E) => B0.AES.encrypt(z, B0.enc.Utf8.parse(y), {
|
|
7352
7352
|
iv: B0.enc.Utf8.parse(E),
|
|
7353
7353
|
mode: B0.mode.CBC,
|
|
7354
7354
|
padding: B0.pad.Pkcs7
|
|
7355
|
-
}).toString(),
|
|
7355
|
+
}).toString(), kn = (y, z, E) => B0.AES.decrypt(z, B0.enc.Utf8.parse(y), {
|
|
7356
7356
|
iv: B0.enc.Utf8.parse(E),
|
|
7357
7357
|
mode: B0.mode.CBC,
|
|
7358
7358
|
padding: B0.pad.Pkcs7
|
|
7359
|
-
}).toString(B0.enc.Utf8),
|
|
7360
|
-
const
|
|
7359
|
+
}).toString(B0.enc.Utf8), _n = (y) => {
|
|
7360
|
+
const z = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
|
|
7361
7361
|
let E = "";
|
|
7362
7362
|
for (let a = 0; a < y; a++)
|
|
7363
|
-
E +=
|
|
7363
|
+
E += z.charAt(Math.floor(Math.random() * z.length));
|
|
7364
7364
|
return E;
|
|
7365
|
-
},
|
|
7366
|
-
key:
|
|
7367
|
-
iv:
|
|
7368
|
-
mode:
|
|
7369
|
-
}).decrypt(y),
|
|
7365
|
+
}, Sn = (y, z) => new Fr.sm4({
|
|
7366
|
+
key: z.key,
|
|
7367
|
+
iv: z.iv,
|
|
7368
|
+
mode: z.mode || "cbc"
|
|
7369
|
+
}).decrypt(y), Rn = (y, z) => new Fr.sm4({ key: z.key, iv: z.iv, mode: z.mode || "cbc" }).encrypt(y);
|
|
7370
7370
|
function Br(y) {
|
|
7371
7371
|
return typeof y == "object" ? JSON.stringify(y ?? {}) : typeof y == "number" ? String(y) : y ?? "";
|
|
7372
7372
|
}
|
|
7373
|
-
function
|
|
7374
|
-
const B = Date.now() + E, m = Math.random().toString(36).substring(2, 15), o = `${B}${y}${m}${Br(a)}${
|
|
7373
|
+
function qn({ uid: y = "", salt: z = "", ts: E = 0, data: a = "", ...g }) {
|
|
7374
|
+
const B = Date.now() + E, m = Math.random().toString(36).substring(2, 15), o = `${B}${y}${m}${Br(a)}${z}`, v = dx.sm3(o);
|
|
7375
7375
|
return {
|
|
7376
7376
|
...g,
|
|
7377
7377
|
"X-Sign-Timestamp": String(B),
|
|
@@ -7379,19 +7379,19 @@ function Pn({ uid: y = "", salt: H = "", ts: E = 0, data: a = "", ...g }) {
|
|
|
7379
7379
|
"X-Sign-Client": v
|
|
7380
7380
|
};
|
|
7381
7381
|
}
|
|
7382
|
-
function
|
|
7383
|
-
const a =
|
|
7382
|
+
function Hn(y, z, E) {
|
|
7383
|
+
const a = _n(16);
|
|
7384
7384
|
let g = {
|
|
7385
7385
|
body: ""
|
|
7386
7386
|
};
|
|
7387
7387
|
return E === "ase" && (g = {
|
|
7388
|
-
body:
|
|
7388
|
+
body: wn(y, Br(z), a)
|
|
7389
7389
|
}), E === "sm4" && (g = {
|
|
7390
7390
|
body: new Fr.sm4({
|
|
7391
7391
|
key: y,
|
|
7392
7392
|
iv: a,
|
|
7393
7393
|
mode: "cbc"
|
|
7394
|
-
}).encrypt(Br(
|
|
7394
|
+
}).encrypt(Br(z))
|
|
7395
7395
|
}), {
|
|
7396
7396
|
headers: {
|
|
7397
7397
|
iv: a,
|
|
@@ -7400,12 +7400,12 @@ function zn(y, H, E) {
|
|
|
7400
7400
|
data: g
|
|
7401
7401
|
};
|
|
7402
7402
|
}
|
|
7403
|
-
function
|
|
7404
|
-
const
|
|
7403
|
+
function Pn(y) {
|
|
7404
|
+
const z = ["script", "iframe", "object", "embed", "link", "meta", "style"], E = ["onerror", "onload", "onclick", "onmouseover", "onfocus", "onmouseenter", "onmouseleave"], a = (v) => /^javascript:/i.test(v) || /^data:text\/html/i.test(v), B = new DOMParser().parseFromString(`<div>${y}</div>`, "text/html"), m = B.body.firstChild;
|
|
7405
7405
|
function o(v) {
|
|
7406
7406
|
if (v.nodeType === Node.ELEMENT_NODE) {
|
|
7407
7407
|
const r = v, s = r.tagName.toLowerCase();
|
|
7408
|
-
if (
|
|
7408
|
+
if (z.includes(s)) {
|
|
7409
7409
|
const C = r.outerHTML, f = B.createTextNode(C);
|
|
7410
7410
|
r.replaceWith(f);
|
|
7411
7411
|
return;
|
|
@@ -7418,12 +7418,9 @@ function In(y) {
|
|
|
7418
7418
|
}
|
|
7419
7419
|
return [...m.childNodes].forEach(o), m.innerHTML;
|
|
7420
7420
|
}
|
|
7421
|
-
const
|
|
7421
|
+
const Tn = () => {
|
|
7422
7422
|
throw window.stop(), window.location.href = "about:blank", new Error("禁止debugger");
|
|
7423
|
-
},
|
|
7424
|
-
const H = Array.from({ length: 1e3 }).map(() => Sn()), E = performance.now();
|
|
7425
|
-
return y(H), performance.now() - E;
|
|
7426
|
-
}, Ln = () => {
|
|
7423
|
+
}, zn = () => {
|
|
7427
7424
|
document.addEventListener(
|
|
7428
7425
|
"keydown",
|
|
7429
7426
|
(y) => {
|
|
@@ -7440,24 +7437,18 @@ const Ee = () => {
|
|
|
7440
7437
|
{ passive: !1 }
|
|
7441
7438
|
), setInterval(() => {
|
|
7442
7439
|
const y = performance.now();
|
|
7443
|
-
|
|
7444
|
-
performance.now() - y > 200 &&
|
|
7445
|
-
|
|
7446
|
-
console.table(g);
|
|
7447
|
-
}), a = ye((g) => {
|
|
7448
|
-
console.log(g);
|
|
7449
|
-
});
|
|
7450
|
-
E && a && E > a * 10 && Ee();
|
|
7451
|
-
});
|
|
7440
|
+
(function() {
|
|
7441
|
+
}).constructor("debugger")(), performance.now() - y > 200 && Tn();
|
|
7442
|
+
}, 500);
|
|
7452
7443
|
};
|
|
7453
7444
|
export {
|
|
7454
|
-
|
|
7455
|
-
|
|
7456
|
-
|
|
7457
|
-
|
|
7458
|
-
|
|
7459
|
-
|
|
7460
|
-
|
|
7461
|
-
|
|
7462
|
-
|
|
7445
|
+
kn as aesDecryptString,
|
|
7446
|
+
wn as aesEncryptString,
|
|
7447
|
+
qn as createHeaders,
|
|
7448
|
+
_n as generateRandomString,
|
|
7449
|
+
Pn as htmlSanitize,
|
|
7450
|
+
Sn as sm4Decrypt,
|
|
7451
|
+
Rn as sm4Encrypt,
|
|
7452
|
+
zn as startNoDebugger,
|
|
7453
|
+
Hn as transmissionDataEncryption
|
|
7463
7454
|
};
|