module-develop-kit 0.3.1 → 0.3.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.d.ts +5 -0
- package/dist/index.es.js +898 -865
- 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 rx(y) {
|
|
3
3
|
return y && y.__esModule && Object.prototype.hasOwnProperty.call(y, "default") ? y.default : y;
|
|
4
4
|
}
|
|
5
|
-
function
|
|
5
|
+
function ex(y) {
|
|
6
6
|
if (Object.prototype.hasOwnProperty.call(y, "__esModule")) return y;
|
|
7
|
-
var
|
|
8
|
-
if (typeof
|
|
7
|
+
var H = y.default;
|
|
8
|
+
if (typeof H == "function") {
|
|
9
9
|
var E = function a() {
|
|
10
|
-
return this instanceof a ? Reflect.construct(
|
|
10
|
+
return this instanceof a ? Reflect.construct(H, arguments, this.constructor) : H.apply(this, arguments);
|
|
11
11
|
};
|
|
12
|
-
E.prototype =
|
|
12
|
+
E.prototype = H.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,63 +22,63 @@ function tx(y) {
|
|
|
22
22
|
}), E;
|
|
23
23
|
}
|
|
24
24
|
var W0 = {}, mr;
|
|
25
|
-
function
|
|
25
|
+
function xx() {
|
|
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 = [], H = [], E = typeof Uint8Array < "u" ? Uint8Array : Array, a = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", g = 0, B = a.length; g < B; ++g)
|
|
29
|
+
y[g] = a[g], H[a.charCodeAt(g)] = g;
|
|
30
|
+
H[45] = 62, H[95] = 63;
|
|
31
31
|
function m(l) {
|
|
32
|
-
var
|
|
33
|
-
if (
|
|
32
|
+
var h = l.length;
|
|
33
|
+
if (h % 4 > 0)
|
|
34
34
|
throw new Error("Invalid string. Length must be a multiple of 4");
|
|
35
35
|
var F = l.indexOf("=");
|
|
36
|
-
F === -1 && (F =
|
|
37
|
-
var i = F ===
|
|
36
|
+
F === -1 && (F = h);
|
|
37
|
+
var i = F === h ? 0 : 4 - F % 4;
|
|
38
38
|
return [F, i];
|
|
39
39
|
}
|
|
40
40
|
function o(l) {
|
|
41
|
-
var
|
|
41
|
+
var h = m(l), F = h[0], i = h[1];
|
|
42
42
|
return (F + i) * 3 / 4 - i;
|
|
43
43
|
}
|
|
44
|
-
function v(l,
|
|
45
|
-
return (
|
|
44
|
+
function v(l, h, F) {
|
|
45
|
+
return (h + F) * 3 / 4 - F;
|
|
46
46
|
}
|
|
47
47
|
function r(l) {
|
|
48
|
-
var
|
|
49
|
-
for (d = 0; d <
|
|
50
|
-
|
|
51
|
-
return p === 2 && (
|
|
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
|
+
for (d = 0; d < u; d += 4)
|
|
50
|
+
h = H[l.charCodeAt(d)] << 18 | H[l.charCodeAt(d + 1)] << 12 | H[l.charCodeAt(d + 2)] << 6 | H[l.charCodeAt(d + 3)], x[n++] = h >> 16 & 255, x[n++] = h >> 8 & 255, x[n++] = h & 255;
|
|
51
|
+
return p === 2 && (h = H[l.charCodeAt(d)] << 2 | H[l.charCodeAt(d + 1)] >> 4, x[n++] = h & 255), p === 1 && (h = H[l.charCodeAt(d)] << 10 | H[l.charCodeAt(d + 1)] << 4 | H[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];
|
|
55
55
|
}
|
|
56
|
-
function C(l,
|
|
57
|
-
for (var i, p = [], x =
|
|
56
|
+
function C(l, h, F) {
|
|
57
|
+
for (var i, p = [], x = h; x < F; x += 3)
|
|
58
58
|
i = (l[x] << 16 & 16711680) + (l[x + 1] << 8 & 65280) + (l[x + 2] & 255), p.push(s(i));
|
|
59
59
|
return p.join("");
|
|
60
60
|
}
|
|
61
61
|
function f(l) {
|
|
62
|
-
for (var
|
|
63
|
-
p.push(C(l, n, n + x >
|
|
64
|
-
return i === 1 ? (
|
|
65
|
-
y[
|
|
66
|
-
)) : i === 2 && (
|
|
67
|
-
y[
|
|
62
|
+
for (var h, F = l.length, i = F % 3, p = [], x = 16383, n = 0, u = F - i; n < u; n += x)
|
|
63
|
+
p.push(C(l, n, n + x > u ? u : n + x));
|
|
64
|
+
return i === 1 ? (h = l[F - 1], p.push(
|
|
65
|
+
y[h >> 2] + y[h << 4 & 63] + "=="
|
|
66
|
+
)) : i === 2 && (h = (l[F - 2] << 8) + l[F - 1], p.push(
|
|
67
|
+
y[h >> 10] + y[h >> 4 & 63] + y[h << 2 & 63] + "="
|
|
68
68
|
)), p.join("");
|
|
69
69
|
}
|
|
70
70
|
return W0;
|
|
71
71
|
}
|
|
72
|
-
const
|
|
72
|
+
const nx = {}, ix = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
73
73
|
__proto__: null,
|
|
74
|
-
default:
|
|
75
|
-
}, Symbol.toStringTag, { value: "Module" })), pr = /* @__PURE__ */
|
|
76
|
-
var ir,
|
|
77
|
-
function
|
|
78
|
-
if (
|
|
79
|
-
|
|
80
|
-
const y =
|
|
81
|
-
class
|
|
74
|
+
default: nx
|
|
75
|
+
}, Symbol.toStringTag, { value: "Module" })), pr = /* @__PURE__ */ ex(ix);
|
|
76
|
+
var ir, wr;
|
|
77
|
+
function ox() {
|
|
78
|
+
if (wr) return ir;
|
|
79
|
+
wr = 1;
|
|
80
|
+
const y = xx();
|
|
81
|
+
class H {
|
|
82
82
|
/**
|
|
83
83
|
* Converts a JS string to an UTF-8 uint8array.
|
|
84
84
|
*
|
|
@@ -126,13 +126,13 @@ function nx() {
|
|
|
126
126
|
return y.toByteArray(a);
|
|
127
127
|
}
|
|
128
128
|
}
|
|
129
|
-
return ir =
|
|
129
|
+
return ir = H, ir;
|
|
130
130
|
}
|
|
131
|
-
var or,
|
|
132
|
-
function
|
|
133
|
-
if (
|
|
134
|
-
|
|
135
|
-
const y =
|
|
131
|
+
var or, _r;
|
|
132
|
+
function sx() {
|
|
133
|
+
if (_r) return or;
|
|
134
|
+
_r = 1;
|
|
135
|
+
const y = ox(), H = 16, E = Uint8Array.from([
|
|
136
136
|
214,
|
|
137
137
|
144,
|
|
138
138
|
233,
|
|
@@ -548,7 +548,7 @@ function ix() {
|
|
|
548
548
|
padding(o) {
|
|
549
549
|
if (o === null)
|
|
550
550
|
return null;
|
|
551
|
-
let v =
|
|
551
|
+
let v = H - o.length % H, 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 ix() {
|
|
|
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 / H, 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
|
|
593
|
+
let h = l * H, 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 <
|
|
598
|
-
C[
|
|
597
|
+
for (let p = 0; p < H; p++)
|
|
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 * H, h = this.uint8ToUint32Block(r, l), F = this.doBlockCrypt(h, this.encryptRoundKeys);
|
|
603
|
+
for (let i = 0; i < H; 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 ix() {
|
|
|
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 / H, 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
|
|
623
|
+
let h = l * H, 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 <
|
|
626
|
-
s[
|
|
625
|
+
for (let x = 0; x < H; x++)
|
|
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 * H, h = this.uint8ToUint32Block(v, l), F = this.doBlockCrypt(h, this.decryptRoundKeys);
|
|
631
|
+
for (let i = 0; i < H; 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 ix() {
|
|
|
638
638
|
return or = B, or;
|
|
639
639
|
}
|
|
640
640
|
var sr, Tr;
|
|
641
|
-
function
|
|
641
|
+
function ax() {
|
|
642
642
|
return Tr || (Tr = 1, sr = {
|
|
643
|
-
sm4:
|
|
643
|
+
sm4: sx()
|
|
644
644
|
}), sr;
|
|
645
645
|
}
|
|
646
|
-
var Fr =
|
|
646
|
+
var Fr = ax(), nt = { exports: {} }, fx = nt.exports, kr;
|
|
647
647
|
function Mt() {
|
|
648
|
-
return
|
|
648
|
+
return kr || (kr = 1, function(y, H) {
|
|
649
649
|
(function() {
|
|
650
650
|
var E, a = 244837814094590, g = (a & 16777215) == 15715070;
|
|
651
651
|
function B(t, e, c) {
|
|
@@ -654,35 +654,35 @@ 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, z, L) {
|
|
658
658
|
for (; --L >= 0; ) {
|
|
659
|
-
var M = e * this[t++] + c[b] +
|
|
660
|
-
|
|
659
|
+
var M = e * this[t++] + c[b] + z;
|
|
660
|
+
z = Math.floor(M / 67108864), c[b++] = M & 67108863;
|
|
661
661
|
}
|
|
662
|
-
return
|
|
662
|
+
return z;
|
|
663
663
|
}
|
|
664
|
-
function v(t, e, c, b,
|
|
664
|
+
function v(t, e, c, b, z, 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] + (z & 1073741823), z = (J >>> 30) + (l0 >>> 15) + N * r0 + (z >>> 30), c[b++] = J & 1073741823;
|
|
668
668
|
}
|
|
669
|
-
return
|
|
669
|
+
return z;
|
|
670
670
|
}
|
|
671
|
-
function r(t, e, c, b,
|
|
671
|
+
function r(t, e, c, b, z, 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] + z, z = (J >> 28) + (l0 >> 14) + N * r0, c[b++] = J & 268435455;
|
|
675
675
|
}
|
|
676
|
-
return
|
|
676
|
+
return z;
|
|
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;
|
|
680
680
|
var C = 52;
|
|
681
681
|
B.prototype.FV = Math.pow(2, C), B.prototype.F1 = C - E, B.prototype.F2 = 2 * E - C;
|
|
682
|
-
var f = "0123456789abcdefghijklmnopqrstuvwxyz", l = new Array(),
|
|
683
|
-
for (
|
|
684
|
-
for (
|
|
685
|
-
for (
|
|
682
|
+
var f = "0123456789abcdefghijklmnopqrstuvwxyz", l = new Array(), h, F;
|
|
683
|
+
for (h = 48, F = 0; F <= 9; ++F) l[h++] = F;
|
|
684
|
+
for (h = 97, F = 10; F < 36; ++F) l[h++] = F;
|
|
685
|
+
for (h = 65, F = 10; F < 36; ++F) l[h++] = F;
|
|
686
686
|
function i(t) {
|
|
687
687
|
return f.charAt(t);
|
|
688
688
|
}
|
|
@@ -697,7 +697,7 @@ function Mt() {
|
|
|
697
697
|
function n(t) {
|
|
698
698
|
this.t = 1, this.s = t < 0 ? -1 : 0, t > 0 ? this[0] = t : t < -1 ? this[0] = t + this.DV : this.t = 0;
|
|
699
699
|
}
|
|
700
|
-
function
|
|
700
|
+
function u(t) {
|
|
701
701
|
var e = m();
|
|
702
702
|
return e.fromInt(t), e;
|
|
703
703
|
}
|
|
@@ -714,20 +714,20 @@ 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, z = !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) == "-" && (z = !0);
|
|
721
721
|
continue;
|
|
722
722
|
}
|
|
723
|
-
|
|
723
|
+
z = !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(), z && 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;
|
|
729
729
|
}
|
|
730
|
-
function
|
|
730
|
+
function _(t) {
|
|
731
731
|
if (this.s < 0) return "-" + this.negate().toString(t);
|
|
732
732
|
var e;
|
|
733
733
|
if (t == 16) e = 4;
|
|
@@ -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, z = !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 && (z = !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 && (z = !0), z && (L += i(b));
|
|
743
|
+
return z ? L : "0";
|
|
744
744
|
}
|
|
745
745
|
function T() {
|
|
746
746
|
var t = m();
|
|
@@ -757,14 +757,14 @@ function Mt() {
|
|
|
757
757
|
for (; --c >= 0; ) if ((e = this[c] - t[c]) != 0) return e;
|
|
758
758
|
return 0;
|
|
759
759
|
}
|
|
760
|
-
function
|
|
760
|
+
function w(t) {
|
|
761
761
|
var e = 1, c;
|
|
762
762
|
return (c = t >>> 16) != 0 && (t = c, e += 16), (c = t >> 8) != 0 && (t = c, e += 8), (c = t >> 4) != 0 && (t = c, e += 4), (c = t >> 2) != 0 && (t = c, e += 2), (c = t >> 1) != 0 && (t = c, e += 1), e;
|
|
763
763
|
}
|
|
764
|
-
function
|
|
765
|
-
return this.t <= 0 ? 0 : this.DB * (this.t - 1) +
|
|
764
|
+
function k() {
|
|
765
|
+
return this.t <= 0 ? 0 : this.DB * (this.t - 1) + w(this[this.t - 1] ^ this.s & this.DM);
|
|
766
766
|
}
|
|
767
|
-
function
|
|
767
|
+
function S(t, e) {
|
|
768
768
|
var c;
|
|
769
769
|
for (c = this.t - 1; c >= 0; --c) e[c + t] = this[c];
|
|
770
770
|
for (c = t - 1; c >= 0; --c) e[c] = 0;
|
|
@@ -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, z = (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] & z) << 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, z = 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) << z, e[M - c] = this[M] >> b;
|
|
795
|
+
b > 0 && (e[this.t - c - 1] |= (this.s & L) << z), 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, z = Math.min(t.t, this.t); c < z; )
|
|
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(), z = c.t;
|
|
813
|
+
for (e.t = z + b.t; --z >= 0; ) e[z] = 0;
|
|
814
|
+
for (z = 0; z < b.t; ++z) e[z + c.t] = c.am(0, b[z], e, z, 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,17 +825,17 @@ 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 z = this.abs();
|
|
829
|
+
if (z.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
|
-
var L = m(), M = this.s, N = t.s, J = this.DB -
|
|
835
|
-
J > 0 ? (b.lShiftTo(J, L),
|
|
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), z.lShiftTo(J, c)) : (b.copyTo(L), z.copyTo(c));
|
|
836
836
|
var r0 = L.t, l0 = L[r0 - 1];
|
|
837
837
|
if (l0 != 0) {
|
|
838
|
-
var
|
|
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();
|
|
839
839
|
for (L.dlShiftTo(xt, g0), c.compareTo(g0) >= 0 && (c[c.t++] = 1, c.subTo(g0, c)), B.ONE.dlShiftTo(r0, g0), g0.subTo(L, L); L.t < r0; ) L[L.t++] = 0;
|
|
840
840
|
for (; --xt >= 0; ) {
|
|
841
841
|
var xr = c[--p0] == l0 ? this.DM : Math.floor(c[p0] * A0 + (c[p0 - 1] + d0) * et);
|
|
@@ -846,7 +846,7 @@ function Mt() {
|
|
|
846
846
|
}
|
|
847
847
|
}
|
|
848
848
|
}
|
|
849
|
-
function
|
|
849
|
+
function P(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
|
}
|
|
@@ -907,11 +907,11 @@ function Mt() {
|
|
|
907
907
|
function P0() {
|
|
908
908
|
return (this.t > 0 ? this[0] & 1 : this.s) == 0;
|
|
909
909
|
}
|
|
910
|
-
function
|
|
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(), z = e.convert(this), L = w(t) - 1;
|
|
913
|
+
for (z.copyTo(c); --L >= 0; )
|
|
914
|
+
if (e.sqrTo(c, b), (t & 1 << L) > 0) e.mulTo(b, z, c);
|
|
915
915
|
else {
|
|
916
916
|
var M = c;
|
|
917
917
|
c = b, b = M;
|
|
@@ -922,8 +922,8 @@ 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 =
|
|
926
|
-
function
|
|
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 = P, B.prototype.modPowInt = z0, B.ZERO = u(0), B.ONE = u(1);
|
|
926
|
+
function _0() {
|
|
927
927
|
var t = m();
|
|
928
928
|
return this.copyTo(t), t;
|
|
929
929
|
}
|
|
@@ -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 =
|
|
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), z = m(), L = m(), M = "";
|
|
955
|
+
for (this.divRemTo(b, z, L); z.signum() > 0; )
|
|
956
|
+
M = (c + L.intValue()).toString(t).substr(1) + M, z.divRemTo(b, z, 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), z = !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 && (z = !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)), z && 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(), z = t & 7;
|
|
979
|
+
b.length = (t >> 3) + 1, e.nextBytes(b), z > 0 ? b[0] &= (1 << z) - 1 : b[0] = 0, this.fromString(b, 256);
|
|
980
980
|
}
|
|
981
981
|
}
|
|
982
|
-
function
|
|
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, z = 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[z++] = 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), z == 0 && (this.s & 128) != (b & 128) && ++z, (z > 0 || b != this.s) && (e[z++] = b);
|
|
989
989
|
return e;
|
|
990
990
|
}
|
|
991
991
|
function Wt(t) {
|
|
@@ -998,23 +998,23 @@ 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, z, 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 (z = t.s & this.DM, b = L; b < this.t; ++b) c[b] = e(this[b], z);
|
|
1005
1005
|
c.t = this.t;
|
|
1006
1006
|
} else {
|
|
1007
|
-
for (
|
|
1007
|
+
for (z = this.s & this.DM, b = L; b < t.t; ++b) c[b] = e(z, t[b]);
|
|
1008
1008
|
c.t = t.t;
|
|
1009
1009
|
}
|
|
1010
1010
|
c.s = e(this.s, t.s), c.clamp();
|
|
1011
1011
|
}
|
|
1012
|
-
function
|
|
1012
|
+
function S0(t, e) {
|
|
1013
1013
|
return t & e;
|
|
1014
1014
|
}
|
|
1015
1015
|
function $t(t) {
|
|
1016
1016
|
var e = m();
|
|
1017
|
-
return this.bitwiseTo(t,
|
|
1017
|
+
return this.bitwiseTo(t, S0, e), e;
|
|
1018
1018
|
}
|
|
1019
1019
|
function L0(t, e) {
|
|
1020
1020
|
return t | e;
|
|
@@ -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, z = Math.min(t.t, this.t); c < z; )
|
|
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 me() {
|
|
1115
1115
|
var t = m();
|
|
1116
1116
|
return this.squareTo(t), t;
|
|
1117
1117
|
}
|
|
1118
|
-
function
|
|
1118
|
+
function we(t) {
|
|
1119
1119
|
var e = m();
|
|
1120
1120
|
return this.divRemTo(t, e, null), e;
|
|
1121
1121
|
}
|
|
1122
|
-
function
|
|
1122
|
+
function _e(t) {
|
|
1123
1123
|
var e = m();
|
|
1124
1124
|
return this.divRemTo(t, null, e), e;
|
|
1125
1125
|
}
|
|
1126
|
-
function
|
|
1126
|
+
function Te(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 ke(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 Se(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 Re(t, e, c) {
|
|
1146
1146
|
t.multiplyTo(e, c);
|
|
1147
1147
|
}
|
|
1148
|
-
function
|
|
1148
|
+
function qe(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 = Re, N0.prototype.sqrTo = qe;
|
|
1152
|
+
function He(t) {
|
|
1153
1153
|
return this.exp(t, new N0());
|
|
1154
1154
|
}
|
|
1155
|
-
function
|
|
1155
|
+
function Pe(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 z;
|
|
1159
|
+
for (z = c.t - this.t; b < z; ++b) c[b + this.t] = this.am(0, t[b], c, b, 0, this.t);
|
|
1160
|
+
for (z = Math.min(t.t, e); b < z; ++b) this.am(0, t[b], c, b, 0, e - b);
|
|
1161
1161
|
c.clamp();
|
|
1162
1162
|
}
|
|
1163
|
-
function
|
|
1163
|
+
function ze(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 Ie(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 Le(t) {
|
|
1181
1181
|
return t;
|
|
1182
1182
|
}
|
|
1183
|
-
function
|
|
1183
|
+
function Oe(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 Ue(t, e) {
|
|
1188
1188
|
t.squareTo(e), this.reduce(e);
|
|
1189
1189
|
}
|
|
1190
|
-
function
|
|
1190
|
+
function Me(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 = Ie, R0.prototype.revert = Le, R0.prototype.reduce = Oe, R0.prototype.mulTo = Me, R0.prototype.sqrTo = Ue;
|
|
1194
|
+
function Ne(t, e) {
|
|
1195
|
+
var c = t.bitLength(), b, z = u(1), L;
|
|
1196
|
+
if (c <= 0) return z;
|
|
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) {
|
|
@@ -1201,35 +1201,35 @@ function Mt() {
|
|
|
1201
1201
|
for (L.sqrTo(M[1], l0); N <= r0; )
|
|
1202
1202
|
M[N] = m(), L.mulTo(l0, M[N - 2], M[N]), N += 2;
|
|
1203
1203
|
}
|
|
1204
|
-
var
|
|
1205
|
-
for (c =
|
|
1206
|
-
for (c >= J ? A0 = t[
|
|
1204
|
+
var h0 = t.t - 1, A0, et = !0, d0 = m(), p0;
|
|
1205
|
+
for (c = w(t[h0]) - 1; h0 >= 0; ) {
|
|
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
|
-
if ((c -= N) < 0 && (c += this.DB, --
|
|
1209
|
-
M[A0].copyTo(
|
|
1208
|
+
if ((c -= N) < 0 && (c += this.DB, --h0), et)
|
|
1209
|
+
M[A0].copyTo(z), et = !1;
|
|
1210
1210
|
else {
|
|
1211
1211
|
for (; N > 1; )
|
|
1212
|
-
L.sqrTo(
|
|
1213
|
-
N > 0 ? L.sqrTo(
|
|
1212
|
+
L.sqrTo(z, d0), L.sqrTo(d0, z), N -= 2;
|
|
1213
|
+
N > 0 ? L.sqrTo(z, d0) : (p0 = z, z = d0, d0 = p0), L.mulTo(d0, M[A0], z);
|
|
1214
1214
|
}
|
|
1215
|
-
for (;
|
|
1216
|
-
L.sqrTo(
|
|
1215
|
+
for (; h0 >= 0 && (t[h0] & 1 << c) == 0; )
|
|
1216
|
+
L.sqrTo(z, d0), p0 = z, z = d0, d0 = p0, --c < 0 && (c = this.DB - 1, --h0);
|
|
1217
1217
|
}
|
|
1218
|
-
return L.revert(
|
|
1218
|
+
return L.revert(z);
|
|
1219
1219
|
}
|
|
1220
|
-
function
|
|
1220
|
+
function We(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 z = e.getLowestSetBit(), L = c.getLowestSetBit();
|
|
1227
1227
|
if (L < 0) return e;
|
|
1228
|
-
for (
|
|
1229
|
-
(
|
|
1228
|
+
for (z < L && (L = z), L > 0 && (e.rShiftTo(L, e), c.rShiftTo(L, c)); e.signum() > 0; )
|
|
1229
|
+
(z = e.getLowestSetBit()) > 0 && e.rShiftTo(z, e), (z = c.getLowestSetBit()) > 0 && c.rShiftTo(z, 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 $e(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 Ke(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(), z = 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 ? ((!z.isEven() || !L.isEven()) && (z.addTo(this, z), L.subTo(t, L)), z.rShiftTo(1, z)) : 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 && z.subTo(M, z), L.subTo(N, L)) : (b.subTo(c, b), e && M.subTo(z, 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], Ve = (1 << 26) / o0[o0.length - 1];
|
|
1257
|
+
function Xe(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], z = e + 1; z < o0.length && b < Ve; ) b *= o0[z++];
|
|
1267
|
+
for (b = c.modInt(b); e < z; ) if (b % o0[e++] == 0) return !1;
|
|
1268
1268
|
}
|
|
1269
1269
|
return c.millerRabin(t);
|
|
1270
1270
|
}
|
|
1271
|
-
function
|
|
1271
|
+
function je(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 z = m(), L = 0; L < t; ++L) {
|
|
1277
|
+
z.fromInt(o0[Math.floor(Math.random() * o0.length)]);
|
|
1278
|
+
var M = z.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,51 +1284,51 @@ 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 =
|
|
1288
|
-
var rt,
|
|
1289
|
-
function
|
|
1290
|
-
|
|
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 = ke, B.prototype.dAddOffset = Se, B.prototype.multiplyLowerTo = Pe, B.prototype.multiplyUpperTo = ze, B.prototype.modInt = $e, B.prototype.millerRabin = je, 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 = we, B.prototype.remainder = _e, B.prototype.divideAndRemainder = Te, B.prototype.modPow = Ne, B.prototype.modInverse = Ke, B.prototype.pow = He, B.prototype.gcd = We, B.prototype.isProbablePrime = Xe, B.prototype.square = me, B.prototype.Barrett = R0;
|
|
1288
|
+
var rt, u0, t0;
|
|
1289
|
+
function Ze(t) {
|
|
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
|
+
Ze((/* @__PURE__ */ new Date()).getTime());
|
|
1294
1294
|
}
|
|
1295
|
-
if (
|
|
1296
|
-
|
|
1295
|
+
if (u0 == null) {
|
|
1296
|
+
u0 = new Array(), t0 = 0;
|
|
1297
1297
|
var v0;
|
|
1298
1298
|
if (typeof window < "u" && window.crypto) {
|
|
1299
1299
|
if (window.crypto.getRandomValues) {
|
|
1300
1300
|
var Dr = new Uint8Array(32);
|
|
1301
1301
|
for (window.crypto.getRandomValues(Dr), v0 = 0; v0 < 32; ++v0)
|
|
1302
|
-
|
|
1302
|
+
u0[t0++] = Dr[v0];
|
|
1303
1303
|
} else if (navigator.appName == "Netscape" && navigator.appVersion < "5") {
|
|
1304
1304
|
var gr = window.crypto.random(32);
|
|
1305
1305
|
for (v0 = 0; v0 < gr.length; ++v0)
|
|
1306
|
-
|
|
1306
|
+
u0[t0++] = gr.charCodeAt(v0) & 255;
|
|
1307
1307
|
}
|
|
1308
1308
|
}
|
|
1309
1309
|
for (; t0 < er; )
|
|
1310
|
-
v0 = Math.floor(65536 * Math.random()),
|
|
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 Ge() {
|
|
1314
1314
|
if (rt == null) {
|
|
1315
|
-
for (yr(), rt =
|
|
1316
|
-
|
|
1315
|
+
for (yr(), rt = tx(), rt.init(u0), t0 = 0; t0 < u0.length; ++t0)
|
|
1316
|
+
u0[t0] = 0;
|
|
1317
1317
|
t0 = 0;
|
|
1318
1318
|
}
|
|
1319
1319
|
return rt.next();
|
|
1320
1320
|
}
|
|
1321
|
-
function
|
|
1321
|
+
function Ye(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] = Ge();
|
|
1324
1324
|
}
|
|
1325
1325
|
function br() {
|
|
1326
1326
|
}
|
|
1327
|
-
br.prototype.nextBytes =
|
|
1327
|
+
br.prototype.nextBytes = Ye;
|
|
1328
1328
|
function rr() {
|
|
1329
1329
|
this.i = 0, this.j = 0, this.S = new Array();
|
|
1330
1330
|
}
|
|
1331
|
-
function
|
|
1331
|
+
function Qe(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 Je() {
|
|
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 = Qe, rr.prototype.next = Je;
|
|
1344
|
+
function tx() {
|
|
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(fx);
|
|
1354
1354
|
}(nt)), nt.exports;
|
|
1355
1355
|
}
|
|
1356
|
-
var ar,
|
|
1357
|
-
function
|
|
1358
|
-
if (
|
|
1359
|
-
|
|
1356
|
+
var ar, Sr;
|
|
1357
|
+
function cx() {
|
|
1358
|
+
if (Sr) return ar;
|
|
1359
|
+
Sr = 1;
|
|
1360
1360
|
const { BigInteger: y } = Mt();
|
|
1361
|
-
function
|
|
1361
|
+
function H(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 ax() {
|
|
|
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 = H(r));
|
|
1397
1397
|
}
|
|
1398
1398
|
getValue() {
|
|
1399
1399
|
return this.v;
|
|
@@ -1430,16 +1430,16 @@ function ax() {
|
|
|
1430
1430
|
* 解析 ASN.1 der,针对 sm2 验签
|
|
1431
1431
|
*/
|
|
1432
1432
|
decodeDer(v) {
|
|
1433
|
-
const r = o(v, 0), s = o(v, r), C = m(v, r), f = v.substr(s, C * 2), l = s + f.length,
|
|
1433
|
+
const r = o(v, 0), s = o(v, r), C = m(v, r), f = v.substr(s, C * 2), l = s + f.length, h = o(v, l), F = m(v, l), i = v.substr(h, F * 2), p = new y(f, 16), x = new y(i, 16);
|
|
1434
1434
|
return { r: p, s: x };
|
|
1435
1435
|
}
|
|
1436
1436
|
}, ar;
|
|
1437
1437
|
}
|
|
1438
1438
|
var fr, Rr;
|
|
1439
|
-
function
|
|
1439
|
+
function ux() {
|
|
1440
1440
|
if (Rr) return fr;
|
|
1441
1441
|
Rr = 1;
|
|
1442
|
-
const { BigInteger: y } = Mt(),
|
|
1442
|
+
const { BigInteger: y } = Mt(), H = new y("2"), E = new y("3");
|
|
1443
1443
|
class a {
|
|
1444
1444
|
constructor(o, v) {
|
|
1445
1445
|
this.x = v, this.q = o;
|
|
@@ -1544,11 +1544,11 @@ function fx() {
|
|
|
1544
1544
|
add(o) {
|
|
1545
1545
|
if (this.isInfinity()) return o;
|
|
1546
1546
|
if (o.isInfinity()) return this;
|
|
1547
|
-
const v = this.x.toBigInteger(), r = this.y.toBigInteger(), s = this.z, C = o.x.toBigInteger(), f = o.y.toBigInteger(), l = o.z,
|
|
1547
|
+
const v = this.x.toBigInteger(), r = this.y.toBigInteger(), s = this.z, C = o.x.toBigInteger(), f = o.y.toBigInteger(), l = o.z, h = this.curve.q, F = v.multiply(l).mod(h), i = C.multiply(s).mod(h), p = F.subtract(i), x = r.multiply(l).mod(h), n = f.multiply(s).mod(h), u = x.subtract(n);
|
|
1548
1548
|
if (y.ZERO.equals(p))
|
|
1549
|
-
return y.ZERO.equals(
|
|
1550
|
-
const d = F.add(i), A = s.multiply(l).mod(
|
|
1551
|
-
return new g(this.curve, this.curve.fromBigInteger(D), this.curve.fromBigInteger(
|
|
1549
|
+
return y.ZERO.equals(u) ? this.twice() : this.curve.infinity;
|
|
1550
|
+
const d = F.add(i), A = s.multiply(l).mod(h), _ = p.square().mod(h), T = p.multiply(_).mod(h), q = A.multiply(u.square()).subtract(d.multiply(_)).mod(h), D = p.multiply(q).mod(h), w = u.multiply(_.multiply(F).subtract(q)).subtract(x.multiply(T)).mod(h), k = T.multiply(A).mod(h);
|
|
1551
|
+
return new g(this.curve, this.curve.fromBigInteger(D), this.curve.fromBigInteger(w), k);
|
|
1552
1552
|
}
|
|
1553
1553
|
/**
|
|
1554
1554
|
* 自加
|
|
@@ -1568,8 +1568,8 @@ function fx() {
|
|
|
1568
1568
|
twice() {
|
|
1569
1569
|
if (this.isInfinity()) return this;
|
|
1570
1570
|
if (!this.y.toBigInteger().signum()) return this.curve.infinity;
|
|
1571
|
-
const o = this.x.toBigInteger(), v = this.y.toBigInteger(), r = this.z, s = this.curve.q, C = this.curve.a.toBigInteger(), f = o.square().multiply(E).add(C.multiply(r.square())).mod(s), l = v.shiftLeft(1).multiply(r).mod(s),
|
|
1572
|
-
return new g(this.curve, this.curve.fromBigInteger(x), this.curve.fromBigInteger(n),
|
|
1571
|
+
const o = this.x.toBigInteger(), v = this.y.toBigInteger(), r = this.z, s = this.curve.q, C = this.curve.a.toBigInteger(), f = o.square().multiply(E).add(C.multiply(r.square())).mod(s), l = v.shiftLeft(1).multiply(r).mod(s), h = v.square().mod(s), F = h.multiply(o).multiply(r).mod(s), i = l.square().mod(s), p = f.square().subtract(F.shiftLeft(3)).mod(s), x = l.multiply(p).mod(s), n = f.multiply(F.shiftLeft(2).subtract(p)).subtract(i.shiftLeft(1).multiply(h)).mod(s), u = l.multiply(i).mod(s);
|
|
1572
|
+
return new g(this.curve, this.curve.fromBigInteger(x), this.curve.fromBigInteger(n), u);
|
|
1573
1573
|
}
|
|
1574
1574
|
/**
|
|
1575
1575
|
* 倍点计算
|
|
@@ -1620,7 +1620,7 @@ function fx() {
|
|
|
1620
1620
|
this.q.divide(new y("4")).add(y.ONE),
|
|
1621
1621
|
this.q
|
|
1622
1622
|
));
|
|
1623
|
-
return r.toBigInteger().mod(
|
|
1623
|
+
return r.toBigInteger().mod(H).equals(new y(o.substr(0, 2), 16).subtract(H)) || (r = r.negate()), new g(this, v, r);
|
|
1624
1624
|
case 4:
|
|
1625
1625
|
case 6:
|
|
1626
1626
|
case 7:
|
|
@@ -1637,36 +1637,36 @@ function fx() {
|
|
|
1637
1637
|
}, fr;
|
|
1638
1638
|
}
|
|
1639
1639
|
var cr, qr;
|
|
1640
|
-
function
|
|
1640
|
+
function hx() {
|
|
1641
1641
|
if (qr) return cr;
|
|
1642
1642
|
qr = 1;
|
|
1643
|
-
const { BigInteger: y, SecureRandom:
|
|
1643
|
+
const { BigInteger: y, SecureRandom: H } = Mt(), { ECCurveFp: E } = ux(), a = new H(), { curve: g, G: B, n: m } = v();
|
|
1644
1644
|
function o() {
|
|
1645
1645
|
return g;
|
|
1646
1646
|
}
|
|
1647
1647
|
function v() {
|
|
1648
|
-
const x = new y("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFF", 16), n = new y("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFC", 16),
|
|
1648
|
+
const x = new y("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFF", 16), n = new y("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFC", 16), u = new y("28E9FA9E9D9F5E344D5A9E4BCF6509A7F39789F515AB8F92DDBCBD414D940E93", 16), d = new E(x, n, u), T = d.decodePointHex("04" + "32C4AE2C1F1981195F9904466A39C9948FE30BBFF2660BE1715A4589334C74C7" + "BC3736A2F4F6779C59BDCEE36B692153D0A9877CC62A474002DF32E52139F0A0"), q = new y("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFF7203DF6B21C6052B53BBF40939D54123", 16);
|
|
1649
1649
|
return { curve: d, G: T, n: q };
|
|
1650
1650
|
}
|
|
1651
|
-
function r(x, n,
|
|
1652
|
-
const A = (x ? new y(x, n,
|
|
1653
|
-
return { privateKey:
|
|
1651
|
+
function r(x, n, u) {
|
|
1652
|
+
const A = (x ? new y(x, n, u) : new y(m.bitLength(), a)).mod(m.subtract(y.ONE)).add(y.ONE), _ = f(A.toString(16), 64), T = B.multiply(A), q = f(T.getX().toBigInteger().toString(16), 64), D = f(T.getY().toBigInteger().toString(16), 64), w = "04" + q + D;
|
|
1653
|
+
return { privateKey: _, publicKey: w };
|
|
1654
1654
|
}
|
|
1655
1655
|
function s(x) {
|
|
1656
1656
|
if (x.length !== 130) throw new Error("Invalid public key to compress");
|
|
1657
|
-
const n = (x.length - 2) / 2,
|
|
1657
|
+
const n = (x.length - 2) / 2, u = x.substr(2, n), d = new y(x.substr(n + 2, n), 16);
|
|
1658
1658
|
let A = "03";
|
|
1659
|
-
return d.mod(new y("2")).equals(y.ZERO) && (A = "02"), A +
|
|
1659
|
+
return d.mod(new y("2")).equals(y.ZERO) && (A = "02"), A + u;
|
|
1660
1660
|
}
|
|
1661
1661
|
function C(x) {
|
|
1662
1662
|
x = unescape(encodeURIComponent(x));
|
|
1663
|
-
const n = x.length,
|
|
1663
|
+
const n = x.length, u = [];
|
|
1664
1664
|
for (let A = 0; A < n; A++)
|
|
1665
|
-
|
|
1665
|
+
u[A >>> 2] |= (x.charCodeAt(A) & 255) << 24 - A % 4 * 8;
|
|
1666
1666
|
const d = [];
|
|
1667
1667
|
for (let A = 0; A < n; A++) {
|
|
1668
|
-
const
|
|
1669
|
-
d.push((
|
|
1668
|
+
const _ = u[A >>> 2] >>> 24 - A % 4 * 8 & 255;
|
|
1669
|
+
d.push((_ >>> 4).toString(16)), d.push((_ & 15).toString(16));
|
|
1670
1670
|
}
|
|
1671
1671
|
return d.join("");
|
|
1672
1672
|
}
|
|
@@ -1676,16 +1676,16 @@ function cx() {
|
|
|
1676
1676
|
function l(x) {
|
|
1677
1677
|
return x.map((n) => (n = n.toString(16), n.length === 1 ? "0" + n : n)).join("");
|
|
1678
1678
|
}
|
|
1679
|
-
function
|
|
1679
|
+
function h(x) {
|
|
1680
1680
|
const n = [];
|
|
1681
|
-
let
|
|
1681
|
+
let u = 0;
|
|
1682
1682
|
for (let d = 0; d < x.length * 2; d += 2)
|
|
1683
|
-
n[d >>> 3] |= parseInt(x[
|
|
1683
|
+
n[d >>> 3] |= parseInt(x[u], 10) << 24 - d % 8 * 4, u++;
|
|
1684
1684
|
try {
|
|
1685
1685
|
const d = [];
|
|
1686
1686
|
for (let A = 0; A < x.length; A++) {
|
|
1687
|
-
const
|
|
1688
|
-
d.push(String.fromCharCode(
|
|
1687
|
+
const _ = n[A >>> 2] >>> 24 - A % 4 * 8 & 255;
|
|
1688
|
+
d.push(String.fromCharCode(_));
|
|
1689
1689
|
}
|
|
1690
1690
|
return decodeURIComponent(escape(d.join("")));
|
|
1691
1691
|
} catch {
|
|
@@ -1694,23 +1694,23 @@ function cx() {
|
|
|
1694
1694
|
}
|
|
1695
1695
|
function F(x) {
|
|
1696
1696
|
const n = [];
|
|
1697
|
-
let
|
|
1698
|
-
|
|
1699
|
-
for (let d = 0; d <
|
|
1697
|
+
let u = x.length;
|
|
1698
|
+
u % 2 !== 0 && (x = f(x, u + 1)), u = x.length;
|
|
1699
|
+
for (let d = 0; d < u; d += 2)
|
|
1700
1700
|
n.push(parseInt(x.substr(d, 2), 16));
|
|
1701
1701
|
return n;
|
|
1702
1702
|
}
|
|
1703
1703
|
function i(x) {
|
|
1704
1704
|
const n = g.decodePointHex(x);
|
|
1705
1705
|
if (!n) return !1;
|
|
1706
|
-
const
|
|
1707
|
-
return n.getY().square().equals(
|
|
1706
|
+
const u = n.getX();
|
|
1707
|
+
return n.getY().square().equals(u.multiply(u.square()).add(u.multiply(g.a)).add(g.b));
|
|
1708
1708
|
}
|
|
1709
1709
|
function p(x, n) {
|
|
1710
|
-
const
|
|
1711
|
-
if (!
|
|
1710
|
+
const u = g.decodePointHex(x);
|
|
1711
|
+
if (!u) return !1;
|
|
1712
1712
|
const d = g.decodePointHex(n);
|
|
1713
|
-
return d ?
|
|
1713
|
+
return d ? u.equals(d) : !1;
|
|
1714
1714
|
}
|
|
1715
1715
|
return cr = {
|
|
1716
1716
|
getGlobalCurve: o,
|
|
@@ -1720,24 +1720,24 @@ function cx() {
|
|
|
1720
1720
|
utf8ToHex: C,
|
|
1721
1721
|
leftPad: f,
|
|
1722
1722
|
arrayToHex: l,
|
|
1723
|
-
arrayToUtf8:
|
|
1723
|
+
arrayToUtf8: h,
|
|
1724
1724
|
hexToArray: F,
|
|
1725
1725
|
verifyPublicKey: i,
|
|
1726
1726
|
comparePublicKeyHex: p
|
|
1727
1727
|
}, cr;
|
|
1728
1728
|
}
|
|
1729
|
-
var
|
|
1730
|
-
function
|
|
1731
|
-
if (Hr) return
|
|
1729
|
+
var ur, Hr;
|
|
1730
|
+
function De() {
|
|
1731
|
+
if (Hr) return ur;
|
|
1732
1732
|
Hr = 1;
|
|
1733
|
-
const y = new Uint32Array(68),
|
|
1733
|
+
const y = new Uint32Array(68), H = new Uint32Array(64);
|
|
1734
1734
|
function E(C, f) {
|
|
1735
1735
|
const l = f & 31;
|
|
1736
1736
|
return C << l | C >>> 32 - l;
|
|
1737
1737
|
}
|
|
1738
1738
|
function a(C, f) {
|
|
1739
1739
|
const l = [];
|
|
1740
|
-
for (let
|
|
1740
|
+
for (let h = C.length - 1; h >= 0; h--) l[h] = (C[h] ^ f[h]) & 255;
|
|
1741
1741
|
return l;
|
|
1742
1742
|
}
|
|
1743
1743
|
function g(C) {
|
|
@@ -1749,8 +1749,8 @@ function Ee() {
|
|
|
1749
1749
|
function m(C) {
|
|
1750
1750
|
let f = C.length * 8, l = f % 512;
|
|
1751
1751
|
l = l >= 448 ? 512 - l % 448 - 1 : 448 - l - 1;
|
|
1752
|
-
const
|
|
1753
|
-
for (let d = 0, A =
|
|
1752
|
+
const h = new Array((l - 7) / 8), F = new Array(8);
|
|
1753
|
+
for (let d = 0, A = h.length; d < A; d++) h[d] = 0;
|
|
1754
1754
|
for (let d = 0, A = F.length; d < A; d++) F[d] = 0;
|
|
1755
1755
|
f = f.toString(2);
|
|
1756
1756
|
for (let d = 7; d >= 0; d--)
|
|
@@ -1758,60 +1758,60 @@ function Ee() {
|
|
|
1758
1758
|
const A = f.length - 8;
|
|
1759
1759
|
F[d] = parseInt(f.substr(A), 2), f = f.substr(0, A);
|
|
1760
1760
|
} else f.length > 0 && (F[d] = parseInt(f, 2), f = "");
|
|
1761
|
-
const i = new Uint8Array([...C, 128, ...
|
|
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), H.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
|
-
|
|
1771
|
-
const
|
|
1772
|
-
let q = n[0], D = n[1],
|
|
1770
|
+
H[R] = y[R] ^ y[R + 4];
|
|
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, P;
|
|
1773
1773
|
for (let R = 0; R < 64; R++)
|
|
1774
|
-
|
|
1775
|
-
n[0] ^= q, n[1] ^= D, n[2] ^=
|
|
1774
|
+
P = R >= 0 && R <= 15 ? _ : T, V = E(E(q, 12) + S + E(P, R), 7), X = V ^ E(q, 12), G = (R >= 0 && R <= 15 ? q ^ D ^ w : q & D | q & w | D & w) + k + X + H[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
|
+
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
|
-
const
|
|
1777
|
+
const u = [];
|
|
1778
1778
|
for (let d = 0, A = n.length; d < A; d++) {
|
|
1779
|
-
const
|
|
1780
|
-
|
|
1779
|
+
const _ = n[d];
|
|
1780
|
+
u.push((_ & 4278190080) >>> 24, (_ & 16711680) >>> 16, (_ & 65280) >>> 8, _ & 255);
|
|
1781
1781
|
}
|
|
1782
|
-
return
|
|
1782
|
+
return u;
|
|
1783
1783
|
}
|
|
1784
1784
|
const o = 64, v = new Uint8Array(o), r = new Uint8Array(o);
|
|
1785
1785
|
for (let C = 0; C < o; C++)
|
|
1786
1786
|
v[C] = 54, r[C] = 92;
|
|
1787
1787
|
function s(C, f) {
|
|
1788
1788
|
for (f.length > o && (f = m(f)); f.length < o; ) f.push(0);
|
|
1789
|
-
const l = a(f, v),
|
|
1790
|
-
return m([...
|
|
1789
|
+
const l = a(f, v), h = a(f, r), F = m([...l, ...C]);
|
|
1790
|
+
return m([...h, ...F]);
|
|
1791
1791
|
}
|
|
1792
|
-
return
|
|
1792
|
+
return ur = {
|
|
1793
1793
|
sm3: m,
|
|
1794
1794
|
hmac: s
|
|
1795
|
-
},
|
|
1795
|
+
}, ur;
|
|
1796
1796
|
}
|
|
1797
|
-
var
|
|
1798
|
-
function
|
|
1799
|
-
if (Pr) return
|
|
1797
|
+
var hr, Pr;
|
|
1798
|
+
function lx() {
|
|
1799
|
+
if (Pr) return hr;
|
|
1800
1800
|
Pr = 1;
|
|
1801
|
-
const { BigInteger: y } = Mt(), { encodeDer:
|
|
1801
|
+
const { BigInteger: y } = Mt(), { encodeDer: H, decodeDer: E } = cx(), a = hx(), g = De().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
|
-
const n = a.generateKeyPairHex(),
|
|
1804
|
+
const n = a.generateKeyPairHex(), u = new y(n.privateKey, 16);
|
|
1805
1805
|
let d = n.publicKey;
|
|
1806
1806
|
d.length > 128 && (d = d.substr(d.length - 128));
|
|
1807
|
-
const A = p.multiply(
|
|
1808
|
-
let D = 1,
|
|
1809
|
-
const
|
|
1810
|
-
|
|
1807
|
+
const A = p.multiply(u), _ = a.hexToArray(a.leftPad(A.getX().toBigInteger().toRadix(16), 64)), T = a.hexToArray(a.leftPad(A.getY().toBigInteger().toRadix(16), 64)), q = a.arrayToHex(g([].concat(_, i, T)));
|
|
1808
|
+
let D = 1, w = 0, k = [];
|
|
1809
|
+
const S = [].concat(_, T), U = () => {
|
|
1810
|
+
k = g([...S, D >> 24 & 255, D >> 16 & 255, D >> 8 & 255, D & 255]), D++, w = 0;
|
|
1811
1811
|
};
|
|
1812
1812
|
U();
|
|
1813
1813
|
for (let $ = 0, V = i.length; $ < V; $++)
|
|
1814
|
-
|
|
1814
|
+
w === k.length && U(), i[$] ^= k[w++] & 255;
|
|
1815
1815
|
const W = a.arrayToHex(i);
|
|
1816
1816
|
return x === v ? d + W + q : d + q + W;
|
|
1817
1817
|
}
|
|
@@ -1819,68 +1819,68 @@ function hx() {
|
|
|
1819
1819
|
output: n = "string"
|
|
1820
1820
|
} = {}) {
|
|
1821
1821
|
p = new y(p, 16);
|
|
1822
|
-
let
|
|
1823
|
-
x === v && (
|
|
1822
|
+
let u = i.substr(128, 64), d = i.substr(192);
|
|
1823
|
+
x === v && (u = i.substr(i.length - 64), d = i.substr(128, i.length - 128 - 64));
|
|
1824
1824
|
const A = a.hexToArray(d), T = a.getGlobalCurve().decodePointHex("04" + i.substr(0, 128)).multiply(p), q = a.hexToArray(a.leftPad(T.getX().toBigInteger().toRadix(16), 64)), D = a.hexToArray(a.leftPad(T.getY().toBigInteger().toRadix(16), 64));
|
|
1825
|
-
let
|
|
1825
|
+
let w = 1, k = 0, S = [];
|
|
1826
1826
|
const U = [].concat(q, D), W = () => {
|
|
1827
|
-
|
|
1827
|
+
S = g([...U, w >> 24 & 255, w >> 16 & 255, w >> 8 & 255, w & 255]), w++, k = 0;
|
|
1828
1828
|
};
|
|
1829
1829
|
W();
|
|
1830
1830
|
for (let V = 0, X = A.length; V < X; V++)
|
|
1831
|
-
|
|
1832
|
-
return a.arrayToHex(g([].concat(q, A, D))) ===
|
|
1831
|
+
k === S.length && W(), A[V] ^= S[k++] & 255;
|
|
1832
|
+
return a.arrayToHex(g([].concat(q, A, D))) === u.toLowerCase() ? n === "array" ? A : a.arrayToUtf8(A) : n === "array" ? [] : "";
|
|
1833
1833
|
}
|
|
1834
1834
|
function C(i, p, {
|
|
1835
1835
|
pointPool: x,
|
|
1836
1836
|
der: n,
|
|
1837
|
-
hash:
|
|
1837
|
+
hash: u,
|
|
1838
1838
|
publicKey: d,
|
|
1839
1839
|
userId: A
|
|
1840
1840
|
} = {}) {
|
|
1841
|
-
let
|
|
1842
|
-
|
|
1843
|
-
const T = new y(p, 16), q = new y(
|
|
1844
|
-
let D = null,
|
|
1841
|
+
let _ = typeof i == "string" ? a.utf8ToHex(i) : a.arrayToHex(i);
|
|
1842
|
+
u && (d = d || h(p), _ = l(_, d, A));
|
|
1843
|
+
const T = new y(p, 16), q = new y(_, 16);
|
|
1844
|
+
let D = null, w = null, k = null;
|
|
1845
1845
|
do {
|
|
1846
1846
|
do {
|
|
1847
|
-
let
|
|
1848
|
-
x && x.length ?
|
|
1849
|
-
} while (
|
|
1850
|
-
|
|
1851
|
-
} while (
|
|
1852
|
-
return n ?
|
|
1847
|
+
let S;
|
|
1848
|
+
x && x.length ? S = x.pop() : S = F(), D = S.k, w = q.add(S.x1).mod(o);
|
|
1849
|
+
} while (w.equals(y.ZERO) || w.add(D).equals(o));
|
|
1850
|
+
k = T.add(y.ONE).modInverse(o).multiply(D.subtract(w.multiply(T))).mod(o);
|
|
1851
|
+
} while (k.equals(y.ZERO));
|
|
1852
|
+
return n ? H(w, k) : a.leftPad(w.toString(16), 64) + a.leftPad(k.toString(16), 64);
|
|
1853
1853
|
}
|
|
1854
|
-
function f(i, p, x, { der: n, hash:
|
|
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);
|
|
1856
|
-
|
|
1857
|
-
let
|
|
1856
|
+
u && (A = l(A, x, d));
|
|
1857
|
+
let _, T;
|
|
1858
1858
|
if (n) {
|
|
1859
1859
|
const U = E(p);
|
|
1860
|
-
|
|
1860
|
+
_ = U.r, T = U.s;
|
|
1861
1861
|
} else
|
|
1862
|
-
|
|
1863
|
-
const q = m.decodePointHex(x), D = new y(A, 16),
|
|
1864
|
-
if (
|
|
1865
|
-
const
|
|
1866
|
-
return
|
|
1862
|
+
_ = new y(p.substring(0, 64), 16), T = new y(p.substring(64), 16);
|
|
1863
|
+
const q = m.decodePointHex(x), D = new y(A, 16), w = _.add(T).mod(o);
|
|
1864
|
+
if (w.equals(y.ZERO)) return !1;
|
|
1865
|
+
const k = B.multiply(T).add(q.multiply(w)), S = D.add(k.getX().toBigInteger()).mod(o);
|
|
1866
|
+
return _.equals(S);
|
|
1867
1867
|
}
|
|
1868
1868
|
function l(i, p, x = "1234567812345678") {
|
|
1869
1869
|
x = a.utf8ToHex(x);
|
|
1870
|
-
const n = a.leftPad(B.curve.a.toBigInteger().toRadix(16), 64),
|
|
1871
|
-
let
|
|
1870
|
+
const n = a.leftPad(B.curve.a.toBigInteger().toRadix(16), 64), u = a.leftPad(B.curve.b.toBigInteger().toRadix(16), 64), d = a.leftPad(B.getX().toBigInteger().toRadix(16), 64), A = a.leftPad(B.getY().toBigInteger().toRadix(16), 64);
|
|
1871
|
+
let _, T;
|
|
1872
1872
|
if (p.length === 128)
|
|
1873
|
-
|
|
1873
|
+
_ = p.substr(0, 64), T = p.substr(64, 64);
|
|
1874
1874
|
else {
|
|
1875
|
-
const
|
|
1876
|
-
|
|
1875
|
+
const k = B.curve.decodePointHex(p);
|
|
1876
|
+
_ = a.leftPad(k.getX().toBigInteger().toRadix(16), 64), T = a.leftPad(k.getY().toBigInteger().toRadix(16), 64);
|
|
1877
1877
|
}
|
|
1878
|
-
const q = a.hexToArray(x + n +
|
|
1878
|
+
const q = a.hexToArray(x + n + u + d + A + _ + T), D = x.length * 4;
|
|
1879
1879
|
q.unshift(D & 255), q.unshift(D >> 8 & 255);
|
|
1880
|
-
const
|
|
1881
|
-
return a.arrayToHex(g(
|
|
1880
|
+
const w = g(q);
|
|
1881
|
+
return a.arrayToHex(g(w.concat(a.hexToArray(i))));
|
|
1882
1882
|
}
|
|
1883
|
-
function
|
|
1883
|
+
function h(i) {
|
|
1884
1884
|
const p = B.multiply(new y(i, 16)), x = a.leftPad(p.getX().toBigInteger().toString(16), 64), n = a.leftPad(p.getY().toBigInteger().toString(16), 64);
|
|
1885
1885
|
return "04" + x + n;
|
|
1886
1886
|
}
|
|
@@ -1888,7 +1888,7 @@ function hx() {
|
|
|
1888
1888
|
const i = a.generateKeyPairHex(), p = m.decodePointHex(i.publicKey);
|
|
1889
1889
|
return i.k = new y(i.privateKey, 16), i.x1 = p.getX().toBigInteger(), i;
|
|
1890
1890
|
}
|
|
1891
|
-
return
|
|
1891
|
+
return hr = {
|
|
1892
1892
|
generateKeyPairHex: a.generateKeyPairHex,
|
|
1893
1893
|
compressPublicKeyHex: a.compressPublicKeyHex,
|
|
1894
1894
|
comparePublicKeyHex: a.comparePublicKeyHex,
|
|
@@ -1896,16 +1896,16 @@ function hx() {
|
|
|
1896
1896
|
doDecrypt: s,
|
|
1897
1897
|
doSignature: C,
|
|
1898
1898
|
doVerifySignature: f,
|
|
1899
|
-
getPublicKeyFromPrivateKey:
|
|
1899
|
+
getPublicKeyFromPrivateKey: h,
|
|
1900
1900
|
getPoint: F,
|
|
1901
1901
|
verifyPublicKey: a.verifyPublicKey
|
|
1902
|
-
},
|
|
1902
|
+
}, hr;
|
|
1903
1903
|
}
|
|
1904
1904
|
var lr, zr;
|
|
1905
|
-
function
|
|
1905
|
+
function vx() {
|
|
1906
1906
|
if (zr) return lr;
|
|
1907
1907
|
zr = 1;
|
|
1908
|
-
const { sm3: y, hmac:
|
|
1908
|
+
const { sm3: y, hmac: H } = De();
|
|
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 ux() {
|
|
|
1942
1942
|
if ((o.mode || "hmac") !== "hmac") throw new Error("invalid mode");
|
|
1943
1943
|
let r = o.key;
|
|
1944
1944
|
if (!r) throw new Error("invalid key");
|
|
1945
|
-
return r = typeof r == "string" ? g(r) : Array.prototype.slice.call(r), a(
|
|
1945
|
+
return r = typeof r == "string" ? g(r) : Array.prototype.slice.call(r), a(H(m, r));
|
|
1946
1946
|
}
|
|
1947
1947
|
return a(y(m));
|
|
1948
1948
|
}, lr;
|
|
1949
1949
|
}
|
|
1950
1950
|
var vr, Ir;
|
|
1951
|
-
function
|
|
1951
|
+
function dx() {
|
|
1952
1952
|
if (Ir) return vr;
|
|
1953
1953
|
Ir = 1;
|
|
1954
|
-
const y = 0,
|
|
1954
|
+
const y = 0, H = 32, E = 16, a = [
|
|
1955
1955
|
214,
|
|
1956
1956
|
144,
|
|
1957
1957
|
233,
|
|
@@ -2254,17 +2254,17 @@ function lx() {
|
|
|
2254
2254
|
function o(i) {
|
|
2255
2255
|
const p = [];
|
|
2256
2256
|
for (let x = 0, n = i.length; x < n; x++) {
|
|
2257
|
-
const
|
|
2258
|
-
if (
|
|
2259
|
-
p.push(
|
|
2260
|
-
else if (
|
|
2261
|
-
p.push(192 |
|
|
2262
|
-
else if (
|
|
2263
|
-
p.push(224 |
|
|
2264
|
-
else if (
|
|
2265
|
-
x++, p.push(240 |
|
|
2257
|
+
const u = i.codePointAt(x);
|
|
2258
|
+
if (u <= 127)
|
|
2259
|
+
p.push(u);
|
|
2260
|
+
else if (u <= 2047)
|
|
2261
|
+
p.push(192 | u >>> 6), p.push(128 | u & 63);
|
|
2262
|
+
else if (u <= 55295 || u >= 57344 && u <= 65535)
|
|
2263
|
+
p.push(224 | u >>> 12), p.push(128 | u >>> 6 & 63), p.push(128 | u & 63);
|
|
2264
|
+
else if (u >= 65536 && u <= 1114111)
|
|
2265
|
+
x++, p.push(240 | u >>> 18 & 28), p.push(128 | u >>> 12 & 63), p.push(128 | u >>> 6 & 63), p.push(128 | u & 63);
|
|
2266
2266
|
else
|
|
2267
|
-
throw p.push(
|
|
2267
|
+
throw p.push(u), new Error("input is not supported");
|
|
2268
2268
|
}
|
|
2269
2269
|
return p;
|
|
2270
2270
|
}
|
|
@@ -2288,18 +2288,18 @@ function lx() {
|
|
|
2288
2288
|
return i ^ r(i, 13) ^ r(i, 23);
|
|
2289
2289
|
}
|
|
2290
2290
|
function l(i, p, x) {
|
|
2291
|
-
const n = new Array(4),
|
|
2291
|
+
const n = new Array(4), u = new Array(4);
|
|
2292
2292
|
for (let d = 0; d < 4; d++)
|
|
2293
|
-
|
|
2293
|
+
u[0] = i[4 * d] & 255, u[1] = i[4 * d + 1] & 255, u[2] = i[4 * d + 2] & 255, u[3] = i[4 * d + 3] & 255, n[d] = u[0] << 24 | u[1] << 16 | u[2] << 8 | u[3];
|
|
2294
2294
|
for (let d = 0, A; d < 32; d += 4)
|
|
2295
2295
|
A = n[1] ^ n[2] ^ n[3] ^ x[d + 0], n[0] ^= C(s(A)), A = n[2] ^ n[3] ^ n[0] ^ x[d + 1], n[1] ^= C(s(A)), A = n[3] ^ n[0] ^ n[1] ^ x[d + 2], n[2] ^= C(s(A)), A = n[0] ^ n[1] ^ n[2] ^ x[d + 3], n[3] ^= C(s(A));
|
|
2296
2296
|
for (let d = 0; d < 16; d += 4)
|
|
2297
2297
|
p[d] = n[3 - d / 4] >>> 24 & 255, p[d + 1] = n[3 - d / 4] >>> 16 & 255, p[d + 2] = n[3 - d / 4] >>> 8 & 255, p[d + 3] = n[3 - d / 4] & 255;
|
|
2298
2298
|
}
|
|
2299
|
-
function
|
|
2300
|
-
const n = new Array(4),
|
|
2299
|
+
function h(i, p, x) {
|
|
2300
|
+
const n = new Array(4), u = new Array(4);
|
|
2301
2301
|
for (let d = 0; d < 4; d++)
|
|
2302
|
-
|
|
2302
|
+
u[0] = i[0 + 4 * d] & 255, u[1] = i[1 + 4 * d] & 255, u[2] = i[2 + 4 * d] & 255, u[3] = i[3 + 4 * d] & 255, n[d] = u[0] << 24 | u[1] << 16 | u[2] << 8 | u[3];
|
|
2303
2303
|
n[0] ^= 2746333894, n[1] ^= 1453994832, n[2] ^= 1736282519, n[3] ^= 2993693404;
|
|
2304
2304
|
for (let d = 0, A; d < 32; d += 4)
|
|
2305
2305
|
A = n[1] ^ n[2] ^ n[3] ^ g[d + 0], p[d + 0] = n[0] ^= f(s(A)), A = n[2] ^ n[3] ^ n[0] ^ g[d + 1], p[d + 1] = n[1] ^= f(s(A)), A = n[3] ^ n[0] ^ n[1] ^ g[d + 2], p[d + 2] = n[2] ^= f(s(A)), A = n[0] ^ n[1] ^ n[2] ^ g[d + 3], p[d + 3] = n[3] ^= f(s(A));
|
|
@@ -2309,37 +2309,37 @@ function lx() {
|
|
|
2309
2309
|
}
|
|
2310
2310
|
function F(i, p, x, {
|
|
2311
2311
|
padding: n = "pkcs#7",
|
|
2312
|
-
mode:
|
|
2312
|
+
mode: u,
|
|
2313
2313
|
iv: d = [],
|
|
2314
2314
|
output: A = "string"
|
|
2315
2315
|
} = {}) {
|
|
2316
|
-
if (
|
|
2316
|
+
if (u === "cbc" && (typeof d == "string" && (d = B(d)), d.length !== 128 / 8))
|
|
2317
2317
|
throw new Error("iv is invalid");
|
|
2318
2318
|
if (typeof p == "string" && (p = B(p)), p.length !== 128 / 8)
|
|
2319
2319
|
throw new Error("key is invalid");
|
|
2320
2320
|
if (typeof i == "string" ? x !== y ? i = o(i) : i = B(i) : i = [...i], (n === "pkcs#5" || n === "pkcs#7") && x !== y) {
|
|
2321
|
-
const
|
|
2322
|
-
for (let
|
|
2321
|
+
const k = E - i.length % E;
|
|
2322
|
+
for (let S = 0; S < k; S++) i.push(k);
|
|
2323
2323
|
}
|
|
2324
|
-
const
|
|
2325
|
-
|
|
2324
|
+
const _ = new Array(H);
|
|
2325
|
+
h(p, _, x);
|
|
2326
2326
|
const T = [];
|
|
2327
|
-
let q = d, D = i.length,
|
|
2327
|
+
let q = d, D = i.length, w = 0;
|
|
2328
2328
|
for (; D >= E; ) {
|
|
2329
|
-
const
|
|
2330
|
-
if (
|
|
2329
|
+
const k = i.slice(w, w + 16), S = new Array(16);
|
|
2330
|
+
if (u === "cbc")
|
|
2331
2331
|
for (let U = 0; U < E; U++)
|
|
2332
|
-
x !== y && (
|
|
2333
|
-
l(
|
|
2332
|
+
x !== y && (k[U] ^= q[U]);
|
|
2333
|
+
l(k, S, _);
|
|
2334
2334
|
for (let U = 0; U < E; U++)
|
|
2335
|
-
|
|
2336
|
-
|
|
2335
|
+
u === "cbc" && x === y && (S[U] ^= q[U]), T[w + U] = S[U];
|
|
2336
|
+
u === "cbc" && (x !== y ? q = S : q = k), D -= E, w += E;
|
|
2337
2337
|
}
|
|
2338
2338
|
if ((n === "pkcs#5" || n === "pkcs#7") && x === y) {
|
|
2339
|
-
const
|
|
2340
|
-
for (let U = 1; U <=
|
|
2341
|
-
if (T[
|
|
2342
|
-
T.splice(
|
|
2339
|
+
const k = T.length, S = T[k - 1];
|
|
2340
|
+
for (let U = 1; U <= S; U++)
|
|
2341
|
+
if (T[k - U] !== S) throw new Error("padding is invalid");
|
|
2342
|
+
T.splice(k - S, S);
|
|
2343
2343
|
}
|
|
2344
2344
|
return A !== "array" ? x !== y ? m(T) : v(T) : T;
|
|
2345
2345
|
}
|
|
@@ -2353,26 +2353,26 @@ function lx() {
|
|
|
2353
2353
|
}, vr;
|
|
2354
2354
|
}
|
|
2355
2355
|
var dr, Lr;
|
|
2356
|
-
function
|
|
2356
|
+
function px() {
|
|
2357
2357
|
return Lr || (Lr = 1, dr = {
|
|
2358
|
-
sm2:
|
|
2359
|
-
sm3:
|
|
2360
|
-
sm4:
|
|
2358
|
+
sm2: lx(),
|
|
2359
|
+
sm3: vx(),
|
|
2360
|
+
sm4: dx()
|
|
2361
2361
|
}), dr;
|
|
2362
2362
|
}
|
|
2363
|
-
var
|
|
2364
|
-
function
|
|
2363
|
+
var Bx = px(), it = { exports: {} };
|
|
2364
|
+
function Fx(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: {} }, Cx = ot.exports, Or;
|
|
2368
2368
|
function j() {
|
|
2369
|
-
return Or || (Or = 1, function(y,
|
|
2369
|
+
return Or || (Or = 1, function(y, H) {
|
|
2370
2370
|
(function(E, a) {
|
|
2371
2371
|
y.exports = a();
|
|
2372
|
-
})(
|
|
2372
|
+
})(Cx, 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 Fx == "function")
|
|
2376
2376
|
try {
|
|
2377
2377
|
B = pr;
|
|
2378
2378
|
} catch {
|
|
@@ -2395,8 +2395,8 @@ function j() {
|
|
|
2395
2395
|
function x() {
|
|
2396
2396
|
}
|
|
2397
2397
|
return function(n) {
|
|
2398
|
-
var
|
|
2399
|
-
return x.prototype = n,
|
|
2398
|
+
var u;
|
|
2399
|
+
return x.prototype = n, u = new x(), x.prototype = null, u;
|
|
2400
2400
|
};
|
|
2401
2401
|
}(), v = {}, r = v.lib = {}, s = r.Base = /* @__PURE__ */ function() {
|
|
2402
2402
|
return {
|
|
@@ -2527,15 +2527,15 @@ function j() {
|
|
|
2527
2527
|
* wordArray1.concat(wordArray2);
|
|
2528
2528
|
*/
|
|
2529
2529
|
concat: function(x) {
|
|
2530
|
-
var n = this.words,
|
|
2530
|
+
var n = this.words, u = x.words, d = this.sigBytes, A = x.sigBytes;
|
|
2531
2531
|
if (this.clamp(), d % 4)
|
|
2532
|
-
for (var
|
|
2533
|
-
var T =
|
|
2534
|
-
n[d +
|
|
2532
|
+
for (var _ = 0; _ < A; _++) {
|
|
2533
|
+
var T = u[_ >>> 2] >>> 24 - _ % 4 * 8 & 255;
|
|
2534
|
+
n[d + _ >>> 2] |= T << 24 - (d + _) % 4 * 8;
|
|
2535
2535
|
}
|
|
2536
2536
|
else
|
|
2537
2537
|
for (var q = 0; q < A; q += 4)
|
|
2538
|
-
n[d + q >>> 2] =
|
|
2538
|
+
n[d + q >>> 2] = u[q >>> 2];
|
|
2539
2539
|
return this.sigBytes += A, this;
|
|
2540
2540
|
},
|
|
2541
2541
|
/**
|
|
@@ -2576,7 +2576,7 @@ function j() {
|
|
|
2576
2576
|
* var wordArray = CryptoJS.lib.WordArray.random(16);
|
|
2577
2577
|
*/
|
|
2578
2578
|
random: function(x) {
|
|
2579
|
-
for (var n = [],
|
|
2579
|
+
for (var n = [], u = 0; u < x; u += 4)
|
|
2580
2580
|
n.push(m());
|
|
2581
2581
|
return new C.init(n, x);
|
|
2582
2582
|
}
|
|
@@ -2595,9 +2595,9 @@ function j() {
|
|
|
2595
2595
|
* var hexString = CryptoJS.enc.Hex.stringify(wordArray);
|
|
2596
2596
|
*/
|
|
2597
2597
|
stringify: function(x) {
|
|
2598
|
-
for (var n = x.words,
|
|
2599
|
-
var
|
|
2600
|
-
d.push((
|
|
2598
|
+
for (var n = x.words, u = x.sigBytes, d = [], A = 0; A < u; A++) {
|
|
2599
|
+
var _ = n[A >>> 2] >>> 24 - A % 4 * 8 & 255;
|
|
2600
|
+
d.push((_ >>> 4).toString(16)), d.push((_ & 15).toString(16));
|
|
2601
2601
|
}
|
|
2602
2602
|
return d.join("");
|
|
2603
2603
|
},
|
|
@@ -2615,11 +2615,11 @@ function j() {
|
|
|
2615
2615
|
* var wordArray = CryptoJS.enc.Hex.parse(hexString);
|
|
2616
2616
|
*/
|
|
2617
2617
|
parse: function(x) {
|
|
2618
|
-
for (var n = x.length,
|
|
2619
|
-
|
|
2620
|
-
return new C.init(
|
|
2618
|
+
for (var n = x.length, u = [], d = 0; d < n; d += 2)
|
|
2619
|
+
u[d >>> 3] |= parseInt(x.substr(d, 2), 16) << 24 - d % 8 * 4;
|
|
2620
|
+
return new C.init(u, n / 2);
|
|
2621
2621
|
}
|
|
2622
|
-
},
|
|
2622
|
+
}, h = f.Latin1 = {
|
|
2623
2623
|
/**
|
|
2624
2624
|
* Converts a word array to a Latin1 string.
|
|
2625
2625
|
*
|
|
@@ -2634,9 +2634,9 @@ function j() {
|
|
|
2634
2634
|
* var latin1String = CryptoJS.enc.Latin1.stringify(wordArray);
|
|
2635
2635
|
*/
|
|
2636
2636
|
stringify: function(x) {
|
|
2637
|
-
for (var n = x.words,
|
|
2638
|
-
var
|
|
2639
|
-
d.push(String.fromCharCode(
|
|
2637
|
+
for (var n = x.words, u = x.sigBytes, d = [], A = 0; A < u; A++) {
|
|
2638
|
+
var _ = n[A >>> 2] >>> 24 - A % 4 * 8 & 255;
|
|
2639
|
+
d.push(String.fromCharCode(_));
|
|
2640
2640
|
}
|
|
2641
2641
|
return d.join("");
|
|
2642
2642
|
},
|
|
@@ -2654,9 +2654,9 @@ function j() {
|
|
|
2654
2654
|
* var wordArray = CryptoJS.enc.Latin1.parse(latin1String);
|
|
2655
2655
|
*/
|
|
2656
2656
|
parse: function(x) {
|
|
2657
|
-
for (var n = x.length,
|
|
2658
|
-
|
|
2659
|
-
return new C.init(
|
|
2657
|
+
for (var n = x.length, u = [], d = 0; d < n; d++)
|
|
2658
|
+
u[d >>> 2] |= (x.charCodeAt(d) & 255) << 24 - d % 4 * 8;
|
|
2659
|
+
return new C.init(u, n);
|
|
2660
2660
|
}
|
|
2661
2661
|
}, F = f.Utf8 = {
|
|
2662
2662
|
/**
|
|
@@ -2674,7 +2674,7 @@ function j() {
|
|
|
2674
2674
|
*/
|
|
2675
2675
|
stringify: function(x) {
|
|
2676
2676
|
try {
|
|
2677
|
-
return decodeURIComponent(escape(
|
|
2677
|
+
return decodeURIComponent(escape(h.stringify(x)));
|
|
2678
2678
|
} catch {
|
|
2679
2679
|
throw new Error("Malformed UTF-8 data");
|
|
2680
2680
|
}
|
|
@@ -2693,7 +2693,7 @@ function j() {
|
|
|
2693
2693
|
* var wordArray = CryptoJS.enc.Utf8.parse(utf8String);
|
|
2694
2694
|
*/
|
|
2695
2695
|
parse: function(x) {
|
|
2696
|
-
return
|
|
2696
|
+
return h.parse(unescape(encodeURIComponent(x)));
|
|
2697
2697
|
}
|
|
2698
2698
|
}, i = r.BufferedBlockAlgorithm = s.extend({
|
|
2699
2699
|
/**
|
|
@@ -2734,15 +2734,15 @@ function j() {
|
|
|
2734
2734
|
* var processedData = bufferedBlockAlgorithm._process(!!'flush');
|
|
2735
2735
|
*/
|
|
2736
2736
|
_process: function(x) {
|
|
2737
|
-
var n,
|
|
2737
|
+
var n, u = this._data, d = u.words, A = u.sigBytes, _ = this.blockSize, T = _ * 4, q = A / T;
|
|
2738
2738
|
x ? q = a.ceil(q) : q = a.max((q | 0) - this._minBufferSize, 0);
|
|
2739
|
-
var D = q *
|
|
2739
|
+
var D = q * _, w = a.min(D * 4, A);
|
|
2740
2740
|
if (D) {
|
|
2741
|
-
for (var
|
|
2742
|
-
this._doProcessBlock(d,
|
|
2743
|
-
n = d.splice(0, D),
|
|
2741
|
+
for (var k = 0; k < D; k += _)
|
|
2742
|
+
this._doProcessBlock(d, k);
|
|
2743
|
+
n = d.splice(0, D), u.sigBytes -= w;
|
|
2744
2744
|
}
|
|
2745
|
-
return new C.init(n,
|
|
2745
|
+
return new C.init(n, w);
|
|
2746
2746
|
},
|
|
2747
2747
|
/**
|
|
2748
2748
|
* Creates a copy of this object.
|
|
@@ -2835,8 +2835,8 @@ function j() {
|
|
|
2835
2835
|
* var SHA256 = CryptoJS.lib.Hasher._createHelper(CryptoJS.algo.SHA256);
|
|
2836
2836
|
*/
|
|
2837
2837
|
_createHelper: function(x) {
|
|
2838
|
-
return function(n,
|
|
2839
|
-
return new x.init(
|
|
2838
|
+
return function(n, u) {
|
|
2839
|
+
return new x.init(u).finalize(n);
|
|
2840
2840
|
};
|
|
2841
2841
|
},
|
|
2842
2842
|
/**
|
|
@@ -2853,8 +2853,8 @@ function j() {
|
|
|
2853
2853
|
* var HmacSHA256 = CryptoJS.lib.Hasher._createHmacHelper(CryptoJS.algo.SHA256);
|
|
2854
2854
|
*/
|
|
2855
2855
|
_createHmacHelper: function(x) {
|
|
2856
|
-
return function(n,
|
|
2857
|
-
return new p.HMAC.init(x,
|
|
2856
|
+
return function(n, u) {
|
|
2857
|
+
return new p.HMAC.init(x, u).finalize(n);
|
|
2858
2858
|
};
|
|
2859
2859
|
}
|
|
2860
2860
|
});
|
|
@@ -2865,12 +2865,12 @@ function j() {
|
|
|
2865
2865
|
});
|
|
2866
2866
|
}(ot)), ot.exports;
|
|
2867
2867
|
}
|
|
2868
|
-
var st = { exports: {} },
|
|
2868
|
+
var st = { exports: {} }, Ax = st.exports, Ur;
|
|
2869
2869
|
function Nt() {
|
|
2870
|
-
return Ur || (Ur = 1, function(y,
|
|
2870
|
+
return Ur || (Ur = 1, function(y, H) {
|
|
2871
2871
|
(function(E, a) {
|
|
2872
2872
|
y.exports = a(j());
|
|
2873
|
-
})(
|
|
2873
|
+
})(Ax, 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: {} }, Ex = at.exports, Mr;
|
|
3099
|
+
function yx() {
|
|
3100
|
+
return Mr || (Mr = 1, function(y, H) {
|
|
3101
3101
|
(function(E, a) {
|
|
3102
3102
|
y.exports = a(j());
|
|
3103
|
-
})(
|
|
3103
|
+
})(Ex, 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 Ax() {
|
|
|
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: {} }, Dx = ft.exports, Nr;
|
|
3121
|
+
function gx() {
|
|
3122
|
+
return Nr || (Nr = 1, function(y, H) {
|
|
3123
3123
|
(function(E, a) {
|
|
3124
3124
|
y.exports = a(j());
|
|
3125
|
-
})(
|
|
3125
|
+
})(Dx, 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 yx() {
|
|
|
3211
3211
|
});
|
|
3212
3212
|
}(ft)), ft.exports;
|
|
3213
3213
|
}
|
|
3214
|
-
var ct = { exports: {} },
|
|
3214
|
+
var ct = { exports: {} }, bx = ct.exports, Wr;
|
|
3215
3215
|
function q0() {
|
|
3216
|
-
return Wr || (Wr = 1, function(y,
|
|
3216
|
+
return Wr || (Wr = 1, function(y, H) {
|
|
3217
3217
|
(function(E, a) {
|
|
3218
3218
|
y.exports = a(j());
|
|
3219
|
-
})(
|
|
3219
|
+
})(bx, function(E) {
|
|
3220
3220
|
return function() {
|
|
3221
3221
|
var a = E, g = a.lib, B = g.WordArray, m = a.enc;
|
|
3222
3222
|
m.Base64 = {
|
|
@@ -3237,7 +3237,7 @@ function q0() {
|
|
|
3237
3237
|
var r = v.words, s = v.sigBytes, C = this._map;
|
|
3238
3238
|
v.clamp();
|
|
3239
3239
|
for (var f = [], l = 0; l < s; l += 3)
|
|
3240
|
-
for (var
|
|
3240
|
+
for (var h = r[l >>> 2] >>> 24 - l % 4 * 8 & 255, F = r[l + 1 >>> 2] >>> 24 - (l + 1) % 4 * 8 & 255, i = r[l + 2 >>> 2] >>> 24 - (l + 2) % 4 * 8 & 255, p = h << 16 | F << 8 | i, x = 0; x < 4 && l + x * 0.75 < s; x++)
|
|
3241
3241
|
f.push(C.charAt(p >>> 6 * (3 - x) & 63));
|
|
3242
3242
|
var n = C.charAt(64);
|
|
3243
3243
|
if (n)
|
|
@@ -3267,8 +3267,8 @@ function q0() {
|
|
|
3267
3267
|
}
|
|
3268
3268
|
var l = s.charAt(64);
|
|
3269
3269
|
if (l) {
|
|
3270
|
-
var
|
|
3271
|
-
|
|
3270
|
+
var h = v.indexOf(l);
|
|
3271
|
+
h !== -1 && (r = h);
|
|
3272
3272
|
}
|
|
3273
3273
|
return o(v, r, C);
|
|
3274
3274
|
},
|
|
@@ -3277,7 +3277,7 @@ function q0() {
|
|
|
3277
3277
|
function o(v, r, s) {
|
|
3278
3278
|
for (var C = [], f = 0, l = 0; l < r; l++)
|
|
3279
3279
|
if (l % 4) {
|
|
3280
|
-
var
|
|
3280
|
+
var h = s[v.charCodeAt(l - 1)] << l % 4 * 2, F = s[v.charCodeAt(l)] >>> 6 - l % 4 * 2, i = h | F;
|
|
3281
3281
|
C[f >>> 2] |= i << 24 - f % 4 * 8, f++;
|
|
3282
3282
|
}
|
|
3283
3283
|
return B.create(C, f);
|
|
@@ -3286,12 +3286,12 @@ function q0() {
|
|
|
3286
3286
|
});
|
|
3287
3287
|
}(ct)), ct.exports;
|
|
3288
3288
|
}
|
|
3289
|
-
var
|
|
3290
|
-
function
|
|
3291
|
-
return $r || ($r = 1, function(y,
|
|
3289
|
+
var ut = { exports: {} }, mx = ut.exports, $r;
|
|
3290
|
+
function wx() {
|
|
3291
|
+
return $r || ($r = 1, function(y, H) {
|
|
3292
3292
|
(function(E, a) {
|
|
3293
3293
|
y.exports = a(j());
|
|
3294
|
-
})(
|
|
3294
|
+
})(mx, function(E) {
|
|
3295
3295
|
return function() {
|
|
3296
3296
|
var a = E, g = a.lib, B = g.WordArray, m = a.enc;
|
|
3297
3297
|
m.Base64url = {
|
|
@@ -3314,13 +3314,13 @@ function bx() {
|
|
|
3314
3314
|
r === void 0 && (r = !0);
|
|
3315
3315
|
var s = v.words, C = v.sigBytes, f = r ? this._safe_map : this._map;
|
|
3316
3316
|
v.clamp();
|
|
3317
|
-
for (var l = [],
|
|
3318
|
-
for (var F = s[
|
|
3317
|
+
for (var l = [], h = 0; h < C; h += 3)
|
|
3318
|
+
for (var F = s[h >>> 2] >>> 24 - h % 4 * 8 & 255, i = s[h + 1 >>> 2] >>> 24 - (h + 1) % 4 * 8 & 255, p = s[h + 2 >>> 2] >>> 24 - (h + 2) % 4 * 8 & 255, x = F << 16 | i << 8 | p, n = 0; n < 4 && h + n * 0.75 < C; n++)
|
|
3319
3319
|
l.push(f.charAt(x >>> 6 * (3 - n) & 63));
|
|
3320
|
-
var
|
|
3321
|
-
if (
|
|
3320
|
+
var u = f.charAt(64);
|
|
3321
|
+
if (u)
|
|
3322
3322
|
for (; l.length % 4; )
|
|
3323
|
-
l.push(
|
|
3323
|
+
l.push(u);
|
|
3324
3324
|
return l.join("");
|
|
3325
3325
|
},
|
|
3326
3326
|
/**
|
|
@@ -3346,9 +3346,9 @@ function bx() {
|
|
|
3346
3346
|
for (var l = 0; l < C.length; l++)
|
|
3347
3347
|
f[C.charCodeAt(l)] = l;
|
|
3348
3348
|
}
|
|
3349
|
-
var
|
|
3350
|
-
if (
|
|
3351
|
-
var F = v.indexOf(
|
|
3349
|
+
var h = C.charAt(64);
|
|
3350
|
+
if (h) {
|
|
3351
|
+
var F = v.indexOf(h);
|
|
3352
3352
|
F !== -1 && (s = F);
|
|
3353
3353
|
}
|
|
3354
3354
|
return o(v, s, f);
|
|
@@ -3359,21 +3359,21 @@ function bx() {
|
|
|
3359
3359
|
function o(v, r, s) {
|
|
3360
3360
|
for (var C = [], f = 0, l = 0; l < r; l++)
|
|
3361
3361
|
if (l % 4) {
|
|
3362
|
-
var
|
|
3362
|
+
var h = s[v.charCodeAt(l - 1)] << l % 4 * 2, F = s[v.charCodeAt(l)] >>> 6 - l % 4 * 2, i = h | F;
|
|
3363
3363
|
C[f >>> 2] |= i << 24 - f % 4 * 8, f++;
|
|
3364
3364
|
}
|
|
3365
3365
|
return B.create(C, f);
|
|
3366
3366
|
}
|
|
3367
3367
|
}(), E.enc.Base64url;
|
|
3368
3368
|
});
|
|
3369
|
-
}(
|
|
3369
|
+
}(ut)), ut.exports;
|
|
3370
3370
|
}
|
|
3371
|
-
var
|
|
3371
|
+
var ht = { exports: {} }, _x = ht.exports, Kr;
|
|
3372
3372
|
function H0() {
|
|
3373
|
-
return Kr || (Kr = 1, function(y,
|
|
3373
|
+
return Kr || (Kr = 1, function(y, H) {
|
|
3374
3374
|
(function(E, a) {
|
|
3375
3375
|
y.exports = a(j());
|
|
3376
|
-
})(
|
|
3376
|
+
})(_x, 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,17 +3394,17 @@ 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
|
|
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], P = u[0], R = u[1], O = u[2], I = u[3];
|
|
3398
|
+
P = C(P, R, O, I, d, 7, r[0]), I = C(I, P, R, O, A, 12, r[1]), O = C(O, I, P, R, _, 17, r[2]), R = C(R, O, I, P, T, 22, r[3]), P = C(P, R, O, I, q, 7, r[4]), I = C(I, P, R, O, D, 12, r[5]), O = C(O, I, P, R, w, 17, r[6]), R = C(R, O, I, P, k, 22, r[7]), P = C(P, R, O, I, S, 7, r[8]), I = C(I, P, R, O, U, 12, r[9]), O = C(O, I, P, R, W, 17, r[10]), R = C(R, O, I, P, $, 22, r[11]), P = C(P, R, O, I, V, 7, r[12]), I = C(I, P, R, O, X, 12, r[13]), O = C(O, I, P, R, G, 17, r[14]), R = C(R, O, I, P, Z, 22, r[15]), P = f(P, R, O, I, A, 5, r[16]), I = f(I, P, R, O, w, 9, r[17]), O = f(O, I, P, R, $, 14, r[18]), R = f(R, O, I, P, d, 20, r[19]), P = f(P, R, O, I, D, 5, r[20]), I = f(I, P, R, O, W, 9, r[21]), O = f(O, I, P, R, Z, 14, r[22]), R = f(R, O, I, P, q, 20, r[23]), P = f(P, R, O, I, U, 5, r[24]), I = f(I, P, R, O, G, 9, r[25]), O = f(O, I, P, R, T, 14, r[26]), R = f(R, O, I, P, S, 20, r[27]), P = f(P, R, O, I, X, 5, r[28]), I = f(I, P, R, O, _, 9, r[29]), O = f(O, I, P, R, k, 14, r[30]), R = f(R, O, I, P, V, 20, r[31]), P = l(P, R, O, I, D, 4, r[32]), I = l(I, P, R, O, S, 11, r[33]), O = l(O, I, P, R, $, 16, r[34]), R = l(R, O, I, P, G, 23, r[35]), P = l(P, R, O, I, A, 4, r[36]), I = l(I, P, R, O, q, 11, r[37]), O = l(O, I, P, R, k, 16, r[38]), R = l(R, O, I, P, W, 23, r[39]), P = l(P, R, O, I, X, 4, r[40]), I = l(I, P, R, O, d, 11, r[41]), O = l(O, I, P, R, T, 16, r[42]), R = l(R, O, I, P, w, 23, r[43]), P = l(P, R, O, I, U, 4, r[44]), I = l(I, P, R, O, V, 11, r[45]), O = l(O, I, P, R, Z, 16, r[46]), R = l(R, O, I, P, _, 23, r[47]), P = h(P, R, O, I, d, 6, r[48]), I = h(I, P, R, O, k, 10, r[49]), O = h(O, I, P, R, G, 15, r[50]), R = h(R, O, I, P, D, 21, r[51]), P = h(P, R, O, I, V, 6, r[52]), I = h(I, P, R, O, T, 10, r[53]), O = h(O, I, P, R, W, 15, r[54]), R = h(R, O, I, P, A, 21, r[55]), P = h(P, R, O, I, S, 6, r[56]), I = h(I, P, R, O, Z, 10, r[57]), O = h(O, I, P, R, w, 15, r[58]), R = h(R, O, I, P, X, 21, r[59]), P = h(P, R, O, I, q, 6, r[60]), I = h(I, P, R, O, $, 10, r[61]), O = h(O, I, P, R, _, 15, r[62]), R = h(R, O, I, P, U, 21, r[63]), u[0] = u[0] + P | 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;
|
|
3402
3402
|
i[x >>> 5] |= 128 << 24 - x % 32;
|
|
3403
|
-
var n = a.floor(p / 4294967296),
|
|
3404
|
-
i[(x + 64 >>> 9 << 4) + 15] = (n << 8 | n >>> 24) & 16711935 | (n << 24 | n >>> 8) & 4278255360, i[(x + 64 >>> 9 << 4) + 14] = (
|
|
3405
|
-
for (var d = this._hash, A = d.words,
|
|
3406
|
-
var T = A[
|
|
3407
|
-
A[
|
|
3403
|
+
var n = a.floor(p / 4294967296), u = p;
|
|
3404
|
+
i[(x + 64 >>> 9 << 4) + 15] = (n << 8 | n >>> 24) & 16711935 | (n << 24 | n >>> 8) & 4278255360, i[(x + 64 >>> 9 << 4) + 14] = (u << 8 | u >>> 24) & 16711935 | (u << 24 | u >>> 8) & 4278255360, F.sigBytes = (i.length + 1) * 4, this._process();
|
|
3405
|
+
for (var d = this._hash, A = d.words, _ = 0; _ < 4; _++) {
|
|
3406
|
+
var T = A[_];
|
|
3407
|
+
A[_] = (T << 8 | T >>> 24) & 16711935 | (T << 24 | T >>> 8) & 4278255360;
|
|
3408
3408
|
}
|
|
3409
3409
|
return d;
|
|
3410
3410
|
},
|
|
@@ -3413,33 +3413,33 @@ function H0() {
|
|
|
3413
3413
|
return F._hash = this._hash.clone(), F;
|
|
3414
3414
|
}
|
|
3415
3415
|
});
|
|
3416
|
-
function C(F, i, p, x, n,
|
|
3416
|
+
function C(F, i, p, x, n, u, d) {
|
|
3417
3417
|
var A = F + (i & p | ~i & x) + n + d;
|
|
3418
|
-
return (A <<
|
|
3418
|
+
return (A << u | A >>> 32 - u) + i;
|
|
3419
3419
|
}
|
|
3420
|
-
function f(F, i, p, x, n,
|
|
3420
|
+
function f(F, i, p, x, n, u, d) {
|
|
3421
3421
|
var A = F + (i & x | p & ~x) + n + d;
|
|
3422
|
-
return (A <<
|
|
3422
|
+
return (A << u | A >>> 32 - u) + i;
|
|
3423
3423
|
}
|
|
3424
|
-
function l(F, i, p, x, n,
|
|
3424
|
+
function l(F, i, p, x, n, u, d) {
|
|
3425
3425
|
var A = F + (i ^ p ^ x) + n + d;
|
|
3426
|
-
return (A <<
|
|
3426
|
+
return (A << u | A >>> 32 - u) + i;
|
|
3427
3427
|
}
|
|
3428
|
-
function
|
|
3428
|
+
function h(F, i, p, x, n, u, d) {
|
|
3429
3429
|
var A = F + (p ^ (i | ~x)) + n + d;
|
|
3430
|
-
return (A <<
|
|
3430
|
+
return (A << u | A >>> 32 - u) + i;
|
|
3431
3431
|
}
|
|
3432
3432
|
g.MD5 = o._createHelper(s), g.HmacMD5 = o._createHmacHelper(s);
|
|
3433
3433
|
}(Math), E.MD5;
|
|
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: {} }, Tx = lt.exports, Vr;
|
|
3438
|
+
function ge() {
|
|
3439
|
+
return Vr || (Vr = 1, function(y, H) {
|
|
3440
3440
|
(function(E, a) {
|
|
3441
3441
|
y.exports = a(j());
|
|
3442
|
-
})(
|
|
3442
|
+
})(Tx, 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() {
|
|
@@ -3452,17 +3452,17 @@ function ye() {
|
|
|
3452
3452
|
]);
|
|
3453
3453
|
},
|
|
3454
3454
|
_doProcessBlock: function(s, C) {
|
|
3455
|
-
for (var f = this._hash.words, l = f[0],
|
|
3455
|
+
for (var f = this._hash.words, l = f[0], h = f[1], F = f[2], i = f[3], p = f[4], x = 0; x < 80; x++) {
|
|
3456
3456
|
if (x < 16)
|
|
3457
3457
|
v[x] = s[C + x] | 0;
|
|
3458
3458
|
else {
|
|
3459
3459
|
var n = v[x - 3] ^ v[x - 8] ^ v[x - 14] ^ v[x - 16];
|
|
3460
3460
|
v[x] = n << 1 | n >>> 31;
|
|
3461
3461
|
}
|
|
3462
|
-
var
|
|
3463
|
-
x < 20 ?
|
|
3462
|
+
var u = (l << 5 | l >>> 27) + p + v[x];
|
|
3463
|
+
x < 20 ? u += (h & F | ~h & i) + 1518500249 : x < 40 ? u += (h ^ F ^ i) + 1859775393 : x < 60 ? u += (h & F | h & i | F & i) - 1894007588 : u += (h ^ F ^ i) - 899497514, p = i, i = F, F = h << 30 | h >>> 2, h = l, l = u;
|
|
3464
3464
|
}
|
|
3465
|
-
f[0] = f[0] + l | 0, f[1] = f[1] +
|
|
3465
|
+
f[0] = f[0] + l | 0, f[1] = f[1] + h | 0, f[2] = f[2] + F | 0, f[3] = f[3] + i | 0, f[4] = f[4] + p | 0;
|
|
3466
3466
|
},
|
|
3467
3467
|
_doFinalize: function() {
|
|
3468
3468
|
var s = this._data, C = s.words, f = this._nDataBytes * 8, l = s.sigBytes * 8;
|
|
@@ -3478,12 +3478,12 @@ function ye() {
|
|
|
3478
3478
|
});
|
|
3479
3479
|
}(lt)), lt.exports;
|
|
3480
3480
|
}
|
|
3481
|
-
var vt = { exports: {} },
|
|
3481
|
+
var vt = { exports: {} }, kx = vt.exports, Xr;
|
|
3482
3482
|
function Cr() {
|
|
3483
|
-
return Xr || (Xr = 1, function(y,
|
|
3483
|
+
return Xr || (Xr = 1, function(y, H) {
|
|
3484
3484
|
(function(E, a) {
|
|
3485
3485
|
y.exports = a(j());
|
|
3486
|
-
})(
|
|
3486
|
+
})(kx, 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() {
|
|
@@ -3493,32 +3493,32 @@ function Cr() {
|
|
|
3493
3493
|
return !1;
|
|
3494
3494
|
return !0;
|
|
3495
3495
|
}
|
|
3496
|
-
function
|
|
3496
|
+
function h(p) {
|
|
3497
3497
|
return (p - (p | 0)) * 4294967296 | 0;
|
|
3498
3498
|
}
|
|
3499
3499
|
for (var F = 2, i = 0; i < 64; )
|
|
3500
|
-
l(F) && (i < 8 && (r[i] =
|
|
3500
|
+
l(F) && (i < 8 && (r[i] = h(a.pow(F, 1 / 2))), s[i] = h(a.pow(F, 1 / 3)), i++), F++;
|
|
3501
3501
|
})();
|
|
3502
3502
|
var C = [], f = v.SHA256 = o.extend({
|
|
3503
3503
|
_doReset: function() {
|
|
3504
3504
|
this._hash = new m.init(r.slice(0));
|
|
3505
3505
|
},
|
|
3506
|
-
_doProcessBlock: function(l,
|
|
3507
|
-
for (var F = this._hash.words, i = F[0], p = F[1], x = F[2], n = F[3],
|
|
3506
|
+
_doProcessBlock: function(l, h) {
|
|
3507
|
+
for (var F = this._hash.words, i = F[0], p = F[1], x = F[2], n = F[3], u = F[4], d = F[5], A = F[6], _ = F[7], T = 0; T < 64; T++) {
|
|
3508
3508
|
if (T < 16)
|
|
3509
|
-
C[T] = l[
|
|
3509
|
+
C[T] = l[h + T] | 0;
|
|
3510
3510
|
else {
|
|
3511
|
-
var q = C[T - 15], D = (q << 25 | q >>> 7) ^ (q << 14 | q >>> 18) ^ q >>> 3,
|
|
3512
|
-
C[T] = D + C[T - 7] +
|
|
3511
|
+
var q = C[T - 15], D = (q << 25 | q >>> 7) ^ (q << 14 | q >>> 18) ^ q >>> 3, w = C[T - 2], k = (w << 15 | w >>> 17) ^ (w << 13 | w >>> 19) ^ w >>> 10;
|
|
3512
|
+
C[T] = D + C[T - 7] + k + C[T - 16];
|
|
3513
3513
|
}
|
|
3514
|
-
var
|
|
3515
|
-
|
|
3514
|
+
var S = u & d ^ ~u & A, U = i & p ^ i & x ^ p & x, W = (i << 30 | i >>> 2) ^ (i << 19 | i >>> 13) ^ (i << 10 | i >>> 22), $ = (u << 26 | u >>> 6) ^ (u << 21 | u >>> 11) ^ (u << 7 | u >>> 25), V = _ + $ + S + s[T] + C[T], X = W + U;
|
|
3515
|
+
_ = A, A = d, d = u, u = n + V | 0, n = x, x = p, p = i, i = V + X | 0;
|
|
3516
3516
|
}
|
|
3517
|
-
F[0] = F[0] + i | 0, F[1] = F[1] + p | 0, F[2] = F[2] + x | 0, F[3] = F[3] + n | 0, F[4] = F[4] +
|
|
3517
|
+
F[0] = F[0] + i | 0, F[1] = F[1] + p | 0, F[2] = F[2] + x | 0, F[3] = F[3] + n | 0, F[4] = F[4] + u | 0, F[5] = F[5] + d | 0, F[6] = F[6] + A | 0, F[7] = F[7] + _ | 0;
|
|
3518
3518
|
},
|
|
3519
3519
|
_doFinalize: function() {
|
|
3520
|
-
var l = this._data,
|
|
3521
|
-
return
|
|
3520
|
+
var l = this._data, h = l.words, F = this._nDataBytes * 8, i = l.sigBytes * 8;
|
|
3521
|
+
return h[i >>> 5] |= 128 << 24 - i % 32, h[(i + 64 >>> 9 << 4) + 14] = a.floor(F / 4294967296), h[(i + 64 >>> 9 << 4) + 15] = F, l.sigBytes = h.length * 4, this._process(), this._hash;
|
|
3522
3522
|
},
|
|
3523
3523
|
clone: function() {
|
|
3524
3524
|
var l = o.clone.call(this);
|
|
@@ -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: {} }, Sx = dt.exports, jr;
|
|
3534
|
+
function Rx() {
|
|
3535
|
+
return jr || (jr = 1, function(y, H) {
|
|
3536
3536
|
(function(E, a, g) {
|
|
3537
3537
|
y.exports = a(j(), Cr());
|
|
3538
|
-
})(
|
|
3538
|
+
})(Sx, 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 Sx() {
|
|
|
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: {} }, qx = pt.exports, Zr;
|
|
3564
|
+
function be() {
|
|
3565
|
+
return Zr || (Zr = 1, function(y, H) {
|
|
3566
3566
|
(function(E, a, g) {
|
|
3567
3567
|
y.exports = a(j(), Nt());
|
|
3568
|
-
})(
|
|
3568
|
+
})(qx, 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() {
|
|
@@ -3654,8 +3654,8 @@ function De() {
|
|
|
3654
3654
|
s(1816402316, 1246189591)
|
|
3655
3655
|
], f = [];
|
|
3656
3656
|
(function() {
|
|
3657
|
-
for (var
|
|
3658
|
-
f[
|
|
3657
|
+
for (var h = 0; h < 80; h++)
|
|
3658
|
+
f[h] = s();
|
|
3659
3659
|
})();
|
|
3660
3660
|
var l = r.SHA512 = B.extend({
|
|
3661
3661
|
_doReset: function() {
|
|
@@ -3670,29 +3670,29 @@ function De() {
|
|
|
3670
3670
|
new o.init(1541459225, 327033209)
|
|
3671
3671
|
]);
|
|
3672
3672
|
},
|
|
3673
|
-
_doProcessBlock: function(
|
|
3674
|
-
for (var i = this._hash.words, p = i[0], x = i[1], n = i[2],
|
|
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, P = _.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 = P, _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
|
-
F0 = I0.high =
|
|
3677
|
+
F0 = I0.high = h[F + c0 * 2] | 0, s0 = I0.low = h[F + c0 * 2 + 1] | 0;
|
|
3678
3678
|
else {
|
|
3679
|
-
var $0 = f[c0 - 15], y0 = $0.high,
|
|
3679
|
+
var $0 = f[c0 - 15], y0 = $0.high, k0 = $0.low, Wt = (y0 >>> 1 | k0 << 31) ^ (y0 >>> 8 | k0 << 24) ^ y0 >>> 7, K0 = (k0 >>> 1 | y0 << 31) ^ (k0 >>> 8 | y0 << 24) ^ (k0 >>> 7 | y0 << 25), V0 = f[c0 - 2], D0 = V0.high, S0 = V0.low, $t = (D0 >>> 19 | S0 << 13) ^ (D0 << 3 | S0 >>> 29) ^ D0 >>> 6, L0 = (S0 >>> 19 | D0 << 13) ^ (S0 << 3 | D0 >>> 29) ^ (S0 >>> 6 | D0 << 26), X0 = f[c0 - 7], j0 = X0.high, Kt = X0.low, M0 = f[c0 - 16], Vt = M0.high, Z0 = M0.low;
|
|
3680
3680
|
s0 = K0 + Kt, F0 = Wt + j0 + (s0 >>> 0 < K0 >>> 0 ? 1 : 0), s0 = s0 + L0, F0 = F0 + $t + (s0 >>> 0 < L0 >>> 0 ? 1 : 0), s0 = s0 + Z0, F0 = F0 + Vt + (s0 >>> 0 < Z0 >>> 0 ? 1 : 0), I0.high = F0, I0.low = s0;
|
|
3681
3681
|
}
|
|
3682
|
-
var Xt = f0 & P0 ^ ~f0 & z0, G0 = n0 &
|
|
3683
|
-
U0 = z0, T0 =
|
|
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
|
+
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),
|
|
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 = P + 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
|
-
var
|
|
3689
|
-
F[p >>> 5] |= 128 << 24 - p % 32, F[(p + 128 >>> 10 << 5) + 30] = Math.floor(i / 4294967296), F[(p + 128 >>> 10 << 5) + 31] = i,
|
|
3688
|
+
var h = this._data, F = h.words, i = this._nDataBytes * 8, p = h.sigBytes * 8;
|
|
3689
|
+
F[p >>> 5] |= 128 << 24 - p % 32, F[(p + 128 >>> 10 << 5) + 30] = Math.floor(i / 4294967296), F[(p + 128 >>> 10 << 5) + 31] = i, h.sigBytes = F.length * 4, this._process();
|
|
3690
3690
|
var x = this._hash.toX32();
|
|
3691
3691
|
return x;
|
|
3692
3692
|
},
|
|
3693
3693
|
clone: function() {
|
|
3694
|
-
var
|
|
3695
|
-
return
|
|
3694
|
+
var h = B.clone.call(this);
|
|
3695
|
+
return h._hash = this._hash.clone(), h;
|
|
3696
3696
|
},
|
|
3697
3697
|
blockSize: 1024 / 32
|
|
3698
3698
|
});
|
|
@@ -3701,12 +3701,12 @@ function De() {
|
|
|
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: {} }, Hx = Bt.exports, Gr;
|
|
3705
|
+
function Px() {
|
|
3706
|
+
return Gr || (Gr = 1, function(y, H) {
|
|
3707
3707
|
(function(E, a, g) {
|
|
3708
|
-
y.exports = a(j(), Nt(),
|
|
3709
|
-
})(
|
|
3708
|
+
y.exports = a(j(), Nt(), be());
|
|
3709
|
+
})(Hx, 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,38 +3731,38 @@ function qx() {
|
|
|
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: {} }, zx = Ft.exports, Yr;
|
|
3735
|
+
function Ix() {
|
|
3736
|
+
return Yr || (Yr = 1, function(y, H) {
|
|
3737
3737
|
(function(E, a, g) {
|
|
3738
3738
|
y.exports = a(j(), Nt());
|
|
3739
|
-
})(
|
|
3739
|
+
})(zx, 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() {
|
|
3743
3743
|
for (var i = 1, p = 0, x = 0; x < 24; x++) {
|
|
3744
3744
|
C[i + 5 * p] = (x + 1) * (x + 2) / 2 % 64;
|
|
3745
|
-
var n = p % 5,
|
|
3746
|
-
i = n, p =
|
|
3745
|
+
var n = p % 5, u = (2 * i + 3 * p) % 5;
|
|
3746
|
+
i = n, p = u;
|
|
3747
3747
|
}
|
|
3748
3748
|
for (var i = 0; i < 5; i++)
|
|
3749
3749
|
for (var p = 0; p < 5; p++)
|
|
3750
3750
|
f[i + 5 * p] = p + (2 * i + 3 * p) % 5 * 5;
|
|
3751
3751
|
for (var d = 1, A = 0; A < 24; A++) {
|
|
3752
|
-
for (var
|
|
3752
|
+
for (var _ = 0, T = 0, q = 0; q < 7; q++) {
|
|
3753
3753
|
if (d & 1) {
|
|
3754
3754
|
var D = (1 << q) - 1;
|
|
3755
|
-
D < 32 ? T ^= 1 << D :
|
|
3755
|
+
D < 32 ? T ^= 1 << D : _ ^= 1 << D - 32;
|
|
3756
3756
|
}
|
|
3757
3757
|
d & 128 ? d = d << 1 ^ 113 : d <<= 1;
|
|
3758
3758
|
}
|
|
3759
|
-
l[A] = r.create(
|
|
3759
|
+
l[A] = r.create(_, T);
|
|
3760
3760
|
}
|
|
3761
3761
|
})();
|
|
3762
|
-
var
|
|
3762
|
+
var h = [];
|
|
3763
3763
|
(function() {
|
|
3764
3764
|
for (var i = 0; i < 25; i++)
|
|
3765
|
-
|
|
3765
|
+
h[i] = r.create();
|
|
3766
3766
|
})();
|
|
3767
3767
|
var F = s.SHA3 = o.extend({
|
|
3768
3768
|
/**
|
|
@@ -3782,41 +3782,41 @@ function Px() {
|
|
|
3782
3782
|
this.blockSize = (1600 - 2 * this.cfg.outputLength) / 32;
|
|
3783
3783
|
},
|
|
3784
3784
|
_doProcessBlock: function(i, p) {
|
|
3785
|
-
for (var x = this._state, n = this.blockSize / 2,
|
|
3786
|
-
var d = i[p + 2 *
|
|
3785
|
+
for (var x = this._state, n = this.blockSize / 2, u = 0; u < n; u++) {
|
|
3786
|
+
var d = i[p + 2 * u], A = i[p + 2 * u + 1];
|
|
3787
3787
|
d = (d << 8 | d >>> 24) & 16711935 | (d << 24 | d >>> 8) & 4278255360, A = (A << 8 | A >>> 24) & 16711935 | (A << 24 | A >>> 8) & 4278255360;
|
|
3788
|
-
var
|
|
3789
|
-
|
|
3788
|
+
var _ = x[u];
|
|
3789
|
+
_.high ^= A, _.low ^= d;
|
|
3790
3790
|
}
|
|
3791
3791
|
for (var T = 0; T < 24; T++) {
|
|
3792
3792
|
for (var q = 0; q < 5; q++) {
|
|
3793
|
-
for (var D = 0,
|
|
3794
|
-
var
|
|
3795
|
-
D ^=
|
|
3793
|
+
for (var D = 0, w = 0, k = 0; k < 5; k++) {
|
|
3794
|
+
var _ = x[q + 5 * k];
|
|
3795
|
+
D ^= _.high, w ^= _.low;
|
|
3796
3796
|
}
|
|
3797
|
-
var
|
|
3798
|
-
|
|
3797
|
+
var S = h[q];
|
|
3798
|
+
S.high = D, S.low = w;
|
|
3799
3799
|
}
|
|
3800
3800
|
for (var q = 0; q < 5; q++)
|
|
3801
|
-
for (var U =
|
|
3802
|
-
var
|
|
3803
|
-
|
|
3801
|
+
for (var U = h[(q + 4) % 5], W = h[(q + 1) % 5], $ = W.high, V = W.low, D = U.high ^ ($ << 1 | V >>> 31), w = U.low ^ (V << 1 | $ >>> 31), k = 0; k < 5; k++) {
|
|
3802
|
+
var _ = x[q + 5 * k];
|
|
3803
|
+
_.high ^= D, _.low ^= w;
|
|
3804
3804
|
}
|
|
3805
3805
|
for (var X = 1; X < 25; X++) {
|
|
3806
|
-
var D,
|
|
3807
|
-
|
|
3808
|
-
var R =
|
|
3809
|
-
R.high = D, R.low =
|
|
3806
|
+
var D, w, _ = x[X], G = _.high, Z = _.low, P = C[X];
|
|
3807
|
+
P < 32 ? (D = G << P | Z >>> 32 - P, w = Z << P | G >>> 32 - P) : (D = Z << P - 32 | G >>> 64 - P, w = G << P - 32 | Z >>> 64 - P);
|
|
3808
|
+
var R = h[f[X]];
|
|
3809
|
+
R.high = D, R.low = w;
|
|
3810
3810
|
}
|
|
3811
|
-
var O =
|
|
3811
|
+
var O = h[0], I = x[0];
|
|
3812
3812
|
O.high = I.high, O.low = I.low;
|
|
3813
3813
|
for (var q = 0; q < 5; q++)
|
|
3814
|
-
for (var
|
|
3815
|
-
var X = q + 5 *
|
|
3816
|
-
|
|
3814
|
+
for (var k = 0; k < 5; k++) {
|
|
3815
|
+
var X = q + 5 * k, _ = x[X], Q = h[X], Y = h[(q + 1) % 5 + 5 * k], x0 = h[(q + 2) % 5 + 5 * k];
|
|
3816
|
+
_.high = Q.high ^ ~Y.high & x0.high, _.low = Q.low ^ ~Y.low & x0.low;
|
|
3817
3817
|
}
|
|
3818
|
-
var
|
|
3819
|
-
|
|
3818
|
+
var _ = x[0], K = l[T];
|
|
3819
|
+
_.high ^= K.high, _.low ^= K.low;
|
|
3820
3820
|
}
|
|
3821
3821
|
},
|
|
3822
3822
|
_doFinalize: function() {
|
|
@@ -3824,11 +3824,11 @@ function Px() {
|
|
|
3824
3824
|
this._nDataBytes * 8;
|
|
3825
3825
|
var x = i.sigBytes * 8, n = this.blockSize * 32;
|
|
3826
3826
|
p[x >>> 5] |= 1 << 24 - x % 32, p[(a.ceil((x + 1) / n) * n >>> 5) - 1] |= 128, i.sigBytes = p.length * 4, this._process();
|
|
3827
|
-
for (var
|
|
3828
|
-
var q =
|
|
3829
|
-
D = (D << 8 | D >>> 24) & 16711935 | (D << 24 | D >>> 8) & 4278255360,
|
|
3827
|
+
for (var u = this._state, d = this.cfg.outputLength / 8, A = d / 8, _ = [], T = 0; T < A; T++) {
|
|
3828
|
+
var q = u[T], D = q.high, w = q.low;
|
|
3829
|
+
D = (D << 8 | D >>> 24) & 16711935 | (D << 24 | D >>> 8) & 4278255360, w = (w << 8 | w >>> 24) & 16711935 | (w << 24 | w >>> 8) & 4278255360, _.push(w), _.push(D);
|
|
3830
3830
|
}
|
|
3831
|
-
return new m.init(
|
|
3831
|
+
return new m.init(_, d);
|
|
3832
3832
|
},
|
|
3833
3833
|
clone: function() {
|
|
3834
3834
|
for (var i = o.clone.call(this), p = i._state = this._state.slice(0), x = 0; x < 25; x++)
|
|
@@ -3841,12 +3841,12 @@ function Px() {
|
|
|
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: {} }, Lx = Ct.exports, Qr;
|
|
3845
|
+
function Ox() {
|
|
3846
|
+
return Qr || (Qr = 1, function(y, H) {
|
|
3847
3847
|
(function(E, a) {
|
|
3848
3848
|
y.exports = a(j());
|
|
3849
|
-
})(
|
|
3849
|
+
})(Lx, function(E) {
|
|
3850
3850
|
/** @preserve
|
|
3851
3851
|
(c) 2012 by Cédric Mesnil. All rights reserved.
|
|
3852
3852
|
|
|
@@ -4182,27 +4182,27 @@ function Ix() {
|
|
|
4182
4182
|
13,
|
|
4183
4183
|
11,
|
|
4184
4184
|
11
|
|
4185
|
-
]), l = m.create([0, 1518500249, 1859775393, 2400959708, 2840853838]),
|
|
4185
|
+
]), l = m.create([0, 1518500249, 1859775393, 2400959708, 2840853838]), h = m.create([1352829926, 1548603684, 1836072691, 2053994217, 0]), F = v.RIPEMD160 = o.extend({
|
|
4186
4186
|
_doReset: function() {
|
|
4187
4187
|
this._hash = m.create([1732584193, 4023233417, 2562383102, 271733878, 3285377520]);
|
|
4188
4188
|
},
|
|
4189
|
-
_doProcessBlock: function(A,
|
|
4189
|
+
_doProcessBlock: function(A, _) {
|
|
4190
4190
|
for (var T = 0; T < 16; T++) {
|
|
4191
|
-
var q =
|
|
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
|
|
4195
|
-
O = X =
|
|
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, P, R, O, I, Q, Y, x0;
|
|
4195
|
+
O = X = w[0], I = G = w[1], Q = Z = w[2], Y = P = w[3], x0 = R = w[4];
|
|
4196
4196
|
for (var K, T = 0; T < 80; T += 1)
|
|
4197
|
-
K = X + A[
|
|
4198
|
-
K =
|
|
4197
|
+
K = X + A[_ + U[T]] | 0, T < 16 ? K += i(G, Z, P) + k[0] : T < 32 ? K += p(G, Z, P) + k[1] : T < 48 ? K += x(G, Z, P) + k[2] : T < 64 ? K += n(G, Z, P) + k[3] : K += u(G, Z, P) + k[4], K = K | 0, K = d(K, $[T]), K = K + R | 0, X = R, R = P, P = 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] + P + 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
|
-
var A = this._data,
|
|
4202
|
-
|
|
4203
|
-
for (var D = this._hash,
|
|
4204
|
-
var
|
|
4205
|
-
|
|
4201
|
+
var A = this._data, _ = A.words, T = this._nDataBytes * 8, q = A.sigBytes * 8;
|
|
4202
|
+
_[q >>> 5] |= 128 << 24 - q % 32, _[(q + 64 >>> 9 << 4) + 14] = (T << 8 | T >>> 24) & 16711935 | (T << 24 | T >>> 8) & 4278255360, A.sigBytes = (_.length + 1) * 4, this._process();
|
|
4203
|
+
for (var D = this._hash, w = D.words, k = 0; k < 5; k++) {
|
|
4204
|
+
var S = w[k];
|
|
4205
|
+
w[k] = (S << 8 | S >>> 24) & 16711935 | (S << 24 | S >>> 8) & 4278255360;
|
|
4206
4206
|
}
|
|
4207
4207
|
return D;
|
|
4208
4208
|
},
|
|
@@ -4211,35 +4211,35 @@ function Ix() {
|
|
|
4211
4211
|
return A._hash = this._hash.clone(), A;
|
|
4212
4212
|
}
|
|
4213
4213
|
});
|
|
4214
|
-
function i(A,
|
|
4215
|
-
return A ^
|
|
4214
|
+
function i(A, _, T) {
|
|
4215
|
+
return A ^ _ ^ T;
|
|
4216
4216
|
}
|
|
4217
|
-
function p(A,
|
|
4218
|
-
return A &
|
|
4217
|
+
function p(A, _, T) {
|
|
4218
|
+
return A & _ | ~A & T;
|
|
4219
4219
|
}
|
|
4220
|
-
function x(A,
|
|
4221
|
-
return (A | ~
|
|
4220
|
+
function x(A, _, T) {
|
|
4221
|
+
return (A | ~_) ^ T;
|
|
4222
4222
|
}
|
|
4223
|
-
function n(A,
|
|
4224
|
-
return A & T |
|
|
4223
|
+
function n(A, _, T) {
|
|
4224
|
+
return A & T | _ & ~T;
|
|
4225
4225
|
}
|
|
4226
|
-
function
|
|
4227
|
-
return A ^ (
|
|
4226
|
+
function u(A, _, T) {
|
|
4227
|
+
return A ^ (_ | ~T);
|
|
4228
4228
|
}
|
|
4229
|
-
function d(A,
|
|
4230
|
-
return A <<
|
|
4229
|
+
function d(A, _) {
|
|
4230
|
+
return A << _ | A >>> 32 - _;
|
|
4231
4231
|
}
|
|
4232
4232
|
g.RIPEMD160 = o._createHelper(F), g.HmacRIPEMD160 = o._createHmacHelper(F);
|
|
4233
4233
|
}(), E.RIPEMD160;
|
|
4234
4234
|
});
|
|
4235
4235
|
}(Ct)), Ct.exports;
|
|
4236
4236
|
}
|
|
4237
|
-
var At = { exports: {} },
|
|
4237
|
+
var At = { exports: {} }, Ux = At.exports, Jr;
|
|
4238
4238
|
function Ar() {
|
|
4239
|
-
return Jr || (Jr = 1, function(y,
|
|
4239
|
+
return Jr || (Jr = 1, function(y, H) {
|
|
4240
4240
|
(function(E, a) {
|
|
4241
4241
|
y.exports = a(j());
|
|
4242
|
-
})(
|
|
4242
|
+
})(Ux, 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({
|
|
@@ -4257,9 +4257,9 @@ function Ar() {
|
|
|
4257
4257
|
r = this._hasher = new r.init(), typeof s == "string" && (s = o.parse(s));
|
|
4258
4258
|
var C = r.blockSize, f = C * 4;
|
|
4259
4259
|
s.sigBytes > f && (s = r.finalize(s)), s.clamp();
|
|
4260
|
-
for (var l = this._oKey = s.clone(),
|
|
4260
|
+
for (var l = this._oKey = s.clone(), h = this._iKey = s.clone(), F = l.words, i = h.words, p = 0; p < C; p++)
|
|
4261
4261
|
F[p] ^= 1549556828, i[p] ^= 909522486;
|
|
4262
|
-
l.sigBytes =
|
|
4262
|
+
l.sigBytes = h.sigBytes = f, this.reset();
|
|
4263
4263
|
},
|
|
4264
4264
|
/**
|
|
4265
4265
|
* Resets this HMAC to its initial state.
|
|
@@ -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: {} }, Mx = Et.exports, te;
|
|
4316
|
+
function Nx() {
|
|
4317
|
+
return te || (te = 1, function(y, H) {
|
|
4318
4318
|
(function(E, a, g) {
|
|
4319
4319
|
y.exports = a(j(), Cr(), Ar());
|
|
4320
|
-
})(
|
|
4320
|
+
})(Mx, 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
|
/**
|
|
@@ -4359,13 +4359,13 @@ function Ux() {
|
|
|
4359
4359
|
* var key = kdf.compute(password, salt);
|
|
4360
4360
|
*/
|
|
4361
4361
|
compute: function(C, f) {
|
|
4362
|
-
for (var l = this.cfg,
|
|
4363
|
-
var d =
|
|
4364
|
-
|
|
4365
|
-
for (var A = d.words,
|
|
4366
|
-
T =
|
|
4367
|
-
for (var D = T.words,
|
|
4368
|
-
A[
|
|
4362
|
+
for (var l = this.cfg, h = r.create(l.hasher, C), F = m.create(), i = m.create([1]), p = F.words, x = i.words, n = l.keySize, u = l.iterations; p.length < n; ) {
|
|
4363
|
+
var d = h.update(f).finalize(i);
|
|
4364
|
+
h.reset();
|
|
4365
|
+
for (var A = d.words, _ = A.length, T = d, q = 1; q < u; q++) {
|
|
4366
|
+
T = h.finalize(T), h.reset();
|
|
4367
|
+
for (var D = T.words, w = 0; w < _; w++)
|
|
4368
|
+
A[w] ^= D[w];
|
|
4369
4369
|
}
|
|
4370
4370
|
F.concat(d), x[0]++;
|
|
4371
4371
|
}
|
|
@@ -4379,12 +4379,12 @@ function Ux() {
|
|
|
4379
4379
|
});
|
|
4380
4380
|
}(Et)), Et.exports;
|
|
4381
4381
|
}
|
|
4382
|
-
var yt = { exports: {} },
|
|
4382
|
+
var yt = { exports: {} }, Wx = yt.exports, re;
|
|
4383
4383
|
function b0() {
|
|
4384
|
-
return re || (re = 1, function(y,
|
|
4384
|
+
return re || (re = 1, function(y, H) {
|
|
4385
4385
|
(function(E, a, g) {
|
|
4386
|
-
y.exports = a(j(),
|
|
4387
|
-
})(
|
|
4386
|
+
y.exports = a(j(), ge(), Ar());
|
|
4387
|
+
})(Wx, 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
|
/**
|
|
@@ -4426,10 +4426,10 @@ function b0() {
|
|
|
4426
4426
|
* var key = kdf.compute(password, salt);
|
|
4427
4427
|
*/
|
|
4428
4428
|
compute: function(s, C) {
|
|
4429
|
-
for (var f, l = this.cfg,
|
|
4430
|
-
f &&
|
|
4429
|
+
for (var f, l = this.cfg, h = l.hasher.create(), F = m.create(), i = F.words, p = l.keySize, x = l.iterations; i.length < p; ) {
|
|
4430
|
+
f && h.update(f), f = h.update(s).finalize(C), h.reset();
|
|
4431
4431
|
for (var n = 1; n < x; n++)
|
|
4432
|
-
f =
|
|
4432
|
+
f = h.finalize(f), h.reset();
|
|
4433
4433
|
F.concat(f);
|
|
4434
4434
|
}
|
|
4435
4435
|
return F.sigBytes = p * 4, F;
|
|
@@ -4442,12 +4442,12 @@ function b0() {
|
|
|
4442
4442
|
});
|
|
4443
4443
|
}(yt)), yt.exports;
|
|
4444
4444
|
}
|
|
4445
|
-
var Dt = { exports: {} },
|
|
4445
|
+
var Dt = { exports: {} }, $x = Dt.exports, ee;
|
|
4446
4446
|
function e0() {
|
|
4447
|
-
return ee || (ee = 1, function(y,
|
|
4447
|
+
return ee || (ee = 1, function(y, H) {
|
|
4448
4448
|
(function(E, a, g) {
|
|
4449
4449
|
y.exports = a(j(), b0());
|
|
4450
|
-
})(
|
|
4450
|
+
})($x, 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;
|
|
@@ -4472,8 +4472,8 @@ function e0() {
|
|
|
4472
4472
|
*
|
|
4473
4473
|
* var cipher = CryptoJS.algo.AES.createEncryptor(keyWordArray, { iv: ivWordArray });
|
|
4474
4474
|
*/
|
|
4475
|
-
createEncryptor: function(D,
|
|
4476
|
-
return this.create(this._ENC_XFORM_MODE, D,
|
|
4475
|
+
createEncryptor: function(D, w) {
|
|
4476
|
+
return this.create(this._ENC_XFORM_MODE, D, w);
|
|
4477
4477
|
},
|
|
4478
4478
|
/**
|
|
4479
4479
|
* Creates this cipher in decryption mode.
|
|
@@ -4489,8 +4489,8 @@ function e0() {
|
|
|
4489
4489
|
*
|
|
4490
4490
|
* var cipher = CryptoJS.algo.AES.createDecryptor(keyWordArray, { iv: ivWordArray });
|
|
4491
4491
|
*/
|
|
4492
|
-
createDecryptor: function(D,
|
|
4493
|
-
return this.create(this._DEC_XFORM_MODE, D,
|
|
4492
|
+
createDecryptor: function(D, w) {
|
|
4493
|
+
return this.create(this._DEC_XFORM_MODE, D, w);
|
|
4494
4494
|
},
|
|
4495
4495
|
/**
|
|
4496
4496
|
* Initializes a newly created cipher.
|
|
@@ -4503,8 +4503,8 @@ function e0() {
|
|
|
4503
4503
|
*
|
|
4504
4504
|
* var cipher = CryptoJS.algo.AES.create(CryptoJS.algo.AES._ENC_XFORM_MODE, keyWordArray, { iv: ivWordArray });
|
|
4505
4505
|
*/
|
|
4506
|
-
init: function(D,
|
|
4507
|
-
this.cfg = this.cfg.extend(
|
|
4506
|
+
init: function(D, w, k) {
|
|
4507
|
+
this.cfg = this.cfg.extend(k), this._xformMode = D, this._key = w, this.reset();
|
|
4508
4508
|
},
|
|
4509
4509
|
/**
|
|
4510
4510
|
* Resets this cipher to its initial state.
|
|
@@ -4547,8 +4547,8 @@ function e0() {
|
|
|
4547
4547
|
*/
|
|
4548
4548
|
finalize: function(D) {
|
|
4549
4549
|
D && this._append(D);
|
|
4550
|
-
var
|
|
4551
|
-
return
|
|
4550
|
+
var w = this._doFinalize();
|
|
4551
|
+
return w;
|
|
4552
4552
|
},
|
|
4553
4553
|
keySize: 128 / 32,
|
|
4554
4554
|
ivSize: 128 / 32,
|
|
@@ -4568,16 +4568,16 @@ function e0() {
|
|
|
4568
4568
|
* var AES = CryptoJS.lib.Cipher._createHelper(CryptoJS.algo.AES);
|
|
4569
4569
|
*/
|
|
4570
4570
|
_createHelper: /* @__PURE__ */ function() {
|
|
4571
|
-
function D(
|
|
4572
|
-
return typeof
|
|
4571
|
+
function D(w) {
|
|
4572
|
+
return typeof w == "string" ? q : A;
|
|
4573
4573
|
}
|
|
4574
|
-
return function(
|
|
4574
|
+
return function(w) {
|
|
4575
4575
|
return {
|
|
4576
|
-
encrypt: function(
|
|
4577
|
-
return D(
|
|
4576
|
+
encrypt: function(k, S, U) {
|
|
4577
|
+
return D(S).encrypt(w, k, S, U);
|
|
4578
4578
|
},
|
|
4579
|
-
decrypt: function(
|
|
4580
|
-
return D(
|
|
4579
|
+
decrypt: function(k, S, U) {
|
|
4580
|
+
return D(S).decrypt(w, k, S, U);
|
|
4581
4581
|
}
|
|
4582
4582
|
};
|
|
4583
4583
|
};
|
|
@@ -4590,7 +4590,7 @@ function e0() {
|
|
|
4590
4590
|
},
|
|
4591
4591
|
blockSize: 1
|
|
4592
4592
|
});
|
|
4593
|
-
var
|
|
4593
|
+
var h = g.mode = {}, F = B.BlockCipherMode = m.extend({
|
|
4594
4594
|
/**
|
|
4595
4595
|
* Creates this mode for encryption.
|
|
4596
4596
|
*
|
|
@@ -4603,8 +4603,8 @@ function e0() {
|
|
|
4603
4603
|
*
|
|
4604
4604
|
* var mode = CryptoJS.mode.CBC.createEncryptor(cipher, iv.words);
|
|
4605
4605
|
*/
|
|
4606
|
-
createEncryptor: function(D,
|
|
4607
|
-
return this.Encryptor.create(D,
|
|
4606
|
+
createEncryptor: function(D, w) {
|
|
4607
|
+
return this.Encryptor.create(D, w);
|
|
4608
4608
|
},
|
|
4609
4609
|
/**
|
|
4610
4610
|
* Creates this mode for decryption.
|
|
@@ -4618,8 +4618,8 @@ function e0() {
|
|
|
4618
4618
|
*
|
|
4619
4619
|
* var mode = CryptoJS.mode.CBC.createDecryptor(cipher, iv.words);
|
|
4620
4620
|
*/
|
|
4621
|
-
createDecryptor: function(D,
|
|
4622
|
-
return this.Decryptor.create(D,
|
|
4621
|
+
createDecryptor: function(D, w) {
|
|
4622
|
+
return this.Decryptor.create(D, w);
|
|
4623
4623
|
},
|
|
4624
4624
|
/**
|
|
4625
4625
|
* Initializes a newly created mode.
|
|
@@ -4631,10 +4631,10 @@ function e0() {
|
|
|
4631
4631
|
*
|
|
4632
4632
|
* var mode = CryptoJS.mode.CBC.Encryptor.create(cipher, iv.words);
|
|
4633
4633
|
*/
|
|
4634
|
-
init: function(D,
|
|
4635
|
-
this._cipher = D, this._iv =
|
|
4634
|
+
init: function(D, w) {
|
|
4635
|
+
this._cipher = D, this._iv = w;
|
|
4636
4636
|
}
|
|
4637
|
-
}), i =
|
|
4637
|
+
}), i = h.CBC = function() {
|
|
4638
4638
|
var D = F.extend();
|
|
4639
4639
|
D.Encryptor = D.extend({
|
|
4640
4640
|
/**
|
|
@@ -4647,9 +4647,9 @@ function e0() {
|
|
|
4647
4647
|
*
|
|
4648
4648
|
* mode.processBlock(data.words, offset);
|
|
4649
4649
|
*/
|
|
4650
|
-
processBlock: function(
|
|
4650
|
+
processBlock: function(k, S) {
|
|
4651
4651
|
var U = this._cipher, W = U.blockSize;
|
|
4652
|
-
|
|
4652
|
+
w.call(this, k, S, W), U.encryptBlock(k, S), this._prevBlock = k.slice(S, S + W);
|
|
4653
4653
|
}
|
|
4654
4654
|
}), D.Decryptor = D.extend({
|
|
4655
4655
|
/**
|
|
@@ -4662,16 +4662,16 @@ function e0() {
|
|
|
4662
4662
|
*
|
|
4663
4663
|
* mode.processBlock(data.words, offset);
|
|
4664
4664
|
*/
|
|
4665
|
-
processBlock: function(
|
|
4666
|
-
var U = this._cipher, W = U.blockSize, $ =
|
|
4667
|
-
U.decryptBlock(
|
|
4665
|
+
processBlock: function(k, S) {
|
|
4666
|
+
var U = this._cipher, W = U.blockSize, $ = k.slice(S, S + W);
|
|
4667
|
+
U.decryptBlock(k, S), w.call(this, k, S, W), this._prevBlock = $;
|
|
4668
4668
|
}
|
|
4669
4669
|
});
|
|
4670
|
-
function
|
|
4670
|
+
function w(k, S, U) {
|
|
4671
4671
|
var W, $ = this._iv;
|
|
4672
4672
|
$ ? (W = $, this._iv = a) : W = this._prevBlock;
|
|
4673
4673
|
for (var V = 0; V < U; V++)
|
|
4674
|
-
S
|
|
4674
|
+
k[S + V] ^= W[V];
|
|
4675
4675
|
}
|
|
4676
4676
|
return D;
|
|
4677
4677
|
}(), p = g.pad = {}, x = p.Pkcs7 = {
|
|
@@ -4687,10 +4687,10 @@ function e0() {
|
|
|
4687
4687
|
*
|
|
4688
4688
|
* CryptoJS.pad.Pkcs7.pad(wordArray, 4);
|
|
4689
4689
|
*/
|
|
4690
|
-
pad: function(D,
|
|
4691
|
-
for (var
|
|
4690
|
+
pad: function(D, w) {
|
|
4691
|
+
for (var k = w * 4, S = k - D.sigBytes % k, U = S << 24 | S << 16 | S << 8 | S, W = [], $ = 0; $ < S; $ += 4)
|
|
4692
4692
|
W.push(U);
|
|
4693
|
-
var V = o.create(W,
|
|
4693
|
+
var V = o.create(W, S);
|
|
4694
4694
|
D.concat(V);
|
|
4695
4695
|
},
|
|
4696
4696
|
/**
|
|
@@ -4705,8 +4705,8 @@ function e0() {
|
|
|
4705
4705
|
* CryptoJS.pad.Pkcs7.unpad(wordArray);
|
|
4706
4706
|
*/
|
|
4707
4707
|
unpad: function(D) {
|
|
4708
|
-
var
|
|
4709
|
-
D.sigBytes -=
|
|
4708
|
+
var w = D.words[D.sigBytes - 1 >>> 2] & 255;
|
|
4709
|
+
D.sigBytes -= w;
|
|
4710
4710
|
}
|
|
4711
4711
|
};
|
|
4712
4712
|
B.BlockCipher = l.extend({
|
|
@@ -4723,15 +4723,15 @@ function e0() {
|
|
|
4723
4723
|
reset: function() {
|
|
4724
4724
|
var D;
|
|
4725
4725
|
l.reset.call(this);
|
|
4726
|
-
var
|
|
4727
|
-
this._xformMode == this._ENC_XFORM_MODE ? D =
|
|
4726
|
+
var w = this.cfg, k = w.iv, S = w.mode;
|
|
4727
|
+
this._xformMode == this._ENC_XFORM_MODE ? D = S.createEncryptor : (D = S.createDecryptor, this._minBufferSize = 1), this._mode && this._mode.__creator == D ? this._mode.init(this, k && k.words) : (this._mode = D.call(S, this, k && k.words), this._mode.__creator = D);
|
|
4728
4728
|
},
|
|
4729
|
-
_doProcessBlock: function(D,
|
|
4730
|
-
this._mode.processBlock(D,
|
|
4729
|
+
_doProcessBlock: function(D, w) {
|
|
4730
|
+
this._mode.processBlock(D, w);
|
|
4731
4731
|
},
|
|
4732
4732
|
_doFinalize: function() {
|
|
4733
|
-
var D,
|
|
4734
|
-
return this._xformMode == this._ENC_XFORM_MODE ? (
|
|
4733
|
+
var D, w = this.cfg.padding;
|
|
4734
|
+
return this._xformMode == this._ENC_XFORM_MODE ? (w.pad(this._data, this.blockSize), D = this._process(!0)) : (D = this._process(!0), w.unpad(D)), D;
|
|
4735
4735
|
},
|
|
4736
4736
|
blockSize: 128 / 32
|
|
4737
4737
|
});
|
|
@@ -4776,7 +4776,7 @@ function e0() {
|
|
|
4776
4776
|
toString: function(D) {
|
|
4777
4777
|
return (D || this.formatter).stringify(this);
|
|
4778
4778
|
}
|
|
4779
|
-
}),
|
|
4779
|
+
}), u = g.format = {}, d = u.OpenSSL = {
|
|
4780
4780
|
/**
|
|
4781
4781
|
* Converts a cipher params object to an OpenSSL-compatible string.
|
|
4782
4782
|
*
|
|
@@ -4791,8 +4791,8 @@ function e0() {
|
|
|
4791
4791
|
* var openSSLString = CryptoJS.format.OpenSSL.stringify(cipherParams);
|
|
4792
4792
|
*/
|
|
4793
4793
|
stringify: function(D) {
|
|
4794
|
-
var
|
|
4795
|
-
return
|
|
4794
|
+
var w, k = D.ciphertext, S = D.salt;
|
|
4795
|
+
return S ? w = o.create([1398893684, 1701076831]).concat(S).concat(k) : w = k, w.toString(s);
|
|
4796
4796
|
},
|
|
4797
4797
|
/**
|
|
4798
4798
|
* Converts an OpenSSL-compatible string to a cipher params object.
|
|
@@ -4808,8 +4808,8 @@ function e0() {
|
|
|
4808
4808
|
* var cipherParams = CryptoJS.format.OpenSSL.parse(openSSLString);
|
|
4809
4809
|
*/
|
|
4810
4810
|
parse: function(D) {
|
|
4811
|
-
var
|
|
4812
|
-
return
|
|
4811
|
+
var w, k = s.parse(D), S = k.words;
|
|
4812
|
+
return S[0] == 1398893684 && S[1] == 1701076831 && (w = o.create(S.slice(2, 4)), S.splice(0, 4), k.sigBytes -= 16), n.create({ ciphertext: k, salt: w });
|
|
4813
4813
|
}
|
|
4814
4814
|
}, A = B.SerializableCipher = m.extend({
|
|
4815
4815
|
/**
|
|
@@ -4838,18 +4838,18 @@ function e0() {
|
|
|
4838
4838
|
* var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv });
|
|
4839
4839
|
* var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv, format: CryptoJS.format.OpenSSL });
|
|
4840
4840
|
*/
|
|
4841
|
-
encrypt: function(D,
|
|
4842
|
-
|
|
4843
|
-
var U = D.createEncryptor(
|
|
4841
|
+
encrypt: function(D, w, k, S) {
|
|
4842
|
+
S = this.cfg.extend(S);
|
|
4843
|
+
var U = D.createEncryptor(k, S), W = U.finalize(w), $ = U.cfg;
|
|
4844
4844
|
return n.create({
|
|
4845
4845
|
ciphertext: W,
|
|
4846
|
-
key:
|
|
4846
|
+
key: k,
|
|
4847
4847
|
iv: $.iv,
|
|
4848
4848
|
algorithm: D,
|
|
4849
4849
|
mode: $.mode,
|
|
4850
4850
|
padding: $.padding,
|
|
4851
4851
|
blockSize: D.blockSize,
|
|
4852
|
-
formatter:
|
|
4852
|
+
formatter: S.format
|
|
4853
4853
|
});
|
|
4854
4854
|
},
|
|
4855
4855
|
/**
|
|
@@ -4869,9 +4869,9 @@ function e0() {
|
|
|
4869
4869
|
* var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, key, { iv: iv, format: CryptoJS.format.OpenSSL });
|
|
4870
4870
|
* var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, key, { iv: iv, format: CryptoJS.format.OpenSSL });
|
|
4871
4871
|
*/
|
|
4872
|
-
decrypt: function(D,
|
|
4873
|
-
|
|
4874
|
-
var U = D.createDecryptor(
|
|
4872
|
+
decrypt: function(D, w, k, S) {
|
|
4873
|
+
S = this.cfg.extend(S), w = this._parse(w, S.format);
|
|
4874
|
+
var U = D.createDecryptor(k, S).finalize(w.ciphertext);
|
|
4875
4875
|
return U;
|
|
4876
4876
|
},
|
|
4877
4877
|
/**
|
|
@@ -4889,10 +4889,10 @@ function e0() {
|
|
|
4889
4889
|
*
|
|
4890
4890
|
* var ciphertextParams = CryptoJS.lib.SerializableCipher._parse(ciphertextStringOrParams, format);
|
|
4891
4891
|
*/
|
|
4892
|
-
_parse: function(D,
|
|
4893
|
-
return typeof D == "string" ?
|
|
4892
|
+
_parse: function(D, w) {
|
|
4893
|
+
return typeof D == "string" ? w.parse(D, this) : D;
|
|
4894
4894
|
}
|
|
4895
|
-
}),
|
|
4895
|
+
}), _ = g.kdf = {}, T = _.OpenSSL = {
|
|
4896
4896
|
/**
|
|
4897
4897
|
* Derives a key and IV from a password.
|
|
4898
4898
|
*
|
|
@@ -4910,13 +4910,13 @@ function e0() {
|
|
|
4910
4910
|
* var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32);
|
|
4911
4911
|
* var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32, 'saltsalt');
|
|
4912
4912
|
*/
|
|
4913
|
-
execute: function(D,
|
|
4914
|
-
if (
|
|
4915
|
-
var W = f.create({ keySize:
|
|
4913
|
+
execute: function(D, w, k, S, U) {
|
|
4914
|
+
if (S || (S = o.random(64 / 8)), U)
|
|
4915
|
+
var W = f.create({ keySize: w + k, hasher: U }).compute(D, S);
|
|
4916
4916
|
else
|
|
4917
|
-
var W = f.create({ keySize:
|
|
4918
|
-
var $ = o.create(W.words.slice(
|
|
4919
|
-
return W.sigBytes =
|
|
4917
|
+
var W = f.create({ keySize: w + k }).compute(D, S);
|
|
4918
|
+
var $ = o.create(W.words.slice(w), k * 4);
|
|
4919
|
+
return W.sigBytes = w * 4, n.create({ key: W, iv: $, salt: S });
|
|
4920
4920
|
}
|
|
4921
4921
|
}, q = B.PasswordBasedCipher = A.extend({
|
|
4922
4922
|
/**
|
|
@@ -4944,11 +4944,11 @@ function e0() {
|
|
|
4944
4944
|
* var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password');
|
|
4945
4945
|
* var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password', { format: CryptoJS.format.OpenSSL });
|
|
4946
4946
|
*/
|
|
4947
|
-
encrypt: function(D,
|
|
4948
|
-
|
|
4949
|
-
var U =
|
|
4950
|
-
|
|
4951
|
-
var W = A.encrypt.call(this, D,
|
|
4947
|
+
encrypt: function(D, w, k, S) {
|
|
4948
|
+
S = this.cfg.extend(S);
|
|
4949
|
+
var U = S.kdf.execute(k, D.keySize, D.ivSize, S.salt, S.hasher);
|
|
4950
|
+
S.iv = U.iv;
|
|
4951
|
+
var W = A.encrypt.call(this, D, w, U.key, S);
|
|
4952
4952
|
return W.mixIn(U), W;
|
|
4953
4953
|
},
|
|
4954
4954
|
/**
|
|
@@ -4968,11 +4968,11 @@ function e0() {
|
|
|
4968
4968
|
* var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, 'password', { format: CryptoJS.format.OpenSSL });
|
|
4969
4969
|
* var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, 'password', { format: CryptoJS.format.OpenSSL });
|
|
4970
4970
|
*/
|
|
4971
|
-
decrypt: function(D,
|
|
4972
|
-
|
|
4973
|
-
var U =
|
|
4974
|
-
|
|
4975
|
-
var W = A.decrypt.call(this, D,
|
|
4971
|
+
decrypt: function(D, w, k, S) {
|
|
4972
|
+
S = this.cfg.extend(S), w = this._parse(w, S.format);
|
|
4973
|
+
var U = S.kdf.execute(k, D.keySize, D.ivSize, w.salt, S.hasher);
|
|
4974
|
+
S.iv = U.iv;
|
|
4975
|
+
var W = A.decrypt.call(this, D, w, U.key, S);
|
|
4976
4976
|
return W;
|
|
4977
4977
|
}
|
|
4978
4978
|
});
|
|
@@ -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: {} }, Kx = gt.exports, xe;
|
|
4984
|
+
function Vx() {
|
|
4985
|
+
return xe || (xe = 1, function(y, H) {
|
|
4986
4986
|
(function(E, a, g) {
|
|
4987
4987
|
y.exports = a(j(), e0());
|
|
4988
|
-
})(
|
|
4988
|
+
})(Kx, 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 $x() {
|
|
|
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: {} }, Xx = bt.exports, ne;
|
|
5014
|
+
function jx() {
|
|
5015
|
+
return ne || (ne = 1, function(y, H) {
|
|
5016
5016
|
(function(E, a, g) {
|
|
5017
5017
|
y.exports = a(j(), e0());
|
|
5018
|
-
})(
|
|
5018
|
+
})(Xx, 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 Vx() {
|
|
|
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: {} }, Zx = mt.exports, ie;
|
|
5036
|
+
function Gx() {
|
|
5037
|
+
return ie || (ie = 1, function(y, H) {
|
|
5038
5038
|
(function(E, a, g) {
|
|
5039
5039
|
y.exports = a(j(), e0());
|
|
5040
|
-
})(
|
|
5040
|
+
})(Zx, function(E) {
|
|
5041
5041
|
/** @preserve
|
|
5042
5042
|
* Counter block mode compatible with Dr Brian Gladman fileenc.c
|
|
5043
5043
|
* derived from CryptoJS.mode.CTR
|
|
@@ -5062,8 +5062,8 @@ function jx() {
|
|
|
5062
5062
|
C && (f = this._counter = C.slice(0), this._iv = void 0), B(f);
|
|
5063
5063
|
var l = f.slice(0);
|
|
5064
5064
|
r.encryptBlock(l, 0);
|
|
5065
|
-
for (var
|
|
5066
|
-
o[v +
|
|
5065
|
+
for (var h = 0; h < s; h++)
|
|
5066
|
+
o[v + h] ^= l[h];
|
|
5067
5067
|
}
|
|
5068
5068
|
});
|
|
5069
5069
|
return a.Decryptor = m, a;
|
|
@@ -5071,12 +5071,12 @@ function jx() {
|
|
|
5071
5071
|
});
|
|
5072
5072
|
}(mt)), mt.exports;
|
|
5073
5073
|
}
|
|
5074
|
-
var
|
|
5075
|
-
function
|
|
5076
|
-
return oe || (oe = 1, function(y,
|
|
5074
|
+
var wt = { exports: {} }, Yx = wt.exports, oe;
|
|
5075
|
+
function Qx() {
|
|
5076
|
+
return oe || (oe = 1, function(y, H) {
|
|
5077
5077
|
(function(E, a, g) {
|
|
5078
5078
|
y.exports = a(j(), e0());
|
|
5079
|
-
})(
|
|
5079
|
+
})(Yx, 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) {
|
|
@@ -5089,14 +5089,14 @@ function Gx() {
|
|
|
5089
5089
|
return a.Decryptor = g, a;
|
|
5090
5090
|
}(), E.mode.OFB;
|
|
5091
5091
|
});
|
|
5092
|
-
}(
|
|
5092
|
+
}(wt)), wt.exports;
|
|
5093
5093
|
}
|
|
5094
|
-
var
|
|
5095
|
-
function
|
|
5096
|
-
return se || (se = 1, function(y,
|
|
5094
|
+
var _t = { exports: {} }, Jx = _t.exports, se;
|
|
5095
|
+
function tn() {
|
|
5096
|
+
return se || (se = 1, function(y, H) {
|
|
5097
5097
|
(function(E, a, g) {
|
|
5098
5098
|
y.exports = a(j(), e0());
|
|
5099
|
-
})(
|
|
5099
|
+
})(Jx, function(E) {
|
|
5100
5100
|
return E.mode.ECB = function() {
|
|
5101
5101
|
var a = E.lib.BlockCipherMode.extend();
|
|
5102
5102
|
return a.Encryptor = a.extend({
|
|
@@ -5110,14 +5110,14 @@ function Qx() {
|
|
|
5110
5110
|
}), a;
|
|
5111
5111
|
}(), E.mode.ECB;
|
|
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: {} }, rn = Tt.exports, ae;
|
|
5116
|
+
function en() {
|
|
5117
|
+
return ae || (ae = 1, function(y, H) {
|
|
5118
5118
|
(function(E, a, g) {
|
|
5119
5119
|
y.exports = a(j(), e0());
|
|
5120
|
-
})(
|
|
5120
|
+
})(rn, 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 tn() {
|
|
|
5131
5131
|
});
|
|
5132
5132
|
}(Tt)), Tt.exports;
|
|
5133
5133
|
}
|
|
5134
|
-
var
|
|
5135
|
-
function
|
|
5136
|
-
return fe || (fe = 1, function(y,
|
|
5134
|
+
var kt = { exports: {} }, xn = kt.exports, fe;
|
|
5135
|
+
function nn() {
|
|
5136
|
+
return fe || (fe = 1, function(y, H) {
|
|
5137
5137
|
(function(E, a, g) {
|
|
5138
5138
|
y.exports = a(j(), e0());
|
|
5139
|
-
})(
|
|
5139
|
+
})(xn, 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;
|
|
@@ -5148,14 +5148,14 @@ function en() {
|
|
|
5148
5148
|
}
|
|
5149
5149
|
}, E.pad.Iso10126;
|
|
5150
5150
|
});
|
|
5151
|
-
}(
|
|
5151
|
+
}(kt)), kt.exports;
|
|
5152
5152
|
}
|
|
5153
|
-
var
|
|
5154
|
-
function
|
|
5155
|
-
return ce || (ce = 1, function(y,
|
|
5153
|
+
var St = { exports: {} }, on = St.exports, ce;
|
|
5154
|
+
function sn() {
|
|
5155
|
+
return ce || (ce = 1, function(y, H) {
|
|
5156
5156
|
(function(E, a, g) {
|
|
5157
5157
|
y.exports = a(j(), e0());
|
|
5158
|
-
})(
|
|
5158
|
+
})(on, 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);
|
|
@@ -5165,14 +5165,14 @@ function nn() {
|
|
|
5165
5165
|
}
|
|
5166
5166
|
}, E.pad.Iso97971;
|
|
5167
5167
|
});
|
|
5168
|
-
}(
|
|
5168
|
+
}(St)), St.exports;
|
|
5169
5169
|
}
|
|
5170
|
-
var Rt = { exports: {} },
|
|
5171
|
-
function
|
|
5172
|
-
return
|
|
5170
|
+
var Rt = { exports: {} }, an = Rt.exports, ue;
|
|
5171
|
+
function fn() {
|
|
5172
|
+
return ue || (ue = 1, function(y, H) {
|
|
5173
5173
|
(function(E, a, g) {
|
|
5174
5174
|
y.exports = a(j(), e0());
|
|
5175
|
-
})(
|
|
5175
|
+
})(an, 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 sn() {
|
|
|
5189
5189
|
});
|
|
5190
5190
|
}(Rt)), Rt.exports;
|
|
5191
5191
|
}
|
|
5192
|
-
var qt = { exports: {} },
|
|
5193
|
-
function
|
|
5194
|
-
return
|
|
5192
|
+
var qt = { exports: {} }, cn = qt.exports, he;
|
|
5193
|
+
function un() {
|
|
5194
|
+
return he || (he = 1, function(y, H) {
|
|
5195
5195
|
(function(E, a, g) {
|
|
5196
5196
|
y.exports = a(j(), e0());
|
|
5197
|
-
})(
|
|
5197
|
+
})(cn, function(E) {
|
|
5198
5198
|
return E.pad.NoPadding = {
|
|
5199
5199
|
pad: function() {
|
|
5200
5200
|
},
|
|
@@ -5204,12 +5204,12 @@ function fn() {
|
|
|
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: {} }, hn = Ht.exports, le;
|
|
5208
|
+
function ln() {
|
|
5209
|
+
return le || (le = 1, function(y, H) {
|
|
5210
5210
|
(function(E, a, g) {
|
|
5211
5211
|
y.exports = a(j(), e0());
|
|
5212
|
-
})(
|
|
5212
|
+
})(hn, 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,58 +5251,58 @@ function hn() {
|
|
|
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: {} }, vn = Pt.exports, ve;
|
|
5255
|
+
function dn() {
|
|
5256
|
+
return ve || (ve = 1, function(y, H) {
|
|
5257
5257
|
(function(E, a, g) {
|
|
5258
5258
|
y.exports = a(j(), q0(), H0(), b0(), e0());
|
|
5259
|
-
})(
|
|
5259
|
+
})(vn, function(E) {
|
|
5260
5260
|
return function() {
|
|
5261
|
-
var a = E, g = a.lib, B = g.BlockCipher, m = a.algo, o = [], v = [], r = [], s = [], C = [], f = [], l = [],
|
|
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() {
|
|
5263
|
-
for (var n = [],
|
|
5264
|
-
|
|
5265
|
-
for (var d = 0, A = 0,
|
|
5266
|
-
var
|
|
5267
|
-
|
|
5268
|
-
var T = n[d], q = n[T], D = n[q],
|
|
5269
|
-
r[d] =
|
|
5270
|
-
var
|
|
5271
|
-
l[
|
|
5263
|
+
for (var n = [], u = 0; u < 256; u++)
|
|
5264
|
+
u < 128 ? n[u] = u << 1 : n[u] = u << 1 ^ 283;
|
|
5265
|
+
for (var d = 0, A = 0, u = 0; u < 256; u++) {
|
|
5266
|
+
var _ = A ^ A << 1 ^ A << 2 ^ A << 3 ^ A << 4;
|
|
5267
|
+
_ = _ >>> 8 ^ _ & 255 ^ 99, o[d] = _, v[_] = d;
|
|
5268
|
+
var T = n[d], q = n[T], D = n[q], w = n[_] * 257 ^ _ * 16843008;
|
|
5269
|
+
r[d] = w << 24 | w >>> 8, s[d] = w << 16 | w >>> 16, C[d] = w << 8 | w >>> 24, f[d] = w;
|
|
5270
|
+
var w = D * 16843009 ^ q * 65537 ^ T * 257 ^ d * 16843008;
|
|
5271
|
+
l[_] = w << 24 | w >>> 8, h[_] = w << 16 | w >>> 16, F[_] = w << 8 | w >>> 24, i[_] = w, d ? (d = T ^ n[n[n[D ^ T]]], A ^= n[n[A]]) : d = A = 1;
|
|
5272
5272
|
}
|
|
5273
5273
|
})();
|
|
5274
5274
|
var p = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54], x = m.AES = B.extend({
|
|
5275
5275
|
_doReset: function() {
|
|
5276
5276
|
var n;
|
|
5277
5277
|
if (!(this._nRounds && this._keyPriorReset === this._key)) {
|
|
5278
|
-
for (var
|
|
5278
|
+
for (var u = this._keyPriorReset = this._key, d = u.words, A = u.sigBytes / 4, _ = this._nRounds = A + 6, T = (_ + 1) * 4, q = this._keySchedule = [], D = 0; D < T; D++)
|
|
5279
5279
|
D < A ? q[D] = d[D] : (n = q[D - 1], D % A ? A > 6 && D % A == 4 && (n = o[n >>> 24] << 24 | o[n >>> 16 & 255] << 16 | o[n >>> 8 & 255] << 8 | o[n & 255]) : (n = n << 8 | n >>> 24, n = o[n >>> 24] << 24 | o[n >>> 16 & 255] << 16 | o[n >>> 8 & 255] << 8 | o[n & 255], n ^= p[D / A | 0] << 24), q[D] = q[D - A] ^ n);
|
|
5280
|
-
for (var
|
|
5281
|
-
var D = T -
|
|
5282
|
-
if (
|
|
5280
|
+
for (var w = this._invKeySchedule = [], k = 0; k < T; k++) {
|
|
5281
|
+
var D = T - k;
|
|
5282
|
+
if (k % 4)
|
|
5283
5283
|
var n = q[D];
|
|
5284
5284
|
else
|
|
5285
5285
|
var n = q[D - 4];
|
|
5286
|
-
|
|
5286
|
+
k < 4 || D <= 4 ? w[k] = n : w[k] = l[o[n >>> 24]] ^ h[o[n >>> 16 & 255]] ^ F[o[n >>> 8 & 255]] ^ i[o[n & 255]];
|
|
5287
5287
|
}
|
|
5288
5288
|
}
|
|
5289
5289
|
},
|
|
5290
|
-
encryptBlock: function(n,
|
|
5291
|
-
this._doCryptBlock(n,
|
|
5290
|
+
encryptBlock: function(n, u) {
|
|
5291
|
+
this._doCryptBlock(n, u, this._keySchedule, r, s, C, f, o);
|
|
5292
5292
|
},
|
|
5293
|
-
decryptBlock: function(n,
|
|
5294
|
-
var d = n[
|
|
5295
|
-
n[
|
|
5296
|
-
var d = n[
|
|
5297
|
-
n[
|
|
5293
|
+
decryptBlock: function(n, u) {
|
|
5294
|
+
var d = n[u + 1];
|
|
5295
|
+
n[u + 1] = n[u + 3], n[u + 3] = d, this._doCryptBlock(n, u, this._invKeySchedule, l, h, F, i, v);
|
|
5296
|
+
var d = n[u + 1];
|
|
5297
|
+
n[u + 1] = n[u + 3], n[u + 3] = d;
|
|
5298
5298
|
},
|
|
5299
|
-
_doCryptBlock: function(n,
|
|
5300
|
-
for (var
|
|
5301
|
-
var X = A[
|
|
5302
|
-
|
|
5299
|
+
_doCryptBlock: function(n, u, d, A, _, T, q, D) {
|
|
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[$++], P = A[W >>> 24] ^ _[k >>> 16 & 255] ^ T[S >>> 8 & 255] ^ q[U & 255] ^ d[$++];
|
|
5302
|
+
k = X, S = G, U = Z, W = P;
|
|
5303
5303
|
}
|
|
5304
|
-
var X = (D[
|
|
5305
|
-
n[
|
|
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[$++], P = (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] = P;
|
|
5306
5306
|
},
|
|
5307
5307
|
keySize: 256 / 32
|
|
5308
5308
|
});
|
|
@@ -5311,12 +5311,12 @@ function ln() {
|
|
|
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: {} }, pn = zt.exports, de;
|
|
5315
|
+
function Bn() {
|
|
5316
|
+
return de || (de = 1, function(y, H) {
|
|
5317
5317
|
(function(E, a, g) {
|
|
5318
5318
|
y.exports = a(j(), q0(), H0(), b0(), e0());
|
|
5319
|
-
})(
|
|
5319
|
+
})(pn, 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,
|
|
@@ -5964,20 +5964,20 @@ function dn() {
|
|
|
5964
5964
|
2147483679
|
|
5965
5965
|
], l = o.DES = m.extend({
|
|
5966
5966
|
_doReset: function() {
|
|
5967
|
-
for (var p = this._key, x = p.words, n = [],
|
|
5968
|
-
var d = v[
|
|
5969
|
-
n[
|
|
5967
|
+
for (var p = this._key, x = p.words, n = [], u = 0; u < 56; u++) {
|
|
5968
|
+
var d = v[u] - 1;
|
|
5969
|
+
n[u] = x[d >>> 5] >>> 31 - d % 32 & 1;
|
|
5970
5970
|
}
|
|
5971
|
-
for (var A = this._subKeys = [],
|
|
5972
|
-
for (var T = A[
|
|
5973
|
-
T[
|
|
5971
|
+
for (var A = this._subKeys = [], _ = 0; _ < 16; _++) {
|
|
5972
|
+
for (var T = A[_] = [], q = s[_], u = 0; u < 24; u++)
|
|
5973
|
+
T[u / 6 | 0] |= n[(r[u] - 1 + q) % 28] << 31 - u % 6, T[4 + (u / 6 | 0)] |= n[28 + (r[u + 24] - 1 + q) % 28] << 31 - u % 6;
|
|
5974
5974
|
T[0] = T[0] << 1 | T[0] >>> 31;
|
|
5975
|
-
for (var
|
|
5976
|
-
T[
|
|
5975
|
+
for (var u = 1; u < 7; u++)
|
|
5976
|
+
T[u] = T[u] >>> (u - 1) * 4 + 3;
|
|
5977
5977
|
T[7] = T[7] << 5 | T[7] >>> 27;
|
|
5978
5978
|
}
|
|
5979
|
-
for (var D = this._invSubKeys = [],
|
|
5980
|
-
D[
|
|
5979
|
+
for (var D = this._invSubKeys = [], u = 0; u < 16; u++)
|
|
5980
|
+
D[u] = A[15 - u];
|
|
5981
5981
|
},
|
|
5982
5982
|
encryptBlock: function(p, x) {
|
|
5983
5983
|
this._doCryptBlock(p, x, this._subKeys);
|
|
@@ -5986,20 +5986,20 @@ function dn() {
|
|
|
5986
5986
|
this._doCryptBlock(p, x, this._invSubKeys);
|
|
5987
5987
|
},
|
|
5988
5988
|
_doCryptBlock: function(p, x, n) {
|
|
5989
|
-
this._lBlock = p[x], this._rBlock = p[x + 1],
|
|
5990
|
-
for (var
|
|
5991
|
-
for (var d = n[
|
|
5992
|
-
T |= C[q][((
|
|
5993
|
-
this._lBlock =
|
|
5989
|
+
this._lBlock = p[x], this._rBlock = p[x + 1], h.call(this, 4, 252645135), h.call(this, 16, 65535), F.call(this, 2, 858993459), F.call(this, 8, 16711935), h.call(this, 1, 1431655765);
|
|
5990
|
+
for (var u = 0; u < 16; u++) {
|
|
5991
|
+
for (var d = n[u], A = this._lBlock, _ = this._rBlock, T = 0, q = 0; q < 8; q++)
|
|
5992
|
+
T |= C[q][((_ ^ d[q]) & f[q]) >>> 0];
|
|
5993
|
+
this._lBlock = _, this._rBlock = A ^ T;
|
|
5994
5994
|
}
|
|
5995
5995
|
var D = this._lBlock;
|
|
5996
|
-
this._lBlock = this._rBlock, this._rBlock = D,
|
|
5996
|
+
this._lBlock = this._rBlock, this._rBlock = D, h.call(this, 1, 1431655765), F.call(this, 8, 16711935), F.call(this, 2, 858993459), h.call(this, 16, 65535), h.call(this, 4, 252645135), p[x] = this._lBlock, p[x + 1] = this._rBlock;
|
|
5997
5997
|
},
|
|
5998
5998
|
keySize: 64 / 32,
|
|
5999
5999
|
ivSize: 64 / 32,
|
|
6000
6000
|
blockSize: 64 / 32
|
|
6001
6001
|
});
|
|
6002
|
-
function
|
|
6002
|
+
function h(p, x) {
|
|
6003
6003
|
var n = (this._lBlock >>> p ^ this._rBlock) & x;
|
|
6004
6004
|
this._rBlock ^= n, this._lBlock ^= n << p;
|
|
6005
6005
|
}
|
|
@@ -6013,8 +6013,8 @@ function dn() {
|
|
|
6013
6013
|
var p = this._key, x = p.words;
|
|
6014
6014
|
if (x.length !== 2 && x.length !== 4 && x.length < 6)
|
|
6015
6015
|
throw new Error("Invalid key length - 3DES requires the key length to be 64, 128, 192 or >192.");
|
|
6016
|
-
var n = x.slice(0, 2),
|
|
6017
|
-
this._des1 = l.createEncryptor(B.create(n)), this._des2 = l.createEncryptor(B.create(
|
|
6016
|
+
var n = x.slice(0, 2), u = x.length < 4 ? x.slice(0, 2) : x.slice(2, 4), d = x.length < 6 ? x.slice(0, 2) : x.slice(4, 6);
|
|
6017
|
+
this._des1 = l.createEncryptor(B.create(n)), this._des2 = l.createEncryptor(B.create(u)), this._des3 = l.createEncryptor(B.create(d));
|
|
6018
6018
|
},
|
|
6019
6019
|
encryptBlock: function(p, x) {
|
|
6020
6020
|
this._des1.encryptBlock(p, x), this._des2.decryptBlock(p, x), this._des3.encryptBlock(p, x);
|
|
@@ -6031,22 +6031,22 @@ function dn() {
|
|
|
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: {} }, Fn = It.exports, pe;
|
|
6035
|
+
function Cn() {
|
|
6036
|
+
return pe || (pe = 1, function(y, H) {
|
|
6037
6037
|
(function(E, a, g) {
|
|
6038
6038
|
y.exports = a(j(), q0(), H0(), b0(), e0());
|
|
6039
|
-
})(
|
|
6039
|
+
})(Fn, 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() {
|
|
6043
|
-
for (var s = this._key, C = s.words, f = s.sigBytes, l = this._S = [],
|
|
6044
|
-
l[
|
|
6045
|
-
for (var
|
|
6046
|
-
var i =
|
|
6047
|
-
F = (F + l[
|
|
6048
|
-
var x = l[
|
|
6049
|
-
l[
|
|
6043
|
+
for (var s = this._key, C = s.words, f = s.sigBytes, l = this._S = [], h = 0; h < 256; h++)
|
|
6044
|
+
l[h] = h;
|
|
6045
|
+
for (var h = 0, F = 0; h < 256; h++) {
|
|
6046
|
+
var i = h % f, p = C[i >>> 2] >>> 24 - i % 4 * 8 & 255;
|
|
6047
|
+
F = (F + l[h] + p) % 256;
|
|
6048
|
+
var x = l[h];
|
|
6049
|
+
l[h] = l[F], l[F] = x;
|
|
6050
6050
|
}
|
|
6051
6051
|
this._i = this._j = 0;
|
|
6052
6052
|
},
|
|
@@ -6057,10 +6057,10 @@ function Bn() {
|
|
|
6057
6057
|
ivSize: 0
|
|
6058
6058
|
});
|
|
6059
6059
|
function v() {
|
|
6060
|
-
for (var s = this._S, C = this._i, f = this._j, l = 0,
|
|
6060
|
+
for (var s = this._S, C = this._i, f = this._j, l = 0, h = 0; h < 4; h++) {
|
|
6061
6061
|
C = (C + 1) % 256, f = (f + s[C]) % 256;
|
|
6062
6062
|
var F = s[C];
|
|
6063
|
-
s[C] = s[f], s[f] = F, l |= s[(s[C] + s[f]) % 256] << 24 -
|
|
6063
|
+
s[C] = s[f], s[f] = F, l |= s[(s[C] + s[f]) % 256] << 24 - h * 8;
|
|
6064
6064
|
}
|
|
6065
6065
|
return this._i = C, this._j = f, l;
|
|
6066
6066
|
}
|
|
@@ -6085,17 +6085,17 @@ function Bn() {
|
|
|
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: {} }, An = Lt.exports, Be;
|
|
6089
|
+
function En() {
|
|
6090
|
+
return Be || (Be = 1, function(y, H) {
|
|
6091
6091
|
(function(E, a, g) {
|
|
6092
6092
|
y.exports = a(j(), q0(), H0(), b0(), e0());
|
|
6093
|
-
})(
|
|
6093
|
+
})(An, 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() {
|
|
6097
|
-
for (var f = this._key.words, l = this.cfg.iv,
|
|
6098
|
-
f[
|
|
6097
|
+
for (var f = this._key.words, l = this.cfg.iv, h = 0; h < 4; h++)
|
|
6098
|
+
f[h] = (f[h] << 8 | f[h] >>> 24) & 16711935 | (f[h] << 24 | f[h] >>> 8) & 4278255360;
|
|
6099
6099
|
var F = this._X = [
|
|
6100
6100
|
f[0],
|
|
6101
6101
|
f[3] << 16 | f[2] >>> 16,
|
|
@@ -6116,20 +6116,20 @@ function Cn() {
|
|
|
6116
6116
|
f[3] & 4294901760 | f[0] & 65535
|
|
6117
6117
|
];
|
|
6118
6118
|
this._b = 0;
|
|
6119
|
-
for (var
|
|
6119
|
+
for (var h = 0; h < 4; h++)
|
|
6120
6120
|
C.call(this);
|
|
6121
|
-
for (var
|
|
6122
|
-
i[
|
|
6121
|
+
for (var h = 0; h < 8; h++)
|
|
6122
|
+
i[h] ^= F[h + 4 & 7];
|
|
6123
6123
|
if (l) {
|
|
6124
|
-
var p = l.words, x = p[0], n = p[1],
|
|
6125
|
-
i[0] ^=
|
|
6126
|
-
for (var
|
|
6124
|
+
var p = l.words, x = p[0], n = p[1], u = (x << 8 | x >>> 24) & 16711935 | (x << 24 | x >>> 8) & 4278255360, d = (n << 8 | n >>> 24) & 16711935 | (n << 24 | n >>> 8) & 4278255360, A = u >>> 16 | d & 4294901760, _ = d << 16 | u & 65535;
|
|
6125
|
+
i[0] ^= u, i[1] ^= A, i[2] ^= d, i[3] ^= _, i[4] ^= u, i[5] ^= A, i[6] ^= d, i[7] ^= _;
|
|
6126
|
+
for (var h = 0; h < 4; h++)
|
|
6127
6127
|
C.call(this);
|
|
6128
6128
|
}
|
|
6129
6129
|
},
|
|
6130
6130
|
_doProcessBlock: function(f, l) {
|
|
6131
|
-
var
|
|
6132
|
-
C.call(this), o[0] =
|
|
6131
|
+
var h = this._X;
|
|
6132
|
+
C.call(this), o[0] = h[0] ^ h[5] >>> 16 ^ h[3] << 16, o[1] = h[2] ^ h[7] >>> 16 ^ h[5] << 16, o[2] = h[4] ^ h[1] >>> 16 ^ h[7] << 16, o[3] = h[6] ^ h[3] >>> 16 ^ h[1] << 16;
|
|
6133
6133
|
for (var F = 0; F < 4; F++)
|
|
6134
6134
|
o[F] = (o[F] << 8 | o[F] >>> 24) & 16711935 | (o[F] << 24 | o[F] >>> 8) & 4278255360, f[l + F] ^= o[F];
|
|
6135
6135
|
},
|
|
@@ -6137,12 +6137,12 @@ function Cn() {
|
|
|
6137
6137
|
ivSize: 64 / 32
|
|
6138
6138
|
});
|
|
6139
6139
|
function C() {
|
|
6140
|
-
for (var f = this._X, l = this._C,
|
|
6141
|
-
v[
|
|
6140
|
+
for (var f = this._X, l = this._C, h = 0; h < 8; h++)
|
|
6141
|
+
v[h] = l[h];
|
|
6142
6142
|
l[0] = l[0] + 1295307597 + this._b | 0, l[1] = l[1] + 3545052371 + (l[0] >>> 0 < v[0] >>> 0 ? 1 : 0) | 0, l[2] = l[2] + 886263092 + (l[1] >>> 0 < v[1] >>> 0 ? 1 : 0) | 0, l[3] = l[3] + 1295307597 + (l[2] >>> 0 < v[2] >>> 0 ? 1 : 0) | 0, l[4] = l[4] + 3545052371 + (l[3] >>> 0 < v[3] >>> 0 ? 1 : 0) | 0, l[5] = l[5] + 886263092 + (l[4] >>> 0 < v[4] >>> 0 ? 1 : 0) | 0, l[6] = l[6] + 1295307597 + (l[5] >>> 0 < v[5] >>> 0 ? 1 : 0) | 0, l[7] = l[7] + 3545052371 + (l[6] >>> 0 < v[6] >>> 0 ? 1 : 0) | 0, this._b = l[7] >>> 0 < v[7] >>> 0 ? 1 : 0;
|
|
6143
|
-
for (var
|
|
6144
|
-
var F = f[
|
|
6145
|
-
r[
|
|
6143
|
+
for (var h = 0; h < 8; h++) {
|
|
6144
|
+
var F = f[h] + l[h], i = F & 65535, p = F >>> 16, x = ((i * i >>> 17) + i * p >>> 15) + p * p, n = ((F & 4294901760) * F | 0) + ((F & 65535) * F | 0);
|
|
6145
|
+
r[h] = x ^ n;
|
|
6146
6146
|
}
|
|
6147
6147
|
f[0] = r[0] + (r[7] << 16 | r[7] >>> 16) + (r[6] << 16 | r[6] >>> 16) | 0, f[1] = r[1] + (r[0] << 8 | r[0] >>> 24) + r[7] | 0, f[2] = r[2] + (r[1] << 16 | r[1] >>> 16) + (r[0] << 16 | r[0] >>> 16) | 0, f[3] = r[3] + (r[2] << 8 | r[2] >>> 24) + r[1] | 0, f[4] = r[4] + (r[3] << 16 | r[3] >>> 16) + (r[2] << 16 | r[2] >>> 16) | 0, f[5] = r[5] + (r[4] << 8 | r[4] >>> 24) + r[3] | 0, f[6] = r[6] + (r[5] << 16 | r[5] >>> 16) + (r[4] << 16 | r[4] >>> 16) | 0, f[7] = r[7] + (r[6] << 8 | r[6] >>> 24) + r[5] | 0;
|
|
6148
6148
|
}
|
|
@@ -6151,16 +6151,16 @@ function Cn() {
|
|
|
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: {} }, yn = Ot.exports, Fe;
|
|
6155
|
+
function Dn() {
|
|
6156
|
+
return Fe || (Fe = 1, function(y, H) {
|
|
6157
6157
|
(function(E, a, g) {
|
|
6158
6158
|
y.exports = a(j(), q0(), H0(), b0(), e0());
|
|
6159
|
-
})(
|
|
6159
|
+
})(yn, 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() {
|
|
6163
|
-
var f = this._key.words, l = this.cfg.iv,
|
|
6163
|
+
var f = this._key.words, l = this.cfg.iv, h = this._X = [
|
|
6164
6164
|
f[0],
|
|
6165
6165
|
f[3] << 16 | f[2] >>> 16,
|
|
6166
6166
|
f[1],
|
|
@@ -6183,17 +6183,17 @@ function En() {
|
|
|
6183
6183
|
for (var i = 0; i < 4; i++)
|
|
6184
6184
|
C.call(this);
|
|
6185
6185
|
for (var i = 0; i < 8; i++)
|
|
6186
|
-
F[i] ^=
|
|
6186
|
+
F[i] ^= h[i + 4 & 7];
|
|
6187
6187
|
if (l) {
|
|
6188
|
-
var p = l.words, x = p[0], n = p[1],
|
|
6189
|
-
F[0] ^=
|
|
6188
|
+
var p = l.words, x = p[0], n = p[1], u = (x << 8 | x >>> 24) & 16711935 | (x << 24 | x >>> 8) & 4278255360, d = (n << 8 | n >>> 24) & 16711935 | (n << 24 | n >>> 8) & 4278255360, A = u >>> 16 | d & 4294901760, _ = d << 16 | u & 65535;
|
|
6189
|
+
F[0] ^= u, F[1] ^= A, F[2] ^= d, F[3] ^= _, F[4] ^= u, F[5] ^= A, F[6] ^= d, F[7] ^= _;
|
|
6190
6190
|
for (var i = 0; i < 4; i++)
|
|
6191
6191
|
C.call(this);
|
|
6192
6192
|
}
|
|
6193
6193
|
},
|
|
6194
6194
|
_doProcessBlock: function(f, l) {
|
|
6195
|
-
var
|
|
6196
|
-
C.call(this), o[0] =
|
|
6195
|
+
var h = this._X;
|
|
6196
|
+
C.call(this), o[0] = h[0] ^ h[5] >>> 16 ^ h[3] << 16, o[1] = h[2] ^ h[7] >>> 16 ^ h[5] << 16, o[2] = h[4] ^ h[1] >>> 16 ^ h[7] << 16, o[3] = h[6] ^ h[3] >>> 16 ^ h[1] << 16;
|
|
6197
6197
|
for (var F = 0; F < 4; F++)
|
|
6198
6198
|
o[F] = (o[F] << 8 | o[F] >>> 24) & 16711935 | (o[F] << 24 | o[F] >>> 8) & 4278255360, f[l + F] ^= o[F];
|
|
6199
6199
|
},
|
|
@@ -6201,12 +6201,12 @@ function En() {
|
|
|
6201
6201
|
ivSize: 64 / 32
|
|
6202
6202
|
});
|
|
6203
6203
|
function C() {
|
|
6204
|
-
for (var f = this._X, l = this._C,
|
|
6205
|
-
v[
|
|
6204
|
+
for (var f = this._X, l = this._C, h = 0; h < 8; h++)
|
|
6205
|
+
v[h] = l[h];
|
|
6206
6206
|
l[0] = l[0] + 1295307597 + this._b | 0, l[1] = l[1] + 3545052371 + (l[0] >>> 0 < v[0] >>> 0 ? 1 : 0) | 0, l[2] = l[2] + 886263092 + (l[1] >>> 0 < v[1] >>> 0 ? 1 : 0) | 0, l[3] = l[3] + 1295307597 + (l[2] >>> 0 < v[2] >>> 0 ? 1 : 0) | 0, l[4] = l[4] + 3545052371 + (l[3] >>> 0 < v[3] >>> 0 ? 1 : 0) | 0, l[5] = l[5] + 886263092 + (l[4] >>> 0 < v[4] >>> 0 ? 1 : 0) | 0, l[6] = l[6] + 1295307597 + (l[5] >>> 0 < v[5] >>> 0 ? 1 : 0) | 0, l[7] = l[7] + 3545052371 + (l[6] >>> 0 < v[6] >>> 0 ? 1 : 0) | 0, this._b = l[7] >>> 0 < v[7] >>> 0 ? 1 : 0;
|
|
6207
|
-
for (var
|
|
6208
|
-
var F = f[
|
|
6209
|
-
r[
|
|
6207
|
+
for (var h = 0; h < 8; h++) {
|
|
6208
|
+
var F = f[h] + l[h], i = F & 65535, p = F >>> 16, x = ((i * i >>> 17) + i * p >>> 15) + p * p, n = ((F & 4294901760) * F | 0) + ((F & 65535) * F | 0);
|
|
6209
|
+
r[h] = x ^ n;
|
|
6210
6210
|
}
|
|
6211
6211
|
f[0] = r[0] + (r[7] << 16 | r[7] >>> 16) + (r[6] << 16 | r[6] >>> 16) | 0, f[1] = r[1] + (r[0] << 8 | r[0] >>> 24) + r[7] | 0, f[2] = r[2] + (r[1] << 16 | r[1] >>> 16) + (r[0] << 16 | r[0] >>> 16) | 0, f[3] = r[3] + (r[2] << 8 | r[2] >>> 24) + r[1] | 0, f[4] = r[4] + (r[3] << 16 | r[3] >>> 16) + (r[2] << 16 | r[2] >>> 16) | 0, f[5] = r[5] + (r[4] << 8 | r[4] >>> 24) + r[3] | 0, f[6] = r[6] + (r[5] << 16 | r[5] >>> 16) + (r[4] << 16 | r[4] >>> 16) | 0, f[7] = r[7] + (r[6] << 8 | r[6] >>> 24) + r[5] | 0;
|
|
6212
6212
|
}
|
|
@@ -6215,12 +6215,12 @@ function En() {
|
|
|
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: {} }, gn = Ut.exports, Ce;
|
|
6219
|
+
function bn() {
|
|
6220
|
+
return Ce || (Ce = 1, function(y, H) {
|
|
6221
6221
|
(function(E, a, g) {
|
|
6222
6222
|
y.exports = a(j(), q0(), H0(), b0(), e0());
|
|
6223
|
-
})(
|
|
6223
|
+
})(gn, 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 = [
|
|
@@ -7281,43 +7281,43 @@ function Dn() {
|
|
|
7281
7281
|
sbox: []
|
|
7282
7282
|
};
|
|
7283
7283
|
function C(i, p) {
|
|
7284
|
-
let x = p >> 24 & 255, n = p >> 16 & 255,
|
|
7285
|
-
return A = A ^ i.sbox[2][
|
|
7284
|
+
let x = p >> 24 & 255, n = p >> 16 & 255, u = p >> 8 & 255, d = p & 255, A = i.sbox[0][x] + i.sbox[1][n];
|
|
7285
|
+
return A = A ^ i.sbox[2][u], A = A + i.sbox[3][d], A;
|
|
7286
7286
|
}
|
|
7287
7287
|
function f(i, p, x) {
|
|
7288
|
-
let n = p,
|
|
7288
|
+
let n = p, u = x, d;
|
|
7289
7289
|
for (let A = 0; A < o; ++A)
|
|
7290
|
-
n = n ^ i.pbox[A],
|
|
7291
|
-
return d = n, n =
|
|
7290
|
+
n = n ^ i.pbox[A], u = C(i, n) ^ u, d = n, n = u, u = d;
|
|
7291
|
+
return d = n, n = u, u = d, u = u ^ i.pbox[o], n = n ^ i.pbox[o + 1], { left: n, right: u };
|
|
7292
7292
|
}
|
|
7293
7293
|
function l(i, p, x) {
|
|
7294
|
-
let n = p,
|
|
7294
|
+
let n = p, u = x, d;
|
|
7295
7295
|
for (let A = o + 1; A > 1; --A)
|
|
7296
|
-
n = n ^ i.pbox[A],
|
|
7297
|
-
return d = n, n =
|
|
7296
|
+
n = n ^ i.pbox[A], u = C(i, n) ^ u, d = n, n = u, u = d;
|
|
7297
|
+
return d = n, n = u, u = d, u = u ^ i.pbox[1], n = n ^ i.pbox[0], { left: n, right: u };
|
|
7298
7298
|
}
|
|
7299
|
-
function
|
|
7300
|
-
for (let
|
|
7301
|
-
i.sbox[
|
|
7299
|
+
function h(i, p, x) {
|
|
7300
|
+
for (let _ = 0; _ < 4; _++) {
|
|
7301
|
+
i.sbox[_] = [];
|
|
7302
7302
|
for (let T = 0; T < 256; T++)
|
|
7303
|
-
i.sbox[
|
|
7303
|
+
i.sbox[_][T] = r[_][T];
|
|
7304
7304
|
}
|
|
7305
7305
|
let n = 0;
|
|
7306
|
-
for (let
|
|
7307
|
-
i.pbox[
|
|
7308
|
-
let
|
|
7309
|
-
for (let
|
|
7310
|
-
A = f(i,
|
|
7311
|
-
for (let
|
|
7306
|
+
for (let _ = 0; _ < o + 2; _++)
|
|
7307
|
+
i.pbox[_] = v[_] ^ p[n], n++, n >= x && (n = 0);
|
|
7308
|
+
let u = 0, d = 0, A = 0;
|
|
7309
|
+
for (let _ = 0; _ < o + 2; _ += 2)
|
|
7310
|
+
A = f(i, u, d), u = A.left, d = A.right, i.pbox[_] = u, i.pbox[_ + 1] = d;
|
|
7311
|
+
for (let _ = 0; _ < 4; _++)
|
|
7312
7312
|
for (let T = 0; T < 256; T += 2)
|
|
7313
|
-
A = f(i,
|
|
7313
|
+
A = f(i, u, d), u = A.left, d = A.right, i.sbox[_][T] = u, i.sbox[_][T + 1] = d;
|
|
7314
7314
|
return !0;
|
|
7315
7315
|
}
|
|
7316
7316
|
var F = m.Blowfish = B.extend({
|
|
7317
7317
|
_doReset: function() {
|
|
7318
7318
|
if (this._keyPriorReset !== this._key) {
|
|
7319
7319
|
var i = this._keyPriorReset = this._key, p = i.words, x = i.sigBytes / 4;
|
|
7320
|
-
|
|
7320
|
+
h(s, p, x);
|
|
7321
7321
|
}
|
|
7322
7322
|
},
|
|
7323
7323
|
encryptBlock: function(i, p) {
|
|
@@ -7337,41 +7337,41 @@ function Dn() {
|
|
|
7337
7337
|
});
|
|
7338
7338
|
}(Ut)), Ut.exports;
|
|
7339
7339
|
}
|
|
7340
|
-
var
|
|
7341
|
-
function
|
|
7342
|
-
return Ae || (Ae = 1, function(y,
|
|
7340
|
+
var mn = it.exports, Ae;
|
|
7341
|
+
function wn() {
|
|
7342
|
+
return Ae || (Ae = 1, function(y, H) {
|
|
7343
7343
|
(function(E, a, g) {
|
|
7344
|
-
y.exports = a(j(), Nt(),
|
|
7345
|
-
})(
|
|
7344
|
+
y.exports = a(j(), Nt(), yx(), gx(), q0(), wx(), H0(), ge(), Cr(), Rx(), be(), Px(), Ix(), Ox(), Ar(), Nx(), b0(), e0(), Vx(), jx(), Gx(), Qx(), tn(), en(), nn(), sn(), fn(), un(), ln(), dn(), Bn(), Cn(), En(), Dn(), bn());
|
|
7345
|
+
})(mn, function(E) {
|
|
7346
7346
|
return E;
|
|
7347
7347
|
});
|
|
7348
7348
|
}(it)), it.exports;
|
|
7349
7349
|
}
|
|
7350
|
-
var
|
|
7351
|
-
const B0 = /* @__PURE__ */
|
|
7350
|
+
var _n = wn();
|
|
7351
|
+
const B0 = /* @__PURE__ */ rx(_n), Tn = (y, H, E) => B0.AES.encrypt(H, 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(), Rn = (y, H, E) => B0.AES.decrypt(H, 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), kn = (y) => {
|
|
7360
|
+
const H = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
|
|
7361
7361
|
let E = "";
|
|
7362
7362
|
for (let a = 0; a < y; a++)
|
|
7363
|
-
E +=
|
|
7363
|
+
E += H.charAt(Math.floor(Math.random() * H.length));
|
|
7364
7364
|
return E;
|
|
7365
|
-
},
|
|
7366
|
-
key:
|
|
7367
|
-
iv:
|
|
7368
|
-
mode:
|
|
7369
|
-
}).decrypt(y),
|
|
7365
|
+
}, qn = (y, H) => new Fr.sm4({
|
|
7366
|
+
key: H.key,
|
|
7367
|
+
iv: H.iv,
|
|
7368
|
+
mode: H.mode || "cbc"
|
|
7369
|
+
}).decrypt(y), Hn = (y, H) => new Fr.sm4({ key: H.key, iv: H.iv, mode: H.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 Pn({ uid: y = "", salt: H = "", 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)}${H}`, v = Bx.sm3(o);
|
|
7375
7375
|
return {
|
|
7376
7376
|
...g,
|
|
7377
7377
|
"X-Sign-Timestamp": String(B),
|
|
@@ -7379,19 +7379,19 @@ function Rn({ uid: y = "", salt: z = "", ts: E = 0, data: a = "", ...g }) {
|
|
|
7379
7379
|
"X-Sign-Client": v
|
|
7380
7380
|
};
|
|
7381
7381
|
}
|
|
7382
|
-
function
|
|
7383
|
-
const a =
|
|
7382
|
+
function zn(y, H, E) {
|
|
7383
|
+
const a = kn(16);
|
|
7384
7384
|
let g = {
|
|
7385
7385
|
body: ""
|
|
7386
7386
|
};
|
|
7387
7387
|
return E === "ase" && (g = {
|
|
7388
|
-
body:
|
|
7388
|
+
body: Tn(y, Br(H), 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(H))
|
|
7395
7395
|
}), {
|
|
7396
7396
|
headers: {
|
|
7397
7397
|
iv: a,
|
|
@@ -7400,12 +7400,12 @@ function qn(y, z, E) {
|
|
|
7400
7400
|
data: g
|
|
7401
7401
|
};
|
|
7402
7402
|
}
|
|
7403
|
-
function
|
|
7404
|
-
const
|
|
7403
|
+
function In(y) {
|
|
7404
|
+
const H = ["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 (H.includes(s)) {
|
|
7409
7409
|
const C = r.outerHTML, f = B.createTextNode(C);
|
|
7410
7410
|
r.replaceWith(f);
|
|
7411
7411
|
return;
|
|
@@ -7418,13 +7418,46 @@ function Hn(y) {
|
|
|
7418
7418
|
}
|
|
7419
7419
|
return [...m.childNodes].forEach(o), m.innerHTML;
|
|
7420
7420
|
}
|
|
7421
|
+
const Ee = () => {
|
|
7422
|
+
throw window.stop(), window.location.href = "about:blank", new Error("禁止debugger");
|
|
7423
|
+
}, Sn = () => Array.from({ length: 100 }).reduce((y, H) => (Reflect.set(y, `key${H}`, "value"), y), {}), ye = (y) => {
|
|
7424
|
+
const H = Array.from({ length: 1e3 }).map(() => Sn()), E = performance.now();
|
|
7425
|
+
return y(H), performance.now() - E;
|
|
7426
|
+
}, Ln = () => {
|
|
7427
|
+
document.addEventListener(
|
|
7428
|
+
"keydown",
|
|
7429
|
+
(y) => {
|
|
7430
|
+
if (y.key === "F12" || y.keyCode === 123) {
|
|
7431
|
+
y.preventDefault();
|
|
7432
|
+
return;
|
|
7433
|
+
}
|
|
7434
|
+
if (y.ctrlKey && y.shiftKey && /[ICJ]/i.test(y.key)) {
|
|
7435
|
+
y.preventDefault();
|
|
7436
|
+
return;
|
|
7437
|
+
}
|
|
7438
|
+
y.ctrlKey && y.key.toLowerCase() === "u" && y.preventDefault();
|
|
7439
|
+
},
|
|
7440
|
+
{ passive: !1 }
|
|
7441
|
+
), setInterval(() => {
|
|
7442
|
+
const y = performance.now();
|
|
7443
|
+
debugger;
|
|
7444
|
+
performance.now() - y > 200 && Ee();
|
|
7445
|
+
const E = ye((g) => {
|
|
7446
|
+
console.table(g);
|
|
7447
|
+
}), a = ye((g) => {
|
|
7448
|
+
console.log(g);
|
|
7449
|
+
});
|
|
7450
|
+
E && a && E > a * 10 && Ee();
|
|
7451
|
+
});
|
|
7452
|
+
};
|
|
7421
7453
|
export {
|
|
7422
|
-
|
|
7423
|
-
|
|
7424
|
-
|
|
7425
|
-
|
|
7426
|
-
|
|
7427
|
-
|
|
7428
|
-
|
|
7429
|
-
|
|
7454
|
+
Rn as aesDecryptString,
|
|
7455
|
+
Tn as aesEncryptString,
|
|
7456
|
+
Pn as createHeaders,
|
|
7457
|
+
kn as generateRandomString,
|
|
7458
|
+
In as htmlSanitize,
|
|
7459
|
+
qn as sm4Decrypt,
|
|
7460
|
+
Hn as sm4Encrypt,
|
|
7461
|
+
Ln as startNoDebugger,
|
|
7462
|
+
zn as transmissionDataEncryption
|
|
7430
7463
|
};
|