首页
社区
课程
招聘
未解决 [求助]dexguard 如何还原
发表于: 2020-11-11 11:55 1536

未解决 [求助]dexguard 如何还原

2020-11-11 11:55
1536

package com.android.sdk.plgin;

 

import com.android.sdk.BuildConfig;
import java.lang.reflect.Method;

 

public class Loader2$1$7$Loaderde$1$2 {
private static transient Object[] e;

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
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
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
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
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
private static final int b() {
    Object[] objArr = (Object[]) ((Method) e[8]).invoke(((Method) e[7]).invoke(null, null), null);
    int length = objArr.length;
    for (int i = 1; i < length; i++) {
        StringBuilder sb = new StringBuilder();
        sb.append(((Method) e[10]).invoke(objArr[i], null));
        sb.append(((Method) e[11]).invoke(objArr[i], null));
        if (sb.toString().hashCode() == 1382004651) {
            return i;
        }
    }
    return 0;
}
 
private static final int b(int i, int i2) {
    int i3 = (i2 + i) >> 24;
    return (i >>> i2) | (i << (-i2));
}
 
private static final int b(byte[] bArr, int i) {
    char c = 0;
    int i2 = bArr[14] << 16;
    char c2 = 0;
    while (c2 == 0) {
        c2 = 3;
        try {
            return (bArr[(i >> 24) & 255] << 24) | (bArr[i & 255] & 255) | ((bArr[(i >> 8) & 255] & 255) << 8) | ((bArr[(i >> 16) & 255] & 255) << 16);
        } catch (Exception e2) {
        }
    }
    while (c == 0) {
        c = 2;
        try {
            return bArr[i & 127] >> 8;
        } catch (Exception e3) {
        }
    }
    return i2;
}
 
static final String b(String str) {
    if (e == null) {
        b21857();
    }
    Object[] objArr = (Object[]) ((Method) e[8]).invoke(((Method) e[7]).invoke(null, null), null);
    StringBuilder sb = new StringBuilder();
    sb.append(((Method) e[10]).invoke(objArr[((Integer) e[12]).intValue()], null));
    int hashCode = sb.append(((Method) e[11]).invoke(objArr[((Integer) e[12]).intValue()], null)).toString().hashCode();
    int[] iArr = (int[]) e[6];
    char c = hashCode ^ iArr[0];
    char c2 = hashCode ^ iArr[1];
    char c3 = hashCode ^ iArr[2];
    char c4 = hashCode ^ iArr[3];
    int[] iArr2 = (int[]) e[5];
    int[] iArr3 = (int[]) e[1];
    int[] iArr4 = (int[]) e[2];
    int[] iArr5 = (int[]) e[3];
    int[] iArr6 = (int[]) e[4];
    byte[] bArr = (byte[]) e[0];
    char[] cArr = (char[]) ((Method) e[9]).invoke(str, null);
    char c5 = c3;
    char c6 = c2;
    char c7 = c;
    char c8 = c4;
    boolean z = false;
    while (true) {
        if (z) {
            break;
        }
        try {
            int length = cArr.length;
            for (int i = 0; i < length; i++) {
                if (i % 8 == 0) {
                    char c9 = c7 ^ iArr2[0];
                    char c10 = c6 ^ iArr2[1];
                    char c11 = c5 ^ iArr2[2];
                    char c12 = iArr2[3] ^ c8;
                    int i2 = 4;
                    while (i2 < 36) {
                        int i3 = (((iArr3[c9 & 255] ^ iArr4[(c10 >> 8) & 255]) ^ iArr5[(c11 >> 16) & 255]) ^ iArr6[c12 >>> 24]) ^ iArr2[i2];
                        int i4 = (((iArr3[c10 & 255] ^ iArr4[(c11 >> 8) & 255]) ^ iArr5[(c12 >> 16) & 255]) ^ iArr6[c9 >>> 24]) ^ iArr2[i2 + 1];
                        int i5 = (((iArr3[c11 & 255] ^ iArr4[(c12 >> 8) & 255]) ^ iArr5[(c9 >> 16) & 255]) ^ iArr6[c10 >>> 24]) ^ iArr2[i2 + 2];
                        int i6 = (((iArr3[c12 & 255] ^ iArr4[(c9 >> 8) & 255]) ^ iArr5[(c10 >> 16) & 255]) ^ iArr6[c11 >>> 24]) ^ iArr2[i2 + 3];
                        int i7 = i2 + 4;
                        c9 = (((iArr3[i3 & 255] ^ iArr4[(i4 >> 8) & 255]) ^ iArr5[(i5 >> 16) & 255]) ^ iArr6[i6 >>> 24]) ^ iArr2[i7];
                        c10 = iArr2[i7 + 1] ^ (((iArr3[i4 & 255] ^ iArr4[(i5 >> 8) & 255]) ^ iArr5[(i6 >> 16) & 255]) ^ iArr6[i3 >>> 24]);
                        c11 = (((iArr3[i5 & 255] ^ iArr4[(i6 >> 8) & 255]) ^ iArr5[(i3 >> 16) & 255]) ^ iArr6[i4 >>> 24]) ^ iArr2[i7 + 2];
                        c12 = (((iArr3[i6 & 255] ^ iArr4[(i3 >> 8) & 255]) ^ iArr5[(i4 >> 16) & 255]) ^ iArr6[i5 >>> 24]) ^ iArr2[i7 + 3];
                        i2 = i7 + 4;
                    }
                    int i8 = (((iArr3[c9 & 255] ^ iArr4[(c10 >> 8) & 255]) ^ iArr5[(c11 >> 16) & 255]) ^ iArr6[c12 >>> 24]) ^ iArr2[i2];
                    int i9 = (((iArr3[c10 & 255] ^ iArr4[(c11 >> 8) & 255]) ^ iArr5[(c12 >> 16) & 255]) ^ iArr6[c9 >>> 24]) ^ iArr2[i2 + 1];
                    int i10 = (((iArr3[c11 & 255] ^ iArr4[(c12 >> 8) & 255]) ^ iArr5[(c9 >> 16) & 255]) ^ iArr6[c10 >>> 24]) ^ iArr2[i2 + 2];
                    int i11 = (((iArr3[c12 & 255] ^ iArr4[(c9 >> 8) & 255]) ^ iArr5[(c10 >> 16) & 255]) ^ iArr6[c11 >>> 24]) ^ iArr2[i2 + 3];
                    int i12 = i2 + 4;
                    c7 = iArr2[i12 + 0] ^ ((((bArr[i8 & 255] & 255) ^ ((bArr[(i9 >> 8) & 255] & 255) << 8)) ^ ((bArr[(i10 >> 16) & 255] & 255) << 16)) ^ (bArr[i11 >>> 24] << 24));
                    c6 = iArr2[i12 + 1] ^ ((((bArr[i9 & 255] & 255) ^ ((bArr[(i10 >> 8) & 255] & 255) << 8)) ^ ((bArr[(i11 >> 16) & 255] & 255) << 16)) ^ (bArr[i8 >>> 24] << 24));
                    c5 = iArr2[i12 + 2] ^ ((((bArr[i10 & 255] & 255) ^ ((bArr[(i11 >> 8) & 255] & 255) << 8)) ^ ((bArr[(i8 >> 16) & 255] & 255) << 16)) ^ (bArr[i9 >>> 24] << 24));
                    c8 = iArr2[i12 + 3] ^ ((((bArr[i11 & 255] & 255) ^ ((bArr[(i8 >> 8) & 255] & 255) << 8)) ^ ((bArr[(i9 >> 16) & 255] & 255) << 16)) ^ (bArr[i10 >>> 24] << 24));
                }
                char c13 = 0;
                while (true) {
                    if (c13 == 0) {
                        c13 = 3;
                        try {
                            switch (i % 8) {
                                case 0:
                                    cArr[i] = (char) ((c7 >> 16) ^ cArr[i]);
                                    continue;
                                case BuildConfig.VERSION_CODE /*1*/:
                                    cArr[i] = (char) (cArr[i] ^ c7);
                                    continue;
                                case 2:
                                    cArr[i] = (char) ((c6 >> 16) ^ cArr[i]);
                                    continue;
                                case 3:
                                    cArr[i] = (char) (cArr[i] ^ c6);
                                    continue;
                                case 4:
                                    cArr[i] = (char) ((c5 >> 16) ^ cArr[i]);
                                    continue;
                                case 5:
                                    cArr[i] = (char) (cArr[i] ^ c5);
                                    continue;
                                case 6:
                                    cArr[i] = (char) ((c8 >> 16) ^ cArr[i]);
                                    continue;
                                case 7:
                                    cArr[i] = (char) (cArr[i] ^ c8);
                                    continue;
                            }
                        } catch (Throwable th) {
                        }
                    }
                }
            }
        } catch (Throwable th2) {
            z = true;
        }
    }
    return new String(cArr);
}
 
private static final void b21857() {
    int[] iArr = new int[256];
    byte[] bArr = new byte[256];
    int[] iArr2 = new int[256];
    int[] iArr3 = new int[256];
    int[] iArr4 = new int[256];
    int[] iArr5 = new int[256];
    int[] iArr6 = new int[30];
    int i = 1;
    for (int i2 = 0; i2 < 256; i2++) {
        iArr[i2] = i;
        i ^= (i << 1) ^ ((i >>> 7) * 283);
    }
    bArr[0] = 99;
    boolean z = false;
    while (true) {
        if (z) {
            break;
        }
        int i3 = 0;
        while (i3 < 255) {
            try {
                int i4 = iArr[255 - i3];
                int i5 = i4 | (i4 << 8);
                bArr[iArr[i3]] = (byte) ((i5 ^ ((((i5 >> 4) ^ (i5 >> 5)) ^ (i5 >> 6)) ^ (i5 >> 7))) ^ 99);
                i3++;
            } catch (Exception e2) {
                z = true;
            }
        }
        for (int i6 = 0; i6 < 256; i6++) {
            byte b = bArr[i6] & 255;
            byte b2 = (b << 1) ^ ((b >>> 7) * 283);
            int i7 = (((b << 8) ^ (((b ^ b2) << 24) ^ (b << 16))) ^ b2) & -1;
            iArr2[i6] = i7;
            iArr3[i6] = (i7 << 8) | (i7 >>> -8);
            iArr4[i6] = (i7 << 16) | (i7 >>> -16);
            iArr5[i6] = (i7 >>> -24) | (i7 << 24);
        }
        int i8 = 1;
        for (int i9 = 0; i9 < 30; i9++) {
            iArr6[i9] = i8;
            i8 = ((i8 >>> 7) * 283) ^ (i8 << 1);
        }
    }
    byte[] bArr2 = new byte[16];
    byte[] bArr3 = {-119, 95, -51, 26, -47, 15, -22, 93, -29, -10, -64, 108, -126, -54, 95, 114, 52, -89, -29, -49, 32, -18, -17, 3, -63, -21, -112, -100, -1, 48, -103, -123, -80, 98, -84, -15, -26, 71, -81, -35, 12, -12, -70, -112, 75, 116, 125, 40, 106, -55, 73, 87, 86, -31, 27, 43, -126, 110, Byte.MAX_VALUE, -125, -36, 49, -2, -55, -23, -47, 120, 59, -29, -125, -69, -1, -46, -42, -31, -75, -34, -31, 82, 54, 81, -82, 75, 38, -93, -85, -1, 75, -7, -61, -54, 81, -127, -35, 47, -42, -22, 53, -127, 19, -9, -110, 122, -98, -90, -42, 1, -15, -9, 48, 123, 73, -107, -83, -66, -9, -58, -40, 47, -95, -82, -10, -11, -29, -66, -47, 68, -16, 15, 80, -83, 51, -74, -65, -8, 30, 18, -106, 51, -125, 21, -121, 30, 56, -117, 9, -71, -44, -127, 17, -108, 49, -38, -121, 104, -24, -116, 38, 3, -7, 14, 19, 79, -64, -58, 115, 28, 58, -45, -77, 17, -32, -21, -82, -84, -65, 86, 27, 107, 9, 74, -116, 35, 77, 9, -104, 1, 27, -34, -64, -85, -74, -73, 16, 20, 112, 71, 90, 45, -14, 62, 107, -74, -44, 113, -111, 107, 90, -47, 100, 68, -11, -56, 26, 30, -127, 54, -81, 101, -52, -98, -37, -69, 42, -104, -119, -8, -101, -40, -96, -90, 86, -90, -30, 118, -8, -21, -38, -106, 21, 33, -70, -69, Byte.MAX_VALUE, -62, 2, -85, 83, 118, -78, -44, 73, 22, 37, -91, Byte.MIN_VALUE};
    byte[] bArr4 = {-77, -30, 117, 115, 34, 95, 79, -105, 99, -127, 84, 56, -32, 108, -109, 77, -105, 86, -7, 101, -77, 3, 80, -107, 49, -18, -96, 47, -91, 43, 6, 70, 85, 96, 106, -13, 121, 125, 122, -111, 123, -5, -59, -122, -114, 23, 68, -37, 79, 126, -23, -110, 40, -18, 94, 5, -30, 124, -81, 123, -97, 21, 47, 45, 78, -59, -39, 66, -22, 71, 29, 68, 25, -77, -104, 81, 37, 82, -65, 91, -117, 109, -30, -7, -15, -14, -113, 0, -119, 2, -17, 111, Byte.MIN_VALUE, -39, -47, -91, 70, -73, 27, 37, -81, -20, -66, -76, 109, 82, -19, 41, 16, 89, -24, 126, -121, -32, Byte.MAX_VALUE, Byte.MIN_VALUE, 48, 14, 9, 95, -13, -116, 46, 88, 55, -77, -38, 8, -25, -38, -24, -45, -77, -13, -1, 49, 105, Byte.MIN_VALUE, -78, 114, -76, -99, 83, -27, 115, 65, 66, 59, 68, 39, -39, 63, 108, -71, 39, 122, -11, -115, -75, -99, 19, 65, -33, -45, -115, -114, -125, -4, -45, 48, 14, -31, -101, -118, 40, -114, -115, 28, -74, 122, 59, -116, 98, -111, -94, -80, -63, 54, 95, 47, -16, 101, 43, 32, 56, -5, -103, -101, 48, -77, Byte.MAX_VALUE, 32, 105, -26, -47, 32, 19, -43, 91, -70, 95, 31, 93, -56, -43, -31, -127, 0, 54, Byte.MAX_VALUE, -70, 79, 36, -30, 38, 15, 83, 76, 64, 53, 51, -114, 25, 48, -24, -37, -44, 37, 49, -78, 24, -40, -63, 10, -2, 63, -98, 112, 101, -47, 27, 72, 69, 10, -104, -23};
    int i10 = 0;
    while (true) {
        if (i10 != 0) {
            bArr2[8] = bArr3[bArr4[58] & 255];
            bArr2[9] = bArr3[bArr4[173] & 255];
            bArr2[10] = bArr3[bArr4[218] & 255];
            bArr2[11] = bArr3[bArr4[232] & 255];
            bArr2[12] = bArr3[bArr4[38] & 255];
            bArr2[13] = bArr3[bArr4[208] & 255];
            bArr2[14] = bArr3[bArr4[82] & 255];
            bArr2[15] = bArr3[bArr4[219] & 255];
            break;
        }
        i10++;
        try {
            bArr2[0] = bArr3[bArr4[174] & 255];
            bArr2[1] = bArr3[bArr4[243] & 255];
            bArr2[2] = bArr3[bArr4[15] & 255];
            bArr2[3] = bArr3[bArr4[63] & 255];
            bArr2[4] = bArr3[bArr4[204] & 255];
            bArr2[5] = bArr3[bArr4[170] & 255];
            bArr2[6] = bArr3[bArr4[233] & 255];
            bArr2[7] = bArr3[bArr4[90] & 255];
            bArr2[8] = bArr3[bArr4[58] & 255];
            bArr2[9] = bArr3[bArr4[173] & 255];
            bArr2[10] = bArr3[bArr4[218] & 255];
            bArr2[11] = bArr3[bArr4[232] & 255];
            bArr2[12] = bArr3[bArr4[38] & 255];
            bArr2[13] = bArr3[bArr4[208] & 255];
            bArr2[14] = bArr3[bArr4[82] & 255];
            bArr2[15] = bArr3[bArr4[219] & 255];
            break;
        } catch (Exception e3) {
        } catch (Throwable th) {
            bArr2[8] = bArr3[bArr4[58] & 255];
            bArr2[9] = bArr3[bArr4[173] & 255];
            bArr2[10] = bArr3[bArr4[218] & 255];
            bArr2[11] = bArr3[bArr4[232] & 255];
            bArr2[12] = bArr3[bArr4[38] & 255];
            bArr2[13] = bArr3[bArr4[208] & 255];
            bArr2[14] = bArr3[bArr4[82] & 255];
            bArr2[15] = bArr3[bArr4[219] & 255];
            throw th;
        }
    }
    int[] iArr7 = new int[44];
    int i11 = 0;
    loop6:
    while (i11 == 0) {
        int i12 = i11 + 3;
        int i13 = 0;
        int i14 = 0;
        while (true) {
            int i15 = 0;
            while (i15 == 0) {
                i15 += 3;
                if (i14 >= 16) {
                    break;
                }
                try {
                    iArr7[(((i13 >> 2) * 4) + i13) & 3] = (bArr2[i14] & 255) | ((bArr2[i14 + 1] & 255) << 8) | ((bArr2[i14 + 2] & 255) << 16) | (bArr2[i14 + 3] << 24);
                    i14 += 4;
                    i13++;
                } catch (Exception e4) {
                }
            }
            break;
        }
        int i16 = 4;
        while (i16 < 44) {
            try {
                int i17 = iArr7[(((i16 - 1) >> 2) * 4) + ((i16 - 1) & 3)];
                if (i16 % 4 == 0) {
                    i17 = b(bArr, b(i17, 8)) ^ iArr6[(i16 / 4) - 1];
                }
                iArr7[((i16 >> 2) * 4) + (i16 & 3)] = i17 ^ iArr7[(((i16 - 4) >> 2) * 4) + ((i16 - 4) & 3)];
                i16++;
            } catch (Exception e5) {
                i11 = i12;
            }
        }
        break loop6;
    }
    Object[] objArr = new Object[13];
    objArr[0] = bArr;
    objArr[1] = iArr2;
    objArr[2] = iArr3;
    objArr[3] = iArr4;
    objArr[4] = iArr5;
    objArr[5] = iArr7;
    objArr[6] = new int[]{658007220, -438061969, 694954592, -2081520164};
    char[] cArr = {65523, 192, 'C', '{', 65535, '{', 'K', 203, 'J', '$', 20, 212, 65524, '/', 192, 214, 151, 28, 'U', 'A', 133, '\\', 'c', 'W', ')', ']', 65525, 65533, 'c', 151, 65534, 65529, 3, 214, 13, 'T', 'Q', 155, '!', '>', 'o', 'Y', '$', 65521, 193, 213, 171, 148, 203, '7', 176, 133, 169, 'U', 141, 148, 65520, 213, 243, 65522, 31, 153, '_', ';', '*', 'C', 234, 156, '\\', 65517, 28, 'u', '3', 4, 'M', 22, 'L', 'H', 128, 137, 197, 15, 174, 145, 65527, 29, '`', 174, '^', 8, '6', 182, 65518, 'B', 157, 'J', 'Q', 154, 65525, 'V', 'c', 65523, 237, 17, 65524, '7', 'n', 'V', '^', 149, 239, 150, 65530, '!', '&', 'f', '*', '&', 144, 14, 19, 'W', 'c', 'G', '0', '@', 173, 'T', '=', 191, ' ', 'a', 9, '8', 'k', 146, 'w', 3, 131, 65525, 132, 65527, 131, 170, 65535, 'r', 30, 'G', 65512, 'v', 8, 161, '?', 65529, 219, 'Q', 65535, 154, '1', 'l', 135, 134, '}', '$', '\'', 223, 146, 163, '>', 65505, 135, 'M', 25, 26, 21, '!', 183, 137, 207, '{', 185, 65525, 135, '{', 'x', 11, '/', ']', 'S', ')', 23, 26, 10, 'U', 'f', 185, 136, 166, 151, 'S', 180, 204, 65508, '@', 210, 65535, 210, 136, '$', 216, 182, '^', '6', 129, 134, 65506, 169, 23, 168, ';', 2, '@', '%', 139, 14, 65514, '&', 7, '9', 14, 13, 132, 65529, '[', 233, 'l', 'P', 'G', 65533, 'z', 149, 10, '-', 238, '2', 'g', 29, 199, 239, 28, '5', 191, 'w', 'S', 27, 65517, 65463, 213, '2', 140, 'D', 'x', 'Y', 203, 21};
    for (int i18 = 0; i18 < cArr.length; i18++) {
        cArr[i18] = (char) (cArr[i18] - bArr3[i18 % bArr3.length]);
    }
    objArr[7] = Class.forName(String.valueOf(cArr, 0, 16)).getMethod(String.valueOf(cArr, 16, 13), null);
    objArr[8] = Class.forName(String.valueOf(cArr, 0, 16)).getMethod(String.valueOf(cArr, 29, 13), null);
    objArr[9] = Class.forName(String.valueOf(cArr, 42, 16)).getMethod(String.valueOf(cArr, 58, 11), null);
    objArr[10] = Class.forName(String.valueOf(cArr, 69, 27)).getMethod(String.valueOf(cArr, 96, 12), null);
    objArr[11] = Class.forName(String.valueOf(cArr, 69, 27)).getMethod(String.valueOf(cArr, 108, 13), null);
    e = objArr;
    objArr[12] = Integer.valueOf(b());
    e = objArr;
}

}


[课程]Android-CTF解题方法汇总!

收藏
免费 0
支持
分享
最新回复 (1)
雪    币: 6369
活跃值: (1528)
能力值: ( LV4,RANK:156 )
在线值:
发帖
回帖
粉丝
2
jeb最新版好像有这个功能了,不过我的过期了,至少可以看看他们发的blog?提了一部分思路
2020-11-11 15:19
0
游客
登录 | 注册 方可回帖
返回
//