amos-tool 1.4.6 → 1.4.9
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/.prettierignore +2 -2
- package/.prettierrc +50 -50
- package/README.md +5 -0
- package/apis/objectPath.md +129 -129
- package/index.d.ts +23 -4
- package/index.js +3 -3
- package/lib/_browser.js +10 -8
- package/lib/_clone.js +67 -62
- package/lib/_cookie.js +35 -32
- package/lib/_deepCopy.js +17 -29
- package/lib/_deepEqual.js +6 -13
- package/lib/_fastDeepEqual.js +28 -44
- package/lib/_flashSupport.js +13 -10
- package/lib/_forOwn.js +8 -7
- package/lib/_funcThrottle.js +16 -15
- package/lib/_isnode.js +2 -1
- package/lib/_list.js +55 -67
- package/lib/_object.assign.js +14 -24
- package/lib/_object.entries.js +6 -5
- package/lib/_object.values.js +5 -4
- package/lib/_omit.js +12 -12
- package/lib/_parseJson.js +7 -6
- package/lib/_pick.js +8 -7
- package/lib/_queue.js +24 -21
- package/lib/_shallowCopy.js +24 -23
- package/lib/_stringify.js +14 -17
- package/lib/_supportWs.js +5 -5
- package/lib/_trim.js +5 -4
- package/lib/_typeOfList.js +22 -21
- package/lib/_uuids.js +30 -35
- package/lib/amostool.js +14 -64
- package/lib/array2tree.js +9 -10
- package/lib/arrayFilter.js +17 -20
- package/lib/arrayUtils.js +13 -11
- package/lib/browser/Cookie.js +34 -35
- package/lib/browser/indexDB.js +71 -82
- package/lib/browserSupport.js +76 -71
- package/lib/completeUnit.js +7 -4
- package/lib/consts.js +2 -1
- package/lib/dom/canvas2img.js +61 -73
- package/lib/dom/canvasTools.js +9 -14
- package/lib/dom/downloadFile.js +15 -12
- package/lib/dom/eventHelper.js +8 -6
- package/lib/dom/fileBlob.js +14 -14
- package/lib/dom/fileSaveAs.js +54 -61
- package/lib/dom/getFontSize.js +7 -10
- package/lib/dom/minfyImg.js +30 -25
- package/lib/encrypt/_base64.js +32 -25
- package/lib/encrypt/_md5.js +68 -31
- package/lib/encrypt/des.js +426 -363
- package/lib/extra/_common.js +119 -166
- package/lib/extra/filterNull.js +3 -2
- package/lib/extra/find.js +10 -11
- package/lib/extra/index.js +4 -3
- package/lib/extra/memo.js +18 -0
- package/lib/extra/pathToTree.js +48 -42
- package/lib/extra/pwdStrength.js +4 -2
- package/lib/extra/sortBy.js +28 -30
- package/lib/flat.js +15 -0
- package/lib/locationParams.js +94 -99
- package/lib/log.js +22 -25
- package/lib/math/_keyColor.js +3 -1
- package/lib/math/addition.js +9 -7
- package/lib/math/amountCase.js +8 -12
- package/lib/math/coinFormat.js +7 -5
- package/lib/math/colorUtil.js +78 -86
- package/lib/math/dateTime.js +76 -94
- package/lib/math/operations.js +33 -37
- package/lib/math/pwdStrength.js +4 -2
- package/lib/math/randomColor.js +17 -5
- package/lib/math/subtraction.js +10 -9
- package/lib/merged.js +9 -9
- package/lib/objectPath.js +88 -95
- package/lib/parseText.js +8 -7
- package/lib/png/Identicon.js +36 -38
- package/lib/png/pnglib.js +58 -32
- package/lib/png/randomPic.js +9 -12
- package/lib/positionFactory.js +25 -80
- package/lib/pwdPolicy.js +27 -31
- package/lib/qs/_assign.js +7 -5
- package/lib/qs/_merge.js +19 -28
- package/lib/qs/_tools.js +3 -2
- package/lib/qs/formats.js +6 -5
- package/lib/qs/index.js +4 -4
- package/lib/qs/parse.js +55 -50
- package/lib/qs/stringify.js +55 -77
- package/lib/qs/utils.js +69 -88
- package/lib/random.js +5 -4
- package/lib/shallowEqual.js +24 -34
- package/lib/store.js +93 -98
- package/lib/strUtils.js +51 -42
- package/lib/tableFilter.js +178 -169
- package/lib/throttleDebounce.js +18 -22
- package/lib/url/encodeUrl.js +5 -4
- package/lib/url/restfulUrl.js +8 -7
- package/lib/utils.js +168 -223
- package/lib/xss/htmlEncode.js +3 -2
- package/lib/xss/implementEncode.js +36 -37
- package/lib/xss/index.js +4 -3
- package/package.json +9 -8
package/lib/encrypt/des.js
CHANGED
|
@@ -1,471 +1,534 @@
|
|
|
1
1
|
"use strict";
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
};
|
|
2
|
+
|
|
3
|
+
var DesUtils = {}, DesCore = {}, isEmpty = function(r) {
|
|
4
|
+
return null == r || "" == r;
|
|
5
|
+
};
|
|
7
6
|
|
|
8
7
|
function getKeyBytes(r) {
|
|
9
|
-
|
|
10
|
-
|
|
8
|
+
var e = new Array, a = r.length, t = parseInt(a / 4), n = a % 4, o = 0;
|
|
9
|
+
for (o = 0; o < t; o++) e[o] = strToBt(r.substring(4 * o + 0, 4 * o + 4));
|
|
10
|
+
return n > 0 && (e[o] = strToBt(r.substring(4 * o + 0, a))), e;
|
|
11
11
|
}
|
|
12
12
|
|
|
13
13
|
function strToBt(r) {
|
|
14
|
-
var e = r.length,
|
|
15
|
-
a = new Array(64);
|
|
14
|
+
var e = r.length, a = new Array(64);
|
|
16
15
|
if (e < 4) {
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
16
|
+
var t = 0, n = 0, o = 0, s = 0;
|
|
17
|
+
for (t = 0; t < e; t++) {
|
|
18
|
+
var i = r.charCodeAt(t);
|
|
19
|
+
for (n = 0; n < 16; n++) {
|
|
20
|
+
var f = 1, c = 0;
|
|
21
|
+
for (c = 15; c > n; c--) f *= 2;
|
|
22
|
+
a[16 * t + n] = parseInt(i / f) % 2;
|
|
21
23
|
}
|
|
22
|
-
|
|
24
|
+
}
|
|
25
|
+
for (o = e; o < 4; o++) {
|
|
23
26
|
for (s = 0; s < 16; s++) {
|
|
24
|
-
|
|
25
|
-
|
|
27
|
+
var y = 1, v = 0;
|
|
28
|
+
for (v = 15; v > s; v--) y *= 2;
|
|
29
|
+
a[16 * o + s] = parseInt(0 / y) % 2;
|
|
26
30
|
}
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
31
|
+
}
|
|
32
|
+
} else {
|
|
33
|
+
var u = 0, b = 0;
|
|
34
|
+
for (u = 0; u < 4; u++) {
|
|
35
|
+
var d = r.charCodeAt(u);
|
|
36
|
+
for (b = 0; b < 16; b++) {
|
|
37
|
+
for (var p = 1, g = 15; g > b; g--) p *= 2;
|
|
38
|
+
a[16 * u + b] = parseInt(d / p) % 2;
|
|
32
39
|
}
|
|
33
|
-
|
|
40
|
+
}
|
|
41
|
+
}
|
|
42
|
+
return a;
|
|
34
43
|
}
|
|
35
44
|
|
|
36
45
|
function bt4ToHex(r) {
|
|
37
|
-
return parseInt(r, 2).toString(16).toUpperCase()
|
|
46
|
+
return parseInt(r, 2).toString(16).toUpperCase();
|
|
38
47
|
}
|
|
39
48
|
|
|
40
49
|
function enc(r, e) {
|
|
41
|
-
|
|
50
|
+
var a = generateKeys(e), t = initPermute(r), n = new Array(32), o = new Array(32), s = new Array(32), i = 0, f = 0, c = 0, y = 0, v = 0;
|
|
51
|
+
for (c = 0; c < 32; c++) n[c] = t[c], o[c] = t[32 + c];
|
|
42
52
|
for (i = 0; i < 16; i++) {
|
|
43
53
|
for (f = 0; f < 32; f++) s[f] = n[f], n[f] = o[f];
|
|
44
|
-
|
|
45
|
-
for (
|
|
54
|
+
var u = new Array(48);
|
|
55
|
+
for (y = 0; y < 48; y++) u[y] = a[i][y];
|
|
56
|
+
var b = xor(pPermute(sBoxPermute(xor(expandPermute(o), u))), s);
|
|
57
|
+
for (v = 0; v < 32; v++) o[v] = b[v];
|
|
46
58
|
}
|
|
47
|
-
|
|
48
|
-
|
|
59
|
+
var d = new Array(64);
|
|
60
|
+
for (i = 0; i < 32; i++) d[i] = o[i], d[32 + i] = n[i];
|
|
61
|
+
return finallyPermute(d);
|
|
49
62
|
}
|
|
50
63
|
|
|
51
64
|
function generateKeys(r) {
|
|
52
|
-
var e = new Array(56),
|
|
53
|
-
|
|
54
|
-
a[
|
|
55
|
-
|
|
56
|
-
|
|
65
|
+
var e = new Array(56), a = new Array;
|
|
66
|
+
a[0] = new Array, a[1] = new Array, a[2] = new Array, a[3] = new Array, a[4] = new Array,
|
|
67
|
+
a[5] = new Array, a[6] = new Array, a[7] = new Array, a[8] = new Array, a[9] = new Array,
|
|
68
|
+
a[10] = new Array, a[11] = new Array, a[12] = new Array, a[13] = new Array, a[14] = new Array,
|
|
69
|
+
a[15] = new Array;
|
|
70
|
+
for (var t = [ 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1 ], n = 0; n < 7; n++) for (var o = 0, s = 7; o < 8; o++,
|
|
71
|
+
s--) e[8 * n + o] = r[8 * s + n];
|
|
57
72
|
for (var i = 0; i < 16; i++) {
|
|
58
|
-
for (var f, c, y = 0; y < t[i]; y++) {
|
|
73
|
+
for (var f = 0, c = 0, y = 0; y < t[i]; y++) {
|
|
59
74
|
f = e[0], c = e[28];
|
|
60
75
|
for (var v = 0; v < 27; v++) e[v] = e[v + 1], e[28 + v] = e[29 + v];
|
|
61
|
-
e[27] = f, e[55] = c
|
|
76
|
+
e[27] = f, e[55] = c;
|
|
62
77
|
}
|
|
63
78
|
var u = new Array(48);
|
|
64
|
-
switch (u[0] = e[13], u[1] = e[16], u[2] = e[10], u[3] = e[23], u[4] = e[0], u[5] = e[4],
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
77
|
-
|
|
78
|
-
|
|
79
|
-
|
|
80
|
-
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
|
|
87
|
-
|
|
88
|
-
|
|
89
|
-
|
|
90
|
-
|
|
91
|
-
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
95
|
-
|
|
96
|
-
|
|
97
|
-
|
|
98
|
-
|
|
99
|
-
|
|
100
|
-
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
|
|
104
|
-
|
|
105
|
-
|
|
106
|
-
|
|
107
|
-
|
|
108
|
-
|
|
109
|
-
|
|
110
|
-
|
|
111
|
-
|
|
79
|
+
switch (u[0] = e[13], u[1] = e[16], u[2] = e[10], u[3] = e[23], u[4] = e[0], u[5] = e[4],
|
|
80
|
+
u[6] = e[2], u[7] = e[27], u[8] = e[14], u[9] = e[5], u[10] = e[20], u[11] = e[9],
|
|
81
|
+
u[12] = e[22], u[13] = e[18], u[14] = e[11], u[15] = e[3], u[16] = e[25], u[17] = e[7],
|
|
82
|
+
u[18] = e[15], u[19] = e[6], u[20] = e[26], u[21] = e[19], u[22] = e[12], u[23] = e[1],
|
|
83
|
+
u[24] = e[40], u[25] = e[51], u[26] = e[30], u[27] = e[36], u[28] = e[46], u[29] = e[54],
|
|
84
|
+
u[30] = e[29], u[31] = e[39], u[32] = e[50], u[33] = e[44], u[34] = e[32], u[35] = e[47],
|
|
85
|
+
u[36] = e[43], u[37] = e[48], u[38] = e[38], u[39] = e[55], u[40] = e[33], u[41] = e[52],
|
|
86
|
+
u[42] = e[45], u[43] = e[41], u[44] = e[49], u[45] = e[35], u[46] = e[28], u[47] = e[31],
|
|
87
|
+
i) {
|
|
88
|
+
case 0:
|
|
89
|
+
for (var b = 0; b < 48; b++) a[0][b] = u[b];
|
|
90
|
+
break;
|
|
91
|
+
|
|
92
|
+
case 1:
|
|
93
|
+
for (var d = 0; d < 48; d++) a[1][d] = u[d];
|
|
94
|
+
break;
|
|
95
|
+
|
|
96
|
+
case 2:
|
|
97
|
+
for (var p = 0; p < 48; p++) a[2][p] = u[p];
|
|
98
|
+
break;
|
|
99
|
+
|
|
100
|
+
case 3:
|
|
101
|
+
for (var g = 0; g < 48; g++) a[3][g] = u[g];
|
|
102
|
+
break;
|
|
103
|
+
|
|
104
|
+
case 4:
|
|
105
|
+
for (var m = 0; m < 48; m++) a[4][m] = u[m];
|
|
106
|
+
break;
|
|
107
|
+
|
|
108
|
+
case 5:
|
|
109
|
+
for (var k = 0; k < 48; k++) a[5][k] = u[k];
|
|
110
|
+
break;
|
|
111
|
+
|
|
112
|
+
case 6:
|
|
113
|
+
for (var l = 0; l < 48; l++) a[6][l] = u[l];
|
|
114
|
+
break;
|
|
115
|
+
|
|
116
|
+
case 7:
|
|
117
|
+
for (var w = 0; w < 48; w++) a[7][w] = u[w];
|
|
118
|
+
break;
|
|
119
|
+
|
|
120
|
+
case 8:
|
|
121
|
+
for (var A = 0; A < 48; A++) a[8][A] = u[A];
|
|
122
|
+
break;
|
|
123
|
+
|
|
124
|
+
case 9:
|
|
125
|
+
for (var B = 0; B < 48; B++) a[9][B] = u[B];
|
|
126
|
+
break;
|
|
127
|
+
|
|
128
|
+
case 10:
|
|
129
|
+
for (var h = 0; h < 48; h++) a[10][h] = u[h];
|
|
130
|
+
break;
|
|
131
|
+
|
|
132
|
+
case 11:
|
|
133
|
+
for (var E = 0; E < 48; E++) a[11][E] = u[E];
|
|
134
|
+
break;
|
|
135
|
+
|
|
136
|
+
case 12:
|
|
137
|
+
for (var x = 0; x < 48; x++) a[12][x] = u[x];
|
|
138
|
+
break;
|
|
139
|
+
|
|
140
|
+
case 13:
|
|
141
|
+
for (var D = 0; D < 48; D++) a[13][D] = u[D];
|
|
142
|
+
break;
|
|
143
|
+
|
|
144
|
+
case 14:
|
|
145
|
+
for (var C = 0; C < 48; C++) a[14][C] = u[C];
|
|
146
|
+
break;
|
|
147
|
+
|
|
148
|
+
case 15:
|
|
149
|
+
for (var T = 0; T < 48; T++) a[15][T] = u[T];
|
|
112
150
|
}
|
|
113
151
|
}
|
|
114
|
-
return a
|
|
152
|
+
return a;
|
|
115
153
|
}
|
|
116
154
|
|
|
117
155
|
function initPermute(r) {
|
|
118
|
-
for (var e = new Array(64), a = 0, t = 1, n = 0; a < 4; a++, t += 2, n += 2)
|
|
119
|
-
|
|
120
|
-
return e
|
|
156
|
+
for (var e = new Array(64), a = 0, t = 1, n = 0; a < 4; a++, t += 2, n += 2) for (var o = 7, s = 0; o >= 0; o--,
|
|
157
|
+
s++) e[8 * a + s] = r[8 * o + t], e[8 * a + s + 32] = r[8 * o + n];
|
|
158
|
+
return e;
|
|
121
159
|
}
|
|
122
160
|
|
|
123
161
|
function xor(r, e) {
|
|
124
162
|
for (var a = new Array(r.length), t = 0; t < r.length; t++) a[t] = r[t] ^ e[t];
|
|
125
|
-
return a
|
|
163
|
+
return a;
|
|
126
164
|
}
|
|
127
165
|
|
|
128
166
|
function pPermute(r) {
|
|
129
167
|
var e = new Array(32);
|
|
130
|
-
return e[0] = r[15], e[1] = r[6], e[2] = r[19], e[3] = r[20], e[4] = r[28], e[5] = r[11],
|
|
168
|
+
return e[0] = r[15], e[1] = r[6], e[2] = r[19], e[3] = r[20], e[4] = r[28], e[5] = r[11],
|
|
169
|
+
e[6] = r[27], e[7] = r[16], e[8] = r[0], e[9] = r[14], e[10] = r[22], e[11] = r[25],
|
|
170
|
+
e[12] = r[4], e[13] = r[17], e[14] = r[30], e[15] = r[9], e[16] = r[1], e[17] = r[7],
|
|
171
|
+
e[18] = r[23], e[19] = r[13], e[20] = r[31], e[21] = r[26], e[22] = r[2], e[23] = r[8],
|
|
172
|
+
e[24] = r[18], e[25] = r[12], e[26] = r[29], e[27] = r[5], e[28] = r[21], e[29] = r[10],
|
|
173
|
+
e[30] = r[3], e[31] = r[24], e;
|
|
131
174
|
}
|
|
132
175
|
|
|
133
176
|
function sBoxPermute(r) {
|
|
134
|
-
for (var e = new Array(32), a = "", t = [
|
|
135
|
-
|
|
136
|
-
|
|
137
|
-
|
|
138
|
-
|
|
139
|
-
|
|
140
|
-
|
|
141
|
-
|
|
142
|
-
|
|
143
|
-
|
|
144
|
-
|
|
145
|
-
|
|
146
|
-
|
|
147
|
-
|
|
148
|
-
|
|
149
|
-
|
|
150
|
-
|
|
151
|
-
|
|
152
|
-
|
|
153
|
-
|
|
154
|
-
|
|
155
|
-
|
|
156
|
-
|
|
157
|
-
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
|
|
161
|
-
|
|
162
|
-
|
|
163
|
-
|
|
164
|
-
|
|
165
|
-
|
|
166
|
-
|
|
167
|
-
|
|
168
|
-
[6, 11, 13, 8, 1, 4, 10, 7, 9, 5, 0, 15, 14, 2, 3, 12]
|
|
169
|
-
], y = [
|
|
170
|
-
[13, 2, 8, 4, 6, 15, 11, 1, 10, 9, 3, 14, 5, 0, 12, 7],
|
|
171
|
-
[1, 15, 13, 8, 10, 3, 7, 4, 12, 5, 6, 11, 0, 14, 9, 2],
|
|
172
|
-
[7, 11, 4, 1, 9, 12, 14, 2, 0, 6, 10, 13, 15, 3, 5, 8],
|
|
173
|
-
[2, 1, 14, 7, 4, 10, 8, 13, 15, 12, 9, 0, 3, 5, 6, 11]
|
|
174
|
-
], v = 0; v < 8; v++) {
|
|
175
|
-
var u = 2 * r[6 * v + 0] + r[6 * v + 5],
|
|
176
|
-
b = 2 * r[6 * v + 1] * 2 * 2 + 2 * r[6 * v + 2] * 2 + 2 * r[6 * v + 3] + r[6 * v + 4];
|
|
177
|
-
switch (v) {
|
|
178
|
-
case 0:
|
|
179
|
-
a = getBoxBinary(t[u][b]);
|
|
180
|
-
break;
|
|
181
|
-
case 1:
|
|
182
|
-
a = getBoxBinary(n[u][b]);
|
|
183
|
-
break;
|
|
184
|
-
case 2:
|
|
185
|
-
a = getBoxBinary(o[u][b]);
|
|
186
|
-
break;
|
|
187
|
-
case 3:
|
|
188
|
-
a = getBoxBinary(s[u][b]);
|
|
189
|
-
break;
|
|
190
|
-
case 4:
|
|
191
|
-
a = getBoxBinary(i[u][b]);
|
|
192
|
-
break;
|
|
193
|
-
case 5:
|
|
194
|
-
a = getBoxBinary(f[u][b]);
|
|
195
|
-
break;
|
|
196
|
-
case 6:
|
|
197
|
-
a = getBoxBinary(c[u][b]);
|
|
198
|
-
break;
|
|
199
|
-
case 7:
|
|
200
|
-
a = getBoxBinary(y[u][b])
|
|
177
|
+
for (var e = 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 ] ], n = [ [ 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 ] ], o = [ [ 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 ] ], y = [ [ 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 ] ], v = 0; v < 8; v++) {
|
|
178
|
+
var u, b;
|
|
179
|
+
switch (u = 2 * r[6 * v + 0] + r[6 * v + 5], b = 2 * r[6 * v + 1] * 2 * 2 + 2 * r[6 * v + 2] * 2 + 2 * r[6 * v + 3] + r[6 * v + 4],
|
|
180
|
+
v) {
|
|
181
|
+
case 0:
|
|
182
|
+
a = getBoxBinary(t[u][b]);
|
|
183
|
+
break;
|
|
184
|
+
|
|
185
|
+
case 1:
|
|
186
|
+
a = getBoxBinary(n[u][b]);
|
|
187
|
+
break;
|
|
188
|
+
|
|
189
|
+
case 2:
|
|
190
|
+
a = getBoxBinary(o[u][b]);
|
|
191
|
+
break;
|
|
192
|
+
|
|
193
|
+
case 3:
|
|
194
|
+
a = getBoxBinary(s[u][b]);
|
|
195
|
+
break;
|
|
196
|
+
|
|
197
|
+
case 4:
|
|
198
|
+
a = getBoxBinary(i[u][b]);
|
|
199
|
+
break;
|
|
200
|
+
|
|
201
|
+
case 5:
|
|
202
|
+
a = getBoxBinary(f[u][b]);
|
|
203
|
+
break;
|
|
204
|
+
|
|
205
|
+
case 6:
|
|
206
|
+
a = getBoxBinary(c[u][b]);
|
|
207
|
+
break;
|
|
208
|
+
|
|
209
|
+
case 7:
|
|
210
|
+
a = getBoxBinary(y[u][b]);
|
|
201
211
|
}
|
|
202
|
-
e[4 * v + 0] = parseInt(a.substring(0, 1)), e[4 * v + 1] = parseInt(a.substring(1, 2)),
|
|
212
|
+
e[4 * v + 0] = parseInt(a.substring(0, 1)), e[4 * v + 1] = parseInt(a.substring(1, 2)),
|
|
213
|
+
e[4 * v + 2] = parseInt(a.substring(2, 3)), e[4 * v + 3] = parseInt(a.substring(3, 4));
|
|
203
214
|
}
|
|
204
|
-
return e
|
|
215
|
+
return e;
|
|
205
216
|
}
|
|
206
217
|
|
|
207
218
|
function expandPermute(r) {
|
|
208
|
-
for (var e = new Array(48), a = 0; a < 8; a++) e[6 * a + 0] = 0 == a ? r[31] : r[4 * a - 1],
|
|
209
|
-
|
|
219
|
+
for (var e = new Array(48), a = 0; a < 8; a++) e[6 * a + 0] = 0 == a ? r[31] : r[4 * a - 1],
|
|
220
|
+
e[6 * a + 1] = r[4 * a + 0], e[6 * a + 2] = r[4 * a + 1], e[6 * a + 3] = r[4 * a + 2],
|
|
221
|
+
e[6 * a + 4] = r[4 * a + 3], e[6 * a + 5] = 7 == a ? r[0] : r[4 * a + 4];
|
|
222
|
+
return e;
|
|
210
223
|
}
|
|
211
224
|
|
|
212
225
|
function getBoxBinary(r) {
|
|
213
226
|
var e = "";
|
|
214
227
|
switch (r) {
|
|
215
|
-
|
|
216
|
-
|
|
217
|
-
|
|
218
|
-
|
|
219
|
-
|
|
220
|
-
|
|
221
|
-
|
|
222
|
-
|
|
223
|
-
|
|
224
|
-
|
|
225
|
-
|
|
226
|
-
|
|
227
|
-
|
|
228
|
-
|
|
229
|
-
|
|
230
|
-
|
|
231
|
-
|
|
232
|
-
|
|
233
|
-
|
|
234
|
-
|
|
235
|
-
|
|
236
|
-
|
|
237
|
-
|
|
238
|
-
|
|
239
|
-
|
|
240
|
-
|
|
241
|
-
|
|
242
|
-
|
|
243
|
-
|
|
244
|
-
|
|
245
|
-
|
|
246
|
-
|
|
247
|
-
|
|
248
|
-
|
|
249
|
-
|
|
250
|
-
|
|
251
|
-
|
|
252
|
-
|
|
253
|
-
|
|
254
|
-
|
|
255
|
-
|
|
256
|
-
|
|
257
|
-
|
|
258
|
-
|
|
259
|
-
|
|
260
|
-
|
|
261
|
-
|
|
228
|
+
case 0:
|
|
229
|
+
e = "0000";
|
|
230
|
+
break;
|
|
231
|
+
|
|
232
|
+
case 1:
|
|
233
|
+
e = "0001";
|
|
234
|
+
break;
|
|
235
|
+
|
|
236
|
+
case 2:
|
|
237
|
+
e = "0010";
|
|
238
|
+
break;
|
|
239
|
+
|
|
240
|
+
case 3:
|
|
241
|
+
e = "0011";
|
|
242
|
+
break;
|
|
243
|
+
|
|
244
|
+
case 4:
|
|
245
|
+
e = "0100";
|
|
246
|
+
break;
|
|
247
|
+
|
|
248
|
+
case 5:
|
|
249
|
+
e = "0101";
|
|
250
|
+
break;
|
|
251
|
+
|
|
252
|
+
case 6:
|
|
253
|
+
e = "0110";
|
|
254
|
+
break;
|
|
255
|
+
|
|
256
|
+
case 7:
|
|
257
|
+
e = "0111";
|
|
258
|
+
break;
|
|
259
|
+
|
|
260
|
+
case 8:
|
|
261
|
+
e = "1000";
|
|
262
|
+
break;
|
|
263
|
+
|
|
264
|
+
case 9:
|
|
265
|
+
e = "1001";
|
|
266
|
+
break;
|
|
267
|
+
|
|
268
|
+
case 10:
|
|
269
|
+
e = "1010";
|
|
270
|
+
break;
|
|
271
|
+
|
|
272
|
+
case 11:
|
|
273
|
+
e = "1011";
|
|
274
|
+
break;
|
|
275
|
+
|
|
276
|
+
case 12:
|
|
277
|
+
e = "1100";
|
|
278
|
+
break;
|
|
279
|
+
|
|
280
|
+
case 13:
|
|
281
|
+
e = "1101";
|
|
282
|
+
break;
|
|
283
|
+
|
|
284
|
+
case 14:
|
|
285
|
+
e = "1110";
|
|
286
|
+
break;
|
|
287
|
+
|
|
288
|
+
case 15:
|
|
289
|
+
e = "1111";
|
|
262
290
|
}
|
|
263
|
-
return e
|
|
291
|
+
return e;
|
|
264
292
|
}
|
|
265
293
|
|
|
266
294
|
function finallyPermute(r) {
|
|
267
295
|
var e = new Array(64);
|
|
268
|
-
return e[0] = r[39], e[1] = r[7], e[2] = r[47], e[3] = r[15], e[4] = r[55], e[5] = r[23],
|
|
296
|
+
return e[0] = r[39], e[1] = r[7], e[2] = r[47], e[3] = r[15], e[4] = r[55], e[5] = r[23],
|
|
297
|
+
e[6] = r[63], e[7] = r[31], e[8] = r[38], e[9] = r[6], e[10] = r[46], e[11] = r[14],
|
|
298
|
+
e[12] = r[54], e[13] = r[22], e[14] = r[62], e[15] = r[30], e[16] = r[37], e[17] = r[5],
|
|
299
|
+
e[18] = r[45], e[19] = r[13], e[20] = r[53], e[21] = r[21], e[22] = r[61], e[23] = r[29],
|
|
300
|
+
e[24] = r[36], e[25] = r[4], e[26] = r[44], e[27] = r[12], e[28] = r[52], e[29] = r[20],
|
|
301
|
+
e[30] = r[60], e[31] = r[28], e[32] = r[35], e[33] = r[3], e[34] = r[43], e[35] = r[11],
|
|
302
|
+
e[36] = r[51], e[37] = r[19], e[38] = r[59], e[39] = r[27], e[40] = r[34], e[41] = r[2],
|
|
303
|
+
e[42] = r[42], e[43] = r[10], e[44] = r[50], e[45] = r[18], e[46] = r[58], e[47] = r[26],
|
|
304
|
+
e[48] = r[33], e[49] = r[1], e[50] = r[41], e[51] = r[9], e[52] = r[49], e[53] = r[17],
|
|
305
|
+
e[54] = r[57], e[55] = r[25], e[56] = r[32], e[57] = r[0], e[58] = r[40], e[59] = r[8],
|
|
306
|
+
e[60] = r[48], e[61] = r[16], e[62] = r[56], e[63] = r[24], e;
|
|
269
307
|
}
|
|
270
308
|
|
|
271
309
|
function bt64ToHex(r) {
|
|
272
310
|
var e = "";
|
|
273
|
-
if (r)
|
|
274
|
-
for (var
|
|
275
|
-
|
|
276
|
-
|
|
277
|
-
|
|
278
|
-
return e
|
|
311
|
+
if (r) for (var a = 0; a < 16; a++) {
|
|
312
|
+
for (var t = "", n = 0; n < 4; n++) t += r[4 * a + n];
|
|
313
|
+
e += bt4ToHex(t);
|
|
314
|
+
}
|
|
315
|
+
return e;
|
|
279
316
|
}
|
|
280
317
|
|
|
281
318
|
function hexToBt64(r) {
|
|
282
319
|
for (var e = "", a = 0; a < 16; a++) e += hexToBt4(r.substring(a, a + 1));
|
|
283
|
-
return e
|
|
320
|
+
return e;
|
|
284
321
|
}
|
|
285
322
|
|
|
286
323
|
function hexToBt4(r) {
|
|
287
324
|
var e;
|
|
288
325
|
switch (r) {
|
|
289
|
-
|
|
290
|
-
|
|
291
|
-
|
|
292
|
-
|
|
293
|
-
|
|
294
|
-
|
|
295
|
-
|
|
296
|
-
|
|
297
|
-
|
|
298
|
-
|
|
299
|
-
|
|
300
|
-
|
|
301
|
-
|
|
302
|
-
|
|
303
|
-
|
|
304
|
-
|
|
305
|
-
|
|
306
|
-
|
|
307
|
-
|
|
308
|
-
|
|
309
|
-
|
|
310
|
-
|
|
311
|
-
|
|
312
|
-
|
|
313
|
-
|
|
314
|
-
|
|
315
|
-
|
|
316
|
-
|
|
317
|
-
|
|
318
|
-
|
|
319
|
-
|
|
320
|
-
|
|
321
|
-
|
|
322
|
-
|
|
323
|
-
|
|
324
|
-
|
|
325
|
-
|
|
326
|
-
|
|
327
|
-
|
|
328
|
-
|
|
329
|
-
|
|
330
|
-
|
|
331
|
-
|
|
332
|
-
|
|
333
|
-
|
|
334
|
-
|
|
335
|
-
|
|
326
|
+
case "0":
|
|
327
|
+
e = "0000";
|
|
328
|
+
break;
|
|
329
|
+
|
|
330
|
+
case "1":
|
|
331
|
+
e = "0001";
|
|
332
|
+
break;
|
|
333
|
+
|
|
334
|
+
case "2":
|
|
335
|
+
e = "0010";
|
|
336
|
+
break;
|
|
337
|
+
|
|
338
|
+
case "3":
|
|
339
|
+
e = "0011";
|
|
340
|
+
break;
|
|
341
|
+
|
|
342
|
+
case "4":
|
|
343
|
+
e = "0100";
|
|
344
|
+
break;
|
|
345
|
+
|
|
346
|
+
case "5":
|
|
347
|
+
e = "0101";
|
|
348
|
+
break;
|
|
349
|
+
|
|
350
|
+
case "6":
|
|
351
|
+
e = "0110";
|
|
352
|
+
break;
|
|
353
|
+
|
|
354
|
+
case "7":
|
|
355
|
+
e = "0111";
|
|
356
|
+
break;
|
|
357
|
+
|
|
358
|
+
case "8":
|
|
359
|
+
e = "1000";
|
|
360
|
+
break;
|
|
361
|
+
|
|
362
|
+
case "9":
|
|
363
|
+
e = "1001";
|
|
364
|
+
break;
|
|
365
|
+
|
|
366
|
+
case "A":
|
|
367
|
+
e = "1010";
|
|
368
|
+
break;
|
|
369
|
+
|
|
370
|
+
case "B":
|
|
371
|
+
e = "1011";
|
|
372
|
+
break;
|
|
373
|
+
|
|
374
|
+
case "C":
|
|
375
|
+
e = "1100";
|
|
376
|
+
break;
|
|
377
|
+
|
|
378
|
+
case "D":
|
|
379
|
+
e = "1101";
|
|
380
|
+
break;
|
|
381
|
+
|
|
382
|
+
case "E":
|
|
383
|
+
e = "1110";
|
|
384
|
+
break;
|
|
385
|
+
|
|
386
|
+
case "F":
|
|
387
|
+
e = "1111";
|
|
336
388
|
}
|
|
337
|
-
return e
|
|
389
|
+
return e;
|
|
338
390
|
}
|
|
339
391
|
|
|
340
392
|
function dec(r, e) {
|
|
341
|
-
|
|
342
|
-
for (
|
|
393
|
+
var a = generateKeys(e), t = initPermute(r), n = new Array(32), o = new Array(32), s = new Array(32), i = 0, f = 0, c = 0, y = 0, v = 0;
|
|
394
|
+
for (c = 0; c < 32; c++) n[c] = t[c], o[c] = t[32 + c];
|
|
395
|
+
for (i = 15; i >= 0; i--) {
|
|
343
396
|
for (f = 0; f < 32; f++) s[f] = n[f], n[f] = o[f];
|
|
344
|
-
|
|
345
|
-
for (
|
|
397
|
+
var u = new Array(48);
|
|
398
|
+
for (y = 0; y < 48; y++) u[y] = a[i][y];
|
|
399
|
+
var b = xor(pPermute(sBoxPermute(xor(expandPermute(o), u))), s);
|
|
400
|
+
for (v = 0; v < 32; v++) o[v] = b[v];
|
|
346
401
|
}
|
|
347
|
-
|
|
348
|
-
|
|
402
|
+
var d = new Array(64);
|
|
403
|
+
for (i = 0; i < 32; i++) d[i] = o[i], d[32 + i] = n[i];
|
|
404
|
+
return finallyPermute(d);
|
|
349
405
|
}
|
|
350
406
|
|
|
351
407
|
function byteToString(r) {
|
|
352
408
|
for (var e = "", a = 0; a < 4; a++) {
|
|
353
409
|
for (var t = 0, n = 0; n < 16; n++) {
|
|
354
|
-
for (var o = 1, s = 15;
|
|
355
|
-
t += r[16 * a + n] * o
|
|
410
|
+
for (var o = 1, s = 15; s > n; s--) o *= 2;
|
|
411
|
+
t += r[16 * a + n] * o;
|
|
356
412
|
}
|
|
357
|
-
0 != t && (e += String.fromCharCode(t))
|
|
413
|
+
0 != t && (e += String.fromCharCode(t));
|
|
358
414
|
}
|
|
359
|
-
return e
|
|
415
|
+
return e;
|
|
360
416
|
}
|
|
417
|
+
|
|
361
418
|
DesCore.encode = function(r, e, a, t) {
|
|
362
419
|
if (!r || 0 == r.trim().length) return r;
|
|
363
|
-
var n, o, s, i, f, c, y = r.length,
|
|
364
|
-
|
|
365
|
-
|
|
366
|
-
|
|
367
|
-
|
|
368
|
-
if (isEmpty(e)
|
|
369
|
-
|
|
370
|
-
|
|
371
|
-
|
|
372
|
-
u = p
|
|
373
|
-
}
|
|
374
|
-
} else {
|
|
375
|
-
for (var g, m = b, k = 0; k < i; k++) m = enc(m, n[k]);
|
|
376
|
-
for (g = 0; g < f; g++) m = enc(m, o[g]);
|
|
377
|
-
u = m
|
|
378
|
-
}
|
|
379
|
-
else {
|
|
380
|
-
for (var l, w, A = b, B = 0; B < i; B++) A = enc(A, n[B]);
|
|
381
|
-
for (l = 0; l < f; l++) A = enc(A, o[l]);
|
|
382
|
-
for (w = 0; w < c; w++) A = enc(A, s[w]);
|
|
383
|
-
u = A
|
|
420
|
+
var n, o, s, i, f, c, y = r.length, v = "";
|
|
421
|
+
if (isEmpty(e) || (i = (n = getKeyBytes(e)).length), isEmpty(a) || (f = (o = getKeyBytes(a)).length),
|
|
422
|
+
isEmpty(t) || (c = (s = getKeyBytes(t)).length), y > 0) if (y < 4) {
|
|
423
|
+
var u, b = strToBt(r);
|
|
424
|
+
if (isEmpty(e) || isEmpty(a) || isEmpty(t)) if (isEmpty(e) || isEmpty(a)) {
|
|
425
|
+
if (!isEmpty(e)) {
|
|
426
|
+
var d, p = 0;
|
|
427
|
+
for (d = b, p = 0; p < i; p++) d = enc(d, n[p]);
|
|
428
|
+
u = d;
|
|
384
429
|
}
|
|
385
|
-
v = bt64ToHex(u)
|
|
386
430
|
} else {
|
|
387
|
-
|
|
388
|
-
|
|
389
|
-
|
|
390
|
-
|
|
391
|
-
|
|
392
|
-
|
|
393
|
-
|
|
394
|
-
|
|
395
|
-
|
|
396
|
-
|
|
397
|
-
|
|
398
|
-
|
|
399
|
-
|
|
400
|
-
|
|
401
|
-
|
|
402
|
-
|
|
403
|
-
|
|
404
|
-
|
|
405
|
-
|
|
431
|
+
var g, m, k;
|
|
432
|
+
for (g = b, m = 0; m < i; m++) g = enc(g, n[m]);
|
|
433
|
+
for (k = 0; k < f; k++) g = enc(g, o[k]);
|
|
434
|
+
u = g;
|
|
435
|
+
} else {
|
|
436
|
+
var l, w, A, B;
|
|
437
|
+
for (l = b, w = 0; w < i; w++) l = enc(l, n[w]);
|
|
438
|
+
for (A = 0; A < f; A++) l = enc(l, o[A]);
|
|
439
|
+
for (B = 0; B < c; B++) l = enc(l, s[B]);
|
|
440
|
+
u = l;
|
|
441
|
+
}
|
|
442
|
+
v = bt64ToHex(u);
|
|
443
|
+
} else {
|
|
444
|
+
var h = parseInt(y / 4), E = y % 4, x = 0;
|
|
445
|
+
for (x = 0; x < h; x++) {
|
|
446
|
+
var D = strToBt(r.substring(4 * x + 0, 4 * x + 4)), C = void 0;
|
|
447
|
+
if (isEmpty(e) || isEmpty(a) || isEmpty(t)) if (isEmpty(e) || isEmpty(a)) {
|
|
448
|
+
if (!isEmpty(e)) {
|
|
449
|
+
var T = void 0, P = void 0;
|
|
450
|
+
for (T = D, P = 0; P < i; P++) T = enc(T, n[P]);
|
|
451
|
+
C = T;
|
|
406
452
|
}
|
|
407
|
-
|
|
453
|
+
} else {
|
|
454
|
+
var I = void 0, K = void 0, U = void 0;
|
|
455
|
+
for (I = D, K = 0; K < i; K++) I = enc(I, n[K]);
|
|
456
|
+
for (U = 0; U < f; U++) I = enc(I, o[U]);
|
|
457
|
+
C = I;
|
|
458
|
+
} else {
|
|
459
|
+
var H = void 0, S = void 0, q = void 0, O = void 0;
|
|
460
|
+
for (H = D, S = 0; S < i; S++) H = enc(H, n[S]);
|
|
461
|
+
for (q = 0; q < f; q++) H = enc(H, o[q]);
|
|
462
|
+
for (O = 0; O < c; O++) H = enc(H, s[O]);
|
|
463
|
+
C = H;
|
|
408
464
|
}
|
|
409
|
-
|
|
410
|
-
|
|
411
|
-
|
|
412
|
-
|
|
413
|
-
|
|
414
|
-
|
|
415
|
-
|
|
416
|
-
|
|
417
|
-
|
|
418
|
-
for (var J, L = j, M = 0; M < i; M++) L = enc(L, n[M]);
|
|
419
|
-
for (J = 0; J < f; J++) L = enc(L, o[J]);
|
|
420
|
-
F = L
|
|
421
|
-
}
|
|
422
|
-
else {
|
|
423
|
-
for (var N, Q, R = j, V = 0; V < i; V++) R = enc(R, n[V]);
|
|
424
|
-
for (N = 0; N < f; N++) R = enc(R, o[N]);
|
|
425
|
-
for (Q = 0; Q < c; Q++) R = enc(R, s[Q]);
|
|
426
|
-
F = R
|
|
465
|
+
v += bt64ToHex(C);
|
|
466
|
+
}
|
|
467
|
+
if (E > 0) {
|
|
468
|
+
var F, j = strToBt(r.substring(4 * h + 0, y));
|
|
469
|
+
if (isEmpty(e) || isEmpty(a) || isEmpty(t)) if (isEmpty(e) || isEmpty(a)) {
|
|
470
|
+
if (!isEmpty(e)) {
|
|
471
|
+
var z, G;
|
|
472
|
+
for (z = j, G = 0; G < i; G++) z = enc(z, n[G]);
|
|
473
|
+
F = z;
|
|
427
474
|
}
|
|
428
|
-
|
|
475
|
+
} else {
|
|
476
|
+
var J, L, M;
|
|
477
|
+
for (J = j, L = 0; L < i; L++) J = enc(J, n[L]);
|
|
478
|
+
for (M = 0; M < f; M++) J = enc(J, o[M]);
|
|
479
|
+
F = J;
|
|
480
|
+
} else {
|
|
481
|
+
var N, Q, R, V;
|
|
482
|
+
for (N = j, Q = 0; Q < i; Q++) N = enc(N, n[Q]);
|
|
483
|
+
for (R = 0; R < f; R++) N = enc(N, o[R]);
|
|
484
|
+
for (V = 0; V < c; V++) N = enc(N, s[V]);
|
|
485
|
+
F = N;
|
|
429
486
|
}
|
|
430
|
-
|
|
487
|
+
v += bt64ToHex(F);
|
|
488
|
+
}
|
|
489
|
+
}
|
|
490
|
+
return v;
|
|
431
491
|
}, DesCore.decode = function(r, e, a, t) {
|
|
432
492
|
if (!r || 0 == r.trim().length) return r;
|
|
433
|
-
var n, o, s, i, f, c, y = r.length,
|
|
434
|
-
|
|
435
|
-
|
|
436
|
-
|
|
437
|
-
|
|
493
|
+
var n, o, s, i, f, c, y = r.length, v = "";
|
|
494
|
+
isEmpty(e) || (i = (n = getKeyBytes(e)).length), null != a && "" != a && (f = (o = getKeyBytes(a)).length),
|
|
495
|
+
null != t && "" != t && (c = (s = getKeyBytes(t)).length);
|
|
496
|
+
var u = parseInt(y / 16), b = 0;
|
|
497
|
+
for (b = 0; b < u; b++) {
|
|
498
|
+
var d = hexToBt64(r.substring(16 * b + 0, 16 * b + 16)), p = new Array(64), g = 0;
|
|
499
|
+
for (g = 0; g < 64; g++) p[g] = parseInt(d.substring(g, g + 1));
|
|
438
500
|
var m = void 0;
|
|
439
|
-
if (isEmpty(e) || isEmpty(a) || isEmpty(t))
|
|
440
|
-
if (isEmpty(e)
|
|
441
|
-
|
|
442
|
-
|
|
443
|
-
|
|
444
|
-
}
|
|
445
|
-
} else {
|
|
446
|
-
for (var w = void 0, A = void 0, B = void 0, w = p, A = f - 1; 0 <= A; A--) w = dec(w, o[A]);
|
|
447
|
-
for (B = i - 1; 0 <= B; B--) w = dec(w, n[B]);
|
|
448
|
-
m = w
|
|
501
|
+
if (isEmpty(e) || isEmpty(a) || isEmpty(t)) if (isEmpty(e) || isEmpty(a)) {
|
|
502
|
+
if (!isEmpty(e)) {
|
|
503
|
+
var k = void 0, l = void 0;
|
|
504
|
+
for (k = p, l = i - 1; l >= 0; l--) k = dec(k, n[l]);
|
|
505
|
+
m = k;
|
|
449
506
|
}
|
|
450
|
-
else {
|
|
451
|
-
|
|
452
|
-
for (
|
|
453
|
-
for (
|
|
454
|
-
m =
|
|
507
|
+
} else {
|
|
508
|
+
var w = void 0, A = void 0, B = void 0;
|
|
509
|
+
for (w = p, A = f - 1; A >= 0; A--) w = dec(w, o[A]);
|
|
510
|
+
for (B = i - 1; B >= 0; B--) w = dec(w, n[B]);
|
|
511
|
+
m = w;
|
|
512
|
+
} else {
|
|
513
|
+
var h = void 0, E = void 0, x = void 0, D = void 0;
|
|
514
|
+
for (h = p, E = c - 1; E >= 0; E--) h = dec(h, s[E]);
|
|
515
|
+
for (x = f - 1; x >= 0; x--) h = dec(h, o[x]);
|
|
516
|
+
for (D = i - 1; D >= 0; D--) h = dec(h, n[D]);
|
|
517
|
+
m = h;
|
|
455
518
|
}
|
|
456
|
-
v += byteToString(m)
|
|
519
|
+
v += byteToString(m);
|
|
457
520
|
}
|
|
458
|
-
return v
|
|
521
|
+
return v;
|
|
459
522
|
}, DesUtils.encode = function(r, e) {
|
|
460
523
|
if (isEmpty(e)) throw new Error("[DesUtils.encode] method parameter `secretKey` required.");
|
|
461
524
|
if ("," === e) return DesCore.encode(r, e);
|
|
462
|
-
if (!(
|
|
525
|
+
if (!(e.indexOf(",") > -1)) return DesCore.encode(r, e);
|
|
463
526
|
var a = e.split(",");
|
|
464
|
-
return
|
|
527
|
+
return a.length > 2 ? DesCore.encode(r, a[0], a[1], a[2]) : 1 === a.length ? DesCore.encode(r, a[0]) : 2 === a.length ? DesCore.encode(r, a[0], a[1]) : r;
|
|
465
528
|
}, DesUtils.decode = function(r, e) {
|
|
466
529
|
if (isEmpty(e)) throw new Error("[DesUtils.encode] method parameter `secretKey` required.");
|
|
467
530
|
if ("," === e) return DesCore.decode(r, e);
|
|
468
|
-
if (!(
|
|
531
|
+
if (!(e.indexOf(",") > -1)) return DesCore.decode(r, e);
|
|
469
532
|
var a = e.split(",");
|
|
470
|
-
return
|
|
471
|
-
}, DesUtils.DesCore = DesCore, module.exports = DesUtils;
|
|
533
|
+
return a.length > 2 ? DesCore.decode(r, a[0], a[1], a[2]) : 1 === a.length ? DesCore.decode(r, a[0]) : 2 === a.length ? DesCore.decode(r, a[0], a[1]) : r;
|
|
534
|
+
}, DesUtils.DesCore = DesCore, module.exports = DesUtils;
|