
warsaw's Invisible Java Crackme
Download invisible.zip, 2 kb (password: crackmes.de) Browse contents of invisible.zip Is this the real code, or is it just fantasy...
Difficulty: 4 - Needs special knowledge | Send a message to warsaw » View profile of warsaw » |
Solutions
Solution by boonz, published 07. jul, 2014; download (48 kb), password: crackmes.de or browse.
boonz has not rated this crackme yet.
Discussion and comments
warsaw Author 02. Jul 2014 | Note, this crackme is designed for Hotspot. It won't work properly on alternative JVM implementations. |
---|---|
boonz 02. Jul 2014 | for (int i = 1; i < 32; i++) { array[i] = (char) (array[i] ^ array[i * 123456 % 31] & 0x1F); } The hash function must be brute-forced because it takes the least 5 bits using binary AND which cannot be inversed? |
warsaw Author 06. Jul 2014 | No brute forcing is required. That operation is invertible. |
marcoventuri 06. Jul 2014 | sorry,i wrong solution |
Dark_Prince 14. Sep 2014 | What a nice solution! Well done boonz. |
You may leave your comment, thoughts and discuss this crackme with other reversers here.
Acting childish will not be tolerated.
HTML and such will be left as-is, so don't try.