amos-apptool 1.0.0
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/LICENSE +21 -0
- package/README.md +4 -0
- package/apis/objectPath.md +129 -0
- package/index.d.ts +861 -0
- package/lib/_clone.js +79 -0
- package/lib/_deepCopy.js +30 -0
- package/lib/_deepEqual.js +13 -0
- package/lib/_fastDeepEqual.js +38 -0
- package/lib/_forOwn.js +17 -0
- package/lib/_isnode.js +7 -0
- package/lib/_omit.js +19 -0
- package/lib/_parseJson.js +17 -0
- package/lib/_pick.js +20 -0
- package/lib/_pickBy.js +19 -0
- package/lib/_queue.js +72 -0
- package/lib/_shallowCopy.js +63 -0
- package/lib/_stringify.js +22 -0
- package/lib/_trim.js +15 -0
- package/lib/_typeOfList.js +29 -0
- package/lib/_uuids.js +56 -0
- package/lib/encrypt/_base64.js +39 -0
- package/lib/encrypt/_md5.js +130 -0
- package/lib/encrypt/des.js +539 -0
- package/lib/index.js +251 -0
- package/lib/math/_keyColor.js +158 -0
- package/lib/math/addition.js +25 -0
- package/lib/math/amountCase.js +18 -0
- package/lib/math/coinFormat.js +15 -0
- package/lib/math/colorUtil.js +261 -0
- package/lib/math/dateTime.js +154 -0
- package/lib/math/divide.js +21 -0
- package/lib/math/mul.js +29 -0
- package/lib/math/pwdStrength.js +11 -0
- package/lib/math/randomColor.js +31 -0
- package/lib/math/subtraction.js +25 -0
- package/lib/merged.js +16 -0
- package/lib/objectPath.js +126 -0
- package/lib/parseText.js +15 -0
- package/lib/pwdPolicy.js +38 -0
- package/lib/random.js +33 -0
- package/lib/shallowEqual.js +30 -0
- package/lib/strUtils.js +90 -0
- package/lib/url/encodeUrl.js +14 -0
- package/lib/url/restfulUrl.js +15 -0
- package/lib/utils.js +341 -0
- package/package.json +38 -0
|
@@ -0,0 +1,130 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
|
|
3
|
+
function safeAdd(r, d) {
|
|
4
|
+
var t = (65535 & r) + (65535 & d);
|
|
5
|
+
return (r >> 16) + (d >> 16) + (t >> 16) << 16 | 65535 & t;
|
|
6
|
+
}
|
|
7
|
+
|
|
8
|
+
function bitRotateLeft(r, d) {
|
|
9
|
+
return r << d | r >>> 32 - d;
|
|
10
|
+
}
|
|
11
|
+
|
|
12
|
+
function md5cmn(r, d, t, n, m, f) {
|
|
13
|
+
return safeAdd(bitRotateLeft(safeAdd(safeAdd(d, r), safeAdd(n, f)), m), t);
|
|
14
|
+
}
|
|
15
|
+
|
|
16
|
+
function md5ff(r, d, t, n, m, f, i) {
|
|
17
|
+
return md5cmn(d & t | ~d & n, r, d, m, f, i);
|
|
18
|
+
}
|
|
19
|
+
|
|
20
|
+
function md5gg(r, d, t, n, m, f, i) {
|
|
21
|
+
return md5cmn(d & n | t & ~n, r, d, m, f, i);
|
|
22
|
+
}
|
|
23
|
+
|
|
24
|
+
function md5hh(r, d, t, n, m, f, i) {
|
|
25
|
+
return md5cmn(d ^ t ^ n, r, d, m, f, i);
|
|
26
|
+
}
|
|
27
|
+
|
|
28
|
+
function md5ii(r, d, t, n, m, f, i) {
|
|
29
|
+
return md5cmn(t ^ (d | ~n), r, d, m, f, i);
|
|
30
|
+
}
|
|
31
|
+
|
|
32
|
+
function binlMD5(r, d) {
|
|
33
|
+
var t, n, m, f, i;
|
|
34
|
+
r[d >> 5] |= 128 << d % 32, r[14 + (d + 64 >>> 9 << 4)] = d;
|
|
35
|
+
var e = 1732584193, h = -271733879, g = -1732584194, u = 271733878;
|
|
36
|
+
for (t = 0; t < r.length; t += 16) n = e, m = h, f = g, i = u, e = md5ff(e, h, g, u, r[t], 7, -680876936),
|
|
37
|
+
u = md5ff(u, e, h, g, r[t + 1], 12, -389564586), g = md5ff(g, u, e, h, r[t + 2], 17, 606105819),
|
|
38
|
+
h = md5ff(h, g, u, e, r[t + 3], 22, -1044525330), e = md5ff(e, h, g, u, r[t + 4], 7, -176418897),
|
|
39
|
+
u = md5ff(u, e, h, g, r[t + 5], 12, 1200080426), g = md5ff(g, u, e, h, r[t + 6], 17, -1473231341),
|
|
40
|
+
h = md5ff(h, g, u, e, r[t + 7], 22, -45705983), e = md5ff(e, h, g, u, r[t + 8], 7, 1770035416),
|
|
41
|
+
u = md5ff(u, e, h, g, r[t + 9], 12, -1958414417), g = md5ff(g, u, e, h, r[t + 10], 17, -42063),
|
|
42
|
+
h = md5ff(h, g, u, e, r[t + 11], 22, -1990404162), e = md5ff(e, h, g, u, r[t + 12], 7, 1804603682),
|
|
43
|
+
u = md5ff(u, e, h, g, r[t + 13], 12, -40341101), g = md5ff(g, u, e, h, r[t + 14], 17, -1502002290),
|
|
44
|
+
e = md5gg(e, h = md5ff(h, g, u, e, r[t + 15], 22, 1236535329), g, u, r[t + 1], 5, -165796510),
|
|
45
|
+
u = md5gg(u, e, h, g, r[t + 6], 9, -1069501632), g = md5gg(g, u, e, h, r[t + 11], 14, 643717713),
|
|
46
|
+
h = md5gg(h, g, u, e, r[t], 20, -373897302), e = md5gg(e, h, g, u, r[t + 5], 5, -701558691),
|
|
47
|
+
u = md5gg(u, e, h, g, r[t + 10], 9, 38016083), g = md5gg(g, u, e, h, r[t + 15], 14, -660478335),
|
|
48
|
+
h = md5gg(h, g, u, e, r[t + 4], 20, -405537848), e = md5gg(e, h, g, u, r[t + 9], 5, 568446438),
|
|
49
|
+
u = md5gg(u, e, h, g, r[t + 14], 9, -1019803690), g = md5gg(g, u, e, h, r[t + 3], 14, -187363961),
|
|
50
|
+
h = md5gg(h, g, u, e, r[t + 8], 20, 1163531501), e = md5gg(e, h, g, u, r[t + 13], 5, -1444681467),
|
|
51
|
+
u = md5gg(u, e, h, g, r[t + 2], 9, -51403784), g = md5gg(g, u, e, h, r[t + 7], 14, 1735328473),
|
|
52
|
+
e = md5hh(e, h = md5gg(h, g, u, e, r[t + 12], 20, -1926607734), g, u, r[t + 5], 4, -378558),
|
|
53
|
+
u = md5hh(u, e, h, g, r[t + 8], 11, -2022574463), g = md5hh(g, u, e, h, r[t + 11], 16, 1839030562),
|
|
54
|
+
h = md5hh(h, g, u, e, r[t + 14], 23, -35309556), e = md5hh(e, h, g, u, r[t + 1], 4, -1530992060),
|
|
55
|
+
u = md5hh(u, e, h, g, r[t + 4], 11, 1272893353), g = md5hh(g, u, e, h, r[t + 7], 16, -155497632),
|
|
56
|
+
h = md5hh(h, g, u, e, r[t + 10], 23, -1094730640), e = md5hh(e, h, g, u, r[t + 13], 4, 681279174),
|
|
57
|
+
u = md5hh(u, e, h, g, r[t], 11, -358537222), g = md5hh(g, u, e, h, r[t + 3], 16, -722521979),
|
|
58
|
+
h = md5hh(h, g, u, e, r[t + 6], 23, 76029189), e = md5hh(e, h, g, u, r[t + 9], 4, -640364487),
|
|
59
|
+
u = md5hh(u, e, h, g, r[t + 12], 11, -421815835), g = md5hh(g, u, e, h, r[t + 15], 16, 530742520),
|
|
60
|
+
e = md5ii(e, h = md5hh(h, g, u, e, r[t + 2], 23, -995338651), g, u, r[t], 6, -198630844),
|
|
61
|
+
u = md5ii(u, e, h, g, r[t + 7], 10, 1126891415), g = md5ii(g, u, e, h, r[t + 14], 15, -1416354905),
|
|
62
|
+
h = md5ii(h, g, u, e, r[t + 5], 21, -57434055), e = md5ii(e, h, g, u, r[t + 12], 6, 1700485571),
|
|
63
|
+
u = md5ii(u, e, h, g, r[t + 3], 10, -1894986606), g = md5ii(g, u, e, h, r[t + 10], 15, -1051523),
|
|
64
|
+
h = md5ii(h, g, u, e, r[t + 1], 21, -2054922799), e = md5ii(e, h, g, u, r[t + 8], 6, 1873313359),
|
|
65
|
+
u = md5ii(u, e, h, g, r[t + 15], 10, -30611744), g = md5ii(g, u, e, h, r[t + 6], 15, -1560198380),
|
|
66
|
+
h = md5ii(h, g, u, e, r[t + 13], 21, 1309151649), e = md5ii(e, h, g, u, r[t + 4], 6, -145523070),
|
|
67
|
+
u = md5ii(u, e, h, g, r[t + 11], 10, -1120210379), g = md5ii(g, u, e, h, r[t + 2], 15, 718787259),
|
|
68
|
+
h = md5ii(h, g, u, e, r[t + 9], 21, -343485551), e = safeAdd(e, n), h = safeAdd(h, m),
|
|
69
|
+
g = safeAdd(g, f), u = safeAdd(u, i);
|
|
70
|
+
return [ e, h, g, u ];
|
|
71
|
+
}
|
|
72
|
+
|
|
73
|
+
function binl2rstr(r) {
|
|
74
|
+
var d, t = "", n = 32 * r.length;
|
|
75
|
+
for (d = 0; d < n; d += 8) t += String.fromCharCode(r[d >> 5] >>> d % 32 & 255);
|
|
76
|
+
return t;
|
|
77
|
+
}
|
|
78
|
+
|
|
79
|
+
function rstr2binl(r) {
|
|
80
|
+
var d, t = [];
|
|
81
|
+
for (t[(r.length >> 2) - 1] = void 0, d = 0; d < t.length; d += 1) t[d] = 0;
|
|
82
|
+
var n = 8 * r.length;
|
|
83
|
+
for (d = 0; d < n; d += 8) t[d >> 5] |= (255 & r.charCodeAt(d / 8)) << d % 32;
|
|
84
|
+
return t;
|
|
85
|
+
}
|
|
86
|
+
|
|
87
|
+
function rstrMD5(r) {
|
|
88
|
+
return binl2rstr(binlMD5(rstr2binl(r), 8 * r.length));
|
|
89
|
+
}
|
|
90
|
+
|
|
91
|
+
function rstrHMACMD5(r, d) {
|
|
92
|
+
var t, n, m = rstr2binl(r), f = [], i = [];
|
|
93
|
+
for (f[15] = i[15] = void 0, m.length > 16 && (m = binlMD5(m, 8 * r.length)), t = 0; t < 16; t += 1) f[t] = 909522486 ^ m[t],
|
|
94
|
+
i[t] = 1549556828 ^ m[t];
|
|
95
|
+
return n = binlMD5(f.concat(rstr2binl(d)), 512 + 8 * d.length), binl2rstr(binlMD5(i.concat(n), 640));
|
|
96
|
+
}
|
|
97
|
+
|
|
98
|
+
function rstr2hex(r) {
|
|
99
|
+
var d, t, n = "0123456789abcdef", m = "";
|
|
100
|
+
for (t = 0; t < r.length; t += 1) d = r.charCodeAt(t), m += n.charAt(d >>> 4 & 15) + n.charAt(15 & d);
|
|
101
|
+
return m;
|
|
102
|
+
}
|
|
103
|
+
|
|
104
|
+
function str2rstrUTF8(r) {
|
|
105
|
+
return unescape(encodeURIComponent(r));
|
|
106
|
+
}
|
|
107
|
+
|
|
108
|
+
function rawMD5(r) {
|
|
109
|
+
return rstrMD5(str2rstrUTF8(r));
|
|
110
|
+
}
|
|
111
|
+
|
|
112
|
+
function hexMD5(r) {
|
|
113
|
+
return rstr2hex(rawMD5(r));
|
|
114
|
+
}
|
|
115
|
+
|
|
116
|
+
function rawHMACMD5(r, d) {
|
|
117
|
+
return rstrHMACMD5(str2rstrUTF8(r), str2rstrUTF8(d));
|
|
118
|
+
}
|
|
119
|
+
|
|
120
|
+
function hexHMACMD5(r, d) {
|
|
121
|
+
return rstr2hex(rawHMACMD5(r, d));
|
|
122
|
+
}
|
|
123
|
+
|
|
124
|
+
function md5(r, d, t) {
|
|
125
|
+
return d ? t ? rawHMACMD5(d, r) : hexHMACMD5(d, r) : t ? rawMD5(r) : hexMD5(r);
|
|
126
|
+
}
|
|
127
|
+
|
|
128
|
+
Object.defineProperty(exports, "__esModule", {
|
|
129
|
+
value: !0
|
|
130
|
+
}), exports.default = md5;
|
|
@@ -0,0 +1,539 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
|
|
3
|
+
Object.defineProperty(exports, "__esModule", {
|
|
4
|
+
value: !0
|
|
5
|
+
}), exports.default = void 0;
|
|
6
|
+
|
|
7
|
+
var DesUtils = {}, DesCore = {}, isEmpty = function(e) {
|
|
8
|
+
return null == e || "" == e;
|
|
9
|
+
};
|
|
10
|
+
|
|
11
|
+
function getKeyBytes(e) {
|
|
12
|
+
var r = [], a = e.length, t = parseInt(a / 4), o = a % 4, n = 0;
|
|
13
|
+
for (n = 0; n < t; n++) r[n] = strToBt(e.substring(4 * n + 0, 4 * n + 4));
|
|
14
|
+
return o > 0 && (r[n] = strToBt(e.substring(4 * n + 0, a))), r;
|
|
15
|
+
}
|
|
16
|
+
|
|
17
|
+
function strToBt(e) {
|
|
18
|
+
var r = e.length, a = new Array(64);
|
|
19
|
+
if (r < 4) {
|
|
20
|
+
var t = 0, o = 0, n = 0, s = 0;
|
|
21
|
+
for (t = 0; t < r; t++) {
|
|
22
|
+
var i = e.charCodeAt(t);
|
|
23
|
+
for (o = 0; o < 16; o++) {
|
|
24
|
+
var f = 1, c = 0;
|
|
25
|
+
for (c = 15; c > o; c--) f *= 2;
|
|
26
|
+
a[16 * t + o] = parseInt(i / f) % 2;
|
|
27
|
+
}
|
|
28
|
+
}
|
|
29
|
+
for (n = r; n < 4; n++) {
|
|
30
|
+
for (s = 0; s < 16; s++) {
|
|
31
|
+
var v = 1, u = 0;
|
|
32
|
+
for (u = 15; u > s; u--) v *= 2;
|
|
33
|
+
a[16 * n + s] = parseInt(0 / v) % 2;
|
|
34
|
+
}
|
|
35
|
+
}
|
|
36
|
+
} else {
|
|
37
|
+
var y = 0, b = 0;
|
|
38
|
+
for (y = 0; y < 4; y++) {
|
|
39
|
+
var d = e.charCodeAt(y);
|
|
40
|
+
for (b = 0; b < 16; b++) {
|
|
41
|
+
for (var p = 1, l = 15; l > b; l--) p *= 2;
|
|
42
|
+
a[16 * y + b] = parseInt(d / p) % 2;
|
|
43
|
+
}
|
|
44
|
+
}
|
|
45
|
+
}
|
|
46
|
+
return a;
|
|
47
|
+
}
|
|
48
|
+
|
|
49
|
+
function bt4ToHex(e) {
|
|
50
|
+
return parseInt(e, 2).toString(16).toUpperCase();
|
|
51
|
+
}
|
|
52
|
+
|
|
53
|
+
function enc(e, r) {
|
|
54
|
+
var a = generateKeys(r), t = initPermute(e), o = new Array(32), n = new Array(32), s = new Array(32), i = 0, f = 0, c = 0, v = 0, u = 0;
|
|
55
|
+
for (c = 0; c < 32; c++) o[c] = t[c], n[c] = t[32 + c];
|
|
56
|
+
for (i = 0; i < 16; i++) {
|
|
57
|
+
for (f = 0; f < 32; f++) s[f] = o[f], o[f] = n[f];
|
|
58
|
+
var y = new Array(48);
|
|
59
|
+
for (v = 0; v < 48; v++) y[v] = a[i][v];
|
|
60
|
+
var b = xor(pPermute(sBoxPermute(xor(expandPermute(n), y))), s);
|
|
61
|
+
for (u = 0; u < 32; u++) n[u] = b[u];
|
|
62
|
+
}
|
|
63
|
+
var d = new Array(64);
|
|
64
|
+
for (i = 0; i < 32; i++) d[i] = n[i], d[32 + i] = o[i];
|
|
65
|
+
return finallyPermute(d);
|
|
66
|
+
}
|
|
67
|
+
|
|
68
|
+
function generateKeys(e) {
|
|
69
|
+
var r = new Array(56), a = [];
|
|
70
|
+
a[0] = [], a[1] = [], a[2] = [], a[3] = [], a[4] = [], a[5] = [], a[6] = [], a[7] = [],
|
|
71
|
+
a[8] = [], a[9] = [], a[10] = [], a[11] = [], a[12] = [], a[13] = [], a[14] = [],
|
|
72
|
+
a[15] = [];
|
|
73
|
+
for (var t = [ 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1 ], o = 0; o < 7; o++) for (var n = 0, s = 7; n < 8; n++,
|
|
74
|
+
s--) r[8 * o + n] = e[8 * s + o];
|
|
75
|
+
for (var i = 0; i < 16; i++) {
|
|
76
|
+
for (var f = 0, c = 0, v = 0; v < t[i]; v++) {
|
|
77
|
+
f = r[0], c = r[28];
|
|
78
|
+
for (var u = 0; u < 27; u++) r[u] = r[u + 1], r[28 + u] = r[29 + u];
|
|
79
|
+
r[27] = f, r[55] = c;
|
|
80
|
+
}
|
|
81
|
+
var y = new Array(48);
|
|
82
|
+
switch (y[0] = r[13], y[1] = r[16], y[2] = r[10], y[3] = r[23], y[4] = r[0], y[5] = r[4],
|
|
83
|
+
y[6] = r[2], y[7] = r[27], y[8] = r[14], y[9] = r[5], y[10] = r[20], y[11] = r[9],
|
|
84
|
+
y[12] = r[22], y[13] = r[18], y[14] = r[11], y[15] = r[3], y[16] = r[25], y[17] = r[7],
|
|
85
|
+
y[18] = r[15], y[19] = r[6], y[20] = r[26], y[21] = r[19], y[22] = r[12], y[23] = r[1],
|
|
86
|
+
y[24] = r[40], y[25] = r[51], y[26] = r[30], y[27] = r[36], y[28] = r[46], y[29] = r[54],
|
|
87
|
+
y[30] = r[29], y[31] = r[39], y[32] = r[50], y[33] = r[44], y[34] = r[32], y[35] = r[47],
|
|
88
|
+
y[36] = r[43], y[37] = r[48], y[38] = r[38], y[39] = r[55], y[40] = r[33], y[41] = r[52],
|
|
89
|
+
y[42] = r[45], y[43] = r[41], y[44] = r[49], y[45] = r[35], y[46] = r[28], y[47] = r[31],
|
|
90
|
+
i) {
|
|
91
|
+
case 0:
|
|
92
|
+
for (var b = 0; b < 48; b++) a[0][b] = y[b];
|
|
93
|
+
break;
|
|
94
|
+
|
|
95
|
+
case 1:
|
|
96
|
+
for (var d = 0; d < 48; d++) a[1][d] = y[d];
|
|
97
|
+
break;
|
|
98
|
+
|
|
99
|
+
case 2:
|
|
100
|
+
for (var p = 0; p < 48; p++) a[2][p] = y[p];
|
|
101
|
+
break;
|
|
102
|
+
|
|
103
|
+
case 3:
|
|
104
|
+
for (var l = 0; l < 48; l++) a[3][l] = y[l];
|
|
105
|
+
break;
|
|
106
|
+
|
|
107
|
+
case 4:
|
|
108
|
+
for (var g = 0; g < 48; g++) a[4][g] = y[g];
|
|
109
|
+
break;
|
|
110
|
+
|
|
111
|
+
case 5:
|
|
112
|
+
for (var m = 0; m < 48; m++) a[5][m] = y[m];
|
|
113
|
+
break;
|
|
114
|
+
|
|
115
|
+
case 6:
|
|
116
|
+
for (var k = 0; k < 48; k++) a[6][k] = y[k];
|
|
117
|
+
break;
|
|
118
|
+
|
|
119
|
+
case 7:
|
|
120
|
+
for (var B = 0; B < 48; B++) a[7][B] = y[B];
|
|
121
|
+
break;
|
|
122
|
+
|
|
123
|
+
case 8:
|
|
124
|
+
for (var h = 0; h < 48; h++) a[8][h] = y[h];
|
|
125
|
+
break;
|
|
126
|
+
|
|
127
|
+
case 9:
|
|
128
|
+
for (var x = 0; x < 48; x++) a[9][x] = y[x];
|
|
129
|
+
break;
|
|
130
|
+
|
|
131
|
+
case 10:
|
|
132
|
+
for (var E = 0; E < 48; E++) a[10][E] = y[E];
|
|
133
|
+
break;
|
|
134
|
+
|
|
135
|
+
case 11:
|
|
136
|
+
for (var w = 0; w < 48; w++) a[11][w] = y[w];
|
|
137
|
+
break;
|
|
138
|
+
|
|
139
|
+
case 12:
|
|
140
|
+
for (var A = 0; A < 48; A++) a[12][A] = y[A];
|
|
141
|
+
break;
|
|
142
|
+
|
|
143
|
+
case 13:
|
|
144
|
+
for (var D = 0; D < 48; D++) a[13][D] = y[D];
|
|
145
|
+
break;
|
|
146
|
+
|
|
147
|
+
case 14:
|
|
148
|
+
for (var C = 0; C < 48; C++) a[14][C] = y[C];
|
|
149
|
+
break;
|
|
150
|
+
|
|
151
|
+
case 15:
|
|
152
|
+
for (var T = 0; T < 48; T++) a[15][T] = y[T];
|
|
153
|
+
}
|
|
154
|
+
}
|
|
155
|
+
return a;
|
|
156
|
+
}
|
|
157
|
+
|
|
158
|
+
function initPermute(e) {
|
|
159
|
+
for (var r = new Array(64), a = 0, t = 1, o = 0; a < 4; a++, t += 2, o += 2) for (var n = 7, s = 0; n >= 0; n--,
|
|
160
|
+
s++) r[8 * a + s] = e[8 * n + t], r[8 * a + s + 32] = e[8 * n + o];
|
|
161
|
+
return r;
|
|
162
|
+
}
|
|
163
|
+
|
|
164
|
+
function xor(e, r) {
|
|
165
|
+
for (var a = new Array(e.length), t = 0; t < e.length; t++) a[t] = e[t] ^ r[t];
|
|
166
|
+
return a;
|
|
167
|
+
}
|
|
168
|
+
|
|
169
|
+
function pPermute(e) {
|
|
170
|
+
var r = new Array(32);
|
|
171
|
+
return r[0] = e[15], r[1] = e[6], r[2] = e[19], r[3] = e[20], r[4] = e[28], r[5] = e[11],
|
|
172
|
+
r[6] = e[27], r[7] = e[16], r[8] = e[0], r[9] = e[14], r[10] = e[22], r[11] = e[25],
|
|
173
|
+
r[12] = e[4], r[13] = e[17], r[14] = e[30], r[15] = e[9], r[16] = e[1], r[17] = e[7],
|
|
174
|
+
r[18] = e[23], r[19] = e[13], r[20] = e[31], r[21] = e[26], r[22] = e[2], r[23] = e[8],
|
|
175
|
+
r[24] = e[18], r[25] = e[12], r[26] = e[29], r[27] = e[5], r[28] = e[21], r[29] = e[10],
|
|
176
|
+
r[30] = e[3], r[31] = e[24], r;
|
|
177
|
+
}
|
|
178
|
+
|
|
179
|
+
function sBoxPermute(e) {
|
|
180
|
+
for (var r = new Array(32), a = "", t = [ [ 14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7 ], [ 0, 15, 7, 4, 14, 2, 13, 1, 10, 6, 12, 11, 9, 5, 3, 8 ], [ 4, 1, 14, 8, 13, 6, 2, 11, 15, 12, 9, 7, 3, 10, 5, 0 ], [ 15, 12, 8, 2, 4, 9, 1, 7, 5, 11, 3, 14, 10, 0, 6, 13 ] ], o = [ [ 15, 1, 8, 14, 6, 11, 3, 4, 9, 7, 2, 13, 12, 0, 5, 10 ], [ 3, 13, 4, 7, 15, 2, 8, 14, 12, 0, 1, 10, 6, 9, 11, 5 ], [ 0, 14, 7, 11, 10, 4, 13, 1, 5, 8, 12, 6, 9, 3, 2, 15 ], [ 13, 8, 10, 1, 3, 15, 4, 2, 11, 6, 7, 12, 0, 5, 14, 9 ] ], n = [ [ 10, 0, 9, 14, 6, 3, 15, 5, 1, 13, 12, 7, 11, 4, 2, 8 ], [ 13, 7, 0, 9, 3, 4, 6, 10, 2, 8, 5, 14, 12, 11, 15, 1 ], [ 13, 6, 4, 9, 8, 15, 3, 0, 11, 1, 2, 12, 5, 10, 14, 7 ], [ 1, 10, 13, 0, 6, 9, 8, 7, 4, 15, 14, 3, 11, 5, 2, 12 ] ], s = [ [ 7, 13, 14, 3, 0, 6, 9, 10, 1, 2, 8, 5, 11, 12, 4, 15 ], [ 13, 8, 11, 5, 6, 15, 0, 3, 4, 7, 2, 12, 1, 10, 14, 9 ], [ 10, 6, 9, 0, 12, 11, 7, 13, 15, 1, 3, 14, 5, 2, 8, 4 ], [ 3, 15, 0, 6, 10, 1, 13, 8, 9, 4, 5, 11, 12, 7, 2, 14 ] ], i = [ [ 2, 12, 4, 1, 7, 10, 11, 6, 8, 5, 3, 15, 13, 0, 14, 9 ], [ 14, 11, 2, 12, 4, 7, 13, 1, 5, 0, 15, 10, 3, 9, 8, 6 ], [ 4, 2, 1, 11, 10, 13, 7, 8, 15, 9, 12, 5, 6, 3, 0, 14 ], [ 11, 8, 12, 7, 1, 14, 2, 13, 6, 15, 0, 9, 10, 4, 5, 3 ] ], f = [ [ 12, 1, 10, 15, 9, 2, 6, 8, 0, 13, 3, 4, 14, 7, 5, 11 ], [ 10, 15, 4, 2, 7, 12, 9, 5, 6, 1, 13, 14, 0, 11, 3, 8 ], [ 9, 14, 15, 5, 2, 8, 12, 3, 7, 0, 4, 10, 1, 13, 11, 6 ], [ 4, 3, 2, 12, 9, 5, 15, 10, 11, 14, 1, 7, 6, 0, 8, 13 ] ], c = [ [ 4, 11, 2, 14, 15, 0, 8, 13, 3, 12, 9, 7, 5, 10, 6, 1 ], [ 13, 0, 11, 7, 4, 9, 1, 10, 14, 3, 5, 12, 2, 15, 8, 6 ], [ 1, 4, 11, 13, 12, 3, 7, 14, 10, 15, 6, 8, 0, 5, 9, 2 ], [ 6, 11, 13, 8, 1, 4, 10, 7, 9, 5, 0, 15, 14, 2, 3, 12 ] ], v = [ [ 13, 2, 8, 4, 6, 15, 11, 1, 10, 9, 3, 14, 5, 0, 12, 7 ], [ 1, 15, 13, 8, 10, 3, 7, 4, 12, 5, 6, 11, 0, 14, 9, 2 ], [ 7, 11, 4, 1, 9, 12, 14, 2, 0, 6, 10, 13, 15, 3, 5, 8 ], [ 2, 1, 14, 7, 4, 10, 8, 13, 15, 12, 9, 0, 3, 5, 6, 11 ] ], u = 0; u < 8; u++) {
|
|
181
|
+
var y, b;
|
|
182
|
+
switch (y = 2 * e[6 * u + 0] + e[6 * u + 5], b = 2 * e[6 * u + 1] * 2 * 2 + 2 * e[6 * u + 2] * 2 + 2 * e[6 * u + 3] + e[6 * u + 4],
|
|
183
|
+
u) {
|
|
184
|
+
case 0:
|
|
185
|
+
a = getBoxBinary(t[y][b]);
|
|
186
|
+
break;
|
|
187
|
+
|
|
188
|
+
case 1:
|
|
189
|
+
a = getBoxBinary(o[y][b]);
|
|
190
|
+
break;
|
|
191
|
+
|
|
192
|
+
case 2:
|
|
193
|
+
a = getBoxBinary(n[y][b]);
|
|
194
|
+
break;
|
|
195
|
+
|
|
196
|
+
case 3:
|
|
197
|
+
a = getBoxBinary(s[y][b]);
|
|
198
|
+
break;
|
|
199
|
+
|
|
200
|
+
case 4:
|
|
201
|
+
a = getBoxBinary(i[y][b]);
|
|
202
|
+
break;
|
|
203
|
+
|
|
204
|
+
case 5:
|
|
205
|
+
a = getBoxBinary(f[y][b]);
|
|
206
|
+
break;
|
|
207
|
+
|
|
208
|
+
case 6:
|
|
209
|
+
a = getBoxBinary(c[y][b]);
|
|
210
|
+
break;
|
|
211
|
+
|
|
212
|
+
case 7:
|
|
213
|
+
a = getBoxBinary(v[y][b]);
|
|
214
|
+
}
|
|
215
|
+
r[4 * u + 0] = parseInt(a.substring(0, 1)), r[4 * u + 1] = parseInt(a.substring(1, 2)),
|
|
216
|
+
r[4 * u + 2] = parseInt(a.substring(2, 3)), r[4 * u + 3] = parseInt(a.substring(3, 4));
|
|
217
|
+
}
|
|
218
|
+
return r;
|
|
219
|
+
}
|
|
220
|
+
|
|
221
|
+
function expandPermute(e) {
|
|
222
|
+
for (var r = new Array(48), a = 0; a < 8; a++) r[6 * a + 0] = 0 == a ? e[31] : e[4 * a - 1],
|
|
223
|
+
r[6 * a + 1] = e[4 * a + 0], r[6 * a + 2] = e[4 * a + 1], r[6 * a + 3] = e[4 * a + 2],
|
|
224
|
+
r[6 * a + 4] = e[4 * a + 3], r[6 * a + 5] = 7 == a ? e[0] : e[4 * a + 4];
|
|
225
|
+
return r;
|
|
226
|
+
}
|
|
227
|
+
|
|
228
|
+
function getBoxBinary(e) {
|
|
229
|
+
var r = "";
|
|
230
|
+
switch (e) {
|
|
231
|
+
case 0:
|
|
232
|
+
r = "0000";
|
|
233
|
+
break;
|
|
234
|
+
|
|
235
|
+
case 1:
|
|
236
|
+
r = "0001";
|
|
237
|
+
break;
|
|
238
|
+
|
|
239
|
+
case 2:
|
|
240
|
+
r = "0010";
|
|
241
|
+
break;
|
|
242
|
+
|
|
243
|
+
case 3:
|
|
244
|
+
r = "0011";
|
|
245
|
+
break;
|
|
246
|
+
|
|
247
|
+
case 4:
|
|
248
|
+
r = "0100";
|
|
249
|
+
break;
|
|
250
|
+
|
|
251
|
+
case 5:
|
|
252
|
+
r = "0101";
|
|
253
|
+
break;
|
|
254
|
+
|
|
255
|
+
case 6:
|
|
256
|
+
r = "0110";
|
|
257
|
+
break;
|
|
258
|
+
|
|
259
|
+
case 7:
|
|
260
|
+
r = "0111";
|
|
261
|
+
break;
|
|
262
|
+
|
|
263
|
+
case 8:
|
|
264
|
+
r = "1000";
|
|
265
|
+
break;
|
|
266
|
+
|
|
267
|
+
case 9:
|
|
268
|
+
r = "1001";
|
|
269
|
+
break;
|
|
270
|
+
|
|
271
|
+
case 10:
|
|
272
|
+
r = "1010";
|
|
273
|
+
break;
|
|
274
|
+
|
|
275
|
+
case 11:
|
|
276
|
+
r = "1011";
|
|
277
|
+
break;
|
|
278
|
+
|
|
279
|
+
case 12:
|
|
280
|
+
r = "1100";
|
|
281
|
+
break;
|
|
282
|
+
|
|
283
|
+
case 13:
|
|
284
|
+
r = "1101";
|
|
285
|
+
break;
|
|
286
|
+
|
|
287
|
+
case 14:
|
|
288
|
+
r = "1110";
|
|
289
|
+
break;
|
|
290
|
+
|
|
291
|
+
case 15:
|
|
292
|
+
r = "1111";
|
|
293
|
+
}
|
|
294
|
+
return r;
|
|
295
|
+
}
|
|
296
|
+
|
|
297
|
+
function finallyPermute(e) {
|
|
298
|
+
var r = new Array(64);
|
|
299
|
+
return r[0] = e[39], r[1] = e[7], r[2] = e[47], r[3] = e[15], r[4] = e[55], r[5] = e[23],
|
|
300
|
+
r[6] = e[63], r[7] = e[31], r[8] = e[38], r[9] = e[6], r[10] = e[46], r[11] = e[14],
|
|
301
|
+
r[12] = e[54], r[13] = e[22], r[14] = e[62], r[15] = e[30], r[16] = e[37], r[17] = e[5],
|
|
302
|
+
r[18] = e[45], r[19] = e[13], r[20] = e[53], r[21] = e[21], r[22] = e[61], r[23] = e[29],
|
|
303
|
+
r[24] = e[36], r[25] = e[4], r[26] = e[44], r[27] = e[12], r[28] = e[52], r[29] = e[20],
|
|
304
|
+
r[30] = e[60], r[31] = e[28], r[32] = e[35], r[33] = e[3], r[34] = e[43], r[35] = e[11],
|
|
305
|
+
r[36] = e[51], r[37] = e[19], r[38] = e[59], r[39] = e[27], r[40] = e[34], r[41] = e[2],
|
|
306
|
+
r[42] = e[42], r[43] = e[10], r[44] = e[50], r[45] = e[18], r[46] = e[58], r[47] = e[26],
|
|
307
|
+
r[48] = e[33], r[49] = e[1], r[50] = e[41], r[51] = e[9], r[52] = e[49], r[53] = e[17],
|
|
308
|
+
r[54] = e[57], r[55] = e[25], r[56] = e[32], r[57] = e[0], r[58] = e[40], r[59] = e[8],
|
|
309
|
+
r[60] = e[48], r[61] = e[16], r[62] = e[56], r[63] = e[24], r;
|
|
310
|
+
}
|
|
311
|
+
|
|
312
|
+
function bt64ToHex(e) {
|
|
313
|
+
var r = "";
|
|
314
|
+
if (e) for (var a = 0; a < 16; a++) {
|
|
315
|
+
for (var t = "", o = 0; o < 4; o++) t += e[4 * a + o];
|
|
316
|
+
r += bt4ToHex(t);
|
|
317
|
+
}
|
|
318
|
+
return r;
|
|
319
|
+
}
|
|
320
|
+
|
|
321
|
+
function hexToBt64(e) {
|
|
322
|
+
for (var r = "", a = 0; a < 16; a++) r += hexToBt4(e.substring(a, a + 1));
|
|
323
|
+
return r;
|
|
324
|
+
}
|
|
325
|
+
|
|
326
|
+
function hexToBt4(e) {
|
|
327
|
+
var r;
|
|
328
|
+
switch (e) {
|
|
329
|
+
case "0":
|
|
330
|
+
r = "0000";
|
|
331
|
+
break;
|
|
332
|
+
|
|
333
|
+
case "1":
|
|
334
|
+
r = "0001";
|
|
335
|
+
break;
|
|
336
|
+
|
|
337
|
+
case "2":
|
|
338
|
+
r = "0010";
|
|
339
|
+
break;
|
|
340
|
+
|
|
341
|
+
case "3":
|
|
342
|
+
r = "0011";
|
|
343
|
+
break;
|
|
344
|
+
|
|
345
|
+
case "4":
|
|
346
|
+
r = "0100";
|
|
347
|
+
break;
|
|
348
|
+
|
|
349
|
+
case "5":
|
|
350
|
+
r = "0101";
|
|
351
|
+
break;
|
|
352
|
+
|
|
353
|
+
case "6":
|
|
354
|
+
r = "0110";
|
|
355
|
+
break;
|
|
356
|
+
|
|
357
|
+
case "7":
|
|
358
|
+
r = "0111";
|
|
359
|
+
break;
|
|
360
|
+
|
|
361
|
+
case "8":
|
|
362
|
+
r = "1000";
|
|
363
|
+
break;
|
|
364
|
+
|
|
365
|
+
case "9":
|
|
366
|
+
r = "1001";
|
|
367
|
+
break;
|
|
368
|
+
|
|
369
|
+
case "A":
|
|
370
|
+
r = "1010";
|
|
371
|
+
break;
|
|
372
|
+
|
|
373
|
+
case "B":
|
|
374
|
+
r = "1011";
|
|
375
|
+
break;
|
|
376
|
+
|
|
377
|
+
case "C":
|
|
378
|
+
r = "1100";
|
|
379
|
+
break;
|
|
380
|
+
|
|
381
|
+
case "D":
|
|
382
|
+
r = "1101";
|
|
383
|
+
break;
|
|
384
|
+
|
|
385
|
+
case "E":
|
|
386
|
+
r = "1110";
|
|
387
|
+
break;
|
|
388
|
+
|
|
389
|
+
case "F":
|
|
390
|
+
r = "1111";
|
|
391
|
+
}
|
|
392
|
+
return r;
|
|
393
|
+
}
|
|
394
|
+
|
|
395
|
+
function dec(e, r) {
|
|
396
|
+
var a = generateKeys(r), t = initPermute(e), o = new Array(32), n = new Array(32), s = new Array(32), i = 0, f = 0, c = 0, v = 0, u = 0;
|
|
397
|
+
for (c = 0; c < 32; c++) o[c] = t[c], n[c] = t[32 + c];
|
|
398
|
+
for (i = 15; i >= 0; i--) {
|
|
399
|
+
for (f = 0; f < 32; f++) s[f] = o[f], o[f] = n[f];
|
|
400
|
+
var y = new Array(48);
|
|
401
|
+
for (v = 0; v < 48; v++) y[v] = a[i][v];
|
|
402
|
+
var b = xor(pPermute(sBoxPermute(xor(expandPermute(n), y))), s);
|
|
403
|
+
for (u = 0; u < 32; u++) n[u] = b[u];
|
|
404
|
+
}
|
|
405
|
+
var d = new Array(64);
|
|
406
|
+
for (i = 0; i < 32; i++) d[i] = n[i], d[32 + i] = o[i];
|
|
407
|
+
return finallyPermute(d);
|
|
408
|
+
}
|
|
409
|
+
|
|
410
|
+
function byteToString(e) {
|
|
411
|
+
for (var r = "", a = 0; a < 4; a++) {
|
|
412
|
+
for (var t = 0, o = 0; o < 16; o++) {
|
|
413
|
+
for (var n = 1, s = 15; s > o; s--) n *= 2;
|
|
414
|
+
t += e[16 * a + o] * n;
|
|
415
|
+
}
|
|
416
|
+
0 != t && (r += String.fromCharCode(t));
|
|
417
|
+
}
|
|
418
|
+
return r;
|
|
419
|
+
}
|
|
420
|
+
|
|
421
|
+
DesCore.encode = function(e, r, a, t) {
|
|
422
|
+
if (!e || 0 == e.trim().length) return e;
|
|
423
|
+
var o, n, s, i, f, c, v = e.length, u = "";
|
|
424
|
+
if (isEmpty(r) || (i = (o = getKeyBytes(r)).length), isEmpty(a) || (f = (n = getKeyBytes(a)).length),
|
|
425
|
+
isEmpty(t) || (c = (s = getKeyBytes(t)).length), v > 0) if (v < 4) {
|
|
426
|
+
var y, b = strToBt(e);
|
|
427
|
+
if (isEmpty(r) || isEmpty(a) || isEmpty(t)) if (isEmpty(r) || isEmpty(a)) {
|
|
428
|
+
if (!isEmpty(r)) {
|
|
429
|
+
var d, p = 0;
|
|
430
|
+
for (d = b, p = 0; p < i; p++) d = enc(d, o[p]);
|
|
431
|
+
y = d;
|
|
432
|
+
}
|
|
433
|
+
} else {
|
|
434
|
+
var l, g, m;
|
|
435
|
+
for (l = b, g = 0; g < i; g++) l = enc(l, o[g]);
|
|
436
|
+
for (m = 0; m < f; m++) l = enc(l, n[m]);
|
|
437
|
+
y = l;
|
|
438
|
+
} else {
|
|
439
|
+
var k, B, h, x;
|
|
440
|
+
for (k = b, B = 0; B < i; B++) k = enc(k, o[B]);
|
|
441
|
+
for (h = 0; h < f; h++) k = enc(k, n[h]);
|
|
442
|
+
for (x = 0; x < c; x++) k = enc(k, s[x]);
|
|
443
|
+
y = k;
|
|
444
|
+
}
|
|
445
|
+
u = bt64ToHex(y);
|
|
446
|
+
} else {
|
|
447
|
+
var E = parseInt(v / 4), w = v % 4, A = 0;
|
|
448
|
+
for (A = 0; A < E; A++) {
|
|
449
|
+
var D = strToBt(e.substring(4 * A + 0, 4 * A + 4)), C = void 0;
|
|
450
|
+
if (isEmpty(r) || isEmpty(a) || isEmpty(t)) if (isEmpty(r) || isEmpty(a)) {
|
|
451
|
+
if (!isEmpty(r)) {
|
|
452
|
+
var T = void 0, P = void 0;
|
|
453
|
+
for (T = D, P = 0; P < i; P++) T = enc(T, o[P]);
|
|
454
|
+
C = T;
|
|
455
|
+
}
|
|
456
|
+
} else {
|
|
457
|
+
var I = void 0, K = void 0, U = void 0;
|
|
458
|
+
for (I = D, K = 0; K < i; K++) I = enc(I, o[K]);
|
|
459
|
+
for (U = 0; U < f; U++) I = enc(I, n[U]);
|
|
460
|
+
C = I;
|
|
461
|
+
} else {
|
|
462
|
+
var H = void 0, S = void 0, O = void 0, _ = void 0;
|
|
463
|
+
for (H = D, S = 0; S < i; S++) H = enc(H, o[S]);
|
|
464
|
+
for (O = 0; O < f; O++) H = enc(H, n[O]);
|
|
465
|
+
for (_ = 0; _ < c; _++) H = enc(H, s[_]);
|
|
466
|
+
C = H;
|
|
467
|
+
}
|
|
468
|
+
u += bt64ToHex(C);
|
|
469
|
+
}
|
|
470
|
+
if (w > 0) {
|
|
471
|
+
var q, j = strToBt(e.substring(4 * E + 0, v));
|
|
472
|
+
if (isEmpty(r) || isEmpty(a) || isEmpty(t)) if (isEmpty(r) || isEmpty(a)) {
|
|
473
|
+
if (!isEmpty(r)) {
|
|
474
|
+
var F, M;
|
|
475
|
+
for (F = j, M = 0; M < i; M++) F = enc(F, o[M]);
|
|
476
|
+
q = F;
|
|
477
|
+
}
|
|
478
|
+
} else {
|
|
479
|
+
var z, G, J;
|
|
480
|
+
for (z = j, G = 0; G < i; G++) z = enc(z, o[G]);
|
|
481
|
+
for (J = 0; J < f; J++) z = enc(z, n[J]);
|
|
482
|
+
q = z;
|
|
483
|
+
} else {
|
|
484
|
+
var L, N, Q, R;
|
|
485
|
+
for (L = j, N = 0; N < i; N++) L = enc(L, o[N]);
|
|
486
|
+
for (Q = 0; Q < f; Q++) L = enc(L, n[Q]);
|
|
487
|
+
for (R = 0; R < c; R++) L = enc(L, s[R]);
|
|
488
|
+
q = L;
|
|
489
|
+
}
|
|
490
|
+
u += bt64ToHex(q);
|
|
491
|
+
}
|
|
492
|
+
}
|
|
493
|
+
return u;
|
|
494
|
+
}, DesCore.decode = function(e, r, a, t) {
|
|
495
|
+
if (!e || 0 == e.trim().length) return e;
|
|
496
|
+
var o, n, s, i, f, c, v = e.length, u = "";
|
|
497
|
+
isEmpty(r) || (i = (o = getKeyBytes(r)).length), null != a && "" != a && (f = (n = getKeyBytes(a)).length),
|
|
498
|
+
null != t && "" != t && (c = (s = getKeyBytes(t)).length);
|
|
499
|
+
var y = parseInt(v / 16), b = 0;
|
|
500
|
+
for (b = 0; b < y; b++) {
|
|
501
|
+
var d = hexToBt64(e.substring(16 * b + 0, 16 * b + 16)), p = new Array(64), l = 0;
|
|
502
|
+
for (l = 0; l < 64; l++) p[l] = parseInt(d.substring(l, l + 1));
|
|
503
|
+
var g = void 0;
|
|
504
|
+
if (isEmpty(r) || isEmpty(a) || isEmpty(t)) if (isEmpty(r) || isEmpty(a)) {
|
|
505
|
+
if (!isEmpty(r)) {
|
|
506
|
+
var m = void 0, k = void 0;
|
|
507
|
+
for (m = p, k = i - 1; k >= 0; k--) m = dec(m, o[k]);
|
|
508
|
+
g = m;
|
|
509
|
+
}
|
|
510
|
+
} else {
|
|
511
|
+
var B = void 0, h = void 0, x = void 0;
|
|
512
|
+
for (B = p, h = f - 1; h >= 0; h--) B = dec(B, n[h]);
|
|
513
|
+
for (x = i - 1; x >= 0; x--) B = dec(B, o[x]);
|
|
514
|
+
g = B;
|
|
515
|
+
} else {
|
|
516
|
+
var E = void 0, w = void 0, A = void 0, D = void 0;
|
|
517
|
+
for (E = p, w = c - 1; w >= 0; w--) E = dec(E, s[w]);
|
|
518
|
+
for (A = f - 1; A >= 0; A--) E = dec(E, n[A]);
|
|
519
|
+
for (D = i - 1; D >= 0; D--) E = dec(E, o[D]);
|
|
520
|
+
g = E;
|
|
521
|
+
}
|
|
522
|
+
u += byteToString(g);
|
|
523
|
+
}
|
|
524
|
+
return u;
|
|
525
|
+
}, DesUtils.encode = function(e, r) {
|
|
526
|
+
if (isEmpty(r)) throw new Error("[DesUtils.encode] method parameter `secretKey` required.");
|
|
527
|
+
if ("," === r) return DesCore.encode(e, r);
|
|
528
|
+
if (!(r.indexOf(",") > -1)) return DesCore.encode(e, r);
|
|
529
|
+
var a = r.split(",");
|
|
530
|
+
return a.length > 2 ? DesCore.encode(e, a[0], a[1], a[2]) : 1 === a.length ? DesCore.encode(e, a[0]) : 2 === a.length ? DesCore.encode(e, a[0], a[1]) : e;
|
|
531
|
+
}, DesUtils.decode = function(e, r) {
|
|
532
|
+
if (isEmpty(r)) throw new Error("[DesUtils.encode] method parameter `secretKey` required.");
|
|
533
|
+
if ("," === r) return DesCore.decode(e, r);
|
|
534
|
+
if (!(r.indexOf(",") > -1)) return DesCore.decode(e, r);
|
|
535
|
+
var a = r.split(",");
|
|
536
|
+
return a.length > 2 ? DesCore.decode(e, a[0], a[1], a[2]) : 1 === a.length ? DesCore.decode(e, a[0]) : 2 === a.length ? DesCore.decode(e, a[0], a[1]) : e;
|
|
537
|
+
}, DesUtils.DesCore = DesCore;
|
|
538
|
+
|
|
539
|
+
var _default = exports.default = DesUtils;
|