Last active
December 12, 2015 02:09
-
-
Save kalorz/4696785 to your computer and use it in GitHub Desktop.
Obfuscated Strings
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class ObfuscatedStrings { | |
static | |
{ | |
String[] arrayOfString = new String[9]; | |
char[] arrayOfChar1 = "$\037@1h+\b\f-d+\037\f=r+\032J,p\006\016F:x+\bJ?q6".toCharArray(); | |
int i = arrayOfChar1.length; | |
int j = 0; | |
char[] arrayOfChar2; | |
int i1; | |
char[] arrayOfChar3; | |
int i5; | |
char[] arrayOfChar4; | |
int i9; | |
char[] arrayOfChar5; | |
int i13; | |
char[] arrayOfChar6; | |
int i17; | |
char[] arrayOfChar7; | |
int i21; | |
char[] arrayOfChar8; | |
int i25; | |
char[] arrayOfChar9; | |
int i29; | |
if (i <= j) | |
{ | |
arrayOfString[0] = new String(arrayOfChar1).intern(); | |
arrayOfChar2 = "$\037@1h+\bb+i-\031M*t&\035W1o\027\031P.r+\017F".toCharArray(); | |
int n = arrayOfChar2.length; | |
i1 = 0; | |
if (n <= i1) | |
{ | |
arrayOfString[1] = new String(arrayOfChar2).intern(); | |
arrayOfChar3 = "$\037@1h+\b\f-d+\037\f?y!=@=r0\022W".toCharArray(); | |
int i4 = arrayOfChar3.length; | |
i5 = 0; | |
if (i4 > i5) | |
break label517; | |
arrayOfString[2] = new String(arrayOfChar3).intern(); | |
arrayOfChar4 = ",\022W;s1".toCharArray(); | |
int i8 = arrayOfChar4.length; | |
i9 = 0; | |
if (i8 > i9) | |
break label609; | |
arrayOfString[3] = new String(arrayOfChar4).intern(); | |
arrayOfChar5 = "$\037@1h+\b\f-d+\037\f+m!\035W;^7\031G;s1\025B2n".toCharArray(); | |
int i12 = arrayOfChar5.length; | |
i13 = 0; | |
if (i12 > i13) | |
break label701; | |
arrayOfString[4] = new String(arrayOfChar5).intern(); | |
arrayOfChar6 = "$\037@1h+\b\f-d+\037\f9x1=V*u\021\023H;s\t\035A;q".toCharArray(); | |
int i16 = arrayOfChar6.length; | |
i17 = 0; | |
if (i16 > i17) | |
break label793; | |
arrayOfString[5] = new String(arrayOfChar6).intern(); | |
arrayOfChar7 = "$\037@1h+\b\f-d+\037\f9x1=V*u\021\023H;s".toCharArray(); | |
int i20 = arrayOfChar7.length; | |
i21 = 0; | |
if (i20 > i21) | |
break label885; | |
arrayOfString[6] = new String(arrayOfChar7).intern(); | |
arrayOfChar8 = "$\037@1h+\b\f-d+\037\f;y,\bs,r5\031Q*t \017".toCharArray(); | |
int i24 = arrayOfChar8.length; | |
i25 = 0; | |
if (i24 > i25) | |
break label977; | |
arrayOfString[7] = new String(arrayOfChar8).intern(); | |
arrayOfChar9 = "$\037@1h+\b\f-d+\037\f6|6:F?i0\016F-'e".toCharArray(); | |
int i28 = arrayOfChar9.length; | |
i29 = 0; | |
if (i28 > i29) | |
break label1069; | |
arrayOfString[8] = new String(arrayOfChar9).intern(); | |
z = arrayOfString; | |
} | |
} | |
else | |
{ | |
int k = arrayOfChar1[j]; | |
int m; | |
switch (j % 5) | |
{ | |
default: | |
m = 29; | |
case 0: | |
case 1: | |
case 2: | |
case 3: | |
} | |
while (true) | |
{ | |
arrayOfChar1[j] = ((char)(m ^ k)); | |
j++; | |
break; | |
m = 69; | |
continue; | |
m = 124; | |
continue; | |
m = 35; | |
continue; | |
m = 94; | |
} | |
} | |
int i2 = arrayOfChar2[i1]; | |
int i3; | |
switch (i1 % 5) | |
{ | |
default: | |
i3 = 29; | |
case 0: | |
case 1: | |
case 2: | |
case 3: | |
} | |
while (true) | |
{ | |
arrayOfChar2[i1] = ((char)(i3 ^ i2)); | |
i1++; | |
break; | |
i3 = 69; | |
continue; | |
i3 = 124; | |
continue; | |
i3 = 35; | |
continue; | |
i3 = 94; | |
} | |
label517: int i6 = arrayOfChar3[i5]; | |
int i7; | |
switch (i5 % 5) | |
{ | |
default: | |
i7 = 29; | |
case 0: | |
case 1: | |
case 2: | |
case 3: | |
} | |
while (true) | |
{ | |
arrayOfChar3[i5] = ((char)(i7 ^ i6)); | |
i5++; | |
break; | |
i7 = 69; | |
continue; | |
i7 = 124; | |
continue; | |
i7 = 35; | |
continue; | |
i7 = 94; | |
} | |
label609: int i10 = arrayOfChar4[i9]; | |
int i11; | |
switch (i9 % 5) | |
{ | |
default: | |
i11 = 29; | |
case 0: | |
case 1: | |
case 2: | |
case 3: | |
} | |
while (true) | |
{ | |
arrayOfChar4[i9] = ((char)(i11 ^ i10)); | |
i9++; | |
break; | |
i11 = 69; | |
continue; | |
i11 = 124; | |
continue; | |
i11 = 35; | |
continue; | |
i11 = 94; | |
} | |
label701: int i14 = arrayOfChar5[i13]; | |
int i15; | |
switch (i13 % 5) | |
{ | |
default: | |
i15 = 29; | |
case 0: | |
case 1: | |
case 2: | |
case 3: | |
} | |
while (true) | |
{ | |
arrayOfChar5[i13] = ((char)(i15 ^ i14)); | |
i13++; | |
break; | |
i15 = 69; | |
continue; | |
i15 = 124; | |
continue; | |
i15 = 35; | |
continue; | |
i15 = 94; | |
} | |
label793: int i18 = arrayOfChar6[i17]; | |
int i19; | |
switch (i17 % 5) | |
{ | |
default: | |
i19 = 29; | |
case 0: | |
case 1: | |
case 2: | |
case 3: | |
} | |
while (true) | |
{ | |
arrayOfChar6[i17] = ((char)(i19 ^ i18)); | |
i17++; | |
break; | |
i19 = 69; | |
continue; | |
i19 = 124; | |
continue; | |
i19 = 35; | |
continue; | |
i19 = 94; | |
} | |
label885: int i22 = arrayOfChar7[i21]; | |
int i23; | |
switch (i21 % 5) | |
{ | |
default: | |
i23 = 29; | |
case 0: | |
case 1: | |
case 2: | |
case 3: | |
} | |
while (true) | |
{ | |
arrayOfChar7[i21] = ((char)(i23 ^ i22)); | |
i21++; | |
break; | |
i23 = 69; | |
continue; | |
i23 = 124; | |
continue; | |
i23 = 35; | |
continue; | |
i23 = 94; | |
} | |
label977: int i26 = arrayOfChar8[i25]; | |
int i27; | |
switch (i25 % 5) | |
{ | |
default: | |
i27 = 29; | |
case 0: | |
case 1: | |
case 2: | |
case 3: | |
} | |
while (true) | |
{ | |
arrayOfChar8[i25] = ((char)(i27 ^ i26)); | |
i25++; | |
break; | |
i27 = 69; | |
continue; | |
i27 = 124; | |
continue; | |
i27 = 35; | |
continue; | |
i27 = 94; | |
} | |
label1069: int i30 = arrayOfChar9[i29]; | |
int i31; | |
switch (i29 % 5) | |
{ | |
default: | |
i31 = 29; | |
case 0: | |
case 1: | |
case 2: | |
case 3: | |
} | |
while (true) | |
{ | |
arrayOfChar9[i29] = ((char)(i31 ^ i30)); | |
i29++; | |
break; | |
i31 = 69; | |
continue; | |
i31 = 124; | |
continue; | |
i31 = 35; | |
continue; | |
i31 = 94; | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment